Alphabeta Math
TheoremStatement: Literature-sourcedProof: Literature-sourcedPipeline-generatedjudge 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.

Compact groups have discrete duals and discrete groups have compact duals

Statement

(1) If G is a compact abelian topological group, then G^ is discrete. (2) If G is a discrete abelian group, then, assuming the Axiom of Choice (The Axiom of Choice) used only through Tychonoff's theorem, G^ is compact (Open cover, subcover, and compact topological space; a compact subset is a subspace that is compact in its own right).

Facts & Assumptions

[F1]

G^ is a Hausdorff topological abelian group, so translations are homeomorphisms; its compact-open subbasis is S(K,V)={γ:γ[K]⊆V} for compact K⊆G and open V⊆T. (The compact-open character group is a Hausdorff topological abelian group, The Pontryagin dual with the compact-open topology, Subspace topology: the traces of the open sets, its closed sets and its bases, the continuity of the inclusion, and the characteristic property of a map into a subspace)

[F2]

The arc D={z∈T:∣z−1∣<1} contains no nontrivial subgroup of T; the image of a homomorphism is a subgroup. (The unit-circle arc {z:∣z−1∣<1} contains no nontrivial subgroup)

[F3]

On a discrete domain the compact-open topology agrees with the topology of pointwise convergence, and on every subset of C(G,T) the compact-open subspace topology is the topology inherited from the product TG. (On a discrete domain the compact-open topology is the topology of pointwise convergence, The topology of pointwise convergence on YX, which is the product topology, and its restriction to C(X,Y))

[F4]

Every function from a discrete space is continuous, so for discrete G the dual is the set Hom⁡(G,T) of all homomorphisms, and this set is closed in TG for the product topology. (The discrete, indiscrete, cofinite, cocountable, particular-point and Sierpinski topologies, Continuity of a map of topological spaces at a point and globally, Pointwise limits of homomorphisms and of equicontinuous characters)

Proof

Given: An abelian topological group G, compact in case (1) and discrete in case (2).

1.1F1F2F6

Under the hypothesis of (1), S(G,D)={γ∈G^:γ[G]⊆D} is open in G^ by [F1], since G is compact and D is open and contains 1 by [F6]; it contains the identity character because 1[G]={1}⊆D. If γ∈S(G,D), then γ[G] is a subgroup of T contained in D, hence trivial by [F2], so γ=1; therefore S(G,D)={1} and {1} is open in G^.

1.2F3F4

Under the hypothesis of (2), for every f:G→T and every open target set V, the preimage f−1[V] is open because every subset of the discrete source G is open. At any x with f(x)∈V this preimage is the required source neighbourhood, so every such function is continuous by [F4], so the dual is Hom⁡(G,T) with the compact-open topology, which by [F3] is the subspace topology inherited from the product TG; by [F4] the set Hom⁡(G,T) is closed in TG.

2.1step 1.1F1

Hence G^ is discrete: for any γ0∈G^ the translation γ↦γ0γ is a homeomorphism of G^ by [F1] carrying 1 to γ0, so {γ0} is the image of the open set {1} and is open; every singleton is open, which is discreteness.

2.2step 1.2F5

The product TG is compact by Tychonoff's theorem under the Axiom of Choice by [F5], and the closed subspace G^=Hom⁡(G,T) of a compact space is compact by [F5]. This completes (2).

3.1step 2.1step 2.2∎

Clause (1) is step 2.1 and clause (2) is step 2.2, so the theorem is proved.

Depends on

Used by

Dependency tree · two levels

78 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