Skip to content

Commit

Permalink
Maps in sequential diagrams of contractibles are equivalences
Browse files Browse the repository at this point in the history
  • Loading branch information
VojtechStep committed Apr 17, 2024
1 parent f4400b1 commit 19567ec
Showing 1 changed file with 23 additions and 0 deletions.
23 changes: 23 additions & 0 deletions src/synthetic-homotopy-theory/sequential-diagrams.lagda.md
Original file line number Diff line number Diff line change
Expand Up @@ -9,7 +9,9 @@ module synthetic-homotopy-theory.sequential-diagrams where
```agda
open import elementary-number-theory.natural-numbers

open import foundation.contractible-types
open import foundation.dependent-pair-types
open import foundation.equivalences
open import foundation.universe-levels
```

Expand Down Expand Up @@ -88,6 +90,27 @@ module _
pr2 postcomp-sequential-diagram n g x = map-sequential-diagram A n (g x)
```

### A sequential diagram of contractible types consists of equivalences

This is an easy corollary of the fact that every map between
[contractible types](foundation-core.contractible-types.md) is an
[equivalence](foundation-core.equivalences.md).

```agda
module _
{l1 : Level} {A : sequential-diagram l1}
where

is-equiv-sequential-diagram-is-contr :
((n : ℕ) is-contr (family-sequential-diagram A n))
(n : ℕ) is-equiv (map-sequential-diagram A n)
is-equiv-sequential-diagram-is-contr contrs n =
is-equiv-is-contr
( map-sequential-diagram A n)
( contrs n)
( contrs (succ-ℕ n))
```

## References

{{#bibliography}} {{#reference SDR20}}

0 comments on commit 19567ec

Please sign in to comment.