Theorems · Theorem · number theory
IsPrimitiveRoot.sum_eq_zero_iff_forall_eq
∀ {K : Type u_1} [inst : Field K] [CharZero K] {p : ℕ} {ζ : K},
Nat.Prime p → IsPrimitiveRoot ζ p → ∀ (α : Fin p → ℚ), ∑ i, ↑(α i) * ζ ^ ↑i = 0 ↔ ∀ (i j : Fin p), α i = α jFor a prime p, a ℚ-linear combination ∑_{i < p} αᵢ ζⁱ vanishes if and only if all
coefficients αᵢ are equal. This follows from the irreducibility of the p-th cyclotomic
polynomial. See de Launey–Flannery, Algebraic Design Theory, Lemma 2.8.5.
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 210 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites54
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- DFunLike.coeproof · cited by 62,936
- Fieldstatement and proof · cited by 7,404
- Polynomialproof · cited by 5,681
- Finset.sumstatement and proof · cited by 5,195
- Algebra.algebraMapproof · cited by 4,706
- mul_oneproof · cited by 3,885
- Finset.univstatement and proof · cited by 3,473
- LE.le.transproof · cited by 3,151
- one_mulproof · cited by 2,841
- Factproof · cited by 2,726
- add_zeroproof · cited by 2,707
- Finset.sum_congrproof · cited by 2,323
Cited by1
Results whose statement or proof uses this declaration.
- IsPrimitiveRoot.sum_eq_zero_iff_forall_eq_intproof · cited by 0