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.
The profinite completion is initial among continuous homomorphisms from G to profinite groups
Statement
The profinite completion is initial among continuous homomorphisms from to profinite groups.
Facts & Assumptions
Given: An abstract group , a profinite group , and a homomorphism that is continuous for the profinite topology on .
By definition, choose a topological group isomorphism with every finite discrete (A profinite group is a topological group isomorphic to an inverse limit of finite discrete groups).
The canonical map has dense image (The canonical map to the profinite completion has kernel equal to the finite residual and has dense image).
The compatible-tuples construction satisfies the inverse-limit universal property (The compatible-tuple construction satisfies the inverse-limit universal property in groups).
The completion is the inverse limit of the finite quotients with its inverse-limit topology, and the th coordinate of is (The profinite completion is the inverse limit of the finite quotients G over N, The canonical map sends g to its coherent system of residue classes).
A map into an inverse limit is continuous exactly when all coordinate composites are continuous (A map into an inverse limit is continuous exactly when all coordinate composites are continuous).
An inverse limit of finite discrete groups is Hausdorff (Inverse limits of finite discrete groups are Hausdorff and totally disconnected, and compact assuming Choice).
Proof
For each coordinate of [L1], put . This is normal, and is isomorphic to the image of in the finite group , so has finite index. Let be the induced homomorphism.
Let be the completion coordinate and define . It is continuous because both finite quotients are discrete and is a coordinate projection for the topology in [F2]. Moreover, [F2] gives
If and is the transition map, then , so . Let be the natural quotient map. The two induced maps satisfy and the completion coordinates satisfy . Hence , so is a compatible cone.
By [F1], the compatible cone from step 3.1 induces a homomorphism with coordinate maps . The coordinate identities in step 2.1 give . Define ; then .
Every coordinate composite of is the continuous map , so [L3] makes continuous. The inverse is continuous because is a topological group isomorphism, hence is continuous.
For uniqueness, let be continuous homomorphisms with . By [L1] and [L4], is Hausdorff. The equalizer of and is therefore closed, while [L2] says it contains the dense subset . Thus the equalizer is all of , and .
Steps 4.1, 5.1, and 5.2 give the unique continuous homomorphism extending . Therefore is initial among continuous homomorphisms from to profinite groups.
Depends on
- The profinite completion is the inverse limit of the finite quotients G over N
- The canonical map sends g to its coherent system of residue classes
- The canonical map to the profinite completion has kernel equal to the finite residual and has dense image
- A profinite group is a topological group isomorphic to an inverse limit of finite discrete groups
- A map into an inverse limit is continuous exactly when all coordinate composites are continuous
- The compatible-tuple construction satisfies the inverse-limit universal property in groups
- Inverse limits of finite discrete groups are Hausdorff and totally disconnected, and compact assuming Choice
Used by
Dependency tree · two levels
24 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
- Brian Osserman, Math 6112 notes on inverse limits and profinite groups (standard reference, not scraped)
- H. W. Lenstra, Profinite groups and Galois groups (standard reference, not scraped)