A heuristic and sometimes theorematic principle asserting that a global arithmetic or geometric property (existence of a rational point, solvability, isotropy) can be detected by checking the corresponding local properties at all completions of the base field.

Principle

Reduce global problems to a family of local problems: if an object satisfies the specified property in every completion (archimedean and non-archimedean), then, under appropriate hypotheses, it satisfies the property globally; conversely, a global failure must be witnessed by a local obstruction or a global obstruction visible in the aggregate of locals.

Demonstration

The Hasse–Minkowski theorem for quadratic forms over number fields: a quadratic form is isotropic over the number field if and only if it is isotropic over every completion (R and all p-adics). Many torsors under special groups also obey Hasse principles; however counterexamples exist.

Misapplication

Assuming the principle always holds: there are classical failures (e.g., curves of genus one and certain diagonal cubic surfaces) where local solvability does not imply global solvability because of obstructions such as the Brauer–Manin obstruction or descent obstructions.

Consequence

When valid, it reduces infinitely many global checks to finitely many local ones and enables explicit algorithms and classification results; it also focuses attention on detecting and classifying obstructions when it fails.

Reversal

The negation highlights obstructions: local solvability without global solutions leads to the study of Brauer–Manin, descent, and other obstructions; understanding the reversal forces refinement of local data or introduction of new invariants capturing global failure.

Boundary

Holds in full for some classes (quadratic forms, certain homogeneous spaces) and fails in general; it pertains to completions of local fields and excludes phenomena sensitive to integral models, torsion classes, or global height constraints that do not localize straightforwardly.

Semantic Tension

Competes with notions of weak approximation and the Brauer–Manin principle: the tension lies between expecting local-to-global transfer and recognizing subtle global obstructions that are invisible locally yet control arithmetic reality.

Synthesis

The Local–Global Principle is a guiding strategy: test local completions to infer global behavior where admissible, and when it fails, use the pattern of local solutions to isolate global obstructions and refine arithmetic invariants; it is powerful but requires precise hypotheses and an inventory of possible obstructions.