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.
Discrete subgroups of a real vector space are lattices
Statement
Let be a finite-dimensional real vector space (Vector space over a field, Finite-dimensional vector space, and its dimension ; infinite-dimensional means having no finite basis) with the topology induced by a norm (A norm on a real vector space, the induced metric, and the dictionary with the metric axioms, The metric topology: a set is open when every one of its points has a ball around it inside the set; closed means open complement), and let be a subgroup. The following are equivalent:
(a) is discrete in the subspace topology (Subspace topology: the traces of the open sets, its closed sets and its bases, the continuity of the inclusion, and the characteristic property of a map into a subspace);
(b) every bounded subset of (Bounded subset, diameter, distance from a point to a set, and distance between two sets in a metric space) meets in a finite set;
(c) for some -linearly independent (Linear independence: a finite list is independent when forces every , and a subset is independent when every injective finite list into is independent) with ; that is, is a lattice in .
Facts & Assumptions
Given: A finite-dimensional real vector space of dimension with a norm, the induced metric and topology, and a subgroup .
is a linearly independent list and every linearly independent subset of has at most elements, because has a basis of elements (If has a spanning set with elements, then every linearly independent subset of is finite with at most elements; in particular has no linearly independent subset equinumerous with , Linear independence: a finite list is independent when forces every , and a subset is independent when every injective finite list into is independent, Basis of a vector space: a linearly independent spanning subset; and ordered basis: an injective finite list whose image is a basis).
The induced metric is , the norm is homogeneous and satisfies the triangle inequality, a bounded set is contained in some ball, and balls are translation invariant; open sets contain a ball around each of their points (A norm on a real vector space, the induced metric, and the dictionary with the metric axioms, The metric topology: a set is open when every one of its points has a ball around it inside the set; closed means open complement, Open ball, closed ball and sphere in a metric space, Bounded subset, diameter, distance from a point to a set, and distance between two sets in a metric space).
Identifying with by one basis, the given norm corresponds to a norm on . Equivalence with the coordinate maximum norm gives a constant such that in these coordinates (For all norms on are equivalent).
Every subgroup of is for a unique nonnegative integer (Every subgroup of is for exactly one natural number ). In particular, the image of a subgroup of under projection to one coordinate is either or for some .
A finite group of order has for every element , by Lagrange's theorem (Lagrange's theorem: for every subgroup of a finite group ).
For every there is an integer with (For every in a complete ordered field there is a natural with ).
Proof
Proof technique: a direct chain (a) implies (b) implies (c) implies (a): isolation and a finite coordinate grid give bounded finiteness. A bounded fundamental parallelepiped gives a finite-index inclusion into the integer span of a maximal independent tuple. Scaling embeds the group in ; a finite-rank subgroup induction then supplies a lattice basis using only the cyclic-subgroup-of- result.
First handle . Then and , so (a), (b), and (c) hold with . Assume below.
Suppose first that is discrete. Then is open in the subspace topology on , so for some open ; choosing a ball around inside gives an with .
Suppose next that (b) holds. The set is then finite; if it is take , and otherwise let , a minimum of a nonempty finite set of positive reals, so that again . Since balls are translation invariant in the metric of a norm, for every , so : every point of is isolated in , that is, is discrete. Hence (b) implies (a).
Assume (b) from here on. By [F1] the lengths of the -linearly independent finite tuples of elements of form a nonempty subset of , so a maximum exists; select an -linearly independent tuple , and put , so .
Put and . Since , the set is bounded, so is finite by (b).
This proves (a)(b) without selecting a sequence from a bounded set. Fix a basis of and put . Let be bounded; if the conclusion is immediate. Otherwise choose a ball containing it. Let be the coordinates of . By [F3] there is with in these coordinates, so every satisfies . Set ; then the coordinate vectors of lie in the box . Set and choose an integer with by [F6]. Divide each coordinate interval into equal subintervals and take their finitely many product cells. In one cell, any two coordinate vectors differ by less than in each coordinate, so the corresponding points satisfy . By step 1.1, each cell therefore contains at most one point of . The finite collection of cells covers , so is finite.
If , then any relation must have , since otherwise it would express as an element of . The independence of then forces every , so adjoining would give independent elements of , contradicting maximality in step 1.3. Thus , and since the lie in , .
Every differs from an element of by an element of : by step 2.2 write with and write with and ; then .
The map , , is surjective by step 3.1. Thus is finite; let its order be . By [F5], for every . The map , , is an injective homomorphism: if , then because is a real vector space and . Consequently its image is a subgroup of .
By step 4.1, is a subgroup of . For this use, every subgroup has a finite -basis of length at most , by induction on . For the subgroup is zero and the empty list is a basis. For , project onto its first coordinate. By [F4] the image is for some . If , identify with a subgroup of the last coordinates and apply induction. If , choose with first coordinate ; the kernel of that projection is a subgroup of , so induction gives it a basis of length at most . Every has first coordinate for some ; then , so together with a basis of generates . They are independent because projecting any integer relation to the first coordinate forces the coefficient of to be zero, after which independence in forces all remaining coefficients to vanish. This proves the claim, including that the basis has at most elements.
Apply step 5.1 to and pull its -basis back through the isomorphism . This gives a -basis of with . By step 2.2, are linearly independent and span , while because they generate . The finite-dimensional independent-set bound [F1] gives , so . If and these spanning vectors were linearly dependent, one could remove a vector and still span , contradicting [F1] applied to ; when , the empty list is independent. Hence they are -linearly independent and , proving (c).
Finally assume (c): with -linearly independent. Extend this tuple to a basis of and let send the standard basis to it. The function is a norm on , hence equivalent to the coordinate norm by [F3], so there is with for all . A nonzero element of has coordinates with some , so and ; thus and is discrete, proving (a). This closes the cycle (a)(b)(c)(a).
Depends on
- For every $\varepsilon > 0$ in a complete ordered field there is a natural $n \ge 1$ with $1/n < \varepsilon$
- If $V$ has a spanning set with $n$ elements, then every linearly independent subset of $V$ is finite with at most $n$ elements; in particular $V$ has no linearly independent subset equinumerous with $\mathbb{N}$
- Finite-dimensional vector space, and its dimension $\dim_F V$; infinite-dimensional means having no finite basis
- Basis of a vector space: a linearly independent spanning subset; and ordered basis: an injective finite list whose image is a basis
- Linear independence: a finite list $v : n \to V$ is independent when $\sum_{i<n} \lambda_i v_i = 0_V$ forces every $\lambda_i = 0_F$, and a subset $S \subseteq V$ is independent when every injective finite list into $S$ is independent
- Open ball, closed ball and sphere in a metric space
- Bounded subset, diameter, distance from a point to a set, and distance between two sets in a metric space
- The metric topology: a set is open when every one of its points has a ball around it inside the set; closed means open complement
- A norm on a real vector space, the induced metric, and the dictionary with the metric axioms
- Subspace topology: the traces of the open sets, its closed sets and its bases, the continuity of the inclusion, and the characteristic property of a map into a subspace
- Vector space over a field
- Every subgroup of $(\mathbb{Z}, +)$ is $\langle n \rangle = n\mathbb{Z}$ for exactly one natural number $n$
- For $n \ge 1$ all norms on $\mathbb{R}^n$ are equivalent
- Lagrange's theorem: $|G|=[G:H]|H|$ for every subgroup $H$ of a finite group $G$
Used by
Dependency tree · two levels
99 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)
- Andrew V. Sutherland, MIT 18.785 Lecture 15: Dirichlet's Unit Theorem (Fall 2021) (standard reference, not scraped)
- Jurgen Neukirch, Algebraic Number Theory (Springer, 1999) (standard reference, not scraped)