A heuristic and often formal assertion in arithmetic and algebraic contexts that a global property of an object (over a global field or ring) holds precisely when the corresponding property holds in every relevant local completion or localization; concretely, a global solvability, isomorphism class, or cohomological vanishing is equivalent to the collection of its local counterparts satisfying the same condition.

Principle

Reduce global questions to checks at all local places or localizations; the organizing rule is that obstructions to a global statement can be detected as failures at one or more local sites or as a coherent adelic condition across sites.

Demonstration

Hasse–Minkowski for quadratic forms over the rational numbers: a quadratic form over Q represents zero nontrivially over Q if and only if it represents zero over R and over every p-adic completion Q_p; the global existence of a rational solution is determined by the family of local solutions.

Misapplication

Assuming that local solvability at each individual completion automatically implies a global solution without accounting for global obstructions or compatibility conditions (for example, ignoring nontrivial elements of a Tate–Shafarevich group or adelic reciprocity constraints).

Consequence

When the principle applies, one can algorithmically verify global properties by finitely many local computations or by checking a specified set of completions; it also permits patching local data to construct global objects when compatibility holds.

Reversal

A failure of the principle is the existence of locally valid data that do not glue to any global object: local solutions everywhere but no global solution (counterexamples to the Hasse principle).

Boundary

Applies in settings with a well-defined notion of localization or completion (number fields, function fields, local rings, adeles); does not automatically hold for arbitrary global problems (topological or combinatorial) and may fail when global reciprocity or cohomological finiteness hypotheses are absent.

Semantic Tension

Competes with notions of descent and patching: unlike categorical descent (which uses glueing data and Čech cohomology), the local–global principle asserts equivalence of existence statements across localizations rather than explicit construction of glueing maps.

Synthesis

The local–global principle is the organizing idea that a global arithmetic or algebraic property is equivalent to a coherent family of local properties; it functions as both a practical reduction tool and a diagnostic for where and how global obstructions arise.