Two-pointings #
This file defines TwoPointing α
, the type of two pointings of α
. A two-pointing is the data of
two distinct terms.
This is morally a Type-valued Nontrivial
. Another type which is quite close in essence is Sym2
.
Categorically speaking, prod
is a cospan in the category of types. This forms the category of
bipointed types. Two-pointed types form a full subcategory of those.
References #
- [nLab, Coalgebra of the real interval] (https://ncatlab.org/nlab/show/coalgebra+of+the+real+interval)
Two-pointing of a type. This is a Type-valued termed Nontrivial
.
Instances For
theorem
TwoPointing.ext
{α : Type u_3}
{x y : TwoPointing α}
(fst : x.fst = y.fst)
(snd : x.snd = y.snd)
:
x = y
Equations
- instDecidableEqTwoPointing = decEqTwoPointing✝
Swaps the two pointed elements.
Equations
- p.swap = { toProd := (p.snd, p.fst), fst_ne_snd := ⋯ }
Instances For
@[simp]
instance
TwoPointing.instNonemptyOfNontrivial
{α : Type u_1}
[Nontrivial α]
:
Nonempty (TwoPointing α)
Equations
- ⋯ = ⋯
@[simp]
theorem
TwoPointing.nonempty_two_pointing_iff
{α : Type u_1}
:
Nonempty (TwoPointing α) ↔ Nontrivial α
def
TwoPointing.pi
(α : Type u_1)
{β : Type u_2}
(q : TwoPointing β)
[Nonempty α]
:
TwoPointing (α → β)
The two-pointing of constant functions.
Equations
- TwoPointing.pi α q = { toProd := (fun (x : α) => q.fst, fun (x : α) => q.snd), fst_ne_snd := ⋯ }
Instances For
@[simp]
theorem
TwoPointing.pi_fst
(α : Type u_1)
{β : Type u_2}
(q : TwoPointing β)
[Nonempty α]
:
(TwoPointing.pi α q).fst = Function.const α q.fst
@[simp]
theorem
TwoPointing.pi_snd
(α : Type u_1)
{β : Type u_2}
(q : TwoPointing β)
[Nonempty α]
:
(TwoPointing.pi α q).snd = Function.const α q.snd
def
TwoPointing.prod
{α : Type u_1}
{β : Type u_2}
(p : TwoPointing α)
(q : TwoPointing β)
:
TwoPointing (α × β)
The product of two two-pointings.
Equations
- p.prod q = { toProd := ((p.fst, q.fst), p.snd, q.snd), fst_ne_snd := ⋯ }
Instances For
@[simp]
theorem
TwoPointing.prod_fst
{α : Type u_1}
{β : Type u_2}
(p : TwoPointing α)
(q : TwoPointing β)
:
(p.prod q).fst = (p.fst, q.fst)
@[simp]
theorem
TwoPointing.prod_snd
{α : Type u_1}
{β : Type u_2}
(p : TwoPointing α)
(q : TwoPointing β)
:
(p.prod q).snd = (p.snd, q.snd)
def
TwoPointing.sum
{α : Type u_1}
{β : Type u_2}
(p : TwoPointing α)
(q : TwoPointing β)
:
TwoPointing (α ⊕ β)
The sum of two pointings. Keeps the first point from the left and the second point from the right.
Instances For
@[simp]
@[simp]
The false
, true
two-pointing of Bool
.
Equations
- TwoPointing.bool = { toProd := (false, true), fst_ne_snd := Bool.false_ne_true }
Instances For
Equations
- TwoPointing.instInhabitedBool = { default := TwoPointing.bool }
The False
, True
two-pointing of Prop
.
Equations
- TwoPointing.prop = { toProd := (False, True), fst_ne_snd := false_ne_true }