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 are closed embedded zero-dimensional Lie subgroups
Statement
Assume . A subgroup of a finite-dimensional real Lie group is discrete in its subspace topology if and only if it is a closed embedded zero-dimensional Lie subgroup.
Facts & Assumptions
Given: , a Lie group , and a subgroup .
Countable choice and the closed subgroup theorem are available. The Axiom of Countable Choice (), Cartan closed subgroup theorem.
Proof
Suppose is discrete in the subspace topology. There is an identity neighborhood with . Choose a symmetric identity neighborhood with . Every translate contains at most one point of : two such points would satisfy .
If lies in the closure of , then contains some . If , Hausdorffness makes an open neighborhood of disjoint from , contradicting closure. Thus , so is closed.
By [A1], has its unique embedded Lie-subgroup structure. Its embedded topology is its discrete subspace topology, so every singleton is an open coordinate neighborhood; hence its manifold dimension is zero.
Conversely, an embedded zero-dimensional Lie subgroup has the subspace topology, and every point has a chart into the one-point space ; it is therefore discrete. Its closedness is already part of the right-hand condition. This proves both directions. The trivial subgroup and discrete ambient groups are included. Choice is used only through [A1].
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
18 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
- John M. Lee, Introduction to Smooth Manifolds, 2nd ed. (standard reference, not scraped)