Alphabeta Math
LemmaStatement: Literature-sourcedProof: Literature-sourcedPipeline-generatedprecheck passaudited 2026-10-02
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.

Fundamental parallelotope and finite bounded intersections

Statement

Assume the Axiom of Choice (The Axiom of Choice). Let n≥1 and let Λ=Zb1⊕⋯⊕Zbn⊆Rn be a full lattice with covolume covol⁡(Λ)=∣det⁡B∣, B=(b1 ⋯ bn) (Full Euclidean lattice and covolume). Let

P={∑i=1ntibi:0<ti≤1}

be its half-open fundamental parallelotope. Then:

  1. every x∈Rn has a unique representation x=λ+p with λ∈Λ and p∈P;
  2. P is Lebesgue measurable and λn(P)=covol⁡(Λ);
  3. every bounded subset S⊆Rn meets Λ in finitely many points: S∩Λ is finite.

The convention 0<ti≤1 is the published one for half-open boxes, (a,b]-faces (Half-open boxes in Rn and their volume); it is a translate of the equally common 0≤ti<1 parallelotope and carries the same volume.

Facts & Assumptions

Given: The Axiom of Choice, an integer n≥1, the full lattice Λ=Zb1⊕⋯⊕Zbn with matrix B=(b1 ⋯ bn), and its half-open fundamental parallelotope P of the statement.

[A1]

The Axiom of Choice gives the Axiom of Countable Choice (AC implies DC implies countable choice), which is the choice hypothesis of [F3] and [F4], invoked in step 2.2; no further choice is used.

[F1]

The vectors b1,…,bn are linearly independent over R and form a real basis of Rn, and covol⁡(Λ)=∣det⁡B∣ (Full Euclidean lattice and covolume).

[F2]

A square real matrix B is invertible if and only if det⁡B≠0 (A finite square real matrix is invertible if and only if its determinant is nonzero).

[F3]

Invertible linear maps and Lebesgue measure: if T:Rn→Rn is linear with det⁡T≠0, then T[E] is Lebesgue measurable for every Lebesgue measurable E and λn(T[E])=∣det⁡T∣ λn(E) (A linear map T of Rn sends Lebesgue measurable sets to Lebesgue measurable sets, with λn(T[E])=∣det⁡T∣ λn(E) when T is invertible and T[E] Lebesgue null when it is not).

[F4]

For real endpoints ai≤bi, the half-open box B(a,b)=∏i<n(ai,bi] is Lebesgue measurable of measure ∏i<n(bi−ai); in particular the half-open unit cube (0,1]n has λn((0,1]n)=1 (A box in Rn with parameters ai≤bi is Lebesgue measurable of measure ∏i<n(bi−ai), whichever of its faces are included).

[F5]

Integer part: for every real y there is exactly one integer k with k≤y<k+1 (Integer part: for every real x there is exactly one integer m with m≤x<m+1).

[F6]

For every linear map L:Rm→Rn there is a real K≥0 with ∥Lh∥2≤K∥h∥2 for every h (Every Euclidean linear map has a unique matrix and satisfies ∥Lh∥2≤K∥h∥2 for some K≥0).

[F7]

A subset S of a metric space is bounded exactly when S=∅ or S⊆B(x0,r) for some point x0 and real r>0 (Bounded subset, diameter, distance from a point to a set, and distance between two sets in a metric space, Open ball, closed ball and sphere in a metric space); in Rn with the Euclidean metric the triangle inequality gives ∥s∥≤∥s−x0∥+∥x0∥ for s∈B(x0,r).

Proof

1.1F1given

By [F1] the vectors b1,…,bn form a real basis of Rn; therefore every x∈Rn has a unique coefficient vector y=(y1,…,yn)∈Rn with x=∑iyibi.

1.2F5algebra

For every real y there is exactly one pair (m,t)∈Z×(0,1] with y=m+t: apply [F5] to −y to get the unique integer k with k≤−y<k+1, and put m:=−k−1, t:=y−m; then m<y≤m+1 and hence t∈(0,1]. Conversely if m+t=m′+t′ with t,t′∈(0,1], then m−m′=t′−t has absolute value <1 and is an integer, hence m=m′ and t=t′.

1.3F7given

Let S⊆Rn be bounded and suppose first S≠∅. By [F7] there are x0∈Rn and r>0 with S⊆B(x0,r), so every s∈S satisfies ∥s∥≤∥s−x0∥+∥x0∥≤r+∥x0∥=:M.

2.1F1step 1.1step 1.2

(Tiling.) Let x∈Rn have coefficient vector y as in step 1.1 and write yi=mi+ti as in step 1.2. Put λ=∑imibi∈Λ and p=∑itibi∈P; then x=λ+p. For uniqueness, suppose λ+p=λ′+p′ with λ=∑imibi, λ′=∑imi′bi∈Λ and p=∑itibi, p′=∑iti′bi∈P. Then ∑i((mi−mi′)+(ti−ti′))bi=0, and linear independence of the bi forces (mi−mi′)+(ti−ti′)=0 for every i. Here mi−mi′ is an integer and ti′−ti∈(−1,1), so mi−mi′=ti′−ti∈Z∩(−1,1)={0}; thus mi=mi′ and ti=ti′ for all i, that is λ=λ′ and p=p′.

2.2F1F2F3F4A1step 1.1

Let T:Rn→Rn be the linear map T(t)=∑itibi, with matrix B. By step 1.1 the map T is a bijection, so the square matrix B is invertible and [F2] gives det⁡B≠0. Since T[(0,1]n]=P and (0,1]n is Lebesgue measurable of measure 1 by [F4], [F3] and [F1] give λn(P)=∣det⁡B∣ λn((0,1]n)=covol⁡(Λ), with the Countable Choice hypotheses of [F3] and [F4] supplied by [A1].

2.3F6step 1.3

For each i the i-th coordinate functional fi(z):=(B−1z)i is linear, so by [F6] there is Ki≥0 with ∣fi(z)∣≤Ki∥z∥2 for every z. If λ=∑imibi∈S, then B−1λ=(m1,…,mn), so fi(λ)=mi and step 1.3 gives ∣mi∣≤KiM=:Ci.

3.1F1step 2.3

Every integer mi with ∣mi∣≤Ci satisfies −⌈Ci⌉≤mi≤⌈Ci⌉; the set {m∈Z:∣m∣≤Ci} is therefore a subset of the finite set {−⌈Ci⌉,…,⌈Ci⌉} and is finite. Hence S∩Λ is contained in the image under (m1,…,mn)↦∑imibi of the finite set ∏i=1n{m∈Z:∣m∣≤Ci}, so S∩Λ is finite; for S=∅ it is empty.

4.1step 2.1step 2.2step 3.1∎

Step 2.1 proves the unique tiling, step 2.2 the volume λn(P)=covol⁡(Λ), and step 3.1 the finiteness of S∩Λ for bounded S; these are the three claims of the statement.

Depends on

Used by

Dependency tree · two levels

86 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