Download data/lean/OAI/Analysis/BackwardIntertwiners/FiberTails.lean from introvoyz045/math: direct link, hf CLI and curl.
- Browser
- Download file 6.46 kB
-
https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/Analysis/BackwardIntertwiners/FiberTails.lean
- Command line
-
hf download hf://datasets/introvoyz045/math/data/lean/OAI/Analysis/BackwardIntertwiners/FiberTails.lean
-
curl -L -o FiberTails.lean https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/Analysis/BackwardIntertwiners/FiberTails.lean
6.46 kB
| import OAI.Analysis.BackwardIntertwiners.WeightSeparation | |
| namespace OAI | |
| namespace BackwardIntertwiners | |
| open Filter | |
| open scoped Topology | |
| noncomputable section | |
| abbrev Fiber := lp (fun _ : β€ => β) 2 | |
| def coordinateTail (h : β€) : Submodule β Fiber where | |
| carrier := {v | β j : β€, j < h β v j = 0} | |
| zero_mem' := by simp | |
| add_mem' := by intro v z hv hz j hj; simp [hv j hj, hz j hj] | |
| smul_mem' := by intro a v hv j hj; simp [hv j hj] | |
| lemma fiber_exists_coordinate {v : Fiber} (hv : v β 0) : β j : β€, v j β 0 := by | |
| by_contra! h | |
| apply hv | |
| ext j | |
| exact h j | |
| lemma weighted_shift_pow {w : β€ β β} (hw : β j, 0 < w j) | |
| {T : Fiber βL[β] Fiber} | |
| (hT : β v j, T v j = (w j / w (j-1) : β) * v (j-1)) | |
| (n : β) (v : Fiber) (j : β€) : | |
| (T^n) v j = (w j / w (j-(n:β€)) : β) * v (j-(n:β€)) := by | |
| have hwC (k : β€) : (w k:β) β 0 := by exact_mod_cast (ne_of_gt (hw k)) | |
| induction n generalizing j with | |
| | zero => simp [hwC] | |
| | succ n ih => | |
| rw [pow_succ'] | |
| change T ((T^n) v) j = _ | |
| rw [hT, ih] | |
| have hi : j-1-(n:β€) = j-((n+1:β):β€) := by omega | |
| rw [hi] | |
| field_simp [hwC] | |
| lemma invariant_pow {T : Fiber βL[β] Fiber} {L : Submodule β Fiber} | |
| (hi : β v β L, T v β L) {v : Fiber} (hv : v β L) (n : β) : (T^n) v β L := by | |
| induction n with | |
| | zero => simpa using hv | |
| | succ n ih => simpa only [pow_succ', mul_apply_eq_comp] using hi _ ih | |
| lemma SupportSeparation.strict_order {w : β€ β β} (hsep : SupportSeparation w) | |
| {b c : β€ β β} (hbn : β j, b j β 0) (hcn : β j, c j β 0) | |
| {B C : β} (hB : 0 < B) (hC : 0 < C) | |
| (hb : β j, βb jβ β€ B*w j) (hc : β j, βc jβ*w j β€ C) | |
| (hz : β r : β, (β' j : β€, b j * c (j-r)) = 0) | |
| {i j : β€} (hbi : b i β 0) (hcj : c j β 0) : i < j := by | |
| obtain β¨t, h, hbt, hch, hbmax, hcmin, hthβ© := | |
| hsep.of_bounded hbn hcn hB hC hb hc (fun r _ => hz r) | |
| have hit : i β€ t := by by_contra! hh; exact hbi (hbmax i hh) | |
| have hhj : h β€ j := by by_contra! hh; exact hcj (hcmin j hh) | |
| have hstrict : t < h := by | |
| by_contra! hht | |
| have he : t = h := le_antisymm hth hht | |
| have hsingle : (β' k : β€, b k*c k) = b t*c h := by | |
| rw [tsum_eq_single t, he] | |
| intro k hk | |
| by_cases hkt : t < k | |
| Β· simp [hbmax k hkt] | |
| Β· rw [hcmin k (by omega), mul_zero] | |
| have hzero := hz 0 | |
| simp only [Nat.cast_zero, sub_zero] at hzero | |
| rw [hsingle] at hzero | |
| exact (mul_ne_zero hbt hch) hzero | |
| omega | |
| lemma fiber_orthogonal_order {w : β€ β β} (hw : QuadraticWeights w) | |
| {T : Fiber βL[β] Fiber} | |
| (hT : β v j, T v j = (w j / w (j-1) : β) * v (j-1)) | |
| {L : Submodule β Fiber} (hinvariant : β v β L, T v β L) | |
| {v z : Fiber} (hv : v β L) (hz : z β L.orthogonal) | |
| {i j : β€} (hzi : z i β 0) (hvj : v j β 0) : i < j := by | |
| let b := fun k : β€ => star (z k) * (w k:β) | |
| let c := fun k : β€ => v k / (w k:β) | |
| have hwC (k : β€) : (w k:β) β 0 := by exact_mod_cast (ne_of_gt (hw.positive k)) | |
| have hbi : b i β 0 := mul_ne_zero (by simpa using hzi) (hwC i) | |
| have hcj : c j β 0 := div_ne_zero hvj (hwC j) | |
| have hb (k : β€) : βb kβ β€ (βzβ+1)*w k := by | |
| dsimp [b] | |
| rw [norm_mul, RCLike.norm_conj, Complex.norm_real, Real.norm_of_nonneg (hw.positive k).le] | |
| apply mul_le_mul_of_nonneg_right _ (hw.positive k).le | |
| exact (lp.norm_apply_le_norm (by norm_num : (2 : ENNReal) β 0) z k).trans (by linarith) | |
| have hc (k : β€) : βc kβ*w k β€ βvβ+1 := by | |
| dsimp [c] | |
| rw [norm_div, Complex.norm_real, Real.norm_of_nonneg (hw.positive k).le, | |
| div_mul_cancelβ _ (ne_of_gt (hw.positive k))] | |
| exact (lp.norm_apply_le_norm (by norm_num : (2 : ENNReal) β 0) v k).trans (by linarith) | |
| have hcor (r : β) : (β' k : β€, b k*c (k-r)) = 0 := by | |
| calc (β' k : β€, b k*c (k-r)) = inner β z ((T^r) v) := by | |
| rw [lp.inner_eq_tsum] | |
| apply tsum_congr | |
| intro k | |
| rw [RCLike.inner_apply, weighted_shift_pow hw.positive hT] | |
| dsimp [b, c] | |
| simp only [β Complex.star_def] | |
| ring | |
| _ = 0 := Submodule.inner_left_of_mem_orthogonal (invariant_pow hinvariant hv r) hz | |
| exact (quadratic_support_separation w hw).strict_order β¨i,hbiβ© β¨j,hcjβ© | |
| (by positivity : 0 < βzβ+1) (by positivity : 0 < βvβ+1) hb hc hcor hbi hcj | |
| theorem quadratic_fiber_tails (w : β€ β β) (hw : QuadraticWeights w) | |
| (T : Fiber βL[β] Fiber) | |
| (hT : β v j, T v j = (w j / w (j-1) : β) * v (j-1)) | |
| (L : Submodule β Fiber) (hclosed : IsClosed (L : Set Fiber)) | |
| (hinvariant : β v β L, T v β L) : | |
| L = β₯ β¨ L = β€ β¨ β h : β€, L = coordinateTail h := by | |
| by_cases hbot : L = β₯ | |
| Β· exact Or.inl hbot | |
| by_cases htop : L = β€ | |
| Β· exact Or.inr (Or.inl htop) | |
| have hOO : L.orthogonal.orthogonal = L := by | |
| rw [Submodule.orthogonal_orthogonal_eq_closure, hclosed.submodule_topologicalClosure_eq] | |
| have hnotOrth : L.orthogonal β β₯ := by | |
| intro hh | |
| rw [hh, Submodule.bot_orthogonal_eq_top] at hOO | |
| exact htop hOO.symm | |
| obtain β¨z, hz, hzneβ© := (Submodule.ne_bot_iff L.orthogonal).mp hnotOrth | |
| obtain β¨i, hziβ© := fiber_exists_coordinate hzne | |
| obtain β¨v, hv, hvneβ© := (Submodule.ne_bot_iff L).mp hbot | |
| obtain β¨j, hvjβ© := fiber_exists_coordinate hvne | |
| let P := fun k : β€ => β c : Fiber, c β L β§ c k β 0 | |
| have hPnonempty : β k, P k := β¨j, v, hv, hvjβ© | |
| have hPbound : β a : β€, β k : β€, P k β a β€ k := by | |
| refine β¨i+1, ?_β© | |
| rintro k β¨c, hc, hckβ© | |
| have hh := fiber_orthogonal_order hw hT hinvariant hc hz hzi hck | |
| omega | |
| obtain β¨h, hhP, hhminβ© := Int.exists_least_of_bdd hPbound hPnonempty | |
| obtain β¨vβ, hvβ, hvβhβ© := hhP | |
| refine Or.inr (Or.inr β¨h, le_antisymm ?_ ?_β©) | |
| Β· intro c hc k hk | |
| by_contra hck | |
| have hh := hhmin k β¨c, hc, hckβ© | |
| omega | |
| Β· intro c hc | |
| rw [β hOO] | |
| apply (Submodule.mem_orthogonal _ c).mpr | |
| intro u hu | |
| rw [lp.inner_eq_tsum] | |
| apply Eq.trans (tsum_congr (g := fun _ : β€ => (0:β)) ?_) tsum_zero | |
| intro k | |
| rw [RCLike.inner_apply] | |
| by_cases hkh : k < h | |
| Β· rw [hc k hkh, zero_mul] | |
| Β· have huk : u k = 0 := by | |
| by_contra hne | |
| have hh := fiber_orthogonal_order hw hT hinvariant hvβ hu hne hvβh | |
| exact hkh hh | |
| simp [huk] | |
| end | |
| end BackwardIntertwiners | |
| end OAI | |