Download data/lean/OAI/Combinatorics/EditDistance/FamilyRecursion.lean from introvoyz045/math: direct link, hf CLI and curl.
- Browser
- Download file 3.28 kB
-
https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/Combinatorics/EditDistance/FamilyRecursion.lean
- Command line
-
hf download hf://datasets/introvoyz045/math/data/lean/OAI/Combinatorics/EditDistance/FamilyRecursion.lean
-
curl -L -o FamilyRecursion.lean https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/Combinatorics/EditDistance/FamilyRecursion.lean
3.28 kB
| import OAI.Combinatorics.EditDistance.RecursiveWords | |
| namespace OAI | |
| /-! | |
| # Length, alphabet, and distortion recurrences for word families | |
| -/ | |
| namespace EditFamily | |
| open scoped BigOperators | |
| def familyLength (b P s : β) : β := (2 * (2 * b - 1) * P ^ (b / 2)) ^ s | |
| def familyAlphabet (b P : β) : β β β | |
| | 0 => 2 * P | |
| | s+1 => 1 + (2 * b - 1) * familyAlphabet b P s | |
| noncomputable def familyAlpha (s : β) : β := (24 : β)β»ΒΉ ^ s | |
| noncomputable def familyBudget (b P h : β) : β β β | |
| | 0 => 2 | |
| | s+1 => 2 * (2 * (P : β)) ^ (2 * h) / (P ^ (b / 2) : β) + familyBudget b P h s / h | |
| lemma familyLength_pos {b P : β} (hb : 0 < b) (hP : 0 < P) (s : β) : | |
| 0 < familyLength b P s := by | |
| unfold familyLength | |
| exact pow_pos (Nat.mul_pos (Nat.mul_pos (by omega) (by omega)) (pow_pos hP _)) _ | |
| lemma familyAlpha_pos (s : β) : 0 < familyAlpha s := by | |
| unfold familyAlpha | |
| positivity | |
| lemma familyAlpha_le_one (s : β) : familyAlpha s β€ 1 := by | |
| unfold familyAlpha | |
| exact pow_le_oneβ (by norm_num) (by norm_num) | |
| lemma familyBudget_nonneg (b P h s : β) : 0 β€ familyBudget b P h s := by | |
| induction s with | |
| | zero => norm_num [familyBudget] | |
| | succ s ih => | |
| exact add_nonneg (by positivity) (div_nonneg ih (Nat.cast_nonneg _)) | |
| noncomputable def recursive {J : Type} [Fintype J] [DecidableEq J] | |
| (p : J β β) (hp : β j, (p j).Prime) (hinj : Function.Injective p) | |
| (P : β) (hP : 1 β€ P) (hpLow : β j, P β€ p j) (hpHigh : β j, p j β€ 2 * P) | |
| (h : β) (hh : 0 < h) : (s : β) β (j : J) β | |
| Family (p j) (familyLength (Fintype.card J) P s) (familyAlphabet (Fintype.card J) P s) | |
| (familyAlpha s) (familyBudget (Fintype.card J) P h s) | |
| | 0, j => base (hp j) (hpHigh j) | |
| | s+1, j => by | |
| let F := recursive p hp hinj P hP hpLow hpHigh h hh s | |
| have hn : familyLength (Fintype.card J) P (s+1) = | |
| 2 * ((2 * Fintype.card J - 1) * familyLength (Fintype.card J) P s) * | |
| P ^ (Fintype.card J / 2) := by | |
| simp only [familyLength, pow_succ] | |
| ring | |
| have ha : familyAlpha (s+1) = familyAlpha s / 24 := by | |
| simp only [familyAlpha, pow_succ, div_eq_mul_inv] | |
| rw [hn, familyAlphabet, ha, familyBudget] | |
| exact successor j F hp hinj P hP hpLow hpHigh | |
| (familyLength_pos (Fintype.card_pos_iff.mpr β¨jβ©) (by omega) s) | |
| (familyAlpha_pos s).le (familyAlpha_le_one s) | |
| (familyBudget_nonneg _ _ _ _) h hh | |
| lemma familyAlphabet_pos {b P : β} (hP : 0 < P) (s : β) : 0 < familyAlphabet b P s := by | |
| cases s <;> simp only [familyAlphabet] <;> omega | |
| lemma familyAlphabet_le {b P : β} (hb : 0 < b) (hP : 0 < P) (s : β) : | |
| familyAlphabet b P s β€ (2 * P + 1) * (2 * b) ^ s := by | |
| induction s with | |
| | zero => simp [familyAlphabet] | |
| | succ s ih => | |
| have hap := familyAlphabet_pos (b := b) hP s | |
| have hb' : 2 * b - 1 + 1 = 2 * b := by omega | |
| calc | |
| familyAlphabet b P (s+1) = 1 + (2 * b - 1) * familyAlphabet b P s := rfl | |
| _ β€ 2 * b * familyAlphabet b P s := by | |
| nlinarith [Nat.mul_add (2 * b - 1) 1 (familyAlphabet b P s)] | |
| _ β€ 2 * b * ((2 * P + 1) * (2 * b) ^ s) := Nat.mul_le_mul_left _ ih | |
| _ = (2 * P + 1) * (2 * b) ^ (s+1) := by rw [pow_succ]; ring | |
| end EditFamily | |
| end OAI | |