Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: AI-adaptedPipeline-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.

The Pontryagin dual of a finite cyclic group

Example

For N≥1, on the presented group Z/NZ carrying the quotient topology of the discrete group Z (so that the finite group is discrete), every continuous homomorphism χ:Z/NZ→T is χ([m])=exp⁡(2πi km/N) for a unique k∈Z/NZ, and k↦χk is an isomorphism of topological groups Z/NZ→Z/NZ^ for the presented group (The congruence class [a]n and the quotient set Z/n, For every natural n, (Z/n,+) is an abelian group, multiplication is a commutative monoid operation, and both distributive laws hold); no generator of an abstract cyclic group is chosen.

Facts & Assumptions

[F2]

In the presented group Z/NZ one has N[1]=[0] and [m]=m[1], and [m]=[m′] holds exactly when m≡m′(modN). (The congruence class [a]n and the quotient set Z/n, For every natural n, (Z/n,+) is an abelian group, multiplication is a commutative monoid operation, and both distributive laws hold)

[F3]

The N-th roots of unity in T are exactly the numbers exp⁡(2πik/N) with k∈Z, and exp⁡(2πik/N)=exp⁡(2πik′/N) holds exactly when k≡k′(modN); the identity exp⁡(2πiu)=1 for real u holds exactly when u∈Z. (The n-th roots of a complex number and the n distinct roots of unity for every n≥1, exp⁡(x+iy)=ex(cos⁡y+isin⁡y), ∣exp⁡(x+iy)∣=ex, and eiπ+1=0, The zero sets of sine and cosine and the least positive common period 2 pi)

Verification

Given: N≥1, the presented group Z/NZ, and the unit circle T.

1.1F2F3F4

Let χ be a continuous homomorphism of Z/NZ into T and put ζ:=χ([1]). Then ζN=χ([1])N=χ(N[1])=χ([0])=1 by [F2] and the power laws of [F4], so ζ is an N-th root of unity and by [F3] there is k∈Z with ζ=exp⁡(2πik/N); then χ([m])=χ([1])m=exp⁡(2πikm/N) for every m by [F2] and the power laws.

2.1step 1.1F1F2F3F4

The integer k is unique modulo N, and every k defines a character: if exp⁡(2πikm/N)=exp⁡(2πik′m/N) for all m, then for m=1 the congruence k≡k′(modN) follows from [F3]; conversely for fixed k the formula χk([m]):=exp⁡(2πikm/N) is well defined by [F3] and [F2], is a homomorphism because exp⁡(2πik(m+m′)/N)=exp⁡(2πikm/N)exp⁡(2πikm′/N), and is continuous because Z/NZ is finite and discrete by [F1].

3.1step 1.1step 2.1F3F4

The map k↦χk from Z/NZ to the dual is a bijective homomorphism: χk+k′=χkχk′ by the addition formula, injectivity is step 2.1, and surjectivity is step 1.1 combined with the uniqueness in step 2.1.

4.1step 3.1F1F4∎

It is a homeomorphism: Z/NZ is finite and discrete by [F1], its dual is discrete by [F1] because the finite discrete group is compact, and any bijection between discrete spaces is a homeomorphism by [F4]; hence k↦χk is an isomorphism of topological groups.

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