Theorems · Theorem · linear algebra

LinearMap.polyCharpoly_natDegree

∀ {R : Type u_1} {L : Type u_2} {M : Type u_3} {ι : Type u_5} [inst : CommRing R] [inst_1 : AddCommGroup L]
  [inst_2 : Module R L] [inst_3 : AddCommGroup M] [inst_4 : Module R M] (φ : L →ₗ[R] Module.End R M)
  [inst_5 : Fintype ι] [inst_6 : DecidableEq ι] [inst_7 : Module.Free R M] [inst_8 : Module.Finite R M]
  (b : Module.Basis ι R L) [Nontrivial R], (φ.polyCharpoly b).natDegree = Module.finrank R M

Defined in

Mathlib.Algebra.Module.LinearMap.Polynomial

Cited by

2 results in Mathlib

Foundations

Depth 120 from the axioms · uses propext, Classical.choice, Quot.sound

Assumes

CommRingAddCommGroupModuleAddCommGroupModuleFintypeDecidableEqModule.FreeModule.FiniteNontrivial