Loogle!
Result
Found 121 declarations mentioning PowerBasis.
- PowerBasis ๐ Mathlib.RingTheory.PowerBasis
(R : Type u_6) (S : Type u_7) [CommRing R] [Ring S] [Algebra R S] : Type (max u_6 u_7) - PowerBasis.dim ๐ Mathlib.RingTheory.PowerBasis
{R : Type u_6} {S : Type u_7} [CommRing R] [Ring S] [Algebra R S] (self : PowerBasis R S) : โ - PowerBasis.gen ๐ Mathlib.RingTheory.PowerBasis
{R : Type u_6} {S : Type u_7} [CommRing R] [Ring S] [Algebra R S] (self : PowerBasis R S) : S - PowerBasis.minpolyGen ๐ Mathlib.RingTheory.PowerBasis
{S : Type u_2} [Ring S] {A : Type u_3} [CommRing A] [Algebra A S] (pb : PowerBasis A S) : Polynomial A - PowerBasis.isIntegral_gen ๐ Mathlib.RingTheory.PowerBasis
{S : Type u_2} [Ring S] {A : Type u_3} [CommRing A] [Algebra A S] (pb : PowerBasis A S) : IsIntegral A pb.gen - PowerBasis.minpolyGen_monic ๐ Mathlib.RingTheory.PowerBasis
{S : Type u_2} [Ring S] {A : Type u_3} [CommRing A] [Algebra A S] (pb : PowerBasis A S) : pb.minpolyGen.Monic - PowerBasis.dim_ne_zero ๐ Mathlib.RingTheory.PowerBasis
{R : Type u_1} {S : Type u_2} [CommRing R] [Ring S] [Algebra R S] [Nontrivial S] (pb : PowerBasis R S) : pb.dim โ 0 - PowerBasis.dim_pos ๐ Mathlib.RingTheory.PowerBasis
{R : Type u_1} {S : Type u_2} [CommRing R] [Ring S] [Algebra R S] [Nontrivial S] (pb : PowerBasis R S) : 0 < pb.dim - PowerBasis.finite ๐ Mathlib.RingTheory.PowerBasis
{R : Type u_1} {S : Type u_2} [CommRing R] [Ring S] [Algebra R S] (pb : PowerBasis R S) : Module.Finite R S - PowerBasis.natDegree_minpolyGen ๐ Mathlib.RingTheory.PowerBasis
{S : Type u_2} [Ring S] {A : Type u_3} [CommRing A] [Algebra A S] [Nontrivial A] (pb : PowerBasis A S) : pb.minpolyGen.natDegree = pb.dim - PowerBasis.minpolyGen_eq ๐ Mathlib.RingTheory.PowerBasis
{S : Type u_2} [Ring S] {A : Type u_3} [CommRing A] [Algebra A S] (pb : PowerBasis A S) : pb.minpolyGen = minpoly A pb.gen - PowerBasis.basis ๐ Mathlib.RingTheory.PowerBasis
{R : Type u_6} {S : Type u_7} [CommRing R] [Ring S] [Algebra R S] (self : PowerBasis R S) : Module.Basis (Fin self.dim) R S - PowerBasis.natDegree_minpoly ๐ Mathlib.RingTheory.PowerBasis
{S : Type u_2} [Ring S] {A : Type u_3} [CommRing A] [Algebra A S] [Nontrivial A] (pb : PowerBasis A S) : (minpoly A pb.gen).natDegree = pb.dim - PowerBasis.degree_minpolyGen ๐ Mathlib.RingTheory.PowerBasis
{S : Type u_2} [Ring S] {A : Type u_3} [CommRing A] [Algebra A S] [Nontrivial A] (pb : PowerBasis A S) : pb.minpolyGen.degree = โpb.dim - PowerBasis.degree_minpoly ๐ Mathlib.RingTheory.PowerBasis
{S : Type u_2} [Ring S] {A : Type u_3} [CommRing A] [Algebra A S] [Nontrivial A] (pb : PowerBasis A S) : (minpoly A pb.gen).degree = โpb.dim - PowerBasis.finrank ๐ Mathlib.RingTheory.PowerBasis
{R : Type u_1} {S : Type u_2} [CommRing R] [Ring S] [Algebra R S] [StrongRankCondition R] (pb : PowerBasis R S) : Module.finrank R S = pb.dim - PowerBasis.map ๐ Mathlib.RingTheory.PowerBasis
{R : Type u_1} {S : Type u_2} [CommRing R] [Ring S] [Algebra R S] {S' : Type u_6} [CommRing S'] [Algebra R S'] (pb : PowerBasis R S) (e : S โโ[R] S') : PowerBasis R S' - PowerBasis.AlgHom.fintype ๐ Mathlib.RingTheory.PowerBasis
{S : Type u_2} [Ring S] {A : Type u_3} {B : Type u_4} [CommRing A] [CommRing B] [Algebra A B] [Algebra A S] [IsDomain B] (pb : PowerBasis A S) : Fintype (S โโ[A] B) - PowerBasis.map_dim ๐ Mathlib.RingTheory.PowerBasis
{R : Type u_1} {S : Type u_2} [CommRing R] [Ring S] [Algebra R S] {S' : Type u_6} [CommRing S'] [Algebra R S'] (pb : PowerBasis R S) (e : S โโ[R] S') : (pb.map e).dim = pb.dim - PowerBasis.minpolyGen_map ๐ Mathlib.RingTheory.PowerBasis
{S : Type u_2} [Ring S] {A : Type u_3} [CommRing A] {S' : Type u_6} [CommRing S'] [Algebra A S] [Algebra A S'] (pb : PowerBasis A S) (e : S โโ[A] S') : (pb.map e).minpolyGen = pb.minpolyGen - PowerBasis.equivOfMinpoly ๐ Mathlib.RingTheory.PowerBasis
{S : Type u_2} [Ring S] {A : Type u_3} [CommRing A] [Algebra A S] {S' : Type u_6} [Ring S'] [Algebra A S'] (pb : PowerBasis A S) (pb' : PowerBasis A S') (h : minpoly A pb.gen = minpoly A pb'.gen) : S โโ[A] S' - PowerBasis.liftEquiv' ๐ Mathlib.RingTheory.PowerBasis
{S : Type u_2} [Ring S] {A : Type u_3} {B : Type u_4} [CommRing A] [CommRing B] [Algebra A B] [Algebra A S] [IsDomain B] (pb : PowerBasis A S) : (S โโ[A] B) โ { y // y โ (minpoly A pb.gen).aroots B } - PowerBasis.map_gen ๐ Mathlib.RingTheory.PowerBasis
{R : Type u_1} {S : Type u_2} [CommRing R] [Ring S] [Algebra R S] {S' : Type u_6} [CommRing S'] [Algebra R S'] (pb : PowerBasis R S) (e : S โโ[R] S') : (pb.map e).gen = e pb.gen - PowerBasis.exists_smodEq ๐ Mathlib.RingTheory.PowerBasis
{A : Type u_3} {B : Type u_4} [CommRing A] [CommRing B] [Algebra A B] (pb : PowerBasis A B) (b : B) : โ a, b โก (algebraMap A B) a [SMOD Ideal.span {pb.gen}] - PowerBasis.exists_gen_dvd_sub ๐ Mathlib.RingTheory.PowerBasis
{A : Type u_3} {B : Type u_4} [CommRing A] [CommRing B] [Algebra A B] (pb : PowerBasis A B) (b : B) : โ a, pb.gen โฃ b - (algebraMap A B) a - PowerBasis.mk ๐ Mathlib.RingTheory.PowerBasis
{R : Type u_6} {S : Type u_7} [CommRing R] [Ring S] [Algebra R S] (gen : S) (dim : โ) (basis : Module.Basis (Fin dim) R S) (basis_eq_pow : โ (i : Fin dim), basis i = gen ^ โi) : PowerBasis R S - PowerBasis.equivOfMinpoly_gen ๐ Mathlib.RingTheory.PowerBasis
{S : Type u_2} [Ring S] {A : Type u_3} [CommRing A] [Algebra A S] {S' : Type u_6} [Ring S'] [Algebra A S'] (pb : PowerBasis A S) (pb' : PowerBasis A S') (h : minpoly A pb.gen = minpoly A pb'.gen) : (pb.equivOfMinpoly pb' h) pb.gen = pb'.gen - PowerBasis.equivOfMinpoly_map ๐ Mathlib.RingTheory.PowerBasis
{S : Type u_2} [Ring S] {A : Type u_3} [CommRing A] {S' : Type u_6} [CommRing S'] [Algebra A S] [Algebra A S'] (pb : PowerBasis A S) (e : S โโ[A] S') (h : minpoly A pb.gen = minpoly A (pb.map e).gen) : pb.equivOfMinpoly (pb.map e) h = e - PowerBasis.algHom_ext ๐ Mathlib.RingTheory.PowerBasis
{R : Type u_1} {S : Type u_2} [CommRing R] [Ring S] [Algebra R S] {S' : Type u_6} [Semiring S'] [Algebra R S'] (pb : PowerBasis R S) โฆf g : S โโ[R] S'โฆ (h : f pb.gen = g pb.gen) : f = g - PowerBasis.basis_eq_pow ๐ Mathlib.RingTheory.PowerBasis
{R : Type u_6} {S : Type u_7} [CommRing R] [Ring S] [Algebra R S] (self : PowerBasis R S) (i : Fin self.dim) : self.basis i = self.gen ^ โi - PowerBasis.exists_eq_aeval' ๐ Mathlib.RingTheory.PowerBasis
{R : Type u_1} {S : Type u_2} [CommRing R] [Ring S] [Algebra R S] (pb : PowerBasis R S) (y : S) : โ f, y = (Polynomial.aeval pb.gen) f - PowerBasis.aeval_minpolyGen ๐ Mathlib.RingTheory.PowerBasis
{S : Type u_2} [Ring S] {A : Type u_3} [CommRing A] [Algebra A S] (pb : PowerBasis A S) : (Polynomial.aeval pb.gen) pb.minpolyGen = 0 - PowerBasis.coe_basis ๐ Mathlib.RingTheory.PowerBasis
{R : Type u_1} {S : Type u_2} [CommRing R] [Ring S] [Algebra R S] (pb : PowerBasis R S) : โpb.basis = fun i => pb.gen ^ โi - PowerBasis.equivOfMinpoly_symm ๐ Mathlib.RingTheory.PowerBasis
{S : Type u_2} [Ring S] {A : Type u_3} [CommRing A] [Algebra A S] {S' : Type u_6} [Ring S'] [Algebra A S'] (pb : PowerBasis A S) (pb' : PowerBasis A S') (h : minpoly A pb.gen = minpoly A pb'.gen) : (pb.equivOfMinpoly pb' h).symm = pb'.equivOfMinpoly pb โฏ - Module.Basis.PowerBasis ๐ Mathlib.RingTheory.PowerBasis
{R : Type u_1} {S : Type u_2} [CommRing R] [Ring S] [Algebra R S] {ฮน : Type u_6} [Fintype ฮน] (B : Module.Basis ฮน R S) {x : S} (e : ฮน โ Fin (Fintype.card ฮน)) (hx : โ (i : ฮน), B i = x ^ โ(e i)) : PowerBasis R S - PowerBasis.exists_eq_aeval ๐ Mathlib.RingTheory.PowerBasis
{R : Type u_1} {S : Type u_2} [CommRing R] [Ring S] [Algebra R S] [Nontrivial S] (pb : PowerBasis R S) (y : S) : โ f, f.natDegree < pb.dim โง y = (Polynomial.aeval pb.gen) f - PowerBasis.lift ๐ Mathlib.RingTheory.PowerBasis
{S : Type u_2} [Ring S] {A : Type u_3} [CommRing A] [Algebra A S] {S' : Type u_6} [Ring S'] [Algebra A S'] (pb : PowerBasis A S) (y : S') (hy : (Polynomial.aeval y) (minpoly A pb.gen) = 0) : S โโ[A] S' - PowerBasis.map_basis ๐ Mathlib.RingTheory.PowerBasis
{R : Type u_1} {S : Type u_2} [CommRing R] [Ring S] [Algebra R S] {S' : Type u_6} [CommRing S'] [Algebra R S'] (pb : PowerBasis R S) (e : S โโ[R] S') : (pb.map e).basis = pb.basis.map โe - PowerBasis.liftEquiv ๐ Mathlib.RingTheory.PowerBasis
{S : Type u_2} [Ring S] {A : Type u_3} [CommRing A] [Algebra A S] {S' : Type u_6} [Ring S'] [Algebra A S'] (pb : PowerBasis A S) : (S โโ[A] S') โ { y // (Polynomial.aeval y) (minpoly A pb.gen) = 0 } - PowerBasis.equivOfMinpoly_apply ๐ Mathlib.RingTheory.PowerBasis
{S : Type u_2} [Ring S] {A : Type u_3} [CommRing A] [Algebra A S] {S' : Type u_6} [Ring S'] [Algebra A S'] (pb : PowerBasis A S) (pb' : PowerBasis A S') (h : minpoly A pb.gen = minpoly A pb'.gen) (a : S) : (pb.equivOfMinpoly pb' h) a = (pb.lift pb'.gen โฏ) a - PowerBasis.dim_le_natDegree_of_root ๐ Mathlib.RingTheory.PowerBasis
{S : Type u_2} [Ring S] {A : Type u_3} [CommRing A] [Algebra A S] (pb : PowerBasis A S) {p : Polynomial A} (ne_zero : p โ 0) (root : (Polynomial.aeval pb.gen) p = 0) : pb.dim โค p.natDegree - PowerBasis.dim_le_degree_of_root ๐ Mathlib.RingTheory.PowerBasis
{S : Type u_2} [Ring S] {A : Type u_3} [CommRing A] [Algebra A S] (h : PowerBasis A S) {p : Polynomial A} (ne_zero : p โ 0) (root : (Polynomial.aeval h.gen) p = 0) : โh.dim โค p.degree - PowerBasis.lift_gen ๐ Mathlib.RingTheory.PowerBasis
{S : Type u_2} [Ring S] {A : Type u_3} [CommRing A] [Algebra A S] {S' : Type u_6} [Ring S'] [Algebra A S'] (pb : PowerBasis A S) (y : S') (hy : (Polynomial.aeval y) (minpoly A pb.gen) = 0) : (pb.lift y hy) pb.gen = y - PowerBasis.adjoin_gen_eq_top ๐ Mathlib.RingTheory.PowerBasis
{R : Type u_1} {S : Type u_2} [CommRing R] [Ring S] [Algebra R S] (B : PowerBasis R S) : R[B.gen] = โค - PowerBasis.adjoin_eq_top_of_gen_mem_adjoin ๐ Mathlib.RingTheory.PowerBasis
{R : Type u_1} {S : Type u_2} [CommRing R] [Ring S] [Algebra R S] {B : PowerBasis R S} {x : S} (hx : B.gen โ R[x]) : R[x] = โค - PowerBasis.equivOfRoot ๐ Mathlib.RingTheory.PowerBasis
{S : Type u_2} [Ring S] {A : Type u_3} [CommRing A] [Algebra A S] {S' : Type u_6} [Ring S'] [Algebra A S'] (pb : PowerBasis A S) (pb' : PowerBasis A S') (hโ : (Polynomial.aeval pb.gen) (minpoly A pb'.gen) = 0) (hโ : (Polynomial.aeval pb'.gen) (minpoly A pb.gen) = 0) : S โโ[A] S' - PowerBasis.equivOfMinpoly_aeval ๐ Mathlib.RingTheory.PowerBasis
{S : Type u_2} [Ring S] {A : Type u_3} [CommRing A] [Algebra A S] {S' : Type u_6} [Ring S'] [Algebra A S'] (pb : PowerBasis A S) (pb' : PowerBasis A S') (h : minpoly A pb.gen = minpoly A pb'.gen) (f : Polynomial A) : (pb.equivOfMinpoly pb' h) ((Polynomial.aeval pb.gen) f) = (Polynomial.aeval pb'.gen) f - PowerBasis.equivOfRoot_symm ๐ Mathlib.RingTheory.PowerBasis
{S : Type u_2} [Ring S] {A : Type u_3} [CommRing A] [Algebra A S] {S' : Type u_6} [Ring S'] [Algebra A S'] (pb : PowerBasis A S) (pb' : PowerBasis A S') (hโ : (Polynomial.aeval pb.gen) (minpoly A pb'.gen) = 0) (hโ : (Polynomial.aeval pb'.gen) (minpoly A pb.gen) = 0) : (pb.equivOfRoot pb' hโ hโ).symm = pb'.equivOfRoot pb hโ hโ - PowerBasis.equivOfRoot_gen ๐ Mathlib.RingTheory.PowerBasis
{S : Type u_2} [Ring S] {A : Type u_3} [CommRing A] [Algebra A S] {S' : Type u_6} [Ring S'] [Algebra A S'] (pb : PowerBasis A S) (pb' : PowerBasis A S') (hโ : (Polynomial.aeval pb.gen) (minpoly A pb'.gen) = 0) (hโ : (Polynomial.aeval pb'.gen) (minpoly A pb.gen) = 0) : (pb.equivOfRoot pb' hโ hโ) pb.gen = pb'.gen - PowerBasis.liftEquiv'_apply_coe ๐ Mathlib.RingTheory.PowerBasis
{S : Type u_2} [Ring S] {A : Type u_3} {B : Type u_4} [CommRing A] [CommRing B] [Algebra A B] [Algebra A S] [IsDomain B] (pb : PowerBasis A S) (aโ : S โโ[A] B) : โ(pb.liftEquiv' aโ) = aโ pb.gen - PowerBasis.equivOfRoot_map ๐ Mathlib.RingTheory.PowerBasis
{S : Type u_2} [Ring S] {A : Type u_3} [CommRing A] {S' : Type u_6} [CommRing S'] [Algebra A S] [Algebra A S'] (pb : PowerBasis A S) (e : S โโ[A] S') (hโ : (Polynomial.aeval pb.gen) (minpoly A (pb.map e).gen) = 0) (hโ : (Polynomial.aeval (pb.map e).gen) (minpoly A pb.gen) = 0) : pb.equivOfRoot (pb.map e) hโ hโ = e - PowerBasis.equivOfRoot_apply ๐ Mathlib.RingTheory.PowerBasis
{S : Type u_2} [Ring S] {A : Type u_3} [CommRing A] [Algebra A S] {S' : Type u_6} [Ring S'] [Algebra A S'] (pb : PowerBasis A S) (pb' : PowerBasis A S') (hโ : (Polynomial.aeval pb.gen) (minpoly A pb'.gen) = 0) (hโ : (Polynomial.aeval pb'.gen) (minpoly A pb.gen) = 0) (a : S) : (pb.equivOfRoot pb' hโ hโ) a = (pb.lift pb'.gen hโ) a - PowerBasis.lift_aeval ๐ Mathlib.RingTheory.PowerBasis
{S : Type u_2} [Ring S] {A : Type u_3} [CommRing A] [Algebra A S] {S' : Type u_6} [Ring S'] [Algebra A S'] (pb : PowerBasis A S) (y : S') (hy : (Polynomial.aeval y) (minpoly A pb.gen) = 0) (f : Polynomial A) : (pb.lift y hy) ((Polynomial.aeval pb.gen) f) = (Polynomial.aeval y) f - PowerBasis.equivOfRoot_aeval ๐ Mathlib.RingTheory.PowerBasis
{S : Type u_2} [Ring S] {A : Type u_3} [CommRing A] [Algebra A S] {S' : Type u_6} [Ring S'] [Algebra A S'] (pb : PowerBasis A S) (pb' : PowerBasis A S') (hโ : (Polynomial.aeval pb.gen) (minpoly A pb'.gen) = 0) (hโ : (Polynomial.aeval pb'.gen) (minpoly A pb.gen) = 0) (f : Polynomial A) : (pb.equivOfRoot pb' hโ hโ) ((Polynomial.aeval pb.gen) f) = (Polynomial.aeval pb'.gen) f - PowerBasis.leftMulMatrix ๐ Mathlib.RingTheory.PowerBasis
{S : Type u_2} [Ring S] {A : Type u_3} [CommRing A] [Algebra A S] (pb : PowerBasis A S) : (Algebra.leftMulMatrix pb.basis) pb.gen = Matrix.of fun i j => if โj + 1 = pb.dim then -pb.minpolyGen.coeff โi else if โi = โj + 1 then 1 else 0 - PowerBasis.liftEquiv_apply_coe ๐ Mathlib.RingTheory.PowerBasis
{S : Type u_2} [Ring S] {A : Type u_3} [CommRing A] [Algebra A S] {S' : Type u_6} [Ring S'] [Algebra A S'] (pb : PowerBasis A S) (f : S โโ[A] S') : โ(pb.liftEquiv f) = f pb.gen - PowerBasis.liftEquiv_symm_apply ๐ Mathlib.RingTheory.PowerBasis
{S : Type u_2} [Ring S] {A : Type u_3} [CommRing A] [Algebra A S] {S' : Type u_6} [Ring S'] [Algebra A S'] (pb : PowerBasis A S) (y : { y // (Polynomial.aeval y) (minpoly A pb.gen) = 0 }) : pb.liftEquiv.symm y = pb.lift โy โฏ - PowerBasis.constr_pow_gen ๐ Mathlib.RingTheory.PowerBasis
{S : Type u_2} [Ring S] {A : Type u_3} [CommRing A] [Algebra A S] {S' : Type u_6} [Ring S'] [Algebra A S'] (pb : PowerBasis A S) {y : S'} (hy : (Polynomial.aeval y) (minpoly A pb.gen) = 0) : ((pb.basis.constr A) fun i => y ^ โi) pb.gen = y - PowerBasis.constr_pow_algebraMap ๐ Mathlib.RingTheory.PowerBasis
{S : Type u_2} [Ring S] {A : Type u_3} [CommRing A] [Algebra A S] {S' : Type u_6} [Ring S'] [Algebra A S'] (pb : PowerBasis A S) {y : S'} (hy : (Polynomial.aeval y) (minpoly A pb.gen) = 0) (x : A) : ((pb.basis.constr A) fun i => y ^ โi) ((algebraMap A S) x) = (algebraMap A S') x - PowerBasis.liftEquiv'_symm_apply_apply ๐ Mathlib.RingTheory.PowerBasis
{S : Type u_2} [Ring S] {A : Type u_3} {B : Type u_4} [CommRing A] [CommRing B] [Algebra A B] [Algebra A S] [IsDomain B] (pb : PowerBasis A S) (aโ : { y // y โ (minpoly A pb.gen).aroots B }) : โ(pb.liftEquiv'.symm aโ) = โ((pb.basis.constr A) fun i => โaโ ^ โi) - PowerBasis.constr_pow_aeval ๐ Mathlib.RingTheory.PowerBasis
{S : Type u_2} [Ring S] {A : Type u_3} [CommRing A] [Algebra A S] {S' : Type u_6} [Ring S'] [Algebra A S'] (pb : PowerBasis A S) {y : S'} (hy : (Polynomial.aeval y) (minpoly A pb.gen) = 0) (f : Polynomial A) : ((pb.basis.constr A) fun i => y ^ โi) ((Polynomial.aeval pb.gen) f) = (Polynomial.aeval y) f - PowerBasis.constr_pow_mul ๐ Mathlib.RingTheory.PowerBasis
{S : Type u_2} [Ring S] {A : Type u_3} [CommRing A] [Algebra A S] {S' : Type u_6} [Ring S'] [Algebra A S'] (pb : PowerBasis A S) {y : S'} (hy : (Polynomial.aeval y) (minpoly A pb.gen) = 0) (x x' : S) : ((pb.basis.constr A) fun i => y ^ โi) (x * x') = ((pb.basis.constr A) fun i => y ^ โi) x * ((pb.basis.constr A) fun i => y ^ โi) x' - AdjoinRoot.powerBasis' ๐ Mathlib.RingTheory.AdjoinRoot
{R : Type u_1} [CommRing R] {g : Polynomial R} (hg : g.Monic) : PowerBasis R (AdjoinRoot g) - AdjoinRoot.powerBasis ๐ Mathlib.RingTheory.AdjoinRoot
{K : Type u_5} [Field K] {f : Polynomial K} (hf : f โ 0) : PowerBasis K (AdjoinRoot f) - AdjoinRoot.equiv' ๐ Mathlib.RingTheory.AdjoinRoot
{R : Type u_1} {S : Type u_2} [CommRing R] [CommRing S] [Algebra R S] (g : Polynomial R) (pb : PowerBasis R S) (hโ : (Polynomial.aeval (AdjoinRoot.root g)) (minpoly R pb.gen) = 0) (hโ : (Polynomial.aeval pb.gen) g = 0) : AdjoinRoot g โโ[R] S - AdjoinRoot.equiv'_toAlgHom ๐ Mathlib.RingTheory.AdjoinRoot
{R : Type u_1} {S : Type u_2} [CommRing R] [CommRing S] [Algebra R S] (g : Polynomial R) (pb : PowerBasis R S) (hโ : (Polynomial.aeval (AdjoinRoot.root g)) (minpoly R pb.gen) = 0) (hโ : (Polynomial.aeval pb.gen) g = 0) : โ(AdjoinRoot.equiv' g pb hโ hโ) = AdjoinRoot.liftAlgHom g (Algebra.ofId R S) pb.gen hโ - AdjoinRoot.equiv'_symm_toAlgHom ๐ Mathlib.RingTheory.AdjoinRoot
{R : Type u_1} {S : Type u_2} [CommRing R] [CommRing S] [Algebra R S] (g : Polynomial R) (pb : PowerBasis R S) (hโ : (Polynomial.aeval (AdjoinRoot.root g)) (minpoly R pb.gen) = 0) (hโ : (Polynomial.aeval pb.gen) g = 0) : โ(AdjoinRoot.equiv' g pb hโ hโ).symm = pb.lift (AdjoinRoot.root g) hโ - AdjoinRoot.equiv'_apply ๐ Mathlib.RingTheory.AdjoinRoot
{R : Type u_1} {S : Type u_2} [CommRing R] [CommRing S] [Algebra R S] (g : Polynomial R) (pb : PowerBasis R S) (hโ : (Polynomial.aeval (AdjoinRoot.root g)) (minpoly R pb.gen) = 0) (hโ : (Polynomial.aeval pb.gen) g = 0) : โ(AdjoinRoot.equiv' g pb hโ hโ) = โ(AdjoinRoot.liftAlgHom g (Algebra.ofId R S) pb.gen hโ) - AdjoinRoot.equiv'_symm_apply ๐ Mathlib.RingTheory.AdjoinRoot
{R : Type u_1} {S : Type u_2} [CommRing R] [CommRing S] [Algebra R S] (g : Polynomial R) (pb : PowerBasis R S) (hโ : (Polynomial.aeval (AdjoinRoot.root g)) (minpoly R pb.gen) = 0) (hโ : (Polynomial.aeval pb.gen) g = 0) : โ(AdjoinRoot.equiv' g pb hโ hโ).symm = โ(pb.lift (AdjoinRoot.root g) hโ) - PowerBasis.quotientEquivQuotientMinpolyMap ๐ Mathlib.RingTheory.AdjoinRoot
{R : Type u_1} {S : Type u_2} [CommRing R] [CommRing S] [Algebra R S] (pb : PowerBasis R S) (I : Ideal R) : (S โงธ Ideal.map (algebraMap R S) I) โโ[R] Polynomial (R โงธ I) โงธ Ideal.span {Polynomial.map (Ideal.Quotient.mk I) (minpoly R pb.gen)} - PowerBasis.quotientEquivQuotientMinpolyMap_apply_mk ๐ Mathlib.RingTheory.AdjoinRoot
{R : Type u_1} {S : Type u_2} [CommRing R] [CommRing S] [Algebra R S] (pb : PowerBasis R S) (I : Ideal R) (g : Polynomial R) : (pb.quotientEquivQuotientMinpolyMap I) ((Ideal.Quotient.mk (Ideal.map (algebraMap R S) I)) ((Polynomial.aeval pb.gen) g)) = (Ideal.Quotient.mk (Ideal.span {Polynomial.map (Ideal.Quotient.mk I) (minpoly R pb.gen)})) (Polynomial.map (Ideal.Quotient.mk I) g) - PowerBasis.quotientEquivQuotientMinpolyMap_symm_apply_mk ๐ Mathlib.RingTheory.AdjoinRoot
{R : Type u_1} {S : Type u_2} [CommRing R] [CommRing S] [Algebra R S] (pb : PowerBasis R S) (I : Ideal R) (g : Polynomial R) : (pb.quotientEquivQuotientMinpolyMap I).symm ((Ideal.Quotient.mk (Ideal.span {Polynomial.map (Ideal.Quotient.mk I) (minpoly R pb.gen)})) (Polynomial.map (Ideal.Quotient.mk I) g)) = (Ideal.Quotient.mk (Ideal.map (algebraMap R S) I)) ((Polynomial.aeval pb.gen) g) - PowerBasis.quotientEquivQuotientMinpolyMap_apply ๐ Mathlib.RingTheory.AdjoinRoot
{R : Type u_1} {S : Type u_2} [CommRing R] [CommRing S] [Algebra R S] (pb : PowerBasis R S) (I : Ideal R) (aโ : S โงธ Ideal.map (algebraMap R S) I) : (pb.quotientEquivQuotientMinpolyMap I) aโ = (AdjoinRoot.quotAdjoinRootEquivQuotPolynomialQuot I (minpoly R pb.gen)) ((AlgEquiv.ofRingEquiv โฏ) aโ) - PowerBasis.quotientEquivQuotientMinpolyMap_symm_apply ๐ Mathlib.RingTheory.AdjoinRoot
{R : Type u_1} {S : Type u_2} [CommRing R] [CommRing S] [Algebra R S] (pb : PowerBasis R S) (I : Ideal R) (aโ : Polynomial (R โงธ I) โงธ Ideal.span {Polynomial.map (Ideal.Quotient.mk I) (minpoly R pb.gen)}) : (pb.quotientEquivQuotientMinpolyMap I).symm aโ = { toEquiv := โ(AlgEquiv.ofRingEquiv โฏ).symm, map_mul' := โฏ, map_add' := โฏ } ({ toEquiv := โ(AdjoinRoot.quotEquivQuotMap (minpoly R pb.gen) I).symm, map_mul' := โฏ, map_add' := โฏ } aโ) - AlgHom.natCard_of_powerBasis ๐ Mathlib.FieldTheory.Separable
{S : Type u_1} [CommRing S] {K : Type u_2} {L : Type u_3} [Field K] [Field L] [Algebra K S] [Algebra K L] (pb : PowerBasis K S) (h_sep : IsSeparable K pb.gen) (h_splits : (Polynomial.map (algebraMap K L) (minpoly K pb.gen)).Splits) : Nat.card (S โโ[K] L) = pb.dim - AlgHom.card_of_powerBasis ๐ Mathlib.FieldTheory.Separable
{S : Type u_1} [CommRing S] {K : Type u_2} {L : Type u_3} [Field K] [Field L] [Algebra K S] [Algebra K L] (pb : PowerBasis K S) (h_sep : IsSeparable K pb.gen) (h_splits : (Polynomial.map (algebraMap K L) (minpoly K pb.gen)).Splits) : Fintype.card (S โโ[K] L) = pb.dim - PowerBasis.ofAdjoinSimpleEqTop ๐ Mathlib.FieldTheory.IntermediateField.Adjoin.Basic
{K : Type u} [Field K] {L : Type u_3} [Field L] [Algebra K L] {x : L} (h : IsIntegral K x) (hgen : Kโฎxโฏ = โค) : PowerBasis K L - IntermediateField.adjoin.powerBasis ๐ Mathlib.FieldTheory.IntermediateField.Adjoin.Basic
{K : Type u} [Field K] {L : Type u_3} [Field L] [Algebra K L] {x : L} (hx : IsIntegral K x) : PowerBasis K โฅKโฎxโฏ - PowerBasis.equivAdjoinSimple ๐ Mathlib.FieldTheory.IntermediateField.Adjoin.Basic
{K : Type u_1} {L : Type u_2} [Field K] [Field L] [Algebra K L] (pb : PowerBasis K L) : โฅKโฎpb.genโฏ โโ[K] L - PowerBasis.equivAdjoinSimple_gen ๐ Mathlib.FieldTheory.IntermediateField.Adjoin.Basic
{K : Type u_1} {L : Type u_2} [Field K] [Field L] [Algebra K L] (pb : PowerBasis K L) : pb.equivAdjoinSimple (IntermediateField.AdjoinSimple.gen K pb.gen) = pb.gen - PowerBasis.equivAdjoinSimple_symm_gen ๐ Mathlib.FieldTheory.IntermediateField.Adjoin.Basic
{K : Type u_1} {L : Type u_2} [Field K] [Field L] [Algebra K L] (pb : PowerBasis K L) : pb.equivAdjoinSimple.symm pb.gen = IntermediateField.AdjoinSimple.gen K pb.gen - PowerBasis.equivAdjoinSimple_aeval ๐ Mathlib.FieldTheory.IntermediateField.Adjoin.Basic
{K : Type u_1} {L : Type u_2} [Field K] [Field L] [Algebra K L] (pb : PowerBasis K L) (f : Polynomial K) : pb.equivAdjoinSimple ((Polynomial.aeval (IntermediateField.AdjoinSimple.gen K pb.gen)) f) = (Polynomial.aeval pb.gen) f - PowerBasis.equivAdjoinSimple_symm_aeval ๐ Mathlib.FieldTheory.IntermediateField.Adjoin.Basic
{K : Type u_1} {L : Type u_2} [Field K] [Field L] [Algebra K L] (pb : PowerBasis K L) (f : Polynomial K) : pb.equivAdjoinSimple.symm ((Polynomial.aeval pb.gen) f) = (Polynomial.aeval (IntermediateField.AdjoinSimple.gen K pb.gen)) f - Field.powerBasisOfFiniteOfSeparable ๐ Mathlib.FieldTheory.PrimitiveElement
(F : Type u_1) (E : Type u_2) [Field F] [Field E] [Algebra F E] [FiniteDimensional F E] [Algebra.IsSeparable F E] : PowerBasis F E - Algebra.adjoin.powerBasis' ๐ Mathlib.FieldTheory.Minpoly.IsIntegrallyClosed
{R : Type u_1} {S : Type u_2} [CommRing R] [CommRing S] [IsDomain R] [Algebra R S] [IsIntegrallyClosed R] [IsDomain S] [Module.IsTorsionFree R S] {x : S} (hx : IsIntegral R x) : PowerBasis R โฅR[x] - PowerBasis.ofAdjoinEqTop' ๐ Mathlib.FieldTheory.Minpoly.IsIntegrallyClosed
{R : Type u_1} {S : Type u_2} [CommRing R] [CommRing S] [IsDomain R] [Algebra R S] [IsIntegrallyClosed R] [IsDomain S] [Module.IsTorsionFree R S] {x : S} (hx : IsIntegral R x) (hx' : R[x] = โค) : PowerBasis R S - charpoly_leftMulMatrix ๐ Mathlib.LinearAlgebra.Matrix.Charpoly.Minpoly
{R : Type u} [CommRing R] {S : Type u_1} [Ring S] [Algebra R S] (h : PowerBasis R S) : ((Algebra.leftMulMatrix h.basis) h.gen).charpoly = minpoly R h.gen - PowerBasis.trace_gen_eq_nextCoeff_minpoly ๐ Mathlib.RingTheory.Trace.Basic
{S : Type u_2} [CommRing S] {K : Type u_3} [Field K] [Algebra K S] [Nontrivial S] (pb : PowerBasis K S) : (Algebra.trace K S) pb.gen = -(minpoly K pb.gen).nextCoeff - det_traceMatrix_ne_zero' ๐ Mathlib.RingTheory.Trace.Basic
{K : Type u_3} {L : Type u_4} [Field K] [Field L] [Algebra K L] (pb : PowerBasis K L) [Algebra.IsSeparable K L] : (Algebra.traceMatrix K โpb.basis).det โ 0 - PowerBasis.trace_gen_eq_sum_roots ๐ Mathlib.RingTheory.Trace.Basic
{S : Type u_2} [CommRing S] {K : Type u_3} [Field K] {F : Type u_5} [Field F] [Algebra K S] [Algebra K F] [Nontrivial S] (pb : PowerBasis K S) (hf : (Polynomial.map (algebraMap K F) (minpoly K pb.gen)).Splits) : (algebraMap K F) ((Algebra.trace K S) pb.gen) = ((minpoly K pb.gen).aroots F).sum - Algebra.embeddingsMatrixReindex_eq_vandermonde ๐ Mathlib.RingTheory.Trace.Basic
{A : Type u} {B : Type v} (C : Type z) [CommRing A] [CommRing B] [Algebra A B] [CommRing C] [Algebra A C] (pb : PowerBasis A B) (e : Fin pb.dim โ (B โโ[A] C)) : Algebra.embeddingsMatrixReindex A C (โpb.basis) e = (Matrix.vandermonde fun i => (e i) pb.gen).transpose - trace_eq_sum_embeddings_gen ๐ Mathlib.RingTheory.Trace.Basic
{K : Type u_3} {L : Type u_4} [Field K] [Field L] [Algebra K L] (E : Type u_6) [Field E] [Algebra K E] (pb : PowerBasis K L) (hE : (Polynomial.map (algebraMap K E) (minpoly K pb.gen)).Splits) (hfx : IsSeparable K pb.gen) : (algebraMap K E) ((Algebra.trace K L) pb.gen) = โ ฯ, ฯ pb.gen - sum_embeddings_eq_finrank_mul ๐ Mathlib.RingTheory.Trace.Basic
{K : Type u_3} {L : Type u_4} [Field K] [Field L] [Algebra K L] (F : Type u_5) [Field F] [Algebra L F] [Algebra K F] [IsScalarTower K L F] (E : Type u_6) [Field E] [Algebra K E] [IsAlgClosed E] [FiniteDimensional K F] [Algebra.IsSeparable K F] (pb : PowerBasis K L) : โ ฯ, ฯ ((algebraMap L F) pb.gen) = Module.finrank L F โข โ ฯ, ฯ pb.gen - Module.Basis.traceDual_powerBasis_eq ๐ Mathlib.RingTheory.Trace.Basic
{K : Type u_3} {L : Type u_4} [Field K] [Field L] [Algebra K L] [FiniteDimensional K L] [Algebra.IsSeparable K L] (pb : PowerBasis K L) (i : Fin pb.dim) : pb.basis.traceDual i = (minpolyDiv K pb.gen).coeff โi / (Polynomial.aeval pb.gen) (Polynomial.derivative (minpoly K pb.gen)) - Algebra.traceForm_toMatrix_powerBasis ๐ Mathlib.RingTheory.Trace.Basic
{R : Type u_1} {S : Type u_2} [CommRing R] [CommRing S] [Algebra R S] (h : PowerBasis R S) : (LinearMap.BilinForm.toMatrix h.basis) (Algebra.traceForm R S) = Matrix.of fun i j => (Algebra.trace R S) (h.gen ^ (โi + โj)) - Algebra.PowerBasis.norm_gen_eq_coeff_zero_minpoly ๐ Mathlib.RingTheory.Norm.Basic
{R : Type u_1} {S : Type u_2} [CommRing R] [Ring S] [Algebra R S] (pb : PowerBasis R S) : (Algebra.norm R) pb.gen = (-1) ^ pb.dim * (minpoly R pb.gen).coeff 0 - Algebra.PowerBasis.norm_gen_eq_prod_roots ๐ Mathlib.RingTheory.Norm.Basic
{R : Type u_1} {S : Type u_2} [CommRing R] [Ring S] [Algebra R S] {F : Type u_6} [Field F] [Algebra R F] (pb : PowerBasis R S) (hf : (Polynomial.map (algebraMap R F) (minpoly R pb.gen)).Splits) : (algebraMap R F) ((Algebra.norm R) pb.gen) = ((minpoly R pb.gen).aroots F).prod - Algebra.norm_eq_prod_embeddings_gen ๐ Mathlib.RingTheory.Norm.Basic
{R : Type u_1} {S : Type u_2} [CommRing R] [Ring S] [Algebra R S] (F : Type u_6) [Field F] [Algebra R F] (pb : PowerBasis R S) (hE : (Polynomial.map (algebraMap R F) (minpoly R pb.gen)).Splits) (hfx : IsSeparable R pb.gen) : (algebraMap R F) ((Algebra.norm R) pb.gen) = โ ฯ, ฯ pb.gen - Algebra.prod_embeddings_eq_finrank_pow ๐ Mathlib.RingTheory.Norm.Basic
{K : Type u_4} {L : Type u_5} (F : Type u_6) [Field K] [Field L] [Field F] [Algebra K L] [Algebra K F] (E : Type u_7) [Field E] [Algebra K E] [Algebra L F] [IsScalarTower K L F] [IsAlgClosed E] [Algebra.IsSeparable K F] [FiniteDimensional K F] (pb : PowerBasis K L) : โ ฯ, ฯ ((algebraMap L F) pb.gen) = (โ ฯ, ฯ pb.gen) ^ Module.finrank L F - conductor_eq_top_of_powerBasis ๐ Mathlib.RingTheory.Conductor
{R : Type u_1} {S : Type u_2} [CommRing R] [CommRing S] [Algebra R S] (pb : PowerBasis R S) : conductor R pb.gen = โค - Algebra.adjoin.powerBasis ๐ Mathlib.RingTheory.Adjoin.PowerBasis
{K : Type u_1} {S : Type u_2} [Field K] [CommRing S] [Algebra K S] {x : S} (hx : IsIntegral K x) : PowerBasis K โฅK[x] - PowerBasis.ofAdjoinEqTop ๐ Mathlib.RingTheory.Adjoin.PowerBasis
{K : Type u_1} {S : Type u_2} [Field K] [CommRing S] [Algebra K S] {x : S} (hx : IsIntegral K x) (hx' : K[x] = โค) : PowerBasis K S - PowerBasis.toMatrix_isIntegral ๐ Mathlib.RingTheory.Adjoin.PowerBasis
{K : Type u_1} {S : Type u_2} [Field K] [CommRing S] [Algebra K S] {R : Type u_3} [CommRing R] [Algebra R S] [Algebra R K] [IsScalarTower R K S] {B B' : PowerBasis K S} {P : Polynomial R} (h : (Polynomial.aeval B.gen) P = B'.gen) (hB : IsIntegral R B.gen) (hmin : minpoly K B.gen = Polynomial.map (algebraMap R K) (minpoly R B.gen)) (i : Fin B.dim) (j : Fin B'.dim) : IsIntegral R (B.basis.toMatrix (โB'.basis) i j) - PowerBasis.repr_gen_pow_isIntegral ๐ Mathlib.RingTheory.Adjoin.PowerBasis
{S : Type u_2} [CommRing S] {R : Type u_3} [CommRing R] [Algebra R S] {A : Type u_4} [CommRing A] [Algebra R A] [Algebra S A] [IsScalarTower R S A] {B : PowerBasis S A} (hB : IsIntegral R B.gen) (hmin : minpoly S B.gen = Polynomial.map (algebraMap R S) (minpoly R B.gen)) (n : โ) (i : Fin B.dim) : IsIntegral R ((B.basis.repr (B.gen ^ n)) i) - PowerBasis.repr_pow_isIntegral ๐ Mathlib.RingTheory.Adjoin.PowerBasis
{S : Type u_2} [CommRing S] {R : Type u_3} [CommRing R] [Algebra R S] {A : Type u_4} [CommRing A] [Algebra R A] [Algebra S A] [IsScalarTower R S A] {B : PowerBasis S A} (hB : IsIntegral R B.gen) {x : A} (hx : โ (i : Fin B.dim), IsIntegral R ((B.basis.repr x) i)) (hmin : minpoly S B.gen = Polynomial.map (algebraMap R S) (minpoly R B.gen)) (n : โ) (i : Fin B.dim) : IsIntegral R ((B.basis.repr (x ^ n)) i) - PowerBasis.repr_mul_isIntegral ๐ Mathlib.RingTheory.Adjoin.PowerBasis
{S : Type u_2} [CommRing S] {R : Type u_3} [CommRing R] [Algebra R S] {A : Type u_4} [CommRing A] [Algebra R A] [Algebra S A] [IsScalarTower R S A] {B : PowerBasis S A} (hB : IsIntegral R B.gen) {x y : A} (hx : โ (i : Fin B.dim), IsIntegral R ((B.basis.repr x) i)) (hy : โ (i : Fin B.dim), IsIntegral R ((B.basis.repr y) i)) (hmin : minpoly S B.gen = Polynomial.map (algebraMap R S) (minpoly R B.gen)) (i : Fin B.dim) : IsIntegral R ((B.basis.repr (x * y)) i) - IsPrimitiveRoot.powerBasis ๐ Mathlib.NumberTheory.Cyclotomic.PrimitiveRoots
{n : โ} [NeZero n] (K : Type u) {L : Type v} [Field K] [CommRing L] [IsDomain L] [Algebra K L] [IsCyclotomicExtension {n} K L] {ฮถ : L} (hฮถ : IsPrimitiveRoot ฮถ n) : PowerBasis K L - IsPrimitiveRoot.subOnePowerBasis ๐ Mathlib.NumberTheory.Cyclotomic.PrimitiveRoots
{n : โ} [NeZero n] (K : Type u) {L : Type v} [Field K] [CommRing L] [IsDomain L] [Algebra K L] [IsCyclotomicExtension {n} K L] {ฮถ : L} (hฮถ : IsPrimitiveRoot ฮถ n) : PowerBasis K L - Algebra.discr_mul_isIntegral_mem_adjoin ๐ Mathlib.RingTheory.Discriminant
(K : Type u) {L : Type v} [Field K] [Field L] [Algebra K L] [Module.Finite K L] {R : Type z} [CommRing R] [Algebra R K] [Algebra R L] [IsScalarTower R K L] [Algebra.IsSeparable K L] [IsIntegrallyClosed R] [IsFractionRing R K] {B : PowerBasis K L} (hint : IsIntegral R B.gen) {z : L} (hz : IsIntegral R z) : Algebra.discr K โB.basis โข z โ R[B.gen] - Algebra.discr_powerBasis_eq_norm ๐ Mathlib.RingTheory.Discriminant
(K : Type u) {L : Type v} [Field K] [Field L] [Algebra K L] [Module.Finite K L] (pb : PowerBasis K L) [Algebra.IsSeparable K L] : Algebra.discr K โpb.basis = (-1) ^ (Module.finrank K L * (Module.finrank K L - 1) / 2) * (Algebra.norm K) ((Polynomial.aeval pb.gen) (Polynomial.derivative (minpoly K pb.gen))) - Algebra.discr_powerBasis_eq_prod ๐ Mathlib.RingTheory.Discriminant
(K : Type u) {L : Type v} (E : Type z) [Field K] [Field L] [Field E] [Algebra K L] [Algebra K E] [Module.Finite K L] [IsAlgClosed E] (pb : PowerBasis K L) (e : Fin pb.dim โ (L โโ[K] E)) [Algebra.IsSeparable K L] : (algebraMap K E) (Algebra.discr K โpb.basis) = โ i, โ j > i, ((e j) pb.gen - (e i) pb.gen) ^ 2 - Algebra.discr_powerBasis_eq_prod' ๐ Mathlib.RingTheory.Discriminant
(K : Type u) {L : Type v} (E : Type z) [Field K] [Field L] [Field E] [Algebra K L] [Algebra K E] [Module.Finite K L] [IsAlgClosed E] (pb : PowerBasis K L) [Algebra.IsSeparable K L] (e : Fin pb.dim โ (L โโ[K] E)) : (algebraMap K E) (Algebra.discr K โpb.basis) = โ i, โ j > i, -(((e j) pb.gen - (e i) pb.gen) * ((e i) pb.gen - (e j) pb.gen)) - Algebra.discr_powerBasis_eq_prod'' ๐ Mathlib.RingTheory.Discriminant
(K : Type u) {L : Type v} (E : Type z) [Field K] [Field L] [Field E] [Algebra K L] [Algebra K E] [Module.Finite K L] [IsAlgClosed E] (pb : PowerBasis K L) [Algebra.IsSeparable K L] (e : Fin pb.dim โ (L โโ[K] E)) : (algebraMap K E) (Algebra.discr K โpb.basis) = (-1) ^ (Module.finrank K L * (Module.finrank K L - 1) / 2) * โ i, โ j > i, ((e j) pb.gen - (e i) pb.gen) * ((e i) pb.gen - (e j) pb.gen) - mem_adjoin_of_smul_prime_smul_of_minpoly_isEisensteinAt ๐ Mathlib.RingTheory.Polynomial.Eisenstein.IsIntegral
{R : Type u} {K : Type v} {L : Type z} {p : R} [CommRing R] [Field K] [Field L] [Algebra K L] [Algebra R L] [Algebra R K] [IsScalarTower R K L] [IsDomain R] [IsFractionRing R K] [IsIntegrallyClosed R] {B : PowerBasis K L} (hp : Prime p) (hBint : IsIntegral R B.gen) {z : L} (hzint : IsIntegral R z) (hz : p โข z โ R[B.gen]) (hei : (minpoly R B.gen).IsEisensteinAt (R โ p)) : z โ R[B.gen] - mem_adjoin_of_smul_prime_pow_smul_of_minpoly_isEisensteinAt ๐ Mathlib.RingTheory.Polynomial.Eisenstein.IsIntegral
{R : Type u} {K : Type v} {L : Type z} {p : R} [CommRing R] [Field K] [Field L] [Algebra K L] [Algebra R L] [Algebra R K] [IsScalarTower R K L] [IsDomain R] [IsFractionRing R K] [IsIntegrallyClosed R] {B : PowerBasis K L} (hp : Prime p) (hBint : IsIntegral R B.gen) {n : โ} {z : L} (hzint : IsIntegral R z) (hz : p ^ n โข z โ R[B.gen]) (hei : (minpoly R B.gen).IsEisensteinAt (R โ p)) : z โ R[B.gen] - dvd_coeff_zero_of_aeval_eq_prime_smul_of_minpoly_isEisensteinAt ๐ Mathlib.RingTheory.Polynomial.Eisenstein.IsIntegral
{R : Type u} {K : Type v} {L : Type z} {p : R} [CommRing R] [Field K] [Field L] [Algebra K L] [Algebra R L] [Algebra R K] [IsScalarTower R K L] [IsDomain R] [IsFractionRing R K] [IsIntegrallyClosed R] {B : PowerBasis K L} (hp : Prime p) (hBint : IsIntegral R B.gen) {z : L} {Q : Polynomial R} (hQ : (Polynomial.aeval B.gen) Q = p โข z) (hzint : IsIntegral R z) (hei : (minpoly R B.gen).IsEisensteinAt (R โ p)) : p โฃ Q.coeff 0 - IsPrimitiveRoot.integralPowerBasis ๐ Mathlib.NumberTheory.NumberField.Cyclotomic.Basic
{n : โ} {K : Type u} [Field K] {ฮถ : K} [NeZero n] [CharZero K] [IsCyclotomicExtension {n} โ K] (hฮถ : IsPrimitiveRoot ฮถ n) : PowerBasis โค (NumberField.RingOfIntegers K) - IsPrimitiveRoot.subOneIntegralPowerBasis ๐ Mathlib.NumberTheory.NumberField.Cyclotomic.Basic
{n : โ} {K : Type u} [Field K] {ฮถ : K} [NeZero n] [CharZero K] [IsCyclotomicExtension {n} โ K] (hฮถ : IsPrimitiveRoot ฮถ n) : PowerBasis โค (NumberField.RingOfIntegers K) - IsPrimitiveRoot.integralPowerBasisOfPrimePow ๐ Mathlib.NumberTheory.NumberField.Cyclotomic.Basic
{p k : โ} {K : Type u} [Field K] {ฮถ : K} [hp : Fact (Nat.Prime p)] [CharZero K] [IsCyclotomicExtension {p ^ k} โ K] (hฮถ : IsPrimitiveRoot ฮถ (p ^ k)) : PowerBasis โค (NumberField.RingOfIntegers K) - IsPrimitiveRoot.subOneIntegralPowerBasisOfPrimePow ๐ Mathlib.NumberTheory.NumberField.Cyclotomic.Basic
{p k : โ} {K : Type u} [Field K] {ฮถ : K} [hp : Fact (Nat.Prime p)] [CharZero K] [IsCyclotomicExtension {p ^ k} โ K] (hฮถ : IsPrimitiveRoot ฮถ (p ^ k)) : PowerBasis โค (NumberField.RingOfIntegers K) - IsAdjoinRootMonic.powerBasis ๐ Mathlib.RingTheory.IsAdjoinRoot
{R : Type u} {S : Type v} [CommRing R] [Ring S] {f : Polynomial R} [Algebra R S] (h : IsAdjoinRootMonic S f) : PowerBasis R S
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