Alphabeta Math
CorollaryStatement: AI-adaptedProof: AI-adaptedSession-authored (Fable 5 assisted)precheck passaudited 2026-08-02
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.

For n2n\ge2, the sum of all nn-th roots of unity is zero

Facts & Assumptions

Given: A natural n2n\ge2 and ζ=exp ⁣(i2πιR(n))\zeta=\exp\!\left(i\frac{2\pi}{\iota_{\mathbb R}(n)}\right), with ιR\iota_{\mathbb R} as in The nn-th roots of a complex number and the nn distinct roots of unity for every n1n\ge1.

Proof

technique · direct
1.1

The roots are the distinct list 1,ζ,,ζn11,\zeta,\ldots,\zeta^{n-1}, with ζn=1\zeta^n=1 and ζ1\zeta\ne1.

given
1.2

The cyclic successor map on the initial segment nn is a permutation; the commutative-monoid permutation rule therefore gives ζS=S\zeta S=S for S=k<nζkS=\sum_{k<n}\zeta^k.

given
2.1

Thus (ζ1)S=0(\zeta-1)S=0, and field cancellation gives S=0S=0.

algebra

Depends on

Used by

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 82 results over 20 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.

Sources