The category of bounded distributive lattices #
This defines BoundedDistribLattice
, the category of bounded distributive lattices.
Note that this category is sometimes called DistLat
when
being a lattice is understood to entail having a bottom and a top element.
- to_DistribLattice : DistribLattice
- is_bounded_order : bounded_order ↥(self.to_DistribLattice)
The category of bounded distributive lattices with bounded lattice morphisms.
Instances for BoundedDistribLattice
- BoundedDistribLattice.has_sizeof_inst
- BoundedDistribLattice.has_coe_to_sort
- BoundedDistribLattice.inhabited
- BoundedDistribLattice.category_theory.large_category
- BoundedDistribLattice.category_theory.concrete_category
- BoundedDistribLattice.has_forget_to_DistribLattice
- BoundedDistribLattice.has_forget_to_BoundedLattice
- BoolAlg.has_forget_to_BoundedDistribLattice
@[protected, instance]
Equations
- BoundedDistribLattice.has_coe_to_sort = {coe := λ (X : BoundedDistribLattice), ↥(X.to_DistribLattice)}
@[protected, instance]
Equations
Construct a bundled BoundedDistribLattice
from a bounded_order
distrib_lattice
.
Equations
- BoundedDistribLattice.of α = BoundedDistribLattice.mk {α := α, str := _inst_1}
@[simp]
theorem
BoundedDistribLattice.coe_of
(α : Type u_1)
[distrib_lattice α]
[bounded_order α] :
↥(BoundedDistribLattice.of α) = α
@[protected, instance]
Turn a BoundedDistribLattice
into a BoundedLattice
by forgetting it is distributive.
Equations
@[simp]
theorem
BoundedDistribLattice.coe_to_BoundedLattice
(X : BoundedDistribLattice) :
↥(X.to_BoundedLattice) = ↥X
@[protected, instance]
@[protected, instance]
Equations
- BoundedDistribLattice.has_forget_to_DistribLattice = {forget₂ := {obj := λ (X : BoundedDistribLattice), {α := ↥X, str := X.distrib_lattice}, map := λ (X Y : BoundedDistribLattice), bounded_lattice_hom.to_lattice_hom, map_id' := BoundedDistribLattice.has_forget_to_DistribLattice._proof_1, map_comp' := BoundedDistribLattice.has_forget_to_DistribLattice._proof_2}, forget_comp := BoundedDistribLattice.has_forget_to_DistribLattice._proof_3}
@[simp]
@[simp]
theorem
BoundedDistribLattice.iso.mk_inv
{α β : BoundedDistribLattice}
(e : ↥α ≃o ↥β) :
(BoundedDistribLattice.iso.mk e).inv = ↑(e.symm)
Constructs an equivalence between bounded distributive lattices from an order isomorphism between them.
Equations
- BoundedDistribLattice.iso.mk e = {hom := ↑e, inv := ↑(e.symm), hom_inv_id' := _, inv_hom_id' := _}
order_dual
as a functor.
Equations
- BoundedDistribLattice.dual = {obj := λ (X : BoundedDistribLattice), BoundedDistribLattice.of (↥X)ᵒᵈ, map := λ (X Y : BoundedDistribLattice), ⇑bounded_lattice_hom.dual, map_id' := BoundedDistribLattice.dual._proof_1, map_comp' := BoundedDistribLattice.dual._proof_2}
@[simp]
@[simp]
theorem
BoundedDistribLattice.dual_map
(X Y : BoundedDistribLattice)
(ᾰ : bounded_lattice_hom ↥(X.to_BoundedLattice) ↥(Y.to_BoundedLattice)) :
The equivalence between BoundedDistribLattice
and itself induced by order_dual
both ways.
Equations
- BoundedDistribLattice.dual_equiv = category_theory.equivalence.mk BoundedDistribLattice.dual BoundedDistribLattice.dual (category_theory.nat_iso.of_components (λ (X : BoundedDistribLattice), BoundedDistribLattice.iso.mk (order_iso.dual_dual ↥X)) BoundedDistribLattice.dual_equiv._proof_1) (category_theory.nat_iso.of_components (λ (X : BoundedDistribLattice), BoundedDistribLattice.iso.mk (order_iso.dual_dual ↥X)) BoundedDistribLattice.dual_equiv._proof_2)