Lexicographic sum of lattices #
This file proves that we can combine two lattices α
and β
into a lattice α ⊕ₗ β
where
everything in α
is declared smaller than everything in β
.
instance
Sum.Lex.instSemilatticeSup
{α : Type u_1}
{β : Type u_2}
[SemilatticeSup α]
[SemilatticeSup β]
:
SemilatticeSup (Lex (α ⊕ β))
Equations
- Sum.Lex.instSemilatticeSup = SemilatticeSup.mk ⋯ ⋯ ⋯
@[simp]
theorem
Sum.Lex.inl_sup
{α : Type u_1}
{β : Type u_2}
[SemilatticeSup α]
[SemilatticeSup β]
(a₁ : α)
(a₂ : α)
:
@[simp]
theorem
Sum.Lex.inr_sup
{α : Type u_1}
{β : Type u_2}
[SemilatticeSup α]
[SemilatticeSup β]
(b₁ : β)
(b₂ : β)
:
instance
Sum.Lex.instSemilatticeInf
{α : Type u_1}
{β : Type u_2}
[SemilatticeInf α]
[SemilatticeInf β]
:
SemilatticeInf (Lex (α ⊕ β))
Equations
- Sum.Lex.instSemilatticeInf = SemilatticeInf.mk ⋯ ⋯ ⋯
@[simp]
theorem
Sum.Lex.inl_inf
{α : Type u_1}
{β : Type u_2}
[SemilatticeInf α]
[SemilatticeInf β]
(a₁ : α)
(a₂ : α)
:
@[simp]
theorem
Sum.Lex.inr_inf
{α : Type u_1}
{β : Type u_2}
[SemilatticeInf α]
[SemilatticeInf β]
(b₁ : β)
(b₂ : β)
:
def
Sum.Lex.inlLatticeHom
{α : Type u_1}
{β : Type u_2}
[Lattice α]
[Lattice β]
:
LatticeHom α (Lex (α ⊕ β))
Sum.Lex.inlₗ
as a lattice homomorphism.
Equations
- Sum.Lex.inlLatticeHom = { toFun := Sum.inlₗ, map_sup' := ⋯, map_inf' := ⋯ }
Instances For
def
Sum.Lex.inrLatticeHom
{α : Type u_1}
{β : Type u_2}
[Lattice α]
[Lattice β]
:
LatticeHom β (Lex (α ⊕ β))
Sum.Lex.inrₗ
as a lattice homomorphism.
Equations
- Sum.Lex.inrLatticeHom = { toFun := Sum.inrₗ, map_sup' := ⋯, map_inf' := ⋯ }
Instances For
instance
Sum.Lex.instDistribLattice
{α : Type u_1}
{β : Type u_2}
[DistribLattice α]
[DistribLattice β]
:
DistribLattice (Lex (α ⊕ β))
Equations
- Sum.Lex.instDistribLattice = DistribLattice.mk ⋯