Documentation

Linglib.Core.Order.Ortholattice.Hom

Ortholattice homomorphisms #

An ortholattice homomorphism is a bounded lattice homomorphism that preserves the complement. Between Boolean algebras every bounded lattice homomorphism is one, since complements there are unique; between ortholattices preserving the complement is a further condition. A map that preserves meets, the top and the complement is an ortholattice homomorphism, by De Morgan.

We use the DFunLike design, so the type of morphisms has a companion typeclass which is meant to be satisfied by itself and all stricter types.

Implementation notes #

The definitions assume only a Compl on each side, as mathlib's SupHom assumes only Max, so that they apply to the lattices with an involution of Core/Order/InvolutiveCompl.lean as well as to ortholattices. The class field OrtholatticeHomClass.map_compl is not exported: the root name map_compl is mathlib's lemma for Heyting homomorphisms.

[UPSTREAM] candidate, beside Mathlib/Order/Heyting/Hom.lean.

structure OrtholatticeHom (α : Type u_6) (β : Type u_7) [Lattice α] [BoundedOrder α] [Compl α] [Lattice β] [BoundedOrder β] [Compl β] extends BoundedLatticeHom α β :
Type (max u_6 u_7)

The type of ortholattice homomorphisms from α to β: bounded lattice homomorphisms that preserve the complement.

Instances For
    class OrtholatticeHomClass (F : Type u_6) (α : Type u_7) (β : Type u_8) [Lattice α] [BoundedOrder α] [Compl α] [Lattice β] [BoundedOrder β] [Compl β] [FunLike F α β] extends BoundedLatticeHomClass F α β :

    OrtholatticeHomClass F α β states that F is a type of ortholattice homomorphisms.

    You should extend this class when you extend OrtholatticeHom.

    • map_sup (f : F) (a b : α) : f (a ⊔ b) = f a ⊔ f b
    • map_inf (f : F) (a b : α) : f (a ⊓ b) = f a ⊓ f b
    • map_top (f : F) : f ⊤ = ⊤
    • map_bot (f : F) : f ⊥ = ⊥
    • map_compl (f : F) (a : α) : f aᶜ = (f a)ᶜ

      An ortholattice homomorphism preserves the complement.

    Instances
      @[instance 100]
      instance BoundedLatticeHomClass.toOrtholatticeHomClass {F : Type u_1} {α : Type u_2} {β : Type u_3} [BooleanAlgebra α] [BooleanAlgebra β] [FunLike F α β] [BoundedLatticeHomClass F α β] :

      Between Boolean algebras every bounded lattice homomorphism preserves the complement.

      @[instance_reducible]
      instance OrtholatticeHom.instFunLike {α : Type u_2} {β : Type u_3} [Lattice α] [BoundedOrder α] [Compl α] [Lattice β] [BoundedOrder β] [Compl β] :
      FunLike (OrtholatticeHom α β) α β
      Equations
      instance OrtholatticeHom.instOrtholatticeHomClass {α : Type u_2} {β : Type u_3} [Lattice α] [BoundedOrder α] [Compl α] [Lattice β] [BoundedOrder β] [Compl β] :
      @[simp]
      theorem OrtholatticeHom.toFun_eq_coe {α : Type u_2} {β : Type u_3} [Lattice α] [BoundedOrder α] [Compl α] [Lattice β] [BoundedOrder β] [Compl β] (f : OrtholatticeHom α β) :
      f.toFun = ⇑f
      @[simp]
      theorem OrtholatticeHom.coe_toBoundedLatticeHom {α : Type u_2} {β : Type u_3} [Lattice α] [BoundedOrder α] [Compl α] [Lattice β] [BoundedOrder β] [Compl β] (f : OrtholatticeHom α β) :
      theorem OrtholatticeHom.ext {α : Type u_2} {β : Type u_3} [Lattice α] [BoundedOrder α] [Compl α] [Lattice β] [BoundedOrder β] [Compl β] {f g : OrtholatticeHom α β} (h : ∀ (a : α), f a = g a) :
      f = g
      theorem OrtholatticeHom.ext_iff {α : Type u_2} {β : Type u_3} [Lattice α] [BoundedOrder α] [Compl α] [Lattice β] [BoundedOrder β] [Compl β] {f g : OrtholatticeHom α β} :
      f = g ↔ ∀ (a : α), f a = g a
      def OrtholatticeHom.id (α : Type u_2) [Lattice α] [BoundedOrder α] [Compl α] :

      id as an OrtholatticeHom.

      Equations
      Instances For
        @[simp]
        theorem OrtholatticeHom.coe_id {α : Type u_2} [Lattice α] [BoundedOrder α] [Compl α] :
        ⇑(OrtholatticeHom.id α) = id
        @[simp]
        theorem OrtholatticeHom.id_apply {α : Type u_2} [Lattice α] [BoundedOrder α] [Compl α] (a : α) :
        @[instance_reducible]
        instance OrtholatticeHom.instInhabited {α : Type u_2} [Lattice α] [BoundedOrder α] [Compl α] :
        Inhabited (OrtholatticeHom α α)
        Equations
        def OrtholatticeHom.comp {α : Type u_2} {β : Type u_3} {γ : Type u_4} [Lattice α] [BoundedOrder α] [Compl α] [Lattice β] [BoundedOrder β] [Compl β] [Lattice γ] [BoundedOrder γ] [Compl γ] (f : OrtholatticeHom β γ) (g : OrtholatticeHom α β) :

        Composition of OrtholatticeHoms as an OrtholatticeHom.

        Equations
        Instances For
          @[simp]
          theorem OrtholatticeHom.coe_comp {α : Type u_2} {β : Type u_3} {γ : Type u_4} [Lattice α] [BoundedOrder α] [Compl α] [Lattice β] [BoundedOrder β] [Compl β] [Lattice γ] [BoundedOrder γ] [Compl γ] (f : OrtholatticeHom β γ) (g : OrtholatticeHom α β) :
          ⇑(f.comp g) = ⇑f ∘ ⇑g
          @[simp]
          theorem OrtholatticeHom.comp_apply {α : Type u_2} {β : Type u_3} {γ : Type u_4} [Lattice α] [BoundedOrder α] [Compl α] [Lattice β] [BoundedOrder β] [Compl β] [Lattice γ] [BoundedOrder γ] [Compl γ] (f : OrtholatticeHom β γ) (g : OrtholatticeHom α β) (a : α) :
          (f.comp g) a = f (g a)
          @[simp]
          theorem OrtholatticeHom.comp_assoc {α : Type u_2} {β : Type u_3} {γ : Type u_4} {δ : Type u_5} [Lattice α] [BoundedOrder α] [Compl α] [Lattice β] [BoundedOrder β] [Compl β] [Lattice γ] [BoundedOrder γ] [Compl γ] [Lattice δ] [BoundedOrder δ] [Compl δ] (f : OrtholatticeHom γ δ) (g : OrtholatticeHom β γ) (h : OrtholatticeHom α β) :
          (f.comp g).comp h = f.comp (g.comp h)
          @[simp]
          theorem OrtholatticeHom.comp_id {α : Type u_2} {β : Type u_3} [Lattice α] [BoundedOrder α] [Compl α] [Lattice β] [BoundedOrder β] [Compl β] (f : OrtholatticeHom α β) :
          @[simp]
          theorem OrtholatticeHom.id_comp {α : Type u_2} {β : Type u_3} [Lattice α] [BoundedOrder α] [Compl α] [Lattice β] [BoundedOrder β] [Compl β] (f : OrtholatticeHom α β) :
          def OrtholatticeHom.ofInfTopHom {α : Type u_2} {β : Type u_3} [Lattice α] [BoundedOrder α] [InvolutiveCompl α] [Lattice β] [BoundedOrder β] [InvolutiveCompl β] (f : InfTopHom α β) (map_compl : ∀ (a : α), f aᶜ = (f a)ᶜ) :

          A map between lattices with an involution that preserves meets, the top and the complement is an ortholattice homomorphism: it preserves joins and the bottom by De Morgan.

          Equations
          • OrtholatticeHom.ofInfTopHom f map_compl = { toFun := ⇑f, map_sup' := ⋯, map_inf' := ⋯, map_top' := ⋯, map_bot' := ⋯, map_compl' := map_compl }
          Instances For
            @[simp]
            theorem OrtholatticeHom.coe_ofInfTopHom {α : Type u_2} {β : Type u_3} [Lattice α] [BoundedOrder α] [InvolutiveCompl α] [Lattice β] [BoundedOrder β] [InvolutiveCompl β] (f : InfTopHom α β) (map_compl : ∀ (a : α), f aᶜ = (f a)ᶜ) :
            ⇑(ofInfTopHom f map_compl) = ⇑f