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 : ℕ) :
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.
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 : ℕ) :
theorem Sum.isLUB_inlChain {α : Type u_1} {β : Type u_2} [OmegaCompletePartialOrder α] [OmegaCompletePartialOrder β] (c : OmegaCompletePartialOrder.Chain (α ⊕ β)) {a : α} (h : c 0 = inl a) :
IsLUB (Set.range ⇑c) (inl (OmegaCompletePartialOrder.ωSup (inlChain c h)))
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 (α ⊕ β)) :
An increasing sequence in a disjoint sum has a least upper bound.
@[instance_reducible]
noncomputable instance Sum.omegaCompletePartialOrder {α : Type u_1} {β : Type u_2} [OmegaCompletePartialOrder α] [OmegaCompletePartialOrder β] :
OmegaCompletePartialOrder (α ⊕ β)
Equations
- Sum.omegaCompletePartialOrder = { toPartialOrder := Sum.instPartialOrder, ωSup := fun (c : OmegaCompletePartialOrder.Chain (α ⊕ β)) => ⋯.choose, le_ωSup := ⋯, ωSup_le := ⋯ }
theorem Sum.ωSup_eq_inl {α : Type u_1} {β : Type u_2} [OmegaCompletePartialOrder α] [OmegaCompletePartialOrder β] (c : OmegaCompletePartialOrder.Chain (α ⊕ β)) {a : α} (h : c 0 = inl a) :
A chain in the left summand has its supremum in the left summand.
theorem Sum.ωScottContinuous_inl {α : Type u_1} {β : Type u_2} [OmegaCompletePartialOrder α] [OmegaCompletePartialOrder β] :
The left inclusion is continuous for the disjoint sum order.
theorem Sum.ωScottContinuous_swap {α : Type u_1} {β : Type u_2} [OmegaCompletePartialOrder α] [OmegaCompletePartialOrder β] :
Swapping the two summands is continuous.
theorem Sum.ωScottContinuous_inr {α : Type u_1} {β : Type u_2} [OmegaCompletePartialOrder α] [OmegaCompletePartialOrder β] :
The right inclusion is continuous for the disjoint sum order.
theorem Sum.ωScottContinuous_elim {α : Type u_1} {β : Type u_2} [OmegaCompletePartialOrder α] [OmegaCompletePartialOrder β] {γ : Type u_3} [OmegaCompletePartialOrder γ] (f : α →𝒄 γ) (g : β →𝒄 γ) :
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.