Alphabeta Math
TheoremStatement: 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.

The nn-th roots of a complex number and the nn distinct roots of unity for every n1n\ge1

Statement

Write ιR:NR\iota_{\mathbb R}:\mathbb N\to\mathbb R for the canonical-natural map of The canonical natural ι(n)=n1F\iota(n) = n \cdot 1_F of a field. If nNn\in\mathbb N with n1n\ge1 and z=reiθ0z=re^{i\theta}\ne0, its nn distinct roots are r1/nexp ⁣(iθ+2πιR(k)ιR(n)),kN,0k<n.r^{1/n}\exp\!\left(i\frac{\theta+2\pi\iota_{\mathbb R}(k)}{\iota_{\mathbb R}(n)}\right),\qquad k\in\mathbb N,\quad 0\le k<n. For z=0z=0, the only nnth root is 00. Thus the nnth roots of unity are precisely exp ⁣(i2πιR(k)ιR(n))\exp\!\left(i\frac{2\pi\iota_{\mathbb R}(k)}{\iota_{\mathbb R}(n)}\right) for kNk\in\mathbb N with 0k<n0\le k<n. The conventions and prerequisite facts used below are recorded in Every nonzero complex number has a unique polar form r(cosθ+isinθ)r(\cos\theta+i\sin\theta) with r>0r>0 and π<θπ-\pi<\theta\le\pi, Complex de Moivre formula for every integer exponent, ker(exp)=2πiZ\ker(\exp)=2\pi i\mathbb Z, and expz=expw\exp z=\exp w exactly when zw2πiZz-w\in2\pi i\mathbb Z, Existence and uniqueness of nn-th roots: a unique a1/n0a^{1/n} \ge 0 with (a1/n)n=a(a^{1/n})^n = a, The canonical natural ι(n)=n1F\iota(n) = n \cdot 1_F of a field, Integer powers in the complex field.

Facts & Assumptions

Given: nNn\in\mathbb N with n1n\ge1 and zCz\in\mathbb C.

Proof

technique · constructive
1.1

For z0z\ne0, construct each listed candidate from the positive real nnth root of rr; de Moivre verifies it.

construct
1.2

The kernel theorem shows two listed candidates coincide only when their indices are equal modulo nn.

given
2.1

Conversely polar form and the same kernel calculation force every root onto the list; the z=0z=0 case is immediate.

discharge-construct

Depends on

Used by

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 94 results over 22 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