Download data/lean/OAI/NumberTheory/PiExponent/Analysis/FiniteSpacing.lean from introvoyz045/math: direct link, hf CLI and curl.
- Browser
- Download file 4.52 kB
-
https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/NumberTheory/PiExponent/Analysis/FiniteSpacing.lean
- Command line
-
hf download hf://datasets/introvoyz045/math/data/lean/OAI/NumberTheory/PiExponent/Analysis/FiniteSpacing.lean
-
curl -L -o FiniteSpacing.lean https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/NumberTheory/PiExponent/Analysis/FiniteSpacing.lean
4.52 kB
| import Mathlib | |
| namespace OAI | |
| open scoped BigOperators | |
| namespace PiExponent.FiniteSpacing | |
| theorem lower_bound_of_spacing {N : β} (x : Fin N β β) {d : β} | |
| (hmin : β i, d β€ x i) | |
| (hsep : β i j, i < j β d β€ x j - x i) : | |
| β i, ((i.val : β) + 1) * d β€ x i := by | |
| have aux : β k (hk : k < N), ((k : β) + 1) * d β€ x β¨k, hkβ© := by | |
| intro k | |
| induction k with | |
| | zero => | |
| intro hk | |
| simpa using hmin β¨0, hkβ© | |
| | succ k ih => | |
| intro hk | |
| have hk' : k < N := Nat.lt_trans (Nat.lt_succ_self k) hk | |
| have hp := ih hk' | |
| have hs := hsep β¨k, hk'β© β¨k + 1, hkβ© (by simp) | |
| push_cast | |
| linarith | |
| intro i | |
| exact aux i.val i.isLt | |
| theorem sum_inv_succ_sq_le_two_sub (N : β) : | |
| (β k β Finset.range N, 1 / ((k : β) + 1) ^ 2) β€ | |
| 2 - 2 / ((N : β) + 1) := by | |
| induction N with | |
| | zero => norm_num | |
| | succ N ih => | |
| rw [Finset.sum_range_succ] | |
| have hN : (0 : β) β€ N := Nat.cast_nonneg _ | |
| have hN1 : (0 : β) < (N : β) + 1 := by positivity | |
| have hN2 : (0 : β) < (N : β) + 2 := by positivity | |
| have hterm : 1 / ((N : β) + 1) ^ 2 β€ | |
| 2 / ((N : β) + 1) - 2 / ((N : β) + 2) := by | |
| field_simp | |
| nlinarith | |
| push_cast | |
| convert add_le_add ih hterm using 1 | |
| ring | |
| theorem sum_inv_succ_sq_le_two (N : β) : | |
| (β k β Finset.range N, 1 / ((k : β) + 1) ^ 2) β€ 2 := by | |
| have h := sum_inv_succ_sq_le_two_sub N | |
| have hnonneg : 0 β€ 2 / ((N : β) + 1) := by positivity | |
| linarith | |
| theorem sum_inv_sq_le_two_div_sq_of_spacing {N : β} | |
| (x : Fin N β β) {d : β} (hd : 0 < d) | |
| (hmin : β i, d β€ x i) | |
| (hsep : β i j, i < j β d β€ x j - x i) : | |
| (β i, 1 / (x i) ^ 2) β€ 2 / d ^ 2 := by | |
| have hlower := lower_bound_of_spacing x hmin hsep | |
| calc | |
| (β i, 1 / (x i) ^ 2) β€ | |
| β i : Fin N, 1 / ((((i.val : β) + 1) * d) ^ 2) := by | |
| apply Finset.sum_le_sum | |
| intro i _ | |
| have hpos : 0 < ((i.val : β) + 1) * d := by positivity | |
| exact one_div_le_one_div_of_le (sq_pos_of_pos hpos) | |
| (pow_le_pow_leftβ hpos.le (hlower i) 2) | |
| _ = (1 / d ^ 2) * β i : Fin N, 1 / ((i.val : β) + 1) ^ 2 := by | |
| rw [Finset.mul_sum] | |
| apply Finset.sum_congr rfl | |
| intro i _ | |
| rw [mul_pow, one_div_mul_one_div] | |
| ring | |
| _ β€ (1 / d ^ 2) * 2 := by | |
| apply mul_le_mul_of_nonneg_left _ (by positivity) | |
| rw [Fin.sum_univ_eq_sum_range (fun k : β => 1 / ((k : β) + 1) ^ 2)] | |
| exact sum_inv_succ_sq_le_two N | |
| _ = 2 / d ^ 2 := by ring | |
| theorem sum_inv_sq_le_two_div_sq (s : Finset β) {d : β} (hd : 0 < d) | |
| (hmin : β x β s, d β€ x) | |
| (hsep : β x β s, β y β s, x β y β d β€ |x - y|) : | |
| (β x β s, 1 / x ^ 2) β€ 2 / d ^ 2 := by | |
| classical | |
| let e := s.orderEmbOfFin rfl | |
| have hmem : β i, e i β s := fun i => s.orderEmbOfFin_mem rfl i | |
| have hstep : β i j, i < j β d β€ e j - e i := by | |
| intro i j hij | |
| have hij' : e i < e j := e.strictMono hij | |
| have h := hsep (e j) (hmem j) (e i) (hmem i) (ne_of_gt hij') | |
| rwa [abs_of_pos (sub_pos.mpr hij')] at h | |
| have hbound := sum_inv_sq_le_two_div_sq_of_spacing e hd | |
| (fun i => hmin (e i) (hmem i)) hstep | |
| have hsum : (β i : Fin s.card, 1 / (e i) ^ 2) = β x β s, 1 / x ^ 2 := by | |
| have himage : Finset.univ.image e = s := s.image_orderEmbOfFin_univ rfl | |
| calc | |
| _ = β y β Finset.univ.image e, 1 / y ^ 2 := | |
| (Finset.sum_image e.injective.injOn).symm | |
| _ = _ := congrArg (fun t : Finset β => β y β t, 1 / y ^ 2) himage | |
| rwa [hsum] at hbound | |
| theorem sum_inv_sq_le_two_div_sq_indexed {ΞΉ : Type*} | |
| (rows : Finset ΞΉ) (x : ΞΉ β β) {d : β} (hd : 0 < d) | |
| (hmin : β i β rows, d β€ x i) | |
| (hsep : β i β rows, β j β rows, i β j β d β€ |x i - x j|) : | |
| (β i β rows, 1 / (x i) ^ 2) β€ 2 / d ^ 2 := by | |
| classical | |
| have hinj : Set.InjOn x (rows : Set ΞΉ) := by | |
| intro i hi j hj h | |
| by_contra hij | |
| have hs := hsep i hi j hj hij | |
| rw [h, sub_self, abs_zero] at hs | |
| exact (not_le_of_gt hd) hs | |
| have h := sum_inv_sq_le_two_div_sq (rows.image x) hd | |
| (by intro a ha; obtain β¨i, hi, rflβ© := Finset.mem_image.mp ha; exact hmin i hi) | |
| (by | |
| intro a ha b hb hab | |
| obtain β¨i, hi, rflβ© := Finset.mem_image.mp ha | |
| obtain β¨j, hj, rflβ© := Finset.mem_image.mp hb | |
| exact hsep i hi j hj (fun hij => hab (congrArg x hij))) | |
| rwa [Finset.sum_image hinj] at h | |
| end PiExponent.FiniteSpacing | |
| end OAI | |