Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6.1-sol)
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 principal structure theorem for LCA groups

Facts & Assumptions

Given: A locally compact Hausdorff abelian group G, and the Axiom of Choice together with Dependent Choice.

[F1]

Every locally compact Hausdorff abelian group contains an open, hence closed, subgroup which is compactly generated and contains no open subgroup of infinite index. (Every LCA group has an open compactly generated subgroup with no open subgroup of infinite index)

[F2]

A compactly generated locally compact Hausdorff abelian group with no open subgroup of infinite index is isomorphic as a topological group to W⊕Rn for some compact group W and some n≥0. (A compactly generated LCA group with no open subgroup of infinite index is Euclidean times compact)

Proof

1.1F1

Apply [F1] to G: there is an open subgroup H≤G which is compactly generated and contains no open subgroup of infinite index.

2.1F2F3step 1.1∎

Apply [F2] to H: there are n≥0 and a compact group W with H≅W⊕Rn as topological groups. Since H is open in G it is closed by [F3], and the isomorphism is the required one. Thus G contains an open subgroup isomorphic to Rn×W, which is the statement.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

61 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