In (book) HoTT, A type X is n-connected iff its truncation is contraction.
For any X there is a “best possible” n-type with map
For any other n-type Y,
Examples: for any - The hSet truncation of FinSet.
Thm: is the image of
X is:
- -2 connected in all cases.
- -1 connected iff X is inhabited
- 0 connected iff has one connected component.
Thm: X is n-connected iff for every n-truncation f
Thm if X is n-connected then its suspension S X is (n + 1)-connected. Proof Suppose Y is an n+1 - type
Corollory: is n-connected (n=1 : then all loops are contractable)
Serre class Theorem
Infinity-connected
X is infinity connected iff X is n-connected for all .
X is infinity tuncated iff A orth X for all -connected A
Theorem If countable choice holds then can define
Open problem: Can it be defined in general
Fact there is a model where S^2 is not -truncated