Documentation

Mathlib.Algebra.Module.Lattice.Full

Full lattices #

A lattice in an A-module V is full if its A-span is all of V.

Main definitions #

Main statements #

class Submodule.IsFullLattice {R : Type u_1} [CommRing R] (A : Type u_2) [CommRing A] [Algebra R A] {V : Type u_3} [AddCommGroup V] [Module R V] [Module A V] [IsScalarTower R A V] (M : Submodule R V) extends Submodule.IsLattice A M :

A lattice that spans V over A.

Instances
    noncomputable def Module.Basis.extendOfIsFullLattice {R : Type u_1} [CommRing R] (A : Type u_2) [CommRing A] [Algebra R A] {V : Type u_3} [AddCommGroup V] [Module R V] [Module A V] [IsScalarTower R A V] {M : Submodule R V} [Submodule.IsFullLattice A M] {ι : Type u_4} (b : Basis ι R ↥M) :
    Basis ι A V

    Any basis of a full R-lattice in V defines a A-basis of V.

    Equations
    Instances For
      @[simp]
      theorem Module.Basis.extendOfIsFullLattice_apply {R : Type u_1} [CommRing R] (A : Type u_2) [CommRing A] [Algebra R A] {V : Type u_3} [AddCommGroup V] [Module R V] [Module A V] [IsScalarTower R A V] {M : Submodule R V} [Submodule.IsFullLattice A M] {ι : Type u_4} (b : Basis ι R ↥M) (k : ι) :
      (extendOfIsFullLattice A b) k = ↑(b k)
      theorem Submodule.IsFullLattice.of_le {R : Type u_1} [CommRing R] (A : Type u_2) [CommRing A] [Algebra R A] {V : Type u_3} [AddCommGroup V] [Module R V] [Module A V] [IsScalarTower R A V] {M N : Submodule R V} (hle : M ≤ N) [IsFullLattice A M] [IsLattice A N] :

      A lattice containing a full lattice is itself full.

      instance Submodule.IsFullLattice.smul {R : Type u_1} [CommRing R] (A : Type u_2) [CommRing A] [Algebra R A] {V : Type u_3} [AddCommGroup V] [Module R V] [Module A V] [IsScalarTower R A V] (M : Submodule R V) [IsFullLattice A M] (a : Aˣ) :

      The action of Aˣ on R-submodules of V preserves IsFullLattice.

      theorem Submodule.IsFullLattice.rank_eq {R : Type u_1} [CommRing R] (K : Type u_2) [Field K] [Algebra R K] [FaithfulSMul R K] {V : Type u_3} [AddCommGroup V] [Module R V] [Module K V] [IsScalarTower R K V] (M : Submodule R V) [IsFullLattice K M] :

      The R-rank of a full lattice equals the K-rank of the ambient module.

      theorem Submodule.IsFullLattice.finrank_eq {R : Type u_1} [CommRing R] (K : Type u_2) [Field K] [Algebra R K] [FaithfulSMul R K] {V : Type u_3} [AddCommGroup V] [Module R V] [Module K V] [IsScalarTower R K V] (M : Submodule R V) [IsFullLattice K M] :

      The R-finrank of a full lattice equals the K-finrank of the ambient module.

      theorem Submodule.IsFullLattice.of_finrank_le {R : Type u_1} [CommRing R] (K : Type u_2) [Field K] [Algebra R K] [FaithfulSMul R K] {V : Type u_3} [AddCommGroup V] [Module R V] [Module K V] [IsScalarTower R K V] (M : Submodule R V) [Module.Finite K V] [IsLattice K M] (hr : Module.finrank K V ≤ Module.finrank R ↥M) :

      A lattice whose R-finrank is at least the K-finrank of a finite-dimensional ambient module is full.

      theorem Submodule.IsFullLattice.of_rank_le {R : Type u_1} [CommRing R] (K : Type u_2) [Field K] [Algebra R K] [FaithfulSMul R K] {V : Type u_3} [AddCommGroup V] [Module R V] [Module K V] [IsScalarTower R K V] (M : Submodule R V) [IsLattice K M] (hr : Module.rank K V ≤ Module.rank R ↥M) :

      A lattice whose R-rank is at least the K-rank of a finite-dimensional ambient module is full.

      instance Submodule.IsFullLattice.sup {R : Type u_1} [CommRing R] (K : Type u_4) [Field K] [Algebra R K] [IsFractionRing R K] {V : Type u_5} [AddCommGroup V] [Module R V] [Module K V] [IsScalarTower R K V] (M N : Submodule R V) [IsFullLattice K M] [IsFullLattice K N] :
      IsFullLattice K (M ⊔ N)

      If K is the field of fractions of R, the supremum of two full lattices is a full lattice.

      theorem Submodule.IsFullLattice.of_le_of_fg {R : Type u_1} [CommRing R] (K : Type u_4) [Field K] [Algebra R K] [IsFractionRing R K] {V : Type u_5} [AddCommGroup V] [Module R V] [Module K V] [IsScalarTower R K V] {M N : Submodule R V} (hle : M ≤ N) [IsFullLattice K M] (hfg : N.FG) :

      If K is the field of fractions of R, any finitely generated R-submodule of V containing a full lattice is a full lattice.

      instance Submodule.IsFullLattice.inf {R : Type u_1} [CommRing R] (K : Type u_4) [Field K] [Algebra R K] [IsFractionRing R K] {V : Type u_5} [AddCommGroup V] [Module R V] [Module K V] [IsScalarTower R K V] [IsDomain R] [IsNoetherianRing R] (M N : Submodule R V) [IsFullLattice K M] [IsFullLattice K N] :
      IsFullLattice K (M ⊓ N)

      If K is the field of fractions of R, the intersection of two full lattices is a full lattice.

      @[deprecated Submodule.IsFullLattice.of_le_of_fg (since := "2026-10-27")]
      theorem Submodule.IsLattice.of_le_of_isLattice_of_fg {R : Type u_1} [CommRing R] (K : Type u_4) [Field K] [Algebra R K] [IsFractionRing R K] {V : Type u_5} [AddCommGroup V] [Module R V] [Module K V] [IsScalarTower R K V] {M N : Submodule R V} (hle : M ≤ N) [IsFullLattice K M] (hfg : N.FG) :

      Alias of Submodule.IsFullLattice.of_le_of_fg.


      If K is the field of fractions of R, any finitely generated R-submodule of V containing a full lattice is a full lattice.

      @[deprecated Submodule.IsFullLattice.of_rank_le (since := "2026-10-27")]
      theorem Submodule.IsLattice.of_rank_le {R : Type u_1} [CommRing R] (K : Type u_2) [Field K] [Algebra R K] [FaithfulSMul R K] {V : Type u_3} [AddCommGroup V] [Module R V] [Module K V] [IsScalarTower R K V] (M : Submodule R V) [IsLattice K M] (hr : Module.rank K V ≤ Module.rank R ↥M) :

      Alias of Submodule.IsFullLattice.of_rank_le.


      A lattice whose R-rank is at least the K-rank of a finite-dimensional ambient module is full.

      @[deprecated Submodule.IsFullLattice.rank_eq (since := "2026-10-27")]
      theorem Submodule.IsLattice.rank' {R : Type u_1} [CommRing R] (K : Type u_2) [Field K] [Algebra R K] [FaithfulSMul R K] {V : Type u_3} [AddCommGroup V] [Module R V] [Module K V] [IsScalarTower R K V] (M : Submodule R V) [IsFullLattice K M] :

      Alias of Submodule.IsFullLattice.rank_eq.


      The R-rank of a full lattice equals the K-rank of the ambient module.

      @[deprecated "Use `IsFullLattice.rank` and `rank_fun'`." (since := "2026-10-27")]
      theorem Submodule.IsLattice.rank_of_pi {R : Type u_1} [CommRing R] (K : Type u_2) [Field K] [Algebra R K] [FaithfulSMul R K] {ι : Type u_3} [Fintype ι] (M : Submodule R (ι → K)) [IsFullLattice K M] :
      Module.rank R ↥M = ↑(Fintype.card ι)
      @[deprecated "Use `IsFullLattice.finrank` and `Module.finrank_fintype_fun_eq_card`." (since := "2026-10-27")]
      theorem Submodule.IsLattice.finrank_of_pi {R : Type u_1} [CommRing R] (K : Type u_2) [Field K] [Algebra R K] [FaithfulSMul R K] {ι : Type u_3} [Fintype ι] (M : Submodule R (ι → K)) [IsFullLattice K M] :
      @[deprecated Submodule.IsFullLattice.span_eq_top (since := "2026-10-27")]
      theorem Submodule.IsLattice.span_eq_top {R : Type u_1} {inst✝ : CommRing R} {A : Type u_2} {inst✝¹ : CommRing A} {inst✝² : Algebra R A} {V : Type u_3} {inst✝³ : AddCommGroup V} {inst✝⁴ : Module R V} {inst✝⁵ : Module A V} {inst✝⁶ : IsScalarTower R A V} {M : Submodule R V} [self : IsFullLattice A M] :
      span A ↑M = ⊤

      Alias of Submodule.IsFullLattice.span_eq_top.

      @[deprecated Submodule.IsFullLattice.inf (since := "2026-10-27")]
      theorem Submodule.IsLattice.inf {R : Type u_1} [CommRing R] (K : Type u_4) [Field K] [Algebra R K] [IsFractionRing R K] {V : Type u_5} [AddCommGroup V] [Module R V] [Module K V] [IsScalarTower R K V] [IsDomain R] [IsNoetherianRing R] (M N : Submodule R V) [IsFullLattice K M] [IsFullLattice K N] :
      IsFullLattice K (M ⊓ N)

      Alias of Submodule.IsFullLattice.inf.


      If K is the field of fractions of R, the intersection of two full lattices is a full lattice.

      @[deprecated Module.Basis.extendOfIsFullLattice (since := "2026-10-27")]
      noncomputable def Module.Basis.extendOfIsLattice {R : Type u_1} [CommRing R] (A : Type u_2) [CommRing A] [Algebra R A] {V : Type u_3} [AddCommGroup V] [Module R V] [Module A V] [IsScalarTower R A V] {M : Submodule R V} [Submodule.IsFullLattice A M] {ι : Type u_4} (b : Basis ι R ↥M) :
      Basis ι A V

      Alias of Module.Basis.extendOfIsFullLattice.


      Any basis of a full R-lattice in V defines a A-basis of V.

      Equations
      Instances For
        @[deprecated Module.Basis.extendOfIsFullLattice_apply (since := "2026-10-27")]
        theorem Module.Basis.extendOfIsLattice_apply {R : Type u_1} [CommRing R] (A : Type u_2) [CommRing A] [Algebra R A] {V : Type u_3} [AddCommGroup V] [Module R V] [Module A V] [IsScalarTower R A V] {M : Submodule R V} [Submodule.IsFullLattice A M] {ι : Type u_4} (b : Basis ι R ↥M) (k : ι) :
        (extendOfIsFullLattice A b) k = ↑(b k)

        Alias of Module.Basis.extendOfIsFullLattice_apply.