The augmented boundary poset of a poset space #
The incidence boundary of a T-space is obtained by adjoining a new root
below OrderDual T. We use a dedicated inductive type so that the index is
universe-polymorphic and its root/non-root decomposition remains literal.
The incidence relation on the root followed by the points of T.
Instances For
theorem
MagnitudeConjecture.PosetSpace.boundaryLE_refl
{T : Type u}
[Preorder T]
(q : Option T)
:
boundaryLE q q
theorem
MagnitudeConjecture.PosetSpace.boundaryLE_trans
{T : Type u}
[Preorder T]
{q r s : Option T}
:
boundaryLE q r → boundaryLE r s → boundaryLE q s
theorem
MagnitudeConjecture.PosetSpace.boundaryLE_antisymm
{T : Type u}
[PartialOrder T]
{q r : Option T}
(hqr : boundaryLE q r)
(hrq : boundaryLE r q)
:
q = r
A root adjoined below the dual of T.
- root {T : Type u} : BoundaryIndex T
- nonroot {T : Type u} (t : T) : BoundaryIndex T
Instances For
def
MagnitudeConjecture.PosetSpace.instDecidableEqBoundaryIndex.decEq
{T✝ : Type u_1}
[DecidableEq T✝]
(x✝ x✝¹ : BoundaryIndex T✝)
:
Decidable (x✝ = x✝¹)
Instances For
@[instance_reducible]
instance
MagnitudeConjecture.PosetSpace.instDecidableEqBoundaryIndex
{T✝ : Type u_1}
[DecidableEq T✝]
:
DecidableEq (BoundaryIndex T✝)
Forget the order tag on an augmented boundary index.
Instances For
def
MagnitudeConjecture.PosetSpace.BoundaryIndex.equivOption
{T : Type u}
:
BoundaryIndex T ≃ Option T
The underlying finite type is just Option T.
Instances For
@[instance_reducible]
noncomputable instance
MagnitudeConjecture.PosetSpace.instFintypeBoundaryIndex
{T : Type u}
[Fintype T]
:
Fintype (BoundaryIndex T)
@[simp]
@[simp]
theorem
MagnitudeConjecture.PosetSpace.BoundaryIndex.toOption_injective
{T : Type u}
:
Function.Injective toOption
@[instance_reducible]
instance
MagnitudeConjecture.PosetSpace.instPartialOrderBoundaryIndex
{T : Type u}
[PartialOrder T]
:
PartialOrder (BoundaryIndex T)
The augmented order is the boundary incidence relation. Its non-root
part is OrderDual T.
theorem
MagnitudeConjecture.PosetSpace.boundaryLE_toOption_iff_le
{T : Type u}
[PartialOrder T]
(q r : BoundaryIndex T)
:
boundaryLE q.toOption r.toOption ↔ q ≤ r