Download data/lean/OAI/Algorithms/SubexponentialSAT/SqrtLog/AsymptoticResidualLayout.lean from introvoyz045/math: direct link, hf CLI and curl.
- Browser
- Download file 3.43 kB
-
https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/Algorithms/SubexponentialSAT/SqrtLog/AsymptoticResidualLayout.lean
- Command line
-
hf download hf://datasets/introvoyz045/math/data/lean/OAI/Algorithms/SubexponentialSAT/SqrtLog/AsymptoticResidualLayout.lean
-
curl -L -o AsymptoticResidualLayout.lean https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/Algorithms/SubexponentialSAT/SqrtLog/AsymptoticResidualLayout.lean
3.43 kB
| import OAI.Algorithms.SubexponentialSAT.LeanCompat | |
| import OAI.Algorithms.SubexponentialSAT.SqrtLog.AsymptoticResidual | |
| namespace OAI.Algorithms | |
| /-! The layout guards hold uniformly for all half-size residuals and all | |
| polynomially bounded branch-dependent occurrence/arity parameters. -/ | |
| namespace SubexponentialSAT.SqrtLog.Asymptotic | |
| open Filter | |
| open scoped Topology | |
| theorem eventually_uniform_layout_guards (q : β) : | |
| βαΆ m : β in atTop, β a b : β, a β€ L m ^ q β b β€ L m ^ q β | |
| 2 β€ layoutQ m β§ | |
| 4 * layoutCutoff m b β€ layoutQ m β§ | |
| 16 * layoutQ m * layoutR m ^ 2 β€ m β§ | |
| 4096 * (b + a) * b ^ 2 * layoutR m ^ 2 * L m ^ 4 * | |
| (layoutR m ^ (2 * layoutQ m)) ^ 2 β€ m := by | |
| have hmax : βαΆ m : β in atTop, L m ^ q β€ L m ^ q := Eventually.of_forall (fun _ => le_rfl) | |
| filter_upwards [eventually_layoutQ_ge 2, | |
| eventually_layout_fits (fun m => L m ^ q) q hmax, | |
| eventually_layout_small_grid, | |
| eventually_layout_large_grid (fun m => L m ^ q) (fun m => L m ^ q) q hmax hmax] | |
| with m hQ hfit hsmall hlarge a b ha hb | |
| refine β¨hQ, ?_, hsmall, ?_β© | |
| Β· exact (Nat.mul_le_mul_left 4 (layoutCutoff_mono m hb)).trans hfit | |
| Β· exact (by gcongr : | |
| 4096 * (b + a) * b ^ 2 * layoutR m ^ 2 * L m ^ 4 * | |
| (layoutR m ^ (2 * layoutQ m)) ^ 2 β€ | |
| 4096 * (L m ^ q + L m ^ q) * (L m ^ q) ^ 2 * layoutR m ^ 2 * L m ^ 4 * | |
| (layoutR m ^ (2 * layoutQ m)) ^ 2).trans hlarge | |
| theorem eventually_residual_layout_guards (q : β) : | |
| βαΆ n : β in atTop, β m a b : β, n β€ 2 * m β a β€ L m ^ q β b β€ L m ^ q β | |
| 2 β€ layoutQ m β§ | |
| 4 * layoutCutoff m b β€ layoutQ m β§ | |
| 16 * layoutQ m * layoutR m ^ 2 β€ m β§ | |
| 4096 * (b + a) * b ^ 2 * layoutR m ^ 2 * L m ^ 4 * | |
| (layoutR m ^ (2 * layoutQ m)) ^ 2 β€ m := by | |
| filter_upwards [eventually_uniform_half (eventually_uniform_layout_guards q)] with n hn m a b hnm ha hb | |
| exact hn m hnm a b ha hb | |
| theorem eventually_uniform_label_log (q : β) : | |
| βαΆ m : β in atTop, β b : β, 1 β€ b β b β€ L m ^ q β | |
| Real.log (4 * (m : β) * b * (8 * (layoutQ m : β)) ^ | |
| (2 * layoutCutoff m b) + 1) β€ 4 * (L m : β) ^ 2 := by | |
| have hmax : βαΆ m : β in atTop, 1 β€ L m ^ q β§ L m ^ q β€ L m ^ q := | |
| Eventually.of_forall (fun m => β¨Nat.succ_le_of_lt (pow_pos (L_pos m) q), le_rflβ©) | |
| filter_upwards [eventually_layout_label_log (fun m => L m ^ q) q hmax, | |
| eventually_layoutQ_ge 1] with m hm hQ b hb0 hb | |
| have hR := layoutCutoff_mono m hb | |
| have hQ' : (1 : β) β€ layoutQ m := by exact_mod_cast hQ | |
| have harg : 4 * (m : β) * b * (8 * (layoutQ m : β)) ^ | |
| (2 * layoutCutoff m b) + 1 β€ | |
| 4 * (m : β) * (L m ^ q : β) * (8 * (layoutQ m : β)) ^ | |
| (2 * layoutCutoff m (L m ^ q)) + 1 := by | |
| gcongr | |
| linarith | |
| exact (Real.log_le_log (by positivity) harg).trans hm | |
| theorem eventually_residual_label_log (q : β) : | |
| βαΆ n : β in atTop, β m b : β, m β€ n β n β€ 2 * m β 1 β€ b β b β€ L m ^ q β | |
| Real.log (4 * (m : β) * b * (8 * (layoutQ m : β)) ^ | |
| (2 * layoutCutoff m b) + 1) β€ 4 * (L n : β) ^ 2 := by | |
| filter_upwards [eventually_uniform_half (eventually_uniform_label_log q)] with n hn m b hmn hnm hb0 hb | |
| exact (hn m hnm b hb0 hb).trans (by gcongr; exact_mod_cast L_mono hmn) | |
| end SubexponentialSAT.SqrtLog.Asymptotic | |
| end OAI.Algorithms | |