Download data/lean/OAI/NumberTheory/TwoPoint/Walks/ColumnDecoderAsymptotics.lean from introvoyz045/math: direct link, hf CLI and curl.
- Browser
- Download file 2.66 kB
-
https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/NumberTheory/TwoPoint/Walks/ColumnDecoderAsymptotics.lean
- Command line
-
hf download hf://datasets/introvoyz045/math/data/lean/OAI/NumberTheory/TwoPoint/Walks/ColumnDecoderAsymptotics.lean
-
curl -L -o ColumnDecoderAsymptotics.lean https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/NumberTheory/TwoPoint/Walks/ColumnDecoderAsymptotics.lean
2.66 kB
| import OAI.NumberTheory.TwoPoint.Walks.ForestCodeAsymptotics | |
| import OAI.NumberTheory.TwoPoint.Walks.ColumnDecoder | |
| namespace OAI | |
| /-! Exponential bound for the universal full-column decoder. -/ | |
| namespace TwoPointCorrelations | |
| open Filter | |
| /-- The exponent constant is absolute. Fixed coefficients in the | |
| sublinear segment budget only change the lower threshold for `L`. -/ | |
| theorem eventually_column_decoder_exponential (C : β) (hC : 0 β€ C) : | |
| βαΆ L : β in atTop, β k N segments omitted imperfect : β, | |
| L / 2 β€ (k : β) β (k : β) β€ L β 1 β€ N β N β€ 4 * k β | |
| ((2 * segments + omitted + imperfect : β) : β) β€ C * L ^ (0.92 : β) β | |
| (Fintype.card (ColumnDecoderCode N segments omitted imperfect) : β) β€ | |
| Real.exp (52 * k) := by | |
| filter_upwards [eventually_ge_atTop 4, eventually_forest_endpoint_cost C hC] with L hL hcost | |
| intro k N segments omitted imperfect hklo hkhi hN hNk hM | |
| let M := 2 * segments + omitted + imperfect | |
| have hNpos : 0 < (N : β) := by exact_mod_cast (by omega : 0 < N) | |
| have hNreal : (N : β) β€ 4 * L := by | |
| have h := (show (N : β) β€ 4 * k by exact_mod_cast hNk) | |
| linarith | |
| have hlogN : Real.log N β€ Real.log (4 * L) := Real.log_le_log hNpos hNreal | |
| have hlogpos : 0 β€ Real.log (4 * L) := Real.log_nonneg (by linarith) | |
| have hMcost : (M : β) * Real.log N β€ L := by | |
| calc | |
| _ β€ (M : β) * Real.log (4 * L) := mul_le_mul_of_nonneg_left hlogN (by positivity) | |
| _ β€ (C * L ^ (0.92 : β)) * Real.log (4 * L) := | |
| mul_le_mul_of_nonneg_right hM hlogpos | |
| _ β€ L := hcost | |
| have htwo : (2 : β) β€ Real.exp 1 := by linarith [Real.add_one_le_exp (1 : β)] | |
| have hbits : (2 : β) ^ (6 * N + 1) β€ Real.exp (6 * N + 1) := by | |
| calc | |
| _ β€ (Real.exp 1) ^ (6 * N + 1) := pow_le_pow_leftβ (by norm_num) htwo _ | |
| _ = _ := by rw [β Real.exp_nat_mul]; congr 1; push_cast; ring | |
| have hcard : (Fintype.card (ColumnDecoderCode N segments omitted imperfect) : β) β€ | |
| (2 : β) ^ (6 * N + 1) * (N : β) ^ M := by | |
| exact_mod_cast card_columnDecoderCode_le N segments omitted imperfect | |
| calc | |
| _ β€ (2 : β) ^ (6 * N + 1) * (N : β) ^ M := hcard | |
| _ β€ Real.exp (6 * N + 1) * Real.exp ((M : β) * Real.log N) := by | |
| rw [Real.exp_nat_mul, Real.exp_log hNpos] | |
| exact mul_le_mul_of_nonneg_right hbits (by positivity) | |
| _ = Real.exp ((6 * N + 1) + (M : β) * Real.log N) := (Real.exp_add _ _).symm | |
| _ β€ Real.exp (52 * k) := by | |
| apply Real.exp_le_exp.mpr | |
| have hNbound : (N : β) β€ 4 * k := by exact_mod_cast hNk | |
| linarith | |
| end TwoPointCorrelations | |
| end OAI | |