forked from CMU-HoTT/serre-finiteness
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathSerreFinitenessTheorem.agda
43 lines (35 loc) · 1.41 KB
/
SerreFinitenessTheorem.agda
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
module SerreFinitenessTheorem where
open import Cubical.Data.Nat
open import Cubical.Data.Nat.Order
open import Cubical.Foundations.Everything
open import Cubical.Homotopy.Connected
private
variable
ℓ : Level
open import SAF
open import FPAbGroup
open import HomotopyGroups
open import ConnectedCover
open import CorollariesToHurewicz
open import CorollariesToGanea
isFPId : (X : Pointed ℓ) (n : ℕ) → isFP (πAb (suc n) (X ⦉ n ⦊)) ≡ isFP (πAb (suc n) X)
isFPId X n = λ i → isFP (πConnCov X n n ≤-refl i)
interleaved mutual
saf→isFPπ : (X : Pointed ℓ) (safX : saf X) (scX : isConnected 3 (typ X)) (n : ℕ)
→ isFP (πAb n X)
saf→saf⦉-⦊ : (X : Pointed ℓ) (safX : saf X) (scX : isConnected 3 (typ X)) (n : ℕ)
→ saf (X ⦉ n ⦊)
saf→isFPπ X safX scX 0 = saf→isFPBottomπ X safX 0 scX
saf→saf⦉-⦊ X safX scX 0 = transport (λ i → saf (1ConnCovEq X scX i)) safX
saf→isFPπ X safX scX (suc n) =
transport (isFPId X n) (saf→isFPBottomπ
(X ⦉ n ⦊)
(saf→saf⦉-⦊ X safX scX n)
(suc n)
(ConnCovIsConn X n))
saf→saf⦉-⦊ X safX scX (suc n) =
safTotal
(⦉-⦊EMFibSeq X n)
(Conn→ConnConnCov X 3 n scX)
(saf→saf⦉-⦊ X safX scX n)
(isFP→safEM (πAb n X) (saf→isFPπ X safX scX n) n)