Horns as colimits #
In this file, we express horns as colimits:
- horns in
Δ[2]are pushouts of two copies ofΔ[1].
theorem
SSet.horn₂₀.sq :
(stdSimplex.face {0}).BicartSq (stdSimplex.face {0, 1}) (stdSimplex.face {0, 2}) (horn 2 0)
@[reducible, inline]
The inclusion Δ[1] ⟶ Λ[2, 0] which avoids 2.
Equations
Instances For
@[reducible, inline]
The inclusion Δ[1] ⟶ Λ[2, 0] which avoids 1.
Equations
Instances For
theorem
SSet.horn₂₁.sq :
(stdSimplex.face {1}).BicartSq (stdSimplex.face {0, 1}) (stdSimplex.face {1, 2}) (horn 2 1)
@[reducible, inline]
The inclusion Δ[1] ⟶ Λ[2, 1] which avoids 2.
Equations
Instances For
@[reducible, inline]
The inclusion Δ[1] ⟶ Λ[2, 1] which avoids 0.
Equations
Instances For
theorem
SSet.horn₂₂.sq :
(stdSimplex.face {2}).BicartSq (stdSimplex.face {0, 2}) (stdSimplex.face {1, 2}) (horn 2 2)
@[reducible, inline]
The inclusion Δ[1] ⟶ Λ[2, 2] which avoids 1.
Equations
Instances For
@[reducible, inline]
The inclusion Δ[1] ⟶ Λ[2, 2] which avoids 0.