Finite sets as a free join-semilattice #
The finite sets of a type are the free join-semilattice with a bottom on it: a function into such
a semilattice extends uniquely to a map out of the finite sets preserving
joins and the bottom, the join of the function over the set, and two such maps that
agree on singletons are equal. The extension of singleton is
the identity.
theorem
Finset.supBotHom_ext
{α : Type u_1}
{β : Type u_2}
[DecidableEq α]
[SemilatticeSup β]
[OrderBot β]
{f g : SupBotHom (Finset α) β}
(h : ∀ (a : α), f {a} = g {a})
:
f = g
Maps out of the finite sets of α that preserve joins and the bottom agree if they agree on
singletons.
theorem
Finset.supBotHom_ext_iff
{α : Type u_1}
{β : Type u_2}
[DecidableEq α]
[SemilatticeSup β]
[OrderBot β]
{f g : SupBotHom (Finset α) β}
:
f = g ↔ ∀ (a : α), f {a} = g {a}
def
Finset.supBotLift
{α : Type u_1}
{β : Type u_2}
[DecidableEq α]
[SemilatticeSup β]
[OrderBot β]
:
(α → β) ≃ SupBotHom (Finset α) β
A function into a join-semilattice with a bottom extends uniquely to a map out of the finite sets preserving joins and the bottom, the join of the function over the set.
Equations
- One or more equations did not get rendered due to their size.
Instances For
@[simp]
theorem
Finset.supBotLift_apply
{α : Type u_1}
{β : Type u_2}
[DecidableEq α]
[SemilatticeSup β]
[OrderBot β]
(g : α → β)
(s : Finset α)
:
(supBotLift g) s = s.sup g
theorem
Finset.supBotLift_singleton
{α : Type u_1}
{β : Type u_2}
[DecidableEq α]
[SemilatticeSup β]
[OrderBot β]
(g : α → β)
(a : α)
:
(supBotLift g) {a} = g a
@[simp]
theorem
Finset.supBotLift_symm_apply
{α : Type u_1}
{β : Type u_2}
[DecidableEq α]
[SemilatticeSup β]
[OrderBot β]
(f : SupBotHom (Finset α) β)
(a : α)
:
supBotLift.symm f a = f {a}
@[simp]
theorem
Finset.coe_supBotLift_singleton
{α : Type u_1}
[DecidableEq α]
:
⇑(supBotLift singleton) = id
The extension of singleton is the identity.