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 and let be a full lattice with covolume , (Full Euclidean lattice and covolume). Let
be its half-open fundamental parallelotope. Then:
- every has a unique representation with and ;
- is Lebesgue measurable and ;
- every bounded subset meets in finitely many points: is finite.
The convention is the published one for half-open boxes, -faces (Half-open boxes in and their volume); it is a translate of the equally common parallelotope and carries the same volume.
Facts & Assumptions
Given: The Axiom of Choice, an integer , the full lattice with matrix , and its half-open fundamental parallelotope of the statement.
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.
The vectors are linearly independent over and form a real basis of , and (Full Euclidean lattice and covolume).
A square real matrix is invertible if and only if (A finite square real matrix is invertible if and only if its determinant is nonzero).
Invertible linear maps and Lebesgue measure: if is linear with , then is Lebesgue measurable for every Lebesgue measurable and (A linear map of sends Lebesgue measurable sets to Lebesgue measurable sets, with when is invertible and Lebesgue null when it is not).
For real endpoints , the half-open box is Lebesgue measurable of measure ; in particular the half-open unit cube has (A box in with parameters is Lebesgue measurable of measure , whichever of its faces are included).
Integer part: for every real there is exactly one integer with (Integer part: for every real there is exactly one integer with ).
For every linear map there is a real with for every (Every Euclidean linear map has a unique matrix and satisfies for some ).
A subset of a metric space is bounded exactly when or for some point and real (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 with the Euclidean metric the triangle inequality gives for .
Proof
By [F1] the vectors form a real basis of ; therefore every has a unique coefficient vector with .
For every real there is exactly one pair with : apply [F5] to to get the unique integer with , and put , ; then and hence . Conversely if with , then has absolute value and is an integer, hence and .
Let be bounded and suppose first . By [F7] there are and with , so every satisfies .
(Tiling.) Let have coefficient vector as in step 1.1 and write as in step 1.2. Put and ; then . For uniqueness, suppose with , and , . Then , and linear independence of the forces for every . Here is an integer and , so ; thus and for all , that is and .
Let be the linear map , with matrix . By step 1.1 the map is a bijection, so the square matrix is invertible and [F2] gives . Since and is Lebesgue measurable of measure by [F4], [F3] and [F1] give , with the Countable Choice hypotheses of [F3] and [F4] supplied by [A1].
For each the -th coordinate functional is linear, so by [F6] there is with for every . If , then , so and step 1.3 gives .
Every integer with satisfies ; the set is therefore a subset of the finite set and is finite. Hence is contained in the image under of the finite set , so is finite; for it is empty.
Step 2.1 proves the unique tiling, step 2.2 the volume , and step 3.1 the finiteness of for bounded ; these are the three claims of the statement.
Depends on
- Full Euclidean lattice and covolume
- A finite square real matrix is invertible if and only if its determinant is nonzero
- A linear map $T$ of $\mathbb{R}^n$ sends Lebesgue measurable sets to Lebesgue measurable sets, with $\lambda_n(T[E])=|\det T|\,\lambda_n(E)$ when $T$ is invertible and $T[E]$ Lebesgue null when it is not
- A box in $\mathbb{R}^n$ with parameters $a_i\le b_i$ is Lebesgue measurable of measure $\prod_{i<n}(b_i-a_i)$, whichever of its faces are included
- Half-open boxes in $\mathbb{R}^n$ and their volume
- Integer part: for every real $x$ there is exactly one integer $m$ with $m \le x < m + 1$
- Every Euclidean linear map has a unique matrix and satisfies $\|Lh\|_2\le K\|h\|_2$ for some $K\ge0$
- 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
- AC implies DC implies countable choice
- The Axiom of Choice
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
- J. S. Milne, Algebraic Number Theory v3.08 (standard reference, not scraped)
- Brian Conrad and Aaron Landesman, Math 154 Algebraic Number Theory (standard reference, not scraped)