Theorems · Theorem · number theory
DirichletCharacter.factorsThrough_gcd
∀ {R : Type u_1} [inst : CommMonoidWithZero R] {n : ℕ} (χ : DirichletCharacter R n) {m : ℕ} [NeZero n]
(ψ : DirichletCharacter R m),
(DirichletCharacter.changeLevel ⋯) χ = (DirichletCharacter.changeLevel ⋯) ψ → χ.FactorsThrough (n.gcd m)Let χ and ψ be Dirichlet characters of level n and m respectively. Assume that they agree
at level n * m. Then χ factors through gcd(n, m).
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 89 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- CommMonoidWithZeroNeZero
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites32
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
- MonoidHomstatement · cited by 3,629
- Unitsproof · cited by 2,804
- Nat.cast_oneproof · cited by 2,501
- Units.valproof · cited by 1,966
- ZModstatement and proof · cited by 1,024
- CommMonoidWithZerostatement and proof · cited by 913
- map_oneproof · cited by 861
- Nat.ModEqproof · cited by 225
- MonoidHom.kerproof · cited by 212
- DirichletCharacterstatement and proof · cited by 161
- ZMod.valproof · cited by 159
Cited by1
Results whose statement or proof uses this declaration.
- DirichletCharacter.conductor_dvd_of_mem_conductorSetproof · cited by 2