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 be a finite abelian group, and let . Choose a character uniformly from . Then For every outcome with , the updated common kernel , where , contains and has index at least two in .
Facts & Assumptions
Given: A finite abelian group and subgroups .
, and under evaluation. (Character annihilator of a subgroup, Double annihilator returns the subgroup)
is a finite abelian group under pointwise multiplication, so is finite. (Pointwise character dual is a finite abelian group)
A character is a homomorphism , so and . (Additive characters of a finite abelian group)
A subgroup contains the identity and is closed under addition and inverses. (Subgroup)
The canonical evaluation map identifies with its double dual. (Finite abelian group is canonically isomorphic to its double dual)
is a subgroup of under pointwise multiplication. (Annihilators of subgroups are subgroups)
Proof
Choose . Under the canonical evaluation identification [F5], [F1] gives , so there is with . By [F6], is a group; the evaluation map , , is a homomorphism because pointwise multiplication gives . Its image is finite by [F2] and is a subgroup because it is the image of a group homomorphism. It contains and the nonidentity value , so it has at least two elements.
Every nonempty fiber of is a coset of its kernel: exactly when . Therefore at most half of maps to . A uniform has with probability at least , and each such character is nontrivial on because .
For any , every satisfies , so . The set is a subgroup: it contains by [F3], and the homomorphism law gives closure under addition and inverses. Its intersection with is a subgroup by [F4]. If , the homomorphism has at least two values; its fibers are cosets of , so .
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
- Andrew M. Childs, Lecture Notes on Quantum Algorithms (17 April 2025) (standard reference, not scraped)
- Ronald de Wolf, Quantum Computing: Lecture Notes, arXiv:1907.09415v6 (standard reference, not scraped)