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.

Compactness and discreteness are exchanged by duality

Statement

Assume the Axiom of Choice (The Axiom of Choice). Let G be a locally compact Hausdorff abelian group. Then:

(1) G is compact if and only if G^ is discrete;

(2) G is discrete if and only if G^ is compact.

The Axiom of Choice supplies the Tychonoff-based compactness implication and the choice hypotheses of biduality used in the converses.

Facts & Assumptions

Given: A locally compact Hausdorff abelian group G and the Axiom of Choice.

[F1]

If G is compact then G^ is discrete, and if G is discrete then, assuming the Axiom of Choice, G^ is compact. Both directions are for abelian topological groups. (Compact groups have discrete duals and discrete groups have compact duals)

[F2]

The dual of a locally compact Hausdorff abelian group is again a locally compact Hausdorff abelian group. (The dual of a locally compact abelian group is locally compact abelian, The Pontryagin dual with the compact-open topology)

[F4]

The assumed Axiom of Choice implies Dependent Choice, so the current biduality theorem applies with its full hypotheses. (AC implies DC implies countable choice)

Proof

1.1F1

The forward implications are exactly the two clauses of [F1]: compact G gives discrete G^, and discrete G gives compact G^.

2.1F1F2F3F4step 1.1∎

For the converses, apply [F1] to the locally compact Hausdorff abelian group G^ of [F2], whose dual is the bidual G^^: if G^ is compact then G^^ is discrete, and ΦG identifies G with G^^ by [F3], so G is discrete; if G^ is discrete then G^^ is compact, so G is compact. Together with step 1.1 this proves both equivalences.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

65 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