Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-04
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.

Every maximal proper closed subgroup of a profinite group is open

Statement

If H is a maximal proper closed subgroup of a profinite group G, then H is open.

Facts & Assumptions

Given: A profinite group G and a maximal proper closed subgroup H<G.

[F1]

The Frattini subgroup is defined by maximal proper closed subgroups (The Frattini subgroup of a profinite group is the intersection of its maximal proper closed subgroups).

[L1]

A profinite group is an inverse limit of finite discrete groups (A profinite group is a topological group isomorphic to an inverse limit of finite discrete groups).

Proof

technique · direct
1.1

Choose xGH. By [L1], write G as an inverse limit of finite groups and view H as a closed subset of that product. Since xH, some cylinder neighbourhood of x misses H; equivalently, there is an open normal subgroup N of G such that xNH=.

L1givenchoose
2.1

The subgroup HN is open because it is a union of N-cosets, and it is closed because it is a finite union of closed cosets. If HN=G, then x=hn for some hH and nN, so h=xn1xNH, contradicting step 1.1. Thus HN is a proper closed subgroup containing H. By maximality of H, one must have HN=H, hence NH. Therefore H contains an open neighbourhood of the identity and is itself open.

F1step 1.1algebra

Depends on

Used by

Dependency tree · two levels

4 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