Loogle!
Result
Found 216 declarations mentioning MulChar. Of these, only the first 200 are shown.
- MulChar π Mathlib.NumberTheory.MulChar.Basic
(R : Type u_1) [CommMonoid R] (R' : Type u_2) [CommMonoidWithZero R'] : Type (max u_1 u_2) - MulChar.trivial π Mathlib.NumberTheory.MulChar.Basic
(R : Type u_1) [CommMonoid R] (R' : Type u_2) [CommMonoidWithZero R'] : MulChar R R' - MulChar.commGroup π Mathlib.NumberTheory.MulChar.Basic
{R : Type u_1} [CommMonoid R] {R' : Type u_2} [CommMonoidWithZero R'] : CommGroup (MulChar R R') - MulChar.hasInv π Mathlib.NumberTheory.MulChar.Basic
{R : Type u_1} [CommMonoid R] {R' : Type u_2} [CommMonoidWithZero R'] : Inv (MulChar R R') - MulChar.hasMul π Mathlib.NumberTheory.MulChar.Basic
{R : Type u_1} [CommMonoid R] {R' : Type u_2} [CommMonoidWithZero R'] : Mul (MulChar R R') - MulChar.hasOne π Mathlib.NumberTheory.MulChar.Basic
{R : Type u_1} [CommMonoid R] {R' : Type u_2} [CommMonoidWithZero R'] : One (MulChar R R') - MulChar.inhabited π Mathlib.NumberTheory.MulChar.Basic
{R : Type u_1} [CommMonoid R] {R' : Type u_2} [CommMonoidWithZero R'] : Inhabited (MulChar R R') - MulChar.instFunLike π Mathlib.NumberTheory.MulChar.Basic
(R : Type u_1) [CommMonoid R] (R' : Type u_2) [CommMonoidWithZero R'] : FunLike (MulChar R R') R R' - MulChar.IsQuadratic π Mathlib.NumberTheory.MulChar.Basic
{R : Type u_1} [CommMonoid R] {R' : Type u_2} [CommRing R'] (Ο : MulChar R R') : Prop - MulChar.inv π Mathlib.NumberTheory.MulChar.Basic
{R : Type u_1} [CommMonoid R] {R' : Type u_2} [CommMonoidWithZero R'] (Ο : MulChar R R') : MulChar R R' - MulChar.instMulCharClass π Mathlib.NumberTheory.MulChar.Basic
{R : Type u_1} [CommMonoid R] {R' : Type u_2} [CommMonoidWithZero R'] : MulCharClass (MulChar R R') R R' - MulChar.mul π Mathlib.NumberTheory.MulChar.Basic
{R : Type u_1} [CommMonoid R] {R' : Type u_2} [CommMonoidWithZero R'] (Ο Ο' : MulChar R R') : MulChar R R' - MulChar.toMonoidWithZeroHom π Mathlib.NumberTheory.MulChar.Basic
{R' : Type u_2} [CommMonoidWithZero R'] {R : Type u_3} [CommMonoidWithZero R] [Nontrivial R] (Ο : MulChar R R') : R β*β R' - MulChar.toMonoidHom π Mathlib.NumberTheory.MulChar.Basic
{R : Type u_1} [CommMonoid R] {R' : Type u_2} [CommMonoidWithZero R'] (self : MulChar R R') : R β* R' - MulChar.ringHomComp π Mathlib.NumberTheory.MulChar.Basic
{R : Type u_1} [CommMonoid R] {R' : Type u_2} [CommRing R'] {R'' : Type u_3} [CommRing R''] (Ο : MulChar R R') (f : R' β+* R'') : MulChar R R'' - MulChar.domRestrict π Mathlib.NumberTheory.MulChar.Basic
{R : Type u_1} [CommMonoid R] {R' : Type u_2} [CommMonoidWithZero R'] {S : Type u_3} [SetLike S R] [SubmonoidClass S R] (T : S) (Ο : MulChar R R') : MulChar (β₯T) R' - MulChar.restrict π Mathlib.NumberTheory.MulChar.Basic
{R : Type u_1} [CommMonoid R] {R' : Type u_2} [CommMonoidWithZero R'] {S : Type u_3} [SetLike S R] [SubmonoidClass S R] (T : S) (Ο : MulChar R R') : MulChar (β₯T) R' - MulChar.ofUnitHom π Mathlib.NumberTheory.MulChar.Basic
{R : Type u_1} [CommMonoid R] {R' : Type u_2} [CommMonoidWithZero R'] (f : RΛ£ β* R'Λ£) : MulChar R R' - MulChar.toUnitHom π Mathlib.NumberTheory.MulChar.Basic
{R : Type u_1} [CommMonoid R] {R' : Type u_2} [CommMonoidWithZero R'] (Ο : MulChar R R') : RΛ£ β* R'Λ£ - MulChar.equivToUnitHom π Mathlib.NumberTheory.MulChar.Basic
{R : Type u_1} [CommMonoid R] {R' : Type u_2} [CommMonoidWithZero R'] : MulChar R R' β (RΛ£ β* R'Λ£) - MulChar.map_nonunit π Mathlib.NumberTheory.MulChar.Basic
{R : Type u_1} [CommMonoid R] {R' : Type u_2} [CommMonoidWithZero R'] (Ο : MulChar R R') {a : R} (ha : Β¬IsUnit a) : Ο a = 0 - MulChar.IsQuadratic.inv π Mathlib.NumberTheory.MulChar.Basic
{R : Type u_1} [CommMonoid R] {R' : Type u_2} [CommRing R'] {Ο : MulChar R R'} (hΟ : Ο.IsQuadratic) : Οβ»ΒΉ = Ο - MulChar.apply_ne_zero_iff π Mathlib.NumberTheory.MulChar.Basic
{R : Type u_1} [CommMonoid R] {R' : Type u_2} [CommMonoidWithZero R'] [Nontrivial R'] {Ο : MulChar R R'} {a : R} : Ο a β 0 β IsUnit a - MulChar.apply_eq_zero_iff π Mathlib.NumberTheory.MulChar.Basic
{R : Type u_1} [CommMonoid R] {R' : Type u_2} [CommMonoidWithZero R'] [Nontrivial R'] {Ο : MulChar R R'} {a : R} : Ο a = 0 β Β¬IsUnit a - MulChar.orderOf_pos π Mathlib.NumberTheory.MulChar.Basic
{M : Type u_1} [CommMonoid M] {R : Type u_2} [CommMonoidWithZero R] [Finite MΛ£] (Ο : MulChar M R) : 0 < orderOf Ο - MulChar.IsQuadratic.comp π Mathlib.NumberTheory.MulChar.Basic
{R : Type u_1} [CommMonoid R] {R' : Type u_2} [CommRing R'] {R'' : Type u_3} [CommRing R''] {Ο : MulChar R R'} (hΟ : Ο.IsQuadratic) (f : R' β+* R'') : (Ο.ringHomComp f).IsQuadratic - MulChar.map_one π Mathlib.NumberTheory.MulChar.Basic
{R : Type u_1} [CommMonoid R] {R' : Type u_2} [CommMonoidWithZero R'] (Ο : MulChar R R') : Ο 1 = 1 - MulChar.ext' π Mathlib.NumberTheory.MulChar.Basic
{R : Type u_1} [CommMonoid R] {R' : Type u_2} [CommMonoidWithZero R'] {Ο Ο' : MulChar R R'} (h : β (a : R), Ο a = Ο' a) : Ο = Ο' - MulChar.inv_apply_eq_inv π Mathlib.NumberTheory.MulChar.Basic
{R : Type u_1} [CommMonoid R] {R' : Type u_2} [CommMonoidWithZero R'] (Ο : MulChar R R') (a : R) : Οβ»ΒΉ a = Ring.inverse (Ο a) - MulChar.map_zero π Mathlib.NumberTheory.MulChar.Basic
{R' : Type u_2} [CommMonoidWithZero R'] {R : Type u_3} [CommMonoidWithZero R] [Nontrivial R] (Ο : MulChar R R') : Ο 0 = 0 - MulChar.mul_one π Mathlib.NumberTheory.MulChar.Basic
{R : Type u_1} [CommMonoid R] {R' : Type u_2} [CommMonoidWithZero R'] (Ο : MulChar R R') : Ο * 1 = Ο - MulChar.one_apply π Mathlib.NumberTheory.MulChar.Basic
{R : Type u_1} [CommMonoid R] {R' : Type u_2} [CommMonoidWithZero R'] {x : R} (hx : IsUnit x) : 1 x = 1 - MulChar.one_mul π Mathlib.NumberTheory.MulChar.Basic
{R : Type u_1} [CommMonoid R] {R' : Type u_2} [CommMonoidWithZero R'] (Ο : MulChar R R') : 1 * Ο = Ο - MulChar.one_apply_coe π Mathlib.NumberTheory.MulChar.Basic
{R : Type u_1} [CommMonoid R] {R' : Type u_2} [CommMonoidWithZero R'] (a : RΛ£) : 1 βa = 1 - MulChar.map_ringChar π Mathlib.NumberTheory.MulChar.Basic
{R' : Type u_2} [CommMonoidWithZero R'] {R : Type u_3} [CommSemiring R] [Nontrivial R] (Ο : MulChar R R') : Ο β(ringChar R) = 0 - MulChar.ext π Mathlib.NumberTheory.MulChar.Basic
{R : Type u_1} [CommMonoid R] {R' : Type u_2} [CommMonoidWithZero R'] {Ο Ο' : MulChar R R'} (h : β (a : RΛ£), Ο βa = Ο' βa) : Ο = Ο' - MulChar.ext_iff π Mathlib.NumberTheory.MulChar.Basic
{R : Type u_1} [CommMonoid R] {R' : Type u_2} [CommMonoidWithZero R'] {Ο Ο' : MulChar R R'} : Ο = Ο' β β (a : RΛ£), Ο βa = Ο' βa - MulChar.inv_mul π Mathlib.NumberTheory.MulChar.Basic
{R : Type u_1} [CommMonoid R] {R' : Type u_2} [CommMonoidWithZero R'] (Ο : MulChar R R') : Οβ»ΒΉ * Ο = 1 - MulChar.inv_apply π Mathlib.NumberTheory.MulChar.Basic
{R' : Type u_2} [CommMonoidWithZero R'] {R : Type u_3} [CommMonoidWithZero R] (Ο : MulChar R R') (a : R) : Οβ»ΒΉ a = Ο (Ring.inverse a) - MulChar.coe_toMonoidHom π Mathlib.NumberTheory.MulChar.Basic
{R : Type u_1} [CommMonoid R] {R' : Type u_2} [CommMonoidWithZero R'] (Ο : MulChar R R') (x : R) : Ο.toMonoidHom x = Ο x - MulChar.eq_one_iff π Mathlib.NumberTheory.MulChar.Basic
{R : Type u_1} [CommMonoid R] {R' : Type u_2} [CommMonoidWithZero R'] {Ο : MulChar R R'} : Ο = 1 β β (a : RΛ£), Ο βa = 1 - MulChar.inv_apply_eq_inv' π Mathlib.NumberTheory.MulChar.Basic
{R : Type u_1} [CommMonoid R] {R' : Type u_3} [CommGroupWithZero R'] (Ο : MulChar R R') (a : R) : Οβ»ΒΉ a = (Ο a)β»ΒΉ - MulChar.map_nonunit' π Mathlib.NumberTheory.MulChar.Basic
{R : Type u_1} [CommMonoid R] {R' : Type u_2} [CommMonoidWithZero R'] (self : MulChar R R') (a : R) : Β¬IsUnit a β (βself.toMonoidHom).toFun a = 0 - MulChar.mulEquivToUnitHom π Mathlib.NumberTheory.MulChar.Basic
{R : Type u_1} [CommMonoid R] {R' : Type u_2} [CommMonoidWithZero R'] : MulChar R R' β* (RΛ£ β* R'Λ£) - MulChar.ne_one_iff π Mathlib.NumberTheory.MulChar.Basic
{R : Type u_1} [CommMonoid R] {R' : Type u_2} [CommMonoidWithZero R'] {Ο : MulChar R R'} : Ο β 1 β β a, Ο βa β 1 - MulChar.trivial_apply π Mathlib.NumberTheory.MulChar.Basic
(R : Type u_1) [CommMonoid R] (R' : Type u_2) [CommMonoidWithZero R'] (x : R) : (MulChar.trivial R R') x = if IsUnit x then 1 else 0 - MulChar.inv_apply' π Mathlib.NumberTheory.MulChar.Basic
{R' : Type u_2} [CommMonoidWithZero R'] {R : Type u_3} [CommGroupWithZero R] (Ο : MulChar R R') (a : R) : Οβ»ΒΉ a = Ο aβ»ΒΉ - MulChar.mk π Mathlib.NumberTheory.MulChar.Basic
{R : Type u_1} [CommMonoid R] {R' : Type u_2} [CommMonoidWithZero R'] (toMonoidHom : R β* R') (map_nonunit' : β (a : R), Β¬IsUnit a β (βtoMonoidHom).toFun a = 0) : MulChar R R' - MulChar.pow_card_eq_one π Mathlib.NumberTheory.MulChar.Basic
{M : Type u_1} [CommMonoid M] {R : Type u_2} [CommMonoidWithZero R] [Fintype MΛ£] (Ο : MulChar M R) : Ο ^ Fintype.card MΛ£ = 1 - MulChar.sum_one_eq_card_units π Mathlib.NumberTheory.MulChar.Basic
{R : Type u_1} [CommMonoid R] [Fintype R] {R' : Type u_2} [CommRing R'] [DecidableEq R] : β a, 1 a = β(Fintype.card RΛ£) - MulChar.ringHomComp_one π Mathlib.NumberTheory.MulChar.Basic
{R : Type u_1} [CommMonoid R] {R' : Type u_2} [CommRing R'] {R'' : Type u_3} [CommRing R''] (f : R' β+* R'') : MulChar.ringHomComp 1 f = 1 - MulChar.injective_ringHomComp π Mathlib.NumberTheory.MulChar.Basic
{R : Type u_1} [CommMonoid R] {R' : Type u_2} [CommRing R'] {R'' : Type u_3} [CommRing R''] {f : R' β+* R''} (hf : Function.Injective βf) : Function.Injective fun x => x.ringHomComp f - MulChar.mul_apply π Mathlib.NumberTheory.MulChar.Basic
{R : Type u_1} [CommMonoid R] {R' : Type u_2} [CommMonoidWithZero R'] (Ο Ο' : MulChar R R') (a : R) : (Ο * Ο') a = Ο a * Ο' a - MulChar.toMonoidWithZeroHom_apply π Mathlib.NumberTheory.MulChar.Basic
{R' : Type u_2} [CommMonoidWithZero R'] {R : Type u_3} [CommMonoidWithZero R] [Nontrivial R] (Ο : MulChar R R') (aβ : R) : βΟ aβ = (βΟ.toMonoidHom).toFun aβ - MulChar.coeToFun_mul π Mathlib.NumberTheory.MulChar.Basic
{R : Type u_1} [CommMonoid R] {R' : Type u_2} [CommMonoidWithZero R'] (Ο Ο' : MulChar R R') : β(Ο * Ο') = βΟ * βΟ' - MulChar.ringHomComp_inv π Mathlib.NumberTheory.MulChar.Basic
{R' : Type u_2} [CommRing R'] {R'' : Type u_3} [CommRing R''] {R : Type u_4} [CommMonoidWithZero R] (Ο : MulChar R R') (f : R' β+* R'') : (Ο.ringHomComp f)β»ΒΉ = Οβ»ΒΉ.ringHomComp f - MulChar.sum_eq_zero_of_ne_one π Mathlib.NumberTheory.MulChar.Basic
{R : Type u_1} [CommMonoid R] [Fintype R] {R' : Type u_2} [CommRing R'] [IsDomain R'] {Ο : MulChar R R'} (hΟ : Ο β 1) : β a, Ο a = 0 - MulChar.pow_apply' π Mathlib.NumberTheory.MulChar.Basic
{R : Type u_1} [CommMonoid R] {R' : Type u_2} [CommMonoidWithZero R'] (Ο : MulChar R R') {n : β} (hn : n β 0) (a : R) : (Ο ^ n) a = Ο a ^ n - MulChar.IsQuadratic.pow_odd π Mathlib.NumberTheory.MulChar.Basic
{R : Type u_1} [CommMonoid R] {R' : Type u_2} [CommRing R'] {Ο : MulChar R R'} (hΟ : Ο.IsQuadratic) {n : β} (hn : Odd n) : Ο ^ n = Ο - MulChar.pow_apply_coe π Mathlib.NumberTheory.MulChar.Basic
{R : Type u_1} [CommMonoid R] {R' : Type u_2} [CommMonoidWithZero R'] (Ο : MulChar R R') (n : β) (a : RΛ£) : (Ο ^ n) βa = Ο βa ^ n - MulChar.ringHomComp_apply π Mathlib.NumberTheory.MulChar.Basic
{R : Type u_1} [CommMonoid R] {R' : Type u_2} [CommRing R'] {R'' : Type u_3} [CommRing R''] (Ο : MulChar R R') (f : R' β+* R'') (a : R) : (Ο.ringHomComp f) a = f (Ο a) - MulChar.IsQuadratic.pow_char π Mathlib.NumberTheory.MulChar.Basic
{R : Type u_1} [CommMonoid R] {R' : Type u_2} [CommRing R'] {Ο : MulChar R R'} (hΟ : Ο.IsQuadratic) (p : β) [hp : Fact (Nat.Prime p)] [CharP R' p] : Ο ^ p = Ο - MulChar.coe_toUnitHom π Mathlib.NumberTheory.MulChar.Basic
{R : Type u_1} [CommMonoid R] {R' : Type u_2} [CommMonoidWithZero R'] (Ο : MulChar R R') (a : RΛ£) : β(Ο.toUnitHom a) = Ο βa - MulChar.IsQuadratic.sq_eq_one π Mathlib.NumberTheory.MulChar.Basic
{R : Type u_1} [CommMonoid R] {R' : Type u_2} [CommRing R'] {Ο : MulChar R R'} (hΟ : Ο.IsQuadratic) : Ο ^ 2 = 1 - MulChar.IsQuadratic.pow_even π Mathlib.NumberTheory.MulChar.Basic
{R : Type u_1} [CommMonoid R] {R' : Type u_2} [CommRing R'] {Ο : MulChar R R'} (hΟ : Ο.IsQuadratic) {n : β} (hn : Even n) : Ο ^ n = 1 - MulChar.coe_mk π Mathlib.NumberTheory.MulChar.Basic
{R : Type u_1} [CommMonoid R] {R' : Type u_2} [CommMonoidWithZero R'] (f : R β* R') (hf : β (a : R), Β¬IsUnit a β (βf).toFun a = 0) : β{ toMonoidHom := f, map_nonunit' := hf } = βf - MulChar.ringHomCompHom π Mathlib.NumberTheory.MulChar.Basic
{R : Type u_1} [CommMonoid R] {R' : Type u_2} [CommRing R'] {R'' : Type u_3} [CommRing R''] (f : R' β+* R'') : MulChar R R' β* MulChar R R'' - MulChar.ringHomComp_eq_one_iff π Mathlib.NumberTheory.MulChar.Basic
{R : Type u_1} [CommMonoid R] {R' : Type u_2} [CommRing R'] {R'' : Type u_3} [CommRing R''] {f : R' β+* R''} (hf : Function.Injective βf) {Ο : MulChar R R'} : Ο.ringHomComp f = 1 β Ο = 1 - MulChar.ringHomComp_ne_one_iff π Mathlib.NumberTheory.MulChar.Basic
{R : Type u_1} [CommMonoid R] {R' : Type u_2} [CommRing R'] {R'' : Type u_3} [CommRing R''] {f : R' β+* R''} (hf : Function.Injective βf) {Ο : MulChar R R'} : Ο.ringHomComp f β 1 β Ο β 1 - MulChar.IsQuadratic.eq_of_eq_coe π Mathlib.NumberTheory.MulChar.Basic
{R : Type u_1} [CommMonoid R] {R' : Type u_2} [CommRing R'] {R'' : Type u_3} [CommRing R''] {Ο : MulChar R β€} (hΟ : Ο.IsQuadratic) {Ο' : MulChar R' β€} (hΟ' : Ο'.IsQuadratic) [Nontrivial R''] (hR'' : ringChar R'' β 2) {a : R} {a' : R'} (h : β(Ο a) = β(Ο' a')) : Ο a = Ο' a' - MulChar.ringHomComp_mul π Mathlib.NumberTheory.MulChar.Basic
{R : Type u_1} [CommMonoid R] {R' : Type u_2} [CommRing R'] {R'' : Type u_3} [CommRing R''] (Ο Ο : MulChar R R') (f : R' β+* R'') : (Ο * Ο).ringHomComp f = Ο.ringHomComp f * Ο.ringHomComp f - MulChar.isQuadratic_iff_sq_eq_one π Mathlib.NumberTheory.MulChar.Basic
{M : Type u_4} {R : Type u_5} [CommMonoid M] [CommRing R] [NoZeroDivisors R] [Nontrivial R] {Ο : MulChar M R} : Ο.IsQuadratic β Ο ^ 2 = 1 - MulChar.ofUnitHom_coe π Mathlib.NumberTheory.MulChar.Basic
{R : Type u_1} [CommMonoid R] {R' : Type u_2} [CommMonoidWithZero R'] (f : RΛ£ β* R'Λ£) (a : RΛ£) : (MulChar.ofUnitHom f) βa = β(f a) - MulChar.val_neg_one_eq_one_of_odd_order π Mathlib.NumberTheory.MulChar.Basic
{R : Type u_1} {R' : Type u_2} [CommRing R] [CommMonoidWithZero R'] {Ο : MulChar R R'} {n : β} (hn : Odd n) (hΟ : Ο ^ n = 1) : Ο (-1) = 1 - MulChar.domRestrict_eq_one_iff π Mathlib.NumberTheory.MulChar.Basic
{R : Type u_1} [CommMonoid R] {R' : Type u_2} [CommMonoidWithZero R'] {S : Type u_3} [SetLike S R] [SubmonoidClass S R] {T : S} {Ο : MulChar R R'} : MulChar.domRestrict T Ο = 1 β β (x : (β₯T)Λ£), Ο ββx = 1 - MulChar.restrict_eq_one_iff π Mathlib.NumberTheory.MulChar.Basic
{R : Type u_1} [CommMonoid R] {R' : Type u_2} [CommMonoidWithZero R'] {S : Type u_3} [SetLike S R] [SubmonoidClass S R] {T : S} {Ο : MulChar R R'} : MulChar.domRestrict T Ο = 1 β β (x : (β₯T)Λ£), Ο ββx = 1 - MulChar.domRestrictHom π Mathlib.NumberTheory.MulChar.Basic
{R : Type u_1} [CommMonoid R] {S : Type u_3} [SetLike S R] [SubmonoidClass S R] (T : S) (R'' : Type u_4) [CommMonoidWithZero R''] : MulChar R R'' β* MulChar (β₯T) R'' - MulChar.restrictHom π Mathlib.NumberTheory.MulChar.Basic
{R : Type u_1} [CommMonoid R] {S : Type u_3} [SetLike S R] [SubmonoidClass S R] (T : S) (R'' : Type u_4) [CommMonoidWithZero R''] : MulChar R R'' β* MulChar (β₯T) R'' - MulChar.ringHomComp_zpow π Mathlib.NumberTheory.MulChar.Basic
{R : Type u_1} [CommMonoid R] {R' : Type u_2} [CommRing R'] {R'' : Type u_3} [CommRing R''] (Ο : MulChar R R') (f : R' β+* R'') (n : β€) : Ο.ringHomComp f ^ n = (Ο ^ n).ringHomComp f - MulChar.ringHomComp_pow π Mathlib.NumberTheory.MulChar.Basic
{R : Type u_1} [CommMonoid R] {R' : Type u_2} [CommRing R'] {R'' : Type u_3} [CommRing R''] (Ο : MulChar R R') (f : R' β+* R'') (n : β) : Ο.ringHomComp f ^ n = (Ο ^ n).ringHomComp f - MulChar.zpow_apply_coe π Mathlib.NumberTheory.MulChar.Basic
{R : Type u_4} [CommGroupWithZero R] {R' : Type u_5} [CommRing R'] (Ο : MulChar R R') (n : β€) (a : RΛ£) : (Ο ^ n) βa = Ο β(a ^ n) - MulChar.toUnitHom_eq π Mathlib.NumberTheory.MulChar.Basic
{R : Type u_1} [CommMonoid R] {R' : Type u_2} [CommMonoidWithZero R'] (Ο : MulChar R R') : Ο.toUnitHom = MulChar.equivToUnitHom Ο - MulChar.domRestrict_apply π Mathlib.NumberTheory.MulChar.Basic
{R : Type u_1} [CommMonoid R] {R' : Type u_2} [CommMonoidWithZero R'] {S : Type u_3} [SetLike S R] [SubmonoidClass S R] (T : S) (Ο : MulChar R R') (x : β₯T) : (MulChar.domRestrict T Ο) x = if IsUnit x then Ο βx else 0 - MulChar.restrict_apply π Mathlib.NumberTheory.MulChar.Basic
{R : Type u_1} [CommMonoid R] {R' : Type u_2} [CommMonoidWithZero R'] {S : Type u_3} [SetLike S R] [SubmonoidClass S R] (T : S) (Ο : MulChar R R') (x : β₯T) : (MulChar.domRestrict T Ο) x = if IsUnit x then Ο βx else 0 - MulChar.ringHomCompHom_apply π Mathlib.NumberTheory.MulChar.Basic
{R : Type u_1} [CommMonoid R] {R' : Type u_2} [CommRing R'] {R'' : Type u_3} [CommRing R''] (f : R' β+* R'') (Ο : MulChar R R') : (MulChar.ringHomCompHom f) Ο = Ο.ringHomComp f - MulChar.ofUnitHom_eq π Mathlib.NumberTheory.MulChar.Basic
{R : Type u_1} [CommMonoid R] {R' : Type u_2} [CommMonoidWithZero R'] (Ο : RΛ£ β* R'Λ£) : MulChar.ofUnitHom Ο = MulChar.equivToUnitHom.symm Ο - MulChar.coe_equivToUnitHom π Mathlib.NumberTheory.MulChar.Basic
{R : Type u_1} [CommMonoid R] {R' : Type u_2} [CommMonoidWithZero R'] (Ο : MulChar R R') (a : RΛ£) : β((MulChar.equivToUnitHom Ο) a) = Ο βa - MulChar.equivToUnitHom_symm_coe π Mathlib.NumberTheory.MulChar.Basic
{R : Type u_1} [CommMonoid R] {R' : Type u_2} [CommMonoidWithZero R'] (f : RΛ£ β* R'Λ£) (a : RΛ£) : (MulChar.equivToUnitHom.symm f) βa = β(f a) - MulChar.domRestrictHom_apply π Mathlib.NumberTheory.MulChar.Basic
{R : Type u_1} [CommMonoid R] {S : Type u_3} [SetLike S R] [SubmonoidClass S R] (T : S) (R'' : Type u_4) [CommMonoidWithZero R''] (Ο : MulChar R R'') : (MulChar.domRestrictHom T R'') Ο = MulChar.domRestrict T Ο - MulChar.restrictHom_apply π Mathlib.NumberTheory.MulChar.Basic
{R : Type u_1} [CommMonoid R] {S : Type u_3} [SetLike S R] [SubmonoidClass S R] (T : S) (R'' : Type u_4) [CommMonoidWithZero R''] (Ο : MulChar R R'') : (MulChar.domRestrictHom T R'') Ο = MulChar.domRestrict T Ο - MulChar.mulEquivToUnitHom_apply π Mathlib.NumberTheory.MulChar.Basic
{R : Type u_1} [CommMonoid R] {R' : Type u_2} [CommMonoidWithZero R'] (Ο : MulChar R R') : MulChar.mulEquivToUnitHom Ο = MulChar.equivToUnitHom Ο - MulChar.mulEquivToUnitHom_symm_apply π Mathlib.NumberTheory.MulChar.Basic
{R : Type u_1} [CommMonoid R] {R' : Type u_2} [CommMonoidWithZero R'] (f : RΛ£ β* R'Λ£) : MulChar.mulEquivToUnitHom.symm f = MulChar.equivToUnitHom.symm f - MulChar.equivToUnitHom_mul_apply π Mathlib.NumberTheory.MulChar.Basic
{R : Type u_1} [CommMonoid R] {R' : Type u_2} [CommMonoidWithZero R'] (Οβ Οβ : MulChar R R') (a : RΛ£) : (MulChar.equivToUnitHom (Οβ * Οβ)) a = (MulChar.equivToUnitHom Οβ) a * (MulChar.equivToUnitHom Οβ) a - ZMod.Οβ π Mathlib.NumberTheory.LegendreSymbol.ZModChar
: MulChar (ZMod 4) β€ - ZMod.Οβ π Mathlib.NumberTheory.LegendreSymbol.ZModChar
: MulChar (ZMod 8) β€ - ZMod.Οβ' π Mathlib.NumberTheory.LegendreSymbol.ZModChar
: MulChar (ZMod 8) β€ - ZMod.Οβ_apply π Mathlib.NumberTheory.LegendreSymbol.ZModChar
(a : ZMod 4) : ZMod.Οβ a = match a with | 0 => 0 | 2 => 0 | 1 => 1 | 3 => -1 - ZMod.Οβ_int_one_mod_four π Mathlib.NumberTheory.LegendreSymbol.ZModChar
{n : β€} (hn : n % 4 = 1) : ZMod.Οβ βn = 1 - ZMod.Οβ_int_three_mod_four π Mathlib.NumberTheory.LegendreSymbol.ZModChar
{n : β€} (hn : n % 4 = 3) : ZMod.Οβ βn = -1 - ZMod.Οβ_nat_one_mod_four π Mathlib.NumberTheory.LegendreSymbol.ZModChar
{n : β} (hn : n % 4 = 1) : ZMod.Οβ βn = 1 - ZMod.Οβ'_apply π Mathlib.NumberTheory.LegendreSymbol.ZModChar
(a : ZMod 8) : ZMod.Οβ' a = match a with | 0 => 0 | 2 => 0 | 4 => 0 | 6 => 0 | 1 => 1 | 3 => 1 | 5 => -1 | 7 => -1 - ZMod.Οβ_apply π Mathlib.NumberTheory.LegendreSymbol.ZModChar
(a : ZMod 8) : ZMod.Οβ a = match a with | 0 => 0 | 2 => 0 | 4 => 0 | 6 => 0 | 1 => 1 | 7 => 1 | 3 => -1 | 5 => -1 - ZMod.Οβ_nat_three_mod_four π Mathlib.NumberTheory.LegendreSymbol.ZModChar
{n : β} (hn : n % 4 = 3) : ZMod.Οβ βn = -1 - ZMod.Οβ_eq_neg_one_pow π Mathlib.NumberTheory.LegendreSymbol.ZModChar
{n : β} (hn : n % 2 = 1) : ZMod.Οβ βn = (-1) ^ (n / 2) - ZMod.Οβ_int_eq_if_mod_four π Mathlib.NumberTheory.LegendreSymbol.ZModChar
(n : β€) : ZMod.Οβ βn = if n % 2 = 0 then 0 else if n % 4 = 1 then 1 else -1 - ZMod.Οβ_nat_eq_if_mod_four π Mathlib.NumberTheory.LegendreSymbol.ZModChar
(n : β) : ZMod.Οβ βn = if n % 2 = 0 then 0 else if n % 4 = 1 then 1 else -1 - ZMod.Οβ_int_mod_four π Mathlib.NumberTheory.LegendreSymbol.ZModChar
(n : β€) : ZMod.Οβ βn = ZMod.Οβ β(n % 4) - ZMod.Οβ_int_mod_eight π Mathlib.NumberTheory.LegendreSymbol.ZModChar
(n : β€) : ZMod.Οβ βn = ZMod.Οβ β(n % 8) - ZMod.Οβ_nat_mod_four π Mathlib.NumberTheory.LegendreSymbol.ZModChar
(n : β) : ZMod.Οβ βn = ZMod.Οβ β(n % 4) - ZMod.Οβ_nat_mod_eight π Mathlib.NumberTheory.LegendreSymbol.ZModChar
(n : β) : ZMod.Οβ βn = ZMod.Οβ β(n % 8) - ZMod.Οβ'_eq_Οβ_mul_Οβ π Mathlib.NumberTheory.LegendreSymbol.ZModChar
(a : ZMod 8) : ZMod.Οβ' a = ZMod.Οβ a.cast * ZMod.Οβ a - ZMod.Οβ'_int_eq_if_mod_eight π Mathlib.NumberTheory.LegendreSymbol.ZModChar
(n : β€) : ZMod.Οβ' βn = if n % 2 = 0 then 0 else if n % 8 = 1 β¨ n % 8 = 3 then 1 else -1 - ZMod.Οβ_int_eq_if_mod_eight π Mathlib.NumberTheory.LegendreSymbol.ZModChar
(n : β€) : ZMod.Οβ βn = if n % 2 = 0 then 0 else if n % 8 = 1 β¨ n % 8 = 7 then 1 else -1 - ZMod.Οβ'_nat_eq_if_mod_eight π Mathlib.NumberTheory.LegendreSymbol.ZModChar
(n : β) : ZMod.Οβ' βn = if n % 2 = 0 then 0 else if n % 8 = 1 β¨ n % 8 = 3 then 1 else -1 - ZMod.Οβ_nat_eq_if_mod_eight π Mathlib.NumberTheory.LegendreSymbol.ZModChar
(n : β) : ZMod.Οβ βn = if n % 2 = 0 then 0 else if n % 8 = 1 β¨ n % 8 = 7 then 1 else -1 - ZMod.Οβ'_int_eq_Οβ_mul_Οβ π Mathlib.NumberTheory.LegendreSymbol.ZModChar
(a : β€) : ZMod.Οβ' βa = ZMod.Οβ βa * ZMod.Οβ βa - MulChar.starComp π Mathlib.NumberTheory.MulChar.Lemmas
{R : Type u_1} {R' : Type u_2} [CommRing R] [CommRing R'] [StarRing R'] (Ο : MulChar R R') : MulChar R R' - MulChar.instStarMul π Mathlib.NumberTheory.MulChar.Lemmas
{R : Type u_1} {R' : Type u_2} [CommRing R] [CommRing R'] [StarRing R'] : StarMul (MulChar R R') - MulChar.orderOf_dvd_card_sub_one π Mathlib.NumberTheory.MulChar.Lemmas
(F : Type u_1) [Field F] [Fintype F] {R : Type u_2} [CommRing R] (Ο : MulChar F R) : orderOf Ο β£ Fintype.card F - 1 - MulChar.star_eq_inv π Mathlib.NumberTheory.MulChar.Lemmas
{R : Type u_1} [CommRing R] [Finite RΛ£] (Ο : MulChar R β) : star Ο = Οβ»ΒΉ - MulChar.exists_mulChar_orderOf π Mathlib.NumberTheory.MulChar.Lemmas
(F : Type u_1) [Field F] [Fintype F] {R : Type u_2} [CommRing R] {n : β} (h : n β£ Fintype.card F - 1) {ΞΆ : R} (hΞΆ : IsPrimitiveRoot ΞΆ n) : β Ο, orderOf Ο = n - MulChar.eq_iff π Mathlib.NumberTheory.MulChar.Lemmas
{R : Type u_1} [CommMonoid R] {R' : Type u_3} [CommMonoidWithZero R'] {g : RΛ£} (hg : β (x : RΛ£), x β Subgroup.zpowers g) (Οβ Οβ : MulChar R R') : Οβ = Οβ β Οβ βg = Οβ βg - MulChar.starComp_apply π Mathlib.NumberTheory.MulChar.Lemmas
{R : Type u_1} {R' : Type u_2} [CommRing R] [CommRing R'] [StarRing R'] (Ο : MulChar R R') (a : R) : Ο.starComp a = (starRingEnd R') (Ο a) - MulChar.star_apply' π Mathlib.NumberTheory.MulChar.Lemmas
{R : Type u_1} [CommRing R] [Finite RΛ£] (Ο : MulChar R β) (a : R) : star (Ο a) = Οβ»ΒΉ a - MulChar.exists_mulChar_orderOf_eq_card_units π Mathlib.NumberTheory.MulChar.Lemmas
(F : Type u_1) [Field F] [Fintype F] {R : Type u_2} [CommRing R] [DecidableEq F] {ΞΆ : R} (hΞΆ : IsPrimitiveRoot ΞΆ (Fintype.card FΛ£)) : β Ο, orderOf Ο = Fintype.card FΛ£ - MulChar.ofRootOfUnity π Mathlib.NumberTheory.MulChar.Lemmas
{M : Type u_1} [CommMonoid M] [Fintype M] [DecidableEq M] {R : Type u_2} [CommMonoidWithZero R] {ΞΆ : RΛ£} (hΞΆ : ΞΆ β rootsOfUnity (Fintype.card MΛ£) R) {g : MΛ£} (hg : β (x : MΛ£), x β Subgroup.zpowers g) : MulChar M R - MulChar.star_apply π Mathlib.NumberTheory.MulChar.Lemmas
{R : Type u_1} {R' : Type u_2} [CommRing R] [CommRing R'] [StarRing R'] (Ο : MulChar R R') (a : R) : (star Ο) a = star (Ο a) - MulChar.equiv_rootsOfUnity π Mathlib.NumberTheory.MulChar.Lemmas
(M : Type u_1) [CommMonoid M] [Fintype M] [DecidableEq M] (R : Type u_2) [CommMonoidWithZero R] [inst_cyc : IsCyclic MΛ£] : MulChar M R β* β₯(rootsOfUnity (Fintype.card MΛ£) R) - MulChar.apply_mem_algebraAdjoin π Mathlib.NumberTheory.MulChar.Lemmas
{F : Type u_1} [Field F] [Finite F] {R : Type u_2} [CommRing R] [IsDomain R] {Ο : MulChar F R} {ΞΌ : R} (hΞΌ : IsPrimitiveRoot ΞΌ (orderOf Ο)) (a : F) : Ο a β β€[ΞΌ] - MulChar.ofRootOfUnity_spec π Mathlib.NumberTheory.MulChar.Lemmas
{M : Type u_1} [CommMonoid M] [Fintype M] [DecidableEq M] {R : Type u_2} [CommMonoidWithZero R] {ΞΆ : RΛ£} (hΞΆ : ΞΆ β rootsOfUnity (Fintype.card MΛ£) R) {g : MΛ£} (hg : β (x : MΛ£), x β Subgroup.zpowers g) : (MulChar.ofRootOfUnity hΞΆ hg) βg = βΞΆ - MulChar.apply_mem_rootsOfUnity_orderOf π Mathlib.NumberTheory.MulChar.Lemmas
{F : Type u_1} [Field F] [Finite F] {R : Type u_2} [CommRing R] (Ο : MulChar F R) {a : F} (ha : a β 0) : β ΞΆ β rootsOfUnity (orderOf Ο) R, βΞΆ = Ο a - MulChar.exists_apply_eq_pow π Mathlib.NumberTheory.MulChar.Lemmas
{F : Type u_1} [Field F] [Finite F] {R : Type u_2} [CommRing R] [IsDomain R] {Ο : MulChar F R} {n : β} [NeZero n] (hΟ : Ο ^ n = 1) {ΞΌ : R} (hΞΌ : IsPrimitiveRoot ΞΌ n) {a : F} (ha : a β 0) : β k < n, Ο a = ΞΌ ^ k - MulChar.apply_mem_algebraAdjoin_of_pow_eq_one π Mathlib.NumberTheory.MulChar.Lemmas
{F : Type u_1} [Field F] [Finite F] {R : Type u_2} [CommRing R] [IsDomain R] {Ο : MulChar F R} {n : β} [NeZero n] (hΟ : Ο ^ n = 1) {ΞΌ : R} (hΞΌ : IsPrimitiveRoot ΞΌ n) (a : F) : Ο a β β€[ΞΌ] - MulChar.apply_mem_rootsOfUnity_of_pow_eq_one π Mathlib.NumberTheory.MulChar.Lemmas
{F : Type u_1} [Field F] [Finite F] {R : Type u_2} [CommRing R] {Ο : MulChar F R} {n : β} (hΟ : Ο ^ n = 1) {a : F} (ha : a β 0) : β ΞΆ β rootsOfUnity n R, βΞΆ = Ο a - MulChar.apply_mem_rootsOfUnity π Mathlib.NumberTheory.MulChar.Lemmas
{R : Type u_1} {R' : Type u_2} [CommRing R] [CommRing R'] [Fintype RΛ£] (a : RΛ£) {Ο : MulChar R R'} : (MulChar.equivToUnitHom Ο) a β rootsOfUnity (Fintype.card RΛ£) R' - MulChar.domRestrict_ofUnitHom π Mathlib.NumberTheory.MulChar.Lemmas
{R : Type u_1} [CommMonoid R] {R' : Type u_3} [CommMonoidWithZero R'] (f : RΛ£ β* R'Λ£) (S : Submonoid R) : MulChar.domRestrict S (MulChar.ofUnitHom f) = MulChar.ofUnitHom ((f.domRestrict S.units).comp βS.unitsEquivUnitsType.symm) - MulChar.restrict_ofUnitHom π Mathlib.NumberTheory.MulChar.Lemmas
{R : Type u_1} [CommMonoid R] {R' : Type u_3} [CommMonoidWithZero R'] (f : RΛ£ β* R'Λ£) (S : Submonoid R) : MulChar.domRestrict S (MulChar.ofUnitHom f) = MulChar.ofUnitHom ((f.domRestrict S.units).comp βS.unitsEquivUnitsType.symm) - gaussSum π Mathlib.NumberTheory.GaussSum
{R : Type u} [CommRing R] [Fintype R] {R' : Type v} [CommRing R'] (Ο : MulChar R R') (Ο : AddChar R R') : R' - gaussSum_one_one π Mathlib.NumberTheory.GaussSum
{R : Type u_1} {R' : Type u_2} [CommRing R] [Fintype R] [CommRing R'] : gaussSum 1 1 = β(Nat.card RΛ£) - gaussSum_mulShift π Mathlib.NumberTheory.GaussSum
{R : Type u} [CommRing R] [Fintype R] {R' : Type v} [CommRing R'] (Ο : MulChar R R') (Ο : AddChar R R') (a : RΛ£) : Ο βa * gaussSum Ο (Ο.mulShift βa) = gaussSum Ο Ο - gaussSum_one_right π Mathlib.NumberTheory.GaussSum
{R : Type u_1} {R' : Type u_2} [CommRing R] [Fintype R] [CommRing R'] [IsDomain R'] {Ο : MulChar R R'} (hΟ : Ο β 1) : gaussSum Ο 1 = 0 - gaussSum_mulShift_eq π Mathlib.NumberTheory.GaussSum
{R : Type u} [CommRing R] [Fintype R] {R' : Type v} [CommRing R'] (Ο : MulChar R R') (Ο : AddChar R R') (a : RΛ£) : gaussSum Ο (Ο.mulShift βa) = Οβ»ΒΉ βa * gaussSum Ο Ο - gaussSum_ne_zero_of_nontrivial π Mathlib.NumberTheory.GaussSum
{R : Type u} [Field R] [Fintype R] {R' : Type v} [CommRing R'] [IsDomain R'] (h : β(Fintype.card R) β 0) {Ο : MulChar R R'} (hΟ : Ο β 1) {Ο : AddChar R R'} (hΟ : Ο.IsPrimitive) : gaussSum Ο Ο β 0 - MulChar.IsQuadratic.gaussSum_frob π Mathlib.NumberTheory.GaussSum
{R : Type u} [CommRing R] [Fintype R] {R' : Type v} [CommRing R'] (p : β) [fp : Fact (Nat.Prime p)] [hch : CharP R' p] (hp : IsUnit βp) {Ο : MulChar R R'} (hΟ : Ο.IsQuadratic) (Ο : AddChar R R') : gaussSum Ο Ο ^ p = Ο βp * gaussSum Ο Ο - MulChar.IsQuadratic.gaussSum_frob_iter π Mathlib.NumberTheory.GaussSum
{R : Type u} [CommRing R] [Fintype R] {R' : Type v} [CommRing R'] (p : β) [fp : Fact (Nat.Prime p)] [hch : CharP R' p] (n : β) (hp : IsUnit βp) {Ο : MulChar R R'} (hΟ : Ο.IsQuadratic) (Ο : AddChar R R') : gaussSum Ο Ο ^ p ^ n = Ο (βp ^ n) * gaussSum Ο Ο - FiniteField.two_pow_card π Mathlib.NumberTheory.GaussSum
{F : Type u_1} [Fintype F] [Field F] (hF : ringChar F β 2) : 2 ^ (Fintype.card F / 2) = β(ZMod.Οβ β(Fintype.card F)) - gaussSum_one_left π Mathlib.NumberTheory.GaussSum
{R : Type u_1} {R' : Type u_2} [Field R] [Fintype R] [CommRing R'] [IsDomain R'] {Ο : AddChar R R'} (hΟ : Ο β 1) : gaussSum 1 Ο = -1 - star_gaussSum_eq π Mathlib.NumberTheory.GaussSum
{R : Type u} [CommRing R] [Fintype R] (Ο : MulChar R β) (Ο : AddChar R β) : star (gaussSum Ο Ο) = gaussSum Οβ»ΒΉ Οβ»ΒΉ - gaussSum_sq π Mathlib.NumberTheory.GaussSum
{R : Type u} [Field R] [Fintype R] {R' : Type v} [CommRing R'] [IsDomain R'] {Ο : MulChar R R'} (hΟβ : Ο β 1) (hΟβ : Ο.IsQuadratic) {Ο : AddChar R R'} (hΟ : Ο.IsPrimitive) : gaussSum Ο Ο ^ 2 = Ο (-1) * β(Fintype.card R) - gaussSum_mul π Mathlib.NumberTheory.GaussSum
{R : Type u} [CommRing R] [Fintype R] {R' : Type v} [CommRing R'] (Ο Ο : MulChar R R') (Ο : AddChar R R') : gaussSum Ο Ο * gaussSum Ο Ο = β t, β x, Ο x * Ο (t - x) * Ο t - mul_gaussSum_inv_eq_gaussSum π Mathlib.NumberTheory.GaussSum
{R : Type u} [Field R] [Fintype R] {R' : Type v} [CommRing R'] (Ο : MulChar R R') (Ο : AddChar R R') : Ο (-1) * gaussSum Ο Οβ»ΒΉ = gaussSum Ο Ο - Char.card_pow_card π Mathlib.NumberTheory.GaussSum
{F : Type u_1} [Field F] [Fintype F] {F' : Type u_2} [Field F'] [Fintype F'] {Ο : MulChar F F'} (hΟβ : Ο β 1) (hΟβ : Ο.IsQuadratic) (hchβ : ringChar F' β ringChar F) (hchβ : ringChar F' β 2) : (Ο (-1) * β(Fintype.card F)) ^ (Fintype.card F' / 2) = Ο β(Fintype.card F') - gaussSum_mul_gaussSum_eq_card π Mathlib.NumberTheory.GaussSum
{R : Type u} [Field R] [Fintype R] {R' : Type v} [CommRing R'] [IsDomain R'] {Ο : MulChar R R'} (hΟ : Ο β 1) {Ο : AddChar R R'} (hΟ : Ο.IsPrimitive) : gaussSum Ο Ο * gaussSum Οβ»ΒΉ Οβ»ΒΉ = β(Fintype.card R) - gaussSum_frob π Mathlib.NumberTheory.GaussSum
{R : Type u} [CommRing R] [Fintype R] {R' : Type v} [CommRing R'] (p : β) [fp : Fact (Nat.Prime p)] [hch : CharP R' p] (Ο : MulChar R R') (Ο : AddChar R R') : gaussSum Ο Ο ^ p = gaussSum (Ο ^ p) (Ο ^ p) - Char.card_pow_char_pow π Mathlib.NumberTheory.GaussSum
{R : Type u} [CommRing R] [Fintype R] {R' : Type v} [CommRing R'] [IsDomain R'] {Ο : MulChar R R'} (hΟ : Ο.IsQuadratic) (Ο : AddChar R R') (p n : β) [fp : Fact (Nat.Prime p)] [hch : CharP R' p] (hp : IsUnit βp) (hp' : p β 2) (hg : gaussSum Ο Ο ^ 2 = Ο (-1) * β(Fintype.card R)) : (Ο (-1) * β(Fintype.card R)) ^ (p ^ n / 2) = Ο (βp ^ n) - gaussSum_mul_gaussSum_pow_orderOf_sub_one π Mathlib.NumberTheory.GaussSum
{R : Type u} [Field R] [Fintype R] {R' : Type v} [CommRing R'] [IsDomain R'] {Ο : MulChar R R'} {Ο : AddChar R R'} (hΟ : Ο β 1) (hΟ : Ο.IsPrimitive) : gaussSum Ο Ο * gaussSum (Ο ^ (orderOf Ο - 1)) Ο = Ο (-1) * β(Fintype.card R) - MulChar.finite π Mathlib.NumberTheory.MulChar.Duality
{M : Type u_1} {R : Type u_2} [CommMonoid M] [CommRing R] [Finite MΛ£] [IsDomain R] : Finite (MulChar M R) - MulChar.card_eq_card_units_of_hasEnoughRootsOfUnity π Mathlib.NumberTheory.MulChar.Duality
(M : Type u_1) (R : Type u_2) [CommMonoid M] [CommRing R] [Finite M] [HasEnoughRootsOfUnity R (Monoid.exponent MΛ£)] : Nat.card (MulChar M R) = Nat.card MΛ£ - MulChar.mulEquiv_units π Mathlib.NumberTheory.MulChar.Duality
(M : Type u_1) (R : Type u_2) [CommMonoid M] [CommRing R] [Finite M] [HasEnoughRootsOfUnity R (Monoid.exponent MΛ£)] : Nonempty (MulChar M R β* MΛ£) - MulChar.exists_apply_ne_one_of_hasEnoughRootsOfUnity π Mathlib.NumberTheory.MulChar.Duality
(M : Type u_1) (R : Type u_2) [CommMonoid M] [CommRing R] [Finite M] [HasEnoughRootsOfUnity R (Monoid.exponent MΛ£)] [Nontrivial R] {a : M} (ha : a β 1) : β Ο, Ο a β 1 - MulChar.mulCharEquiv π Mathlib.NumberTheory.MulChar.Duality
(M : Type u_1) (R : Type u_2) [CommMonoid M] [CommRing R] [Finite M] [HasEnoughRootsOfUnity R (Monoid.exponent MΛ£)] : MulChar (MulChar M R) R β* MΛ£ - MulChar.subgroupOrderIsoSubgroupMulChar π Mathlib.NumberTheory.MulChar.Duality
(M : Type u_1) (R : Type u_2) [CommMonoid M] [CommRing R] [Finite M] [HasEnoughRootsOfUnity R (Monoid.exponent MΛ£)] : Subgroup MΛ£ βo (Subgroup (MulChar M R))α΅α΅ - MulChar.exists_apply_ne_one_iff_exists_monoidHom π Mathlib.NumberTheory.MulChar.Duality
{M : Type u_1} {R : Type u_2} [CommMonoid M] [CommRing R] (a : MΛ£) : (β Ο, Ο βa β 1) β β Ο, Ο a β 1 - MulChar.apply_mulCharEquiv π Mathlib.NumberTheory.MulChar.Duality
{M : Type u_1} {R : Type u_2} [CommMonoid M] [CommRing R] [Finite M] [HasEnoughRootsOfUnity R (Monoid.exponent MΛ£)] (Ο : MulChar M R) (Ξ· : MulChar (MulChar M R) R) : Ο β((MulChar.mulCharEquiv M R) Ξ·) = Ξ· Ο - MulChar.mulCharEquiv_symm_apply_apply π Mathlib.NumberTheory.MulChar.Duality
{M : Type u_1} {R : Type u_2} [CommMonoid M] [CommRing R] [Finite M] [HasEnoughRootsOfUnity R (Monoid.exponent MΛ£)] (m : MΛ£) (Ο : MulChar M R) : ((MulChar.mulCharEquiv M R).symm m) Ο = Ο βm - MulChar.card_subgroupOrderIsoSubgroupMulChar π Mathlib.NumberTheory.MulChar.Duality
{M : Type u_1} {R : Type u_2} [CommMonoid M] [CommRing R] [Finite M] [HasEnoughRootsOfUnity R (Monoid.exponent MΛ£)] {H : Subgroup MΛ£} : Nat.card β₯(OrderDual.ofDual ((MulChar.subgroupOrderIsoSubgroupMulChar M R) H)) = Nat.card (MΛ£ β§Έ H) - MulChar.mem_subgroupOrderIsoSubgroupMulChar_iff π Mathlib.NumberTheory.MulChar.Duality
{M : Type u_1} {R : Type u_2} [CommMonoid M] [CommRing R] [Finite M] [HasEnoughRootsOfUnity R (Monoid.exponent MΛ£)] {H : Subgroup MΛ£} {Ο : MulChar M R} : Ο β OrderDual.ofDual ((MulChar.subgroupOrderIsoSubgroupMulChar M R) H) β β m β H, Ο βm = 1 - MulChar.domRestrictHom_surjective π Mathlib.NumberTheory.MulChar.Duality
(M : Type u_1) (R : Type u_2) [CommMonoid M] [CommRing R] [Finite M] [HasEnoughRootsOfUnity R (Monoid.exponent MΛ£)] (N : Submonoid M) : Function.Surjective β(MulChar.domRestrictHom N R) - MulChar.restrictHom_surjective π Mathlib.NumberTheory.MulChar.Duality
(M : Type u_1) (R : Type u_2) [CommMonoid M] [CommRing R] [Finite M] [HasEnoughRootsOfUnity R (Monoid.exponent MΛ£)] (N : Submonoid M) : Function.Surjective β(MulChar.domRestrictHom N R) - MulChar.mem_subgroupOrderIsoSubgroupMulChar_symm_iff π Mathlib.NumberTheory.MulChar.Duality
{M : Type u_1} {R : Type u_2} [CommMonoid M] [CommRing R] [Finite M] [HasEnoughRootsOfUnity R (Monoid.exponent MΛ£)] {X : Subgroup (MulChar M R)} {m : MΛ£} : m β (MulChar.subgroupOrderIsoSubgroupMulChar M R).symm (OrderDual.toDual X) β β Ο β X, Ο βm = 1 - quadraticChar π Mathlib.NumberTheory.LegendreSymbol.QuadraticChar.Basic
(F : Type u_1) [Field F] [Fintype F] [DecidableEq F] : MulChar F β€ - quadraticChar_zero π Mathlib.NumberTheory.LegendreSymbol.QuadraticChar.Basic
{F : Type u_1} [Field F] [Fintype F] [DecidableEq F] : (quadraticChar F) 0 = 0 - quadraticChar_neg_one_iff_not_isSquare π Mathlib.NumberTheory.LegendreSymbol.QuadraticChar.Basic
{F : Type u_1} [Field F] [Fintype F] [DecidableEq F] {a : F} : (quadraticChar F) a = -1 β Β¬IsSquare a - quadraticChar_eq_zero_iff π Mathlib.NumberTheory.LegendreSymbol.QuadraticChar.Basic
{F : Type u_1} [Field F] [Fintype F] [DecidableEq F] {a : F} : (quadraticChar F) a = 0 β a = 0 - quadraticChar_exists_neg_one π Mathlib.NumberTheory.LegendreSymbol.QuadraticChar.Basic
{F : Type u_1} [Field F] [Fintype F] [DecidableEq F] (hF : ringChar F β 2) : β a, (quadraticChar F) a = -1 - quadraticChar_apply π Mathlib.NumberTheory.LegendreSymbol.QuadraticChar.Basic
(F : Type u_1) [Field F] [Fintype F] [DecidableEq F] (a : F) : (quadraticChar F) a = quadraticCharFun F a - quadraticChar_sum_zero π Mathlib.NumberTheory.LegendreSymbol.QuadraticChar.Basic
{F : Type u_1} [Field F] [Fintype F] [DecidableEq F] (hF : ringChar F β 2) : β a, (quadraticChar F) a = 0 - quadraticChar_ne_one π Mathlib.NumberTheory.LegendreSymbol.QuadraticChar.Basic
{F : Type u_1} [Field F] [Fintype F] [DecidableEq F] (hF : ringChar F β 2) : quadraticChar F β 1 - quadraticChar_one_iff_isSquare π Mathlib.NumberTheory.LegendreSymbol.QuadraticChar.Basic
{F : Type u_1} [Field F] [Fintype F] [DecidableEq F] {a : F} (ha : a β 0) : (quadraticChar F) a = 1 β IsSquare a - quadraticChar_sq_one π Mathlib.NumberTheory.LegendreSymbol.QuadraticChar.Basic
{F : Type u_1} [Field F] [Fintype F] [DecidableEq F] {a : F} (ha : a β 0) : (quadraticChar F) a ^ 2 = 1 - quadraticChar_eq_one_of_char_two π Mathlib.NumberTheory.LegendreSymbol.QuadraticChar.Basic
{F : Type u_1} [Field F] [Fintype F] [DecidableEq F] (hF : ringChar F = 2) {a : F} (ha : a β 0) : (quadraticChar F) a = 1 - quadraticChar_sq_one' π Mathlib.NumberTheory.LegendreSymbol.QuadraticChar.Basic
{F : Type u_1} [Field F] [Fintype F] [DecidableEq F] {a : F} (ha : a β 0) : (quadraticChar F) (a ^ 2) = 1 - quadraticChar_exists_neg_one' π Mathlib.NumberTheory.LegendreSymbol.QuadraticChar.Basic
{F : Type u_1} [Field F] [Fintype F] [DecidableEq F] (hF : ringChar F β 2) : β a, (quadraticChar F) βa = -1 - quadraticChar_eq_pow_of_char_ne_two' π Mathlib.NumberTheory.LegendreSymbol.QuadraticChar.Basic
{F : Type u_1} [Field F] [Fintype F] [DecidableEq F] (hF : ringChar F β 2) (a : F) : β((quadraticChar F) a) = a ^ (Fintype.card F / 2) - quadraticChar_dichotomy π Mathlib.NumberTheory.LegendreSymbol.QuadraticChar.Basic
{F : Type u_1} [Field F] [Fintype F] [DecidableEq F] {a : F} (ha : a β 0) : (quadraticChar F) a = 1 β¨ (quadraticChar F) a = -1 - quadraticChar_eq_neg_one_iff_not_one π Mathlib.NumberTheory.LegendreSymbol.QuadraticChar.Basic
{F : Type u_1} [Field F] [Fintype F] [DecidableEq F] {a : F} (ha : a β 0) : (quadraticChar F) a = -1 β Β¬(quadraticChar F) a = 1 - quadraticChar_neg_one π Mathlib.NumberTheory.LegendreSymbol.QuadraticChar.Basic
{F : Type u_1} [Field F] [Fintype F] [DecidableEq F] (hF : ringChar F β 2) : (quadraticChar F) (-1) = ZMod.Οβ β(Fintype.card F) - quadraticChar_eq_pow_of_char_ne_two π Mathlib.NumberTheory.LegendreSymbol.QuadraticChar.Basic
{F : Type u_1} [Field F] [Fintype F] [DecidableEq F] (hF : ringChar F β 2) {a : F} (ha : a β 0) : (quadraticChar F) a = if a ^ (Fintype.card F / 2) = 1 then 1 else -1 - quadraticChar_card_sqrts π Mathlib.NumberTheory.LegendreSymbol.QuadraticChar.Basic
{F : Type u_1} [Field F] [Fintype F] [DecidableEq F] (hF : ringChar F β 2) (a : F) : β{x | x ^ 2 = a}.toFinset.card = (quadraticChar F) a + 1 - legendreSym.at_neg_one π Mathlib.NumberTheory.LegendreSymbol.Basic
{p : β} [Fact (Nat.Prime p)] (hp : p β 2) : legendreSym p (-1) = ZMod.Οβ βp - legendreSym.at_neg π Mathlib.NumberTheory.LegendreSymbol.Basic
{p : β} [Fact (Nat.Prime p)] (hp : p β 2) (a : β€) : legendreSym p (-a) = ZMod.Οβ βp * legendreSym p a - quadraticChar_two π Mathlib.NumberTheory.LegendreSymbol.QuadraticChar.GaussSum
{F : Type u_1} [Field F] [Fintype F] [DecidableEq F] (hF : ringChar F β 2) : (quadraticChar F) 2 = ZMod.Οβ β(Fintype.card F) - quadraticChar_neg_two π Mathlib.NumberTheory.LegendreSymbol.QuadraticChar.GaussSum
{F : Type u_1} [Field F] [Fintype F] [DecidableEq F] (hF : ringChar F β 2) : (quadraticChar F) (-2) = ZMod.Οβ' β(Fintype.card F) - quadraticChar_card_card π Mathlib.NumberTheory.LegendreSymbol.QuadraticChar.GaussSum
{F : Type u_1} [Field F] [Fintype F] [DecidableEq F] (hF : ringChar F β 2) {F' : Type u_2} [Field F'] [Fintype F'] [DecidableEq F'] (hF' : ringChar F' β 2) (h : ringChar F' β ringChar F) : (quadraticChar F) β(Fintype.card F') = (quadraticChar F') (β((quadraticChar F) (-1)) * β(Fintype.card F)) - FiniteField.isSquare_odd_prime_iff π Mathlib.NumberTheory.LegendreSymbol.QuadraticChar.GaussSum
{F : Type u_1} [Field F] [Fintype F] (hF : ringChar F β 2) {p : β} [Fact (Nat.Prime p)] (hp : p β 2) : IsSquare βp β (quadraticChar (ZMod p)) (β(ZMod.Οβ β(Fintype.card F)) * β(Fintype.card F)) β -1 - quadraticChar_odd_prime π Mathlib.NumberTheory.LegendreSymbol.QuadraticChar.GaussSum
{F : Type u_1} [Field F] [Fintype F] [DecidableEq F] (hF : ringChar F β 2) {p : β} [Fact (Nat.Prime p)] (hpβ : p β 2) (hpβ : ringChar F β p) : (quadraticChar F) βp = (quadraticChar (ZMod p)) (β(ZMod.Οβ β(Fintype.card F)) * β(Fintype.card F)) - legendreSym.at_two π Mathlib.NumberTheory.LegendreSymbol.QuadraticReciprocity
{p : β} [Fact (Nat.Prime p)] (hp : p β 2) : legendreSym p 2 = ZMod.Οβ βp - legendreSym.at_neg_two π Mathlib.NumberTheory.LegendreSymbol.QuadraticReciprocity
{p : β} [Fact (Nat.Prime p)] (hp : p β 2) : legendreSym p (-2) = ZMod.Οβ' βp - jacobiSum π Mathlib.NumberTheory.JacobiSum.Basic
{R : Type u_1} {R' : Type u_2} [CommRing R] [Fintype R] [CommRing R'] (Ο Ο : MulChar R R') : R' - jacobiSum_comm π Mathlib.NumberTheory.JacobiSum.Basic
{R : Type u_1} {R' : Type u_2} [CommRing R] [Fintype R] [CommRing R'] (Ο Ο : MulChar R R') : jacobiSum Ο Ο = jacobiSum Ο Ο
About
Loogle searches Lean and Mathlib definitions and theorems.
You can use Loogle from within the Lean4 VSCode language extension
using the Loogle command from the command palette. You can also try the
#loogle command from LeanSearchClient,
the CLI version, the Loogle
VS Code extension, the lean.nvim
integration or the Zulip bot.
Usage
Loogle finds definitions and lemmas in various ways:
By constant:
πReal.sin
finds all lemmas whose statement somehow mentions the sine function.By lemma name substring:
π"differ"
finds all lemmas that have"differ"somewhere in their lemma name.By subexpression:
π_ * (_ ^ _)
finds all lemmas whose statements somewhere include a product where the second argument is raised to some power.The pattern can also be non-linear, as in
πReal.sqrt ?a * Real.sqrt ?aIf the pattern has parameters, they are matched in any order. Both of these will find
List.map:
π(?a -> ?b) -> List ?a -> List ?b
πList ?a -> (?a -> ?b) -> List ?bBy main conclusion:
π|- tsum _ = _ * tsum _
finds all lemmas where the conclusion (the subexpression to the right of allβandβ) has the given shape.As before, if the pattern has parameters, they are matched against the hypotheses of the lemma in any order; for example,
π|- _ < _ β tsum _ < tsum _
will findtsum_lt_tsumeven though the hypothesisf i < g iis not the last.You can filter for definitions vs theorems: Using
β’ (_ : Type _)finds all definitions which provide data whileβ’ (_ : Prop)finds all theorems (and definitions of proofs).
If you pass more than one such search filter, separated by commas
Loogle will return lemmas which match all of them. The
search
π Real.sin, "two", tsum, _ * _, _ ^ _, |- _ < _ β _
would find all lemmas which mention the constants Real.sin
and tsum, have "two" as a substring of the
lemma name, include a product and a power somewhere in the type,
and have a hypothesis of the form _ < _ (if
there were any such lemmas). Metavariables (?a) are
assigned independently in each filter.
The #lucky button will directly send you to the
documentation of the first hit.
Source code
You can find the source code for this service at https://github.com/nomeata/loogle. The https://loogle.lean-lang.org/ service is provided by the Lean FRO. Please review the Lean FRO Terms of Use and Privacy Policy.
This is Loogle revision 9f11169 serving mathlib revision ce5dd8c