2017-07-04 11:57:46 +00:00
|
|
|
|
import homotopy.susp types.pointed2 ..move_to_lib
|
2017-03-23 00:02:53 +00:00
|
|
|
|
|
2017-07-17 14:39:49 +00:00
|
|
|
|
open susp eq pointed function is_equiv lift equiv is_trunc nat
|
2017-03-23 00:02:53 +00:00
|
|
|
|
|
|
|
|
|
namespace susp
|
2017-05-26 21:32:42 +00:00
|
|
|
|
variables {X X' Y Y' Z : Type*}
|
2017-07-17 14:39:49 +00:00
|
|
|
|
|
2017-07-20 17:01:22 +00:00
|
|
|
|
definition iterate_susp_iterate_susp_rev (n m : ℕ) (A : Type*) :
|
|
|
|
|
iterate_susp n (iterate_susp m A) ≃* iterate_susp (m + n) A :=
|
2017-03-28 16:07:18 +00:00
|
|
|
|
begin
|
|
|
|
|
induction n with n e,
|
|
|
|
|
{ reflexivity },
|
2017-07-20 17:01:22 +00:00
|
|
|
|
{ exact susp_pequiv e }
|
2017-03-28 16:07:18 +00:00
|
|
|
|
end
|
|
|
|
|
|
2017-07-20 17:01:22 +00:00
|
|
|
|
definition iterate_susp_pequiv [constructor] (n : ℕ) {X Y : Type*} (f : X ≃* Y) :
|
|
|
|
|
iterate_susp n X ≃* iterate_susp n Y :=
|
2017-03-28 16:07:18 +00:00
|
|
|
|
begin
|
|
|
|
|
induction n with n e,
|
|
|
|
|
{ exact f },
|
2017-07-20 17:01:22 +00:00
|
|
|
|
{ exact susp_pequiv e }
|
2017-03-28 16:07:18 +00:00
|
|
|
|
end
|
|
|
|
|
|
|
|
|
|
open algebra nat
|
2017-07-20 17:01:22 +00:00
|
|
|
|
definition iterate_susp_iterate_susp (n m : ℕ) (A : Type*) :
|
|
|
|
|
iterate_susp n (iterate_susp m A) ≃* iterate_susp (n + m) A :=
|
|
|
|
|
iterate_susp_iterate_susp_rev n m A ⬝e* pequiv_of_eq (ap (λk, iterate_susp k A) (add.comm m n))
|
2017-03-28 16:07:18 +00:00
|
|
|
|
|
2017-07-20 17:01:22 +00:00
|
|
|
|
definition plift_susp.{u v} : Π(A : Type*), plift.{u v} (susp A) ≃* susp (plift.{u v} A) :=
|
2017-06-06 17:54:42 +00:00
|
|
|
|
begin
|
|
|
|
|
intro A,
|
|
|
|
|
calc
|
2017-07-20 17:01:22 +00:00
|
|
|
|
plift.{u v} (susp A) ≃* susp A : by exact (pequiv_plift (susp A))⁻¹ᵉ*
|
|
|
|
|
... ≃* susp (plift.{u v} A) : by exact susp_pequiv (pequiv_plift.{u v} A)
|
2017-06-06 17:54:42 +00:00
|
|
|
|
end
|
|
|
|
|
|
2017-07-04 11:57:46 +00:00
|
|
|
|
definition is_contr_susp [instance] (A : Type) [H : is_contr A] : is_contr (susp A) :=
|
|
|
|
|
begin
|
|
|
|
|
apply is_contr.mk north,
|
|
|
|
|
intro x, induction x,
|
|
|
|
|
reflexivity,
|
|
|
|
|
exact merid !center,
|
|
|
|
|
apply eq_pathover_constant_left_id_right, apply square_of_eq,
|
|
|
|
|
exact whisker_left idp (ap merid !eq_of_is_contr)
|
|
|
|
|
end
|
|
|
|
|
|
2017-07-20 17:01:22 +00:00
|
|
|
|
definition loop_susp_pintro_phomotopy {X Y : Type*} {f g : ⅀ X →* Y} (p : f ~* g) :
|
|
|
|
|
loop_susp_pintro X Y f ~* loop_susp_pintro X Y g :=
|
|
|
|
|
pwhisker_right (loop_susp_unit X) (Ω⇒ p)
|
2017-07-04 11:57:46 +00:00
|
|
|
|
|
|
|
|
|
variables {A₀₀ A₂₀ A₀₂ A₂₂ : Type*}
|
|
|
|
|
{f₁₀ : A₀₀ →* A₂₀} {f₁₂ : A₀₂ →* A₂₂}
|
|
|
|
|
{f₀₁ : A₀₀ →* A₀₂} {f₂₁ : A₂₀ →* A₂₂}
|
|
|
|
|
|
2017-07-20 17:01:22 +00:00
|
|
|
|
-- rename: susp_functor_psquare
|
2017-07-04 11:57:46 +00:00
|
|
|
|
definition suspend_psquare (p : psquare f₁₀ f₁₂ f₀₁ f₂₁) : psquare (⅀→ f₁₀) (⅀→ f₁₂) (⅀→ f₀₁) (⅀→ f₂₁) :=
|
|
|
|
|
sorry
|
|
|
|
|
|
2017-07-20 17:01:22 +00:00
|
|
|
|
definition susp_to_loop_psquare (f₁₀ : A₀₀ →* A₂₀) (f₁₂ : A₀₂ →* A₂₂) (f₀₁ : susp A₀₀ →* A₀₂) (f₂₁ : susp A₂₀ →* A₂₂) : (psquare (⅀→ f₁₀) f₁₂ f₀₁ f₂₁) → (psquare f₁₀ (Ω→ f₁₂) ((loop_susp_pintro A₀₀ A₀₂) f₀₁) ((loop_susp_pintro A₂₀ A₂₂) f₂₁)) :=
|
2017-07-04 11:57:46 +00:00
|
|
|
|
begin
|
|
|
|
|
intro p,
|
|
|
|
|
refine pvconcat _ (ap1_psquare p),
|
2017-07-20 17:01:22 +00:00
|
|
|
|
exact loop_susp_unit_natural f₁₀
|
2017-07-04 11:57:46 +00:00
|
|
|
|
end
|
|
|
|
|
|
2017-07-20 17:01:22 +00:00
|
|
|
|
definition loop_to_susp_square (f₁₀ : A₀₀ →* A₂₀) (f₁₂ : A₀₂ →* A₂₂) (f₀₁ : A₀₀ →* Ω A₀₂) (f₂₁ : A₂₀ →* Ω A₂₂) : (psquare f₁₀ (Ω→ f₁₂) f₀₁ f₂₁) → (psquare (⅀→ f₁₀) f₁₂ ((susp_pelim A₀₀ A₀₂) f₀₁) ((susp_pelim A₂₀ A₂₂) f₂₁)) :=
|
2017-07-04 11:57:46 +00:00
|
|
|
|
begin
|
|
|
|
|
intro p,
|
|
|
|
|
refine pvconcat (suspend_psquare p) _,
|
2017-07-20 17:01:22 +00:00
|
|
|
|
exact psquare_transpose (loop_susp_counit_natural f₁₂)
|
2017-07-04 11:57:46 +00:00
|
|
|
|
end
|
|
|
|
|
|
2017-03-23 00:02:53 +00:00
|
|
|
|
end susp
|