How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Blichfeldt lattice-point principle
Statement
Assume the Axiom of Choice (The Axiom of Choice). Let and let be a full lattice with (Full Euclidean lattice and covolume). If is Lebesgue measurable with , then there are distinct points with .
Facts & Assumptions
Given: The Axiom of Choice, a full lattice in with covolume , and a Lebesgue measurable set with .
The Axiom of Choice gives the Axiom of Countable Choice (AC implies DC implies countable choice), the choice hypothesis of the complete-measure fact [F2], invoked in step 2.1; the translation-invariance fact [F3], the defining properties of a measure [F4] and the countability facts [F5] use no choice principle, and no further choice is used.
The half-open fundamental parallelotope tiles uniquely by -translates, is Lebesgue measurable with , and every bounded subset of meets in finitely many points (Fundamental parallelotope and finite bounded intersections).
Assuming countable choice, is a sigma-algebra and is a measure on it (Assuming countable choice, is a sigma-algebra containing every elementary set and is a complete measure extending elementary volume).
Translations preserve measurability and measure: is Lebesgue measurable if and only if is, and then (Lebesgue outer measure, Lebesgue measurability and Lebesgue measure are unchanged by translation).
A measure is countably additive: for pairwise disjoint measurable sets one has , extended nonnegative sums included (Measures on sigma-algebras).
is at most countable: the quotient map of The integers as equivalence classes of pairs of naturals is surjective, is at most countable (, A product of two at most countable sets is at most countable), and an at most countable set that is a surjective image of an at most countable set is at most countable (A nonempty set is at most countable iff it is a surjective image of ). Hence is at most countable, and so is , being a surjective image of under (Finite, countably infinite, countable, uncountable).
Proof
Assume for contradiction that there are no distinct with .
is at most countable by [F5], and it is infinite because gives the distinct multiples ; being at most countable and infinite, it is countably infinite, so fix a bijection , (Finite, countably infinite, countable, uncountable). By [A1] the Axiom of Countable Choice holds; it discharges the choice hypothesis of the complete-measure fact [F2] applied below.
For each put and . Each is measurable: is measurable by hypothesis, the translate is measurable by [F3] applied to the measurable tile of [F1], and the intersection is measurable because [F2] makes a sigma-algebra, its Countable Choice hypothesis having been discharged in step 1.2.
The are pairwise disjoint with union , since the translates tile by [F1]; hence by countable additivity [F4].
By [F3] applied to the translation by , is measurable with ; and , since translated by is .
The sets are pairwise disjoint: if with , then with and , so while because ; this contradicts step 1.1.
By countable additivity [F4] applied to the pairwise disjoint measurable sets , , using steps 2.2, 3.1 and 4.1.
Since , monotonicity of a measure (additivity [F4] applied to ) gives .
Step 6.1 contradicts the hypothesis ; therefore the assumption of step 1.1 is false, and there exist distinct with .
Remarks
The proof works for unbounded and even for : and , so each piece has finite measure, but their measure sum may be infinite. Countable additivity permits extended nonnegative sums; under the no-pair assumption, the are disjoint in , which bounds that sum by and gives the contradiction. The hypothesis is strict: for and one has and no two distinct points of differ by a lattice vector.
For the planar case, the schematic below illustrates steps 2.1, 3.1 and 4.1. The two shaded pieces are translated from distinct tiles into the same fundamental parallelotope. If their images meet at , then and are distinct points of with . Thus the no-pair assumption in the proof forbids the pictured overlap. Tile outlines indicate location only; the half-open boundary convention remains . The argument above is independent of the illustration.
Depends on
- Fundamental parallelotope and finite bounded intersections
- Full Euclidean lattice and covolume
- Assuming countable choice, $\mathcal{L}(\mathbb{R}^n)$ is a sigma-algebra containing every elementary set and $\lambda_n$ is a complete measure extending elementary volume
- Lebesgue outer measure, Lebesgue measurability and Lebesgue measure are unchanged by translation
- Measures on sigma-algebras
- Finite, countably infinite, countable, uncountable
- The integers as equivalence classes of pairs of naturals
- $\mathbb{N} \times \mathbb{N} \approx \mathbb{N}$
- A product of two at most countable sets is at most countable
- A nonempty set is at most countable iff it is a surjective image of $\mathbb{N}$
- AC implies DC implies countable choice
- The Axiom of Choice
Used by
Dependency tree · two levels
73 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- J. S. Milne, Algebraic Number Theory v3.08 (standard reference, not scraped)
- Ben Green, Additive Combinatorics, Lecture 3 §3.7 (standard reference, not scraped)