Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: 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 bidual map on the circle and the integers

Example

Assume the Axiom of Choice (The Axiom of Choice) and Dependent Choice (The axiom of dependent choice: a relation in which every element is related to something admits an N-indexed chain); the two identifications of values below are direct computations from the classifications of the characters of Z and T given in the Facts, and the continuity statement is exactly Pontryagin biduality: the evaluation map is a topological isomorphism. Under the identifications Z^≅T, z↦(n↦zn), and T^≅Z, k↦(z↦zk), the evaluation map ΦZ:Z→Z^^ is the identity of Z, and ΦT:T→T^^ is the identity of T. In particular the abstract biduality identification is the natural one on these two groups, not merely an abstract isomorphism.

Facts & Assumptions

[F1]

A homomorphism γ:Z→T is determined by γ(1), and every z∈T occurs; since Z carries the discrete topology every such homomorphism is continuous. Hence z↦(n↦zn) is an algebraic isomorphism T→Z^. Compact subsets of the discrete space Z are finite (their cover by singletons has a finite subcover), so the preimage of each compact-open subbasic set is a finite intersection of open conditions on powers of z; the inverse is evaluation at 1, whose preimages of open sets are subbasic open sets. Thus both directions are continuous. (The integers as equivalence classes of pairs of naturals, The discrete, indiscrete, cofinite, cocountable, particular-point and Sierpinski topologies, The Pontryagin dual with the compact-open topology, Topological group: multiplication and inversion are continuous)

[F2]

Every continuous homomorphism χ:T→T is χ(z)=zk for a unique k∈Z. Indeed, writing T≅R/Z through the unit-circle isomorphism, χ corresponds to a continuous homomorphism ψ:R→T with ψ(1)=1; by the classification of characters of the line there is a unique ξ∈R with ψ(t)=e2πiξt, and ψ(1)=1 forces e2πiξ=1, that is ξ∈Z by the kernel of the complex exponential. The dual of the compact circle is discrete by Compact groups have discrete duals and discrete groups have compact duals, so this bijection from the discrete group Z is a topological isomorphism. (The multiplicative unit circle is a compact metrizable topological abelian group, Continuous characters of the real line are exponentials, ker⁡(exp⁡)=2πiZ, and exp⁡z=exp⁡w exactly when z−w∈2πiZ, The Pontryagin dual with the compact-open topology)

[F3]

For every locally compact Hausdorff abelian group G the evaluation map ΦG(x)(γ):=γ(x) is an isomorphism of topological groups G→G^^. (Pontryagin biduality: the evaluation map is a topological isomorphism)

Verification

1.1F1F2

Under the identification [F1], the element z∈T corresponds to the character n↦zn of Z, so for n∈Z one has ΦZ(n)(z)=zn; reading this character of T through the identification of [F2], which assigns to k∈Z the character z↦zk, gives the integer n. Hence ΦZ is the identity of Z.

1.2F1F2

Under the identification of [F2], the integer k corresponds to the character z↦zk of T, so for z∈T one has ΦT(z)(k)=zk; reading this character of Z through the identification [F1] gives back z. Hence ΦT is the identity of T.

2.1F3step 1.1step 1.2∎

By [F3] the maps ΦZ and ΦT are topological isomorphisms, and steps 1.1 and 1.2 identify them with the identity maps of Z and T; so the biduality identification is the natural one on these groups, which is the example.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

100 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