Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-generatedprecheck passaudited 2026-09-01
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 kernels of the finite coordinate projections form an open normal neighbourhood basis at the identity

Statement

For a profinite group presented as an inverse limit of finite discrete groups, the kernels of the coordinate projections form an open normal neighbourhood basis at the identity.

Facts & Assumptions

Given: A profinite group written as L=lim←⁡Gi with coordinate maps πi:L→Gi.

[L1]

Each πi is a coordinate projection from the inverse limit (The inverse limit has its canonical coordinate projection maps).

Proof

technique · direct
1.1L1F1given

Each kernel ker⁡πi is a normal subgroup because πi is a homomorphism, and it is open because {ei}⊆Gi is open in the discrete factor and πi−1({ei})=ker⁡πi.

1.2F1L1givenchoose

Let U be any neighbourhood of the identity in L. By [F1], some basic cylinder fixing finitely many coordinates, say those in a finite set F⊆I, is contained in U. Choose k∈I dominating every index in F by directedness. If x∈ker⁡πk, then compatibility gives πi(x)=φik(ek)=ei for every i∈F, so x lies in that cylinder. Hence ker⁡πk⊆U.

2.1step 1.1step 1.2∎

Therefore the family (ker⁡πi) is a neighbourhood basis of open normal subgroups at the identity.

Depends on

Used by

Dependency tree · two levels

13 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