Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-generatedPipeline-generatedjudge pass (gpt-6-luna)
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.

A Fourier sample cuts a larger common kernel

Statement

Let G be a finite abelian group, and let H⊊K≤G. Choose a character χ uniformly from H⊥. Then P(χ∣K≠1)≥12. For every outcome with χ∣K≠1, the updated common kernel K∩ker⁡χ, where ker⁡χ={g∈G:χ(g)=1}, contains H and has index at least two in K.

Facts & Assumptions

Given: A finite abelian group G and subgroups H⊊K≤G.

[F1]

H⊥={χ∈G^:χ(h)=1 for every h∈H}, and (H⊥)⊥=H under evaluation. (Character annihilator of a subgroup, Double annihilator returns the subgroup)

[F2]

G^ is a finite abelian group under pointwise multiplication, so H⊥ is finite. (Pointwise character dual is a finite abelian group)

[F3]

A character is a homomorphism G→C×, so χ(x+y)=χ(x)χ(y) and χ(0)=1. (Additive characters of a finite abelian group)

[F4]

A subgroup contains the identity and is closed under addition and inverses. (Subgroup)

[F5]

The canonical evaluation map g↦(χ↦χ(g)) identifies G with its double dual. (Finite abelian group is canonically isomorphic to its double dual)

[F6]

H⊥ is a subgroup of G^ under pointwise multiplication. (Annihilators of subgroups are subgroups)

Proof

1.1givenF1F2F3F5F6chooseconstruct

Choose g∈K∖H. Under the canonical evaluation identification [F5], [F1] gives (H⊥)⊥=H, so there is χ0∈H⊥ with χ0(g)≠1. By [F6], H⊥ is a group; the evaluation map ϵg:H⊥→C×, ϵg(χ)=χ(g), is a homomorphism because pointwise multiplication gives ϵg(χψ)=χ(g)ψ(g). Its image is finite by [F2] and is a subgroup because it is the image of a group homomorphism. It contains 1 and the nonidentity value χ0(g), so it has at least two elements.

2.1step 1.1F2F3F6algebra

Every nonempty fiber of ϵg is a coset of its kernel: ϵg(χ)=ϵg(ψ) exactly when ϵg(χψ−1)=1. Therefore at most half of H⊥ maps to 1. A uniform χ∈H⊥ has χ(g)≠1 with probability at least 1/2, and each such character is nontrivial on K because g∈K.

3.1F3F4step 2.1∎

For any χ∈H⊥, every h∈H satisfies χ(h)=1, so H⊆K∩ker⁡χ. The set ker⁡χ is a subgroup: it contains 0 by [F3], and the homomorphism law gives closure under addition and inverses. Its intersection with K is a subgroup by [F4]. If χ∣K≠1, the homomorphism χ∣K has at least two values; its fibers are cosets of K∩ker⁡χ, so [K:K∩ker⁡χ]=∣χ(K)∣≥2.

Remarks

The current QA-05 double-annihilator and evaluation-map carriers are draft suppliers. Their actual statements and proofs were inspected for this argument; draft status is not independent acceptance.

Depends on

Used by

Dependency tree · two levels

27 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