Documentation

ToCslib.Order.SumOmegaCompletePartialOrder

Disjoint sums of omega-CPOs #

The default sum order keeps the two tags incomparable. Every increasing sequence stays in its initial summand, so its supremum can be computed there.

theorem Sum.chain_eq_inl {α : Type u_1} {β : Type u_2} [OmegaCompletePartialOrder α] [OmegaCompletePartialOrder β] (c : OmegaCompletePartialOrder.Chain (α ⊕ β)) {a : α} (h : c 0 = inl a) (n : ℕ) :
∃ (x : α), c n = inl x

A chain initially in the left summand stays there.

noncomputable def Sum.inlChain {α : Type u_1} {β : Type u_2} [OmegaCompletePartialOrder α] [OmegaCompletePartialOrder β] (c : OmegaCompletePartialOrder.Chain (α ⊕ β)) {a : α} (h : c 0 = inl a) :

The left components of a chain in the left summand.

Equations
Instances For
    @[simp]
    theorem Sum.inl_inlChain {α : Type u_1} {β : Type u_2} [OmegaCompletePartialOrder α] [OmegaCompletePartialOrder β] (c : OmegaCompletePartialOrder.Chain (α ⊕ β)) {a : α} (h : c 0 = inl a) (n : ℕ) :
    inl ((inlChain c h) n) = c n

    A chain in the left summand has its least upper bound there.

    theorem Sum.exists_isLUB_chain {α : Type u_1} {β : Type u_2} [OmegaCompletePartialOrder α] [OmegaCompletePartialOrder β] (c : OmegaCompletePartialOrder.Chain (α ⊕ β)) :
    ∃ (x : α ⊕ β), IsLUB (Set.range ⇑c) x

    An increasing sequence in a disjoint sum has a least upper bound.

    @[instance_reducible]
    Equations

    A chain in the left summand has its supremum in the left summand.

    The left inclusion is continuous for the disjoint sum order.

    The right inclusion is continuous for the disjoint sum order.

    Case analysis on a disjoint sum is continuous when each branch is.

    noncomputable def Sum.elimContinuous {α : Type u_1} {β : Type u_2} [OmegaCompletePartialOrder α] [OmegaCompletePartialOrder β] {γ : Type u_3} [OmegaCompletePartialOrder γ] (f : α →𝒄 γ) (g : β →𝒄 γ) :
    α ⊕ β →𝒄 γ

    Continuous case analysis on a disjoint sum.

    Equations
    Instances For