Alphabeta Math
LemmaStatement: Literature-sourcedProof: Literature-sourcedPipeline-generatedprecheck pass
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 n≥1 and let Λ⊆Rn be a full lattice with covol⁡(Λ)>0 (Full Euclidean lattice and covolume). If S⊆Rn is Lebesgue measurable with λn(S)>covol⁡(Λ), then there are distinct points x,y∈S with x−y∈Λ.

Facts & Assumptions

Given: The Axiom of Choice, a full lattice Λ=Zb1⊕⋯⊕Zbn in Rn with covolume covol⁡(Λ)>0, and a Lebesgue measurable set S⊆Rn with λn(S)>covol⁡(Λ).

[A1]

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.

[F1]

The half-open fundamental parallelotope P={∑itibi:0<ti≤1} tiles Rn uniquely by Λ-translates, P is Lebesgue measurable with λn(P)=covol⁡(Λ), and every bounded subset of Rn meets Λ in finitely many points (Fundamental parallelotope and finite bounded intersections).

[F3]

Translations preserve measurability and measure: E is Lebesgue measurable if and only if E+h is, and then λn(E+h)=λn(E) (Lebesgue outer measure, Lebesgue measurability and Lebesgue measure are unchanged by translation).

[F4]

A measure is countably additive: for pairwise disjoint measurable sets Ek one has μ(⋃kEk)=∑kμ(Ek), extended nonnegative sums included (Measures on sigma-algebras).

[F5]

Z is at most countable: the quotient map N×N→Z of The integers as equivalence classes of pairs of naturals is surjective, N×N is at most countable (N×N≈N, 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 N). Hence Zn is at most countable, and so is Λ, being a surjective image of Zn under (m1,…,mn)↦∑imibi (Finite, countably infinite, countable, uncountable).

Proof

1.1assume-contra

Assume for contradiction that there are no distinct x,y∈S with x−y∈Λ.

1.2F5A1

Λ is at most countable by [F5], and it is infinite because b1≠0 gives the distinct multiples kb1; being at most countable and infinite, it is countably infinite, so fix a bijection λ:N→Λ, k↦λk (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.

2.1F1F2F3step 1.2

For each k put Sk:=S∩(P+λk) and Tk:=Sk−λk. Each Sk is measurable: S is measurable by hypothesis, the translate P+λk is measurable by [F3] applied to the measurable tile P of [F1], and the intersection is measurable because [F2] makes L(Rn) a sigma-algebra, its Countable Choice hypothesis having been discharged in step 1.2.

2.2F1F4step 1.2

The Sk are pairwise disjoint with union S, since the translates P+λ tile Rn by [F1]; hence λn(S)=∑kλn(Sk) by countable additivity [F4].

3.1F1F3step 2.1

By [F3] applied to the translation by −λk, Tk is measurable with λn(Tk)=λn(Sk); and Tk⊆P, since P+λk translated by −λk is P.

4.1step 1.1step 3.1

The sets Tk are pairwise disjoint: if z∈Tj∩Tk with j≠k, then z=x−λj=y−λk with x∈Sj⊆S and y∈Sk⊆S, so x−y=λj−λk∈Λ while x≠y because λj≠λk; this contradicts step 1.1.

5.1F4step 2.2step 3.1step 4.1

By countable additivity [F4] applied to the pairwise disjoint measurable sets Tk, λn(⋃kTk)=∑kλn(Tk)=∑kλn(Sk)=λn(S), using steps 2.2, 3.1 and 4.1.

6.1F1F4step 5.1

Since ⋃kTk⊆P, monotonicity of a measure (additivity [F4] applied to P=(⋃kTk)∪(P∖⋃kTk)) gives λn(S)=λn(⋃kTk)≤λn(P)=covol⁡(Λ).

7.1step 1.1step 6.1discharge-contradiction∎

Step 6.1 contradicts the hypothesis λn(S)>covol⁡(Λ); therefore the assumption of step 1.1 is false, and there exist distinct x,y∈S with x−y∈Λ.

Remarks

The proof works for unbounded S and even for λn(S)=+∞: Sk⊆P+λk and Tk⊆P, 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 Tk are disjoint in P, which bounds that sum by λn(P) and gives the contradiction. The hypothesis is strict: for S=(0,1]2 and Λ=Z2 one has λ2(S)=covol⁡(Λ)=1 and no two distinct points of S 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 z, then x=z+λj and y=z+λk are distinct points of S with x−y=λj−λk∈Λ. Thus the no-pair assumption in the proof forbids the pictured overlap. Tile outlines indicate location only; the half-open boundary convention remains 0<ti≤1. The argument above is independent of the illustration.

P+¸jP+¸kSjSkxy¡¸j¡¸kPTjTkzz=x¡¸j=y¡¸k

Depends on

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