Norm for (finite) ring extensions #

Suppose we have an R-algebra S with a finite basis. For each s : S, the determinant of the linear map given by multiplying by s gives information about the roots of the minimal polynomial of s over R.

Implementation notes #

Typically, the norm is defined specifically for finite field extensions. The current definition is as general as possible and the assumption that we have fields or that the extension is finite is added to the lemmas as needed.

We only define the norm for left multiplication (Algebra.leftMulMatrix, i.e. LinearMap.mulLeft). For now, the definitions assume S is commutative, so the choice doesn't matter anyway.

See also Algebra.trace, which is defined similarly as the trace of Algebra.leftMulMatrix.

References #

noncomputable def Algebra.norm (R : Type u_1) {S : Type u_2} [] [Ring S] [Algebra R S] :
S →* R

The norm of an element s of an R-algebra is the determinant of (*) s.

Equations
• = LinearMap.det.comp ().toRingHom
Instances For
theorem Algebra.norm_apply (R : Type u_1) {S : Type u_2} [] [Ring S] [Algebra R S] (x : S) :
() x = LinearMap.det (() x)
theorem Algebra.norm_eq_one_of_not_exists_basis (R : Type u_1) {S : Type u_2} [] [Ring S] [Algebra R S] (h : ¬∃ (s : ), Nonempty (Basis { x : S // x s } R S)) (x : S) :
() x = 1
theorem Algebra.norm_eq_one_of_not_module_finite {R : Type u_1} {S : Type u_2} [] [Ring S] [Algebra R S] (h : ¬) (x : S) :
() x = 1
theorem Algebra.norm_eq_matrix_det {R : Type u_1} {S : Type u_2} [] [Ring S] [Algebra R S] {ι : Type w} [] [] (b : Basis ι R S) (s : S) :
() s = ().det
theorem Algebra.norm_algebraMap_of_basis {R : Type u_1} {S : Type u_2} [] [Ring S] [Algebra R S] {ι : Type w} [] (b : Basis ι R S) (x : R) :
() (() x) =

If x is in the base ring K, then the norm is x ^ [L : K].

@[simp]
theorem Algebra.norm_algebraMap {K : Type u_4} [] {L : Type u_7} [Ring L] [Algebra K L] (x : K) :
() (() x) =

If x is in the base field K, then the norm is x ^ [L : K].

(If L is not finite-dimensional over K, then norm = 1 = x ^ 0 = x ^ (finrank L K).)

theorem Algebra.PowerBasis.norm_gen_eq_coeff_zero_minpoly {R : Type u_1} {S : Type u_2} [] [Ring S] [Algebra R S] (pb : ) :
() pb.gen = (-1) ^ pb.dim * (minpoly R pb.gen).coeff 0

Given pb : PowerBasis K S, then the norm of pb.gen is (-1) ^ pb.dim * coeff (minpoly K pb.gen) 0.

theorem Algebra.PowerBasis.norm_gen_eq_prod_roots {R : Type u_1} {S : Type u_2} [] [Ring S] [Algebra R S] {F : Type u_6} [] [Algebra R F] (pb : ) (hf : Polynomial.Splits () (minpoly R pb.gen)) :
() (() pb.gen) = ((minpoly R pb.gen).aroots F).prod

Given pb : PowerBasis R S, then the norm of pb.gen is ((minpoly R pb.gen).aroots F).prod.

@[simp]
theorem Algebra.norm_zero {R : Type u_1} {S : Type u_2} [] [Ring S] [Algebra R S] [] [] [] :
() 0 = 0
@[simp]
theorem Algebra.norm_eq_zero_iff {R : Type u_1} {S : Type u_2} [] [Ring S] [Algebra R S] [] [] [] [] {x : S} :
() x = 0 x = 0
theorem Algebra.norm_ne_zero_iff {R : Type u_1} {S : Type u_2} [] [Ring S] [Algebra R S] [] [] [] [] {x : S} :
() x 0 x 0
@[simp]
theorem Algebra.norm_eq_zero_iff' {R : Type u_1} {S : Type u_2} [] [Ring S] [Algebra R S] [] [] [] [] {x : S} :
LinearMap.det (() x) = 0 x = 0

This is Algebra.norm_eq_zero_iff composed with Algebra.norm_apply.

theorem Algebra.norm_eq_zero_iff_of_basis {R : Type u_1} {S : Type u_2} [] [Ring S] [Algebra R S] {ι : Type w} [] [] [] (b : Basis ι R S) {x : S} :
() x = 0 x = 0
theorem Algebra.norm_ne_zero_iff_of_basis {R : Type u_1} {S : Type u_2} [] [Ring S] [Algebra R S] {ι : Type w} [] [] [] (b : Basis ι R S) {x : S} :
() x 0 x 0
theorem Algebra.norm_eq_norm_adjoin (K : Type u_4) {L : Type u_5} [] [] [Algebra K L] [] [] (x : L) :
() x = ^ FiniteDimensional.finrank (Kx) L
theorem IntermediateField.AdjoinSimple.norm_gen_eq_one {K : Type u_4} {L : Type u_5} [] [] [Algebra K L] {x : L} (hx : ¬) :
= 1
theorem IntermediateField.AdjoinSimple.norm_gen_eq_prod_roots {K : Type u_4} {L : Type u_5} {F : Type u_6} [] [] [] [Algebra K L] [Algebra K F] (x : L) (hf : Polynomial.Splits () (minpoly K x)) :
() () = ((minpoly K x).aroots F).prod
theorem Algebra.norm_eq_prod_embeddings_gen {R : Type u_1} {S : Type u_2} [] [Ring S] [Algebra R S] (F : Type u_6) [] [Algebra R F] (pb : ) (hE : Polynomial.Splits () (minpoly R pb.gen)) (hfx : (minpoly R pb.gen).Separable) :
() (() pb.gen) = σ : S →ₐ[R] F, σ pb.gen
theorem Algebra.norm_eq_prod_roots {K : Type u_4} {L : Type u_5} (F : Type u_6) [] [] [] [Algebra K L] [Algebra K F] [] [] {x : L} (hF : Polynomial.Splits () (minpoly K x)) :
() (() x) = ((minpoly K x).aroots F).prod ^ FiniteDimensional.finrank (Kx) L
theorem Algebra.prod_embeddings_eq_finrank_pow {K : Type u_4} {L : Type u_5} (F : Type u_6) [] [] [] [Algebra K L] [Algebra K F] (E : Type u_7) [] [Algebra K E] [Algebra L F] [] [] [] [] (pb : ) :
σ : F →ₐ[K] E, σ (() pb.gen) = (σ : L →ₐ[K] E, σ pb.gen) ^
theorem Algebra.norm_eq_prod_embeddings (K : Type u_4) {L : Type u_5} [] [] [Algebra K L] (E : Type u_7) [] [Algebra K E] [] [] [] (x : L) :
() (() x) = σ : L →ₐ[K] E, σ x

For L/K a finite separable extension of fields and E an algebraically closed extension of K, the norm (down to K) of an element x of L is equal to the product of the images of x over all the K-embeddings σ of L into E.

theorem Algebra.norm_eq_prod_automorphisms (K : Type u_4) {L : Type u_5} [] [] [Algebra K L] [] [IsGalois K L] (x : L) :
() (() x) = σ : L ≃ₐ[K] L, σ x
theorem Algebra.isIntegral_norm {R : Type u_1} [] (K : Type u_4) {L : Type u_5} [] [] [Algebra K L] [Algebra R L] [Algebra R K] [] [] [] {x : L} (hx : ) :
IsIntegral R (() x)
theorem Algebra.norm_eq_of_algEquiv {R : Type u_1} {S : Type u_2} {T : Type u_3} [] [Ring S] [Algebra R S] [Ring T] [Algebra R T] (e : S ≃ₐ[R] T) (x : S) :
() (e x) = () x
theorem Algebra.norm_eq_of_ringEquiv {A : Type u_8} {B : Type u_9} {C : Type u_10} [] [] [Ring C] [Algebra A C] [Algebra B C] (e : A ≃+* B) (he : ().comp e = ) (x : C) :
e (() x) = () x
theorem Algebra.norm_eq_of_equiv_equiv {A₁ : Type u_8} {B₁ : Type u_9} {A₂ : Type u_10} {B₂ : Type u_11} [CommRing A₁] [Ring B₁] [CommRing A₂] [Ring B₂] [Algebra A₁ B₁] [Algebra A₂ B₂] (e₁ : A₁ ≃+* A₂) (e₂ : B₁ ≃+* B₂) (he : (algebraMap A₂ B₂).comp e₁ = (e₂).comp (algebraMap A₁ B₁)) (x : B₁) :
() x = e₁.symm (() (e₂ x))
theorem Algebra.norm_norm (K : Type u_4) (L : Type u_5) {F : Type u_6} [] [] [] [Algebra K L] [Algebra K F] [Algebra L F] [] [] (x : F) :
() (() x) = () x