File size: 3,436 Bytes
4a56cd6 | 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 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 | import Mathlib
namespace OAI
namespace BorsukNine
open Set
open scoped Topology
lemma compact_local_homotopy {X E : Type*} [TopologicalSpace X] [T2Space X]
[LocallyCompactSpace X] [TopologicalSpace E] [Zero E]
{U C : Set X} (hU : IsOpen U) (hC : IsCompact C) (hCU : C β U)
(H : X β E) (hH : Continuous H) (hHz : β x, H x β 0)
(K : β Γ X β E) (hK : ContinuousOn K (Icc (0:β) 1 ΓΛ’ U))
(hK0 : β x β U, K (0,x) = H x)
(hKz : β t β Icc (0:β) 1, β x β U, K (t,x) β 0)
(B : Set E) (houtside : β x β U, H x β B)
(hhits : β t β Icc (0:β) 1, β x β U, K (t,x) β B β x β C)
(hend : β x β U, K (1,x) β B) :
β G : β Γ X β E, ContinuousOn G (Icc (0:β) 1 ΓΛ’ Set.univ) β§
(β x, G (0,x) = H x) β§
(β t β Icc (0:β) 1, β x, G (t,x) β 0) β§
(β x, G (1,x) β B) := by
classical
obtain β¨q,hq1,-,hqs,hqbβ© := exists_continuousMap_one_of_isCompact_subset_isOpen hC hU hCU
let G : β Γ X β E := fun p => if p.2 β U then K (p.1 * q p.2,p.2) else H p.2
have htm (t : β) (ht : t β Icc (0:β) 1) (x : X) : t * q x β Icc (0:β) 1 :=
β¨mul_nonneg ht.1 (hqb x).1,
(mul_le_mul_of_nonneg_right ht.2 (hqb x).1).trans (by simpa using (hqb x).2)β©
have hG : ContinuousOn G (Icc (0:β) 1 ΓΛ’ Set.univ) := by
intro p hp
by_cases hx : p.2 β U
Β· have hc : ContinuousOn (fun p : β Γ X => K (p.1 * q p.2,p.2))
(Icc (0:β) 1 ΓΛ’ U) := hK.comp
((continuous_fst.mul (q.continuous.comp continuous_snd)).prodMk continuous_snd).continuousOn
(fun p hp => β¨htm p.1 hp.1 p.2,hp.2β©)
have hnear : βαΆ p' in π p, p'.2 β U :=
continuous_snd.continuousAt.preimage_mem_nhds (hU.mem_nhds hx)
have hset : Icc (0:β) 1 ΓΛ’ U β π[Icc (0:β) 1 ΓΛ’ Set.univ] p := by
filter_upwards [Filter.Eventually.filter_mono nhdsWithin_le_nhds hnear,
self_mem_nhdsWithin] with p' hu hi
exact β¨hi.1,huβ©
apply ((hc p β¨hp.1,hxβ©).mono_of_mem_nhdsWithin hset).congr_of_eventuallyEq
Β· filter_upwards [Filter.Eventually.filter_mono nhdsWithin_le_nhds hnear] with p' hu
simp [G,hu]
Β· simp [G,hx]
Β· have hxq : p.2 β tsupport q := fun h => hx (hqs h)
have hnear : βαΆ p' in π p, p'.2 β tsupport q :=
continuous_snd.continuousAt.preimage_mem_nhds ((isClosed_tsupport q).isOpen_compl.mem_nhds hxq)
apply (hH.comp continuous_snd).continuousAt.continuousWithinAt.congr_of_eventuallyEq
Β· filter_upwards [Filter.Eventually.filter_mono nhdsWithin_le_nhds hnear] with p' hq
have hz : q p'.2 = 0 := image_eq_zero_of_notMem_tsupport hq
by_cases hu : p'.2 β U
Β· simp [G,hu,hz,hK0 p'.2 hu]
Β· simp [G,hu]
Β· simp [G,hx]
refine β¨G,hG,?_,?_,?_β©
Β· intro x
by_cases hx : x β U
Β· simp [G,hx,hK0 x hx]
Β· simp [G,hx]
Β· intro t ht x
by_cases hx : x β U
Β· simpa only [G,ite_eq_left hx] using hKz _ (htm t ht x) x hx
Β· simpa only [G,ite_eq_right hx] using hHz x
Β· intro x hb
by_cases hx : x β U
Β· have hh : K (q x,x) β B := by simpa only [G,ite_eq_left hx,one_mul] using hb
have hc := hhits _ (hqb x) x hx hh
rw [hq1 hc] at hh
exact hend x hx hh
Β· exact houtside x hx (by simpa only [G,ite_eq_right hx] using hb)
end BorsukNine
end OAI
|