Theorems · Theorem · number theory
AddChar.sum_mulShift
∀ {R : Type u_1} [inst : CommRing R] [inst_1 : Fintype R] [inst_2 : DecidableEq R] {R' : Type u_2}
[inst_3 : CommRing R'] [IsDomain R'] {ψ : AddChar R R'} (b : R),
ψ.IsPrimitive → ∑ x, ψ (x * b) = ↑(if b = 0 then Fintype.card R else 0)The sum over the values of mulShift ψ b for ψ primitive is zero when b ≠ 0
and #R otherwise.
- Cited by
- 2 results in Mathlib
- Foundations
- Depth 60 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites19
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- DFunLike.coestatement and proof · cited by 62,936
- CommRingstatement and proof · cited by 17,173
- Fintypestatement and proof · cited by 7,736
- Finset.sumstatement and proof · cited by 5,195
- Finset.univstatement and proof · cited by 3,473
- Finset.cardproof · cited by 2,327
- Finset.sum_congrproof · cited by 2,323
- mul_commproof · cited by 2,262
- IsDomainstatement and proof · cited by 2,196
- MulZeroClass.mul_zeroproof · cited by 2,091
- Nat.cast_zeroproof · cited by 1,870
- Fintype.cardstatement and proof · cited by 1,386
Cited by2
Results whose statement or proof uses this declaration.
- gaussSum_mul_gaussSum_eq_cardproof · cited by 4
- ZMod.LFunction_stdAddChar_eq_expZetaproof · cited by 1