Download data/lean/OAI/Algebra/DepthFive/AlphaParameters.lean from introvoyz045/math: direct link, hf CLI and curl.
- Browser
- Download file 6.33 kB
-
https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/Algebra/DepthFive/AlphaParameters.lean
- Command line
-
hf download hf://datasets/introvoyz045/math/data/lean/OAI/Algebra/DepthFive/AlphaParameters.lean
-
curl -L -o AlphaParameters.lean https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/Algebra/DepthFive/AlphaParameters.lean
6.33 kB
| import OAI.Algebra.DepthFive.AnalyticParameters | |
| import OAI.Algebra.DepthFive.FractionRounding | |
| namespace OAI | |
| noncomputable section | |
| namespace Problem335.LowerParameters | |
| theorem sqrt_ge_four {n : β} (hn : 16 β€ n) : 4 β€ Real.sqrt (n : β) := by | |
| apply (Real.le_sqrt (by norm_num) (by positivity)).mpr | |
| exact_mod_cast hn | |
| theorem a_ideal_le {n : β} (_hn : 16 β€ n) : | |
| (v n : β) / (Real.sqrt (n : β) - 1) β€ (a n : β) := Nat.le_ceil _ | |
| theorem a_lt_ideal_add_one {n : β} (hn : 16 β€ n) : | |
| (a n : β) < (v n : β) / (Real.sqrt (n : β) - 1) + 1 := by | |
| apply Nat.ceil_lt_add_one | |
| have hs := sqrt_ge_four hn | |
| exact div_nonneg (Nat.cast_nonneg _) (by linarith) | |
| theorem a_scale_lower {n : β} (hn : 16 β€ n) : | |
| (n : β) ^ 2 * Real.sqrt (n : β) / 4 β€ (a n : β) := by | |
| have hs := sqrt_ge_four hn | |
| have hden : 0 < Real.sqrt (n : β) - 1 := by linarith | |
| have hv : 3 * (n : β) ^ 3 β€ 8 * (v n : β) := by | |
| exact_mod_cast three_mul_cube_le_eight_mul_v hn | |
| have heq : (n : β) ^ 2 * Real.sqrt (n : β) * Real.sqrt (n : β) = (n : β) ^ 3 := by | |
| calc | |
| _ = (n : β) ^ 2 * (Real.sqrt (n : β)) ^ 2 := by ring | |
| _ = (n : β) ^ 3 := by rw [Real.sq_sqrt (by positivity)]; ring | |
| apply le_trans _ (a_ideal_le hn) | |
| apply (le_div_iffβ hden).mpr | |
| have hnonneg : 0 β€ (n : β) ^ 2 * Real.sqrt (n : β) := by positivity | |
| nlinarith | |
| theorem a_scale_upper {n : β} (hn : 16 β€ n) : | |
| (a n : β) β€ 3 * (n : β) ^ 2 * Real.sqrt (n : β) := by | |
| have hs := sqrt_ge_four hn | |
| have hnR : (16 : β) β€ n := by exact_mod_cast hn | |
| have hden : 0 < Real.sqrt (n : β) - 1 := by linarith | |
| have hv : (v n : β) β€ (n : β) ^ 3 := by exact_mod_cast v_le_cube n | |
| have heq : (n : β) ^ 2 * Real.sqrt (n : β) * Real.sqrt (n : β) = (n : β) ^ 3 := by | |
| calc | |
| _ = (n : β) ^ 2 * (Real.sqrt (n : β)) ^ 2 := by ring | |
| _ = (n : β) ^ 3 := by rw [Real.sq_sqrt (by positivity)]; ring | |
| have hnonneg : 0 β€ (n : β) ^ 2 * Real.sqrt (n : β) := by positivity | |
| have hmul := mul_le_mul_of_nonneg_right (show (2 : β) β€ Real.sqrt (n : β) by linarith) hnonneg | |
| have hideal : (v n : β) / (Real.sqrt (n : β) - 1) β€ | |
| 2 * (n : β) ^ 2 * Real.sqrt (n : β) := by | |
| apply (div_le_iffβ hden).mpr | |
| nlinarith | |
| have hlarge : 1 β€ (n : β) ^ 2 * Real.sqrt (n : β) := by | |
| have hn2 : (1 : β) β€ (n : β) ^ 2 := by nlinarith | |
| nlinarith [mul_le_mul_of_nonneg_left (show (1 : β) β€ Real.sqrt (n : β) by linarith) | |
| (sq_nonneg (n : β))] | |
| have hround := a_lt_ideal_add_one hn | |
| nlinarith | |
| theorem alpha_bounds {n : β} (hn : 16 β€ n) : | |
| 1 / Real.sqrt (n : β) β€ alpha n β§ | |
| alpha n β€ 1 / Real.sqrt (n : β) * | |
| Real.exp ((Real.sqrt (n : β) - 1) / (v n : β)) := by | |
| have hs := sqrt_ge_four hn | |
| have hv : (0 : β) < v n := by exact_mod_cast v_pos (by omega : 4 β€ n) | |
| exact fraction_natCeil_inverse_bounds (by linarith) hv | |
| /-- The relative logarithmic rounding error is controlled by the rounded order. -/ | |
| theorem alpha_log_error_bounds {n : β} (hn : 16 β€ n) : | |
| 0 β€ Real.log (alpha n * Real.sqrt (n : β)) β§ | |
| Real.log (alpha n * Real.sqrt (n : β)) β€ 2 / (a n : β) := by | |
| have hs := sqrt_ge_four hn | |
| have hsm : 0 < Real.sqrt (n : β) - 1 := by linarith | |
| have hspos : 0 < Real.sqrt (n : β) := by linarith | |
| have hv : (0 : β) < v n := by exact_mod_cast v_pos (by omega : 4 β€ n) | |
| have hx : 0 < (v n : β) / (Real.sqrt (n : β) - 1) := div_pos hv hsm | |
| have hxa := a_ideal_le hn | |
| have hax := a_lt_ideal_add_one hn | |
| have ha : 4 * (n : β) β€ (a n : β) := by exact_mod_cast four_mul_n_le_a hn | |
| have hnR : (16 : β) β€ n := by exact_mod_cast hn | |
| have hxone : 1 β€ (v n : β) / (Real.sqrt (n : β) - 1) := by linarith | |
| have hbase : ((v n : β) / (Real.sqrt (n : β) - 1)) / | |
| ((v n : β) / (Real.sqrt (n : β) - 1) + (v n : β)) = | |
| 1 / Real.sqrt (n : β) := by | |
| field_simp | |
| ring | |
| have heq : ((a n : β) / ((a n : β) + (v n : β))) / | |
| (((v n : β) / (Real.sqrt (n : β) - 1)) / | |
| ((v n : β) / (Real.sqrt (n : β) - 1) + (v n : β))) = | |
| alpha n * Real.sqrt (n : β) := by | |
| rw [hbase, alpha] | |
| field_simp | |
| constructor | |
| Β· rw [β heq] | |
| exact (fraction_rounding_log_bounds hx hv hxa hax.le).1 | |
| Β· rw [β heq] | |
| exact fraction_rounding_log_le_two_div hxone hv hxa hax.le | |
| /-- The occupation-moment error from differentiation is of order `n^(-1/2)`. -/ | |
| theorem sq_div_a_le {n : β} (hn : 16 β€ n) : | |
| (n : β) ^ 2 / (a n : β) β€ 4 / Real.sqrt (n : β) := by | |
| have ha : (0 : β) < a n := by exact_mod_cast a_pos (by omega : 4 β€ n) | |
| have hs : 0 < Real.sqrt (n : β) := by have := sqrt_ge_four hn; linarith | |
| apply (div_le_div_iffβ ha hs).mpr | |
| have h := a_scale_lower hn | |
| linarith | |
| /-- The ambient-variable occupation error has the better order `1/n`. -/ | |
| theorem sq_div_v_le {n : β} (hn : 16 β€ n) : | |
| (n : β) ^ 2 / (v n : β) β€ 8 / (3 * (n : β)) := by | |
| have hv : (0 : β) < v n := by exact_mod_cast v_pos (by omega : 4 β€ n) | |
| have hnR : (0 : β) < n := by exact_mod_cast (by omega : 0 < n) | |
| apply (div_le_div_iffβ hv (by positivity)).mpr | |
| have h : 3 * (n : β) ^ 3 β€ 8 * (v n : β) := by | |
| exact_mod_cast three_mul_cube_le_eight_mul_v hn | |
| nlinarith | |
| /-- Uniform two-sided growth of the chosen differentiation order. -/ | |
| theorem a_isTheta : | |
| Asymptotics.IsTheta Filter.atTop (fun n : β => (a n : β)) | |
| (fun n : β => (n : β) ^ 2 * Real.sqrt (n : β)) := by | |
| constructor | |
| Β· apply Asymptotics.isBigO_iff.mpr | |
| refine β¨3, ?_β© | |
| filter_upwards [Filter.eventually_ge_atTop 16] with n hn | |
| have hnonneg : 0 β€ (n : β) ^ 2 * Real.sqrt (n : β) := by positivity | |
| simpa only [Real.norm_eq_abs, abs_of_nonneg (show (0 : β) β€ (a n : β) by positivity), | |
| abs_of_nonneg hnonneg, mul_assoc] using a_scale_upper hn | |
| Β· apply Asymptotics.isBigO_iff.mpr | |
| refine β¨4, ?_β© | |
| filter_upwards [Filter.eventually_ge_atTop 16] with n hn | |
| have hnonneg : 0 β€ (n : β) ^ 2 * Real.sqrt (n : β) := by positivity | |
| simp only [Real.norm_eq_abs, abs_of_nonneg (show (0 : β) β€ (a n : β) by positivity), abs_of_nonneg hnonneg] | |
| have h := a_scale_lower hn | |
| linarith | |
| end Problem335.LowerParameters | |
| end | |
| end OAI | |