Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6.1-sol)audited 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.

Discrete subgroups of a real vector space are lattices

Statement

Facts & Assumptions

Given: A finite-dimensional real vector space V of dimension n with a norm, the induced metric and topology, and a subgroup Γ≤V.

[F2]

The induced metric is d(x,y)=∥x−y∥, 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).

[F3]

Identifying V with Rn by one basis, the given norm corresponds to a norm on Rn. Equivalence with the coordinate maximum norm gives a constant c>0 such that ∥x∥≥c∥x∥∞ in these coordinates (For n≥1 all norms on Rn are equivalent).

[F4]

Every subgroup of (Z,+) is dZ for a unique nonnegative integer d (Every subgroup of (Z,+) is ⟨n⟩=nZ for exactly one natural number n). In particular, the image of a subgroup of Zm under projection to one coordinate is either {0} or dZ for some d>0.

[F5]

A finite group of order N has uN=1 for every element u, by Lagrange's theorem (Lagrange's theorem: ∣G∣=[G:H]∣H∣ for every subgroup H of a finite group G).

[F6]

For every ε>0 there is an integer q≥1 with 1/q<ε (For every ε>0 in a complete ordered field there is a natural n≥1 with 1/n<ε).

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 Zr; a finite-rank subgroup induction then supplies a lattice basis using only the cyclic-subgroup-of-Z result.

First handle n=0. Then V={0} and Γ={0}, so (a), (b), and (c) hold with r=0. Assume n≥1 below.

1.1F2

Suppose first that Γ is discrete. Then {0} is open in the subspace topology on Γ, so {0}=Γ∩U for some open U⊆V; choosing a ball around 0 inside U gives an ε>0 with Γ∩B(0,ε)={0}.

1.2F2

Suppose next that (b) holds. The set Γ∩B(0,1) is then finite; if it is {0} take ε=1, and otherwise let δ:=min⁡{∥γ∥:0≠γ∈Γ∩B(0,1)}>0, a minimum of a nonempty finite set of positive reals, so that again Γ∩B(0,δ)={0}. Since balls are translation invariant in the metric of a norm, B(γ,δ)=γ+B(0,δ) for every γ∈Γ, so Γ∩B(γ,δ)={γ}: every point of Γ is isolated in Γ, that is, Γ is discrete. Hence (b) implies (a).

1.3F1

Assume (b) from here on. By [F1] the lengths of the R-linearly independent finite tuples of elements of Γ form a nonempty subset of {0,1,…,n}, so a maximum r exists; select an R-linearly independent tuple v1,…,vr∈Γ, and put W:=span⁡R(v1,…,vr), so dim⁡RW=r.

1.4F2

Put Γ0:=Zv1⊕⋯⊕Zvr⊆Γ and P:={∑i=1rtivi:0≤ti<1}. Since ∥∑itivi∥≤∑i∣ti∣ ∥vi∥≤∑i∥vi∥, the set P is bounded, so F:=Γ∩P is finite by (b).

2.1F2F3F6step 1.1

This proves (a)⇒(b) without selecting a sequence from a bounded set. Fix a basis e1,…,en of V and put S:=∑i=1n∥ei∥>0. Let B⊆V be bounded; if B=∅ the conclusion is immediate. Otherwise choose a ball B(x0,R) containing it. Let ai be the coordinates of x0. By [F3] there is c>0 with ∥v∥≥c∥(vi)∥∞ in these coordinates, so every x∈B satisfies max⁡i∣xi−ai∣<R/c. Set M:=max⁡{1,R/c}; then the coordinate vectors of B lie in the box ∏i[ai−M,ai+M]. Set δ:=ε/(2S)>0 and choose an integer q≥1 with 1/q<δ/(2M) by [F6]. Divide each coordinate interval into q 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 x,y satisfy ∥x−y∥≤∑i∣xi−yi∣∥ei∥<δS=ε/2<ε. By step 1.1, each cell therefore contains at most one point of Γ. The finite collection of cells covers B, so B∩Γ is finite.

2.2step 1.3

If γ∈Γ∖W, then any relation λ1v1+⋯+λrvr+μγ=0 must have μ=0, since otherwise it would express γ as an element of W. The independence of v1,…,vr then forces every λi=0, so adjoining γ would give r+1 independent elements of Γ, contradicting maximality in step 1.3. Thus Γ⊆W, and since the vi lie in Γ, span⁡RΓ=W.

3.1step 1.4step 2.2

Every γ∈Γ differs from an element of Γ0 by an element of F: by step 2.2 write γ=∑isivi with si∈R and write si=mi+ti with mi∈Z and 0≤ti<1; then γ−∑imivi∈Γ∩P=F.

4.1F5step 1.4step 3.1

The map F→Γ/Γ0, f↦f+Γ0, is surjective by step 3.1. Thus Γ/Γ0 is finite; let its order be N≥1. By [F5], Nγ∈Γ0 for every γ∈Γ. The map T:Γ→Γ0, T(γ)=Nγ, is an injective homomorphism: if Nγ=0, then γ=0 because V is a real vector space and N>0. Consequently its image is a subgroup of Γ0≅Zr.

5.1F4choosestep 4.1

By step 4.1, T(Γ) is a subgroup of Γ0≅Zr. For this use, every subgroup H≤Zm has a finite Z-basis of length at most m, by induction on m. For m=0 the subgroup is zero and the empty list is a basis. For m≥1, project H onto its first coordinate. By [F4] the image is dZ for some d≥0. If d=0, identify H with a subgroup of the last m−1 coordinates and apply induction. If d>0, choose h∈H with first coordinate d; the kernel H0 of that projection is a subgroup of Zm−1, so induction gives it a basis of length at most m−1. Every x∈H has first coordinate kd for some k∈Z; then x−kh∈H0, so h together with a basis of H0 generates H. They are independent because projecting any integer relation to the first coordinate forces the coefficient of h to be zero, after which independence in H0 forces all remaining coefficients to vanish. This proves the claim, including that the basis has at most m elements.

6.1F1step 2.2step 5.1

Apply step 5.1 to T(Γ)≤Γ0≅Zr and pull its Z-basis back through the isomorphism T:Γ→T(Γ). This gives a Z-basis b1,…,bs of Γ with s≤r. By step 2.2, v1,…,vr are linearly independent and span W, while span⁡R(b1,…,bs)=W because they generate Γ. The finite-dimensional independent-set bound [F1] gives r≤s, so s=r. If r>0 and these r spanning vectors were linearly dependent, one could remove a vector and still span W, contradicting [F1] applied to v1,…,vr; when r=0, the empty list is independent. Hence they are R-linearly independent and Γ=Zb1⊕⋯⊕Zbr, proving (c).

7.1F1F3∎

Finally assume (c): Γ=Zv1⊕⋯⊕Zvr with v1,…,vr R-linearly independent. Extend this tuple to a basis v1,…,vr,w1,…,wn−r of V and let φ:Rn→V send the standard basis to it. The function t↦∥φ(t)∥ is a norm on Rn, hence equivalent to the coordinate norm ∣t∣∞=max⁡i∣ti∣ by [F3], so there is c>0 with ∥φ(t)∥≥c ∣t∣∞ for all t. A nonzero element of Γ has coordinates (m1,…,mr,0,…,0) with some mi∈Z∖{0}, so ∣m∣∞≥1 and ∥γ∥≥c; thus Γ∩B(0,c)={0} and Γ is discrete, proving (a). This closes the cycle (a)⇒(b)⇒(c)⇒(a).

Depends on

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