Download data/lean/OAI/Computability/DeterministicSum/SparsePolynomials.lean from introvoyz045/math: direct link, hf CLI and curl.
- Browser
- Download file 11.9 kB
-
https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/Computability/DeterministicSum/SparsePolynomials.lean
- Command line
-
hf download hf://datasets/introvoyz045/math/data/lean/OAI/Computability/DeterministicSum/SparsePolynomials.lean
-
curl -L -o SparsePolynomials.lean https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/Computability/DeterministicSum/SparsePolynomials.lean
11.9 kB
| import Mathlib | |
| namespace OAI | |
| /-! Monic remainders, sparse coefficient support and weighted polynomial identities. -/ | |
| namespace DeterministicThreeSum | |
| namespace Sparse | |
| open scoped BigOperators | |
| open Finset Polynomial | |
| variable (R : Type*) [CommRing R] | |
| noncomputable def gridPolynomial (n : β) : R[X] := | |
| β i : Fin n, (X - C (i.val : R)) | |
| lemma gridPolynomial_monic (n : β) : (gridPolynomial R n).Monic := by | |
| apply monic_prod_of_monic | |
| intro i hi | |
| exact monic_X_sub_C _ | |
| lemma gridPolynomial_eval (n : β) (i : Fin n) : | |
| (gridPolynomial R n).eval (i.val : R) = 0 := by | |
| rw [gridPolynomial, eval_prod] | |
| apply prod_eq_zero (mem_univ i) | |
| simp | |
| lemma gridPolynomial_natDegree [Nontrivial R] (n : β) : | |
| (gridPolynomial R n).natDegree = n := by | |
| rw [gridPolynomial, natDegree_prod_of_monic] | |
| Β· simp only [natDegree_X_sub_C, sum_const, card_univ, Fintype.card_fin, smul_eq_mul, mul_one] | |
| Β· intro i hi | |
| exact monic_X_sub_C _ | |
| noncomputable def remainderPower (n j : β) : R[X] := | |
| X ^ j %β gridPolynomial R n | |
| lemma remainderPower_eval (n j : β) (i : Fin n) : | |
| (remainderPower R n j).eval (i.val : R) = (i.val : R) ^ j := by | |
| rw [remainderPower] | |
| have h := evalβ_modByMonic_eq_self_of_root | |
| (p := (X : R[X]) ^ j) (f := RingHom.id R) (by simpa using gridPolynomial_eval R n i) | |
| simpa using h | |
| lemma remainderPower_degree_le (n j : β) : | |
| (remainderPower R n j).natDegree β€ j := by | |
| calc | |
| _ β€ ((X : R[X]) ^ j).natDegree := natDegree_modByMonic_le_left | |
| _ β€ j := natDegree_X_pow_le j | |
| lemma remainderPower_degree_lt [Nontrivial R] {n : β} (hn : 0 < n) (j : β) : | |
| (remainderPower R n j).natDegree < n := by | |
| have hne : gridPolynomial R n β 1 := by | |
| intro h | |
| have hh := congrArg Polynomial.natDegree h | |
| rw [gridPolynomial_natDegree, natDegree_one] at hh | |
| omega | |
| have h := natDegree_modByMonic_lt ((X : R[X]) ^ j) (gridPolynomial_monic R n) hne | |
| rwa [gridPolynomial_natDegree] at h | |
| lemma remainderPower_coeff_zero_of_ge [Nontrivial R] {n j k : β} (hn : 0 < n) | |
| (hk : n β€ k) : (remainderPower R n j).coeff k = 0 := | |
| coeff_eq_zero_of_natDegree_lt ((remainderPower_degree_lt R hn j).trans_le hk) | |
| lemma remainderPower_coeff_zero_of_gt {n j k : β} (hk : j < k) : | |
| (remainderPower R n j).coeff k = 0 := | |
| coeff_eq_zero_of_natDegree_lt ((remainderPower_degree_le R n j).trans_lt hk) | |
| lemma remainderPower_sum [Nontrivial R] {n : β} (hn : 0 < n) (j : β) (x : Fin n) : | |
| β k : Fin n, (remainderPower R n j).coeff k.val * (x.val : R) ^ k.val = | |
| (x.val : R) ^ j := by | |
| rw [Fin.sum_univ_eq_sum_range | |
| (fun k => (remainderPower R n j).coeff k * (x.val : R) ^ k)] | |
| rw [β eval_eq_sum_range' (remainderPower_degree_lt R hn j)] | |
| exact remainderPower_eval R n j x | |
| noncomputable def localCoefficient (m b v i j : β) : R := | |
| β r β range (v + 1), (v.choose r : R) * | |
| (remainderPower R m r).coeff i * (remainderPower R b (v - r)).coeff j | |
| lemma localCoefficient_zero {m b v i j : β} (h : v < i + j) : | |
| localCoefficient R m b v i j = 0 := by | |
| apply sum_eq_zero | |
| intro r hr | |
| have hrle : r β€ v := by have := mem_range.mp hr; omega | |
| by_cases hri : r < i | |
| Β· rw [remainderPower_coeff_zero_of_gt R hri] | |
| ring | |
| Β· have hrj : v - r < j := by omega | |
| rw [remainderPower_coeff_zero_of_gt R hrj] | |
| ring | |
| lemma localCoefficient_eval [Nontrivial R] {m b : β} (hm : 0 < m) (hb : 0 < b) | |
| (v : β) (x : Fin m) (y : Fin b) : | |
| β i : Fin m, β j : Fin b, | |
| localCoefficient R m b v i.val j.val * (x.val : R) ^ i.val * (y.val : R) ^ j.val = | |
| ((x.val : R) + (y.val : R)) ^ v := by | |
| simp only [localCoefficient, Finset.sum_mul] | |
| simp_rw [Finset.sum_comm (s := univ) (t := range (v + 1))] | |
| calc | |
| _ = β r β range (v + 1), (v.choose r : R) * | |
| (β i : Fin m, (remainderPower R m r).coeff i.val * (x.val : R) ^ i.val) * | |
| (β j : Fin b, (remainderPower R b (v - r)).coeff j.val * (y.val : R) ^ j.val) := by | |
| apply sum_congr rfl | |
| intro r hr | |
| simp only [Finset.sum_mul, Finset.mul_sum] | |
| conv_rhs => rw [Finset.sum_comm] | |
| apply sum_congr rfl | |
| intro i hi | |
| apply sum_congr rfl | |
| intro j hj | |
| ring | |
| _ = β r β range (v + 1), (v.choose r : R) * (x.val : R) ^ r * (y.val : R) ^ (v - r) := by | |
| simp only [remainderPower_sum R hm, remainderPower_sum R hb] | |
| _ = _ := by | |
| rw [add_pow] | |
| apply sum_congr rfl | |
| intro r hr | |
| ring | |
| variable {Ο : Type*} [Fintype Ο] [DecidableEq Ο] | |
| noncomputable def coefficient (m b : β) (P : MvPolynomial Ο R) | |
| (i : Ο β Fin m) (j : Ο β Fin b) : R := | |
| β v β P.support, P.coeff v * β k, localCoefficient R m b (v k) (i k).val (j k).val | |
| lemma monomial_expansion [Nontrivial R] {m b : β} (hm : 0 < m) (hb : 0 < b) | |
| (v : Ο β β) (x : Ο β Fin m) (y : Ο β Fin b) : | |
| β i : Ο β Fin m, β j : Ο β Fin b, | |
| (β k, localCoefficient R m b (v k) (i k).val (j k).val) * | |
| (β k, ((x k).val : R) ^ (i k).val) * | |
| (β k, ((y k).val : R) ^ (j k).val) = | |
| β k, (((x k).val : R) + ((y k).val : R)) ^ (v k) := by | |
| have h := congrArg (fun g : Ο β R => β k, g k) | |
| (funext fun k => localCoefficient_eval R hm hb (v k) (x k) (y k)) | |
| simp_rw [Fintype.prod_sum, Finset.prod_mul_distrib] at h | |
| exact h | |
| theorem coefficient_evaluation [Nontrivial R] {m b : β} (hm : 0 < m) (hb : 0 < b) | |
| (P : MvPolynomial Ο R) (x : Ο β Fin m) (y : Ο β Fin b) : | |
| MvPolynomial.eval (fun k => ((x k).val : R) + ((y k).val : R)) P = | |
| β i : Ο β Fin m, β j : Ο β Fin b, | |
| coefficient R m b P i j * (β k, ((x k).val : R) ^ (i k).val) * | |
| (β k, ((y k).val : R) ^ (j k).val) := by | |
| rw [MvPolynomial.eval_eq'] | |
| simp only [coefficient, Finset.sum_mul] | |
| simp_rw [Finset.sum_comm (s := univ) (t := P.support)] | |
| apply sum_congr rfl | |
| intro v hv | |
| rw [β monomial_expansion R hm hb v x y] | |
| simp only [Finset.mul_sum] | |
| apply sum_congr rfl | |
| intro i hi | |
| apply sum_congr rfl | |
| intro j hj | |
| ring | |
| omit [DecidableEq Ο] in | |
| lemma coefficient_support {m b Ξ : β} (P : MvPolynomial Ο R) (hP : P.totalDegree β€ Ξ) | |
| (i : Ο β Fin m) (j : Ο β Fin b) | |
| (hij : Ξ < (β k, (i k).val) + β k, (j k).val) : | |
| coefficient R m b P i j = 0 := by | |
| apply sum_eq_zero | |
| intro v hv | |
| have hdeg : β k, v k β€ Ξ := by | |
| have h := (MvPolynomial.le_totalDegree hv).trans hP | |
| rw [Finsupp.sum_fintype _ _ (fun _ => rfl)] at h | |
| exact h | |
| have hex : β k, v k < (i k).val + (j k).val := by | |
| by_contra! h | |
| have hs := sum_le_sum (fun k (_ : k β (univ : Finset Ο)) => h k) | |
| rw [sum_add_distrib] at hs | |
| omega | |
| obtain β¨k, hkβ© := hex | |
| rw [prod_eq_zero (mem_univ k) (localCoefficient_zero R hk)] | |
| exact mul_zero _ | |
| end Sparse | |
| end DeterministicThreeSum | |
| namespace DeterministicThreeSum.Weighted | |
| open Finset | |
| open scoped BigOperators | |
| noncomputable section | |
| variable {R : Type} [CommRing R] | |
| lemma split_support {I J : Type} [Fintype I] [Fintype J] [DecidableEq I] [DecidableEq J] | |
| (small : Finset I) (low : Finset J) (A : I β J β R) | |
| (hA : β i β small, β j β low, A i j = 0) (X : I β R) (Y : J β R) : | |
| (β i, β j, A i j * X i * Y j) = | |
| (β j β low, (β i, A i j * X i) * Y j) + | |
| β i β small, X i * β j β lowαΆ, A i j * Y j := by | |
| have hs : (β i, β j β lowαΆ, A i j * X i * Y j) = | |
| β i β small, X i * β j β lowαΆ, A i j * Y j := by | |
| calc | |
| _ = β i, X i * β j β lowαΆ, A i j * Y j := by | |
| apply sum_congr rfl | |
| intro i hi | |
| rw [mul_sum] | |
| apply sum_congr rfl | |
| intro j hj | |
| ring | |
| _ = _ := (sum_subset (subset_univ small) (by | |
| intro i hi hni | |
| have hz : (β j β lowαΆ, A i j * Y j) = 0 := by | |
| apply sum_eq_zero | |
| intro j hj | |
| rw [hA i hni j (mem_compl.mp hj), zero_mul] | |
| rw [hz,mul_zero])).symm | |
| calc | |
| _ = β i, ((β j β low, A i j * X i * Y j) + | |
| β j β lowαΆ, A i j * X i * Y j) := by | |
| apply sum_congr rfl | |
| intro i hi | |
| exact (sum_add_sum_compl low _).symm | |
| _ = (β i, β j β low, A i j * X i * Y j) + | |
| β i, β j β lowαΆ, A i j * X i * Y j := sum_add_distrib | |
| _ = _ := by rw [hs, sum_comm]; simp only [sum_mul] | |
| lemma weighted_finite_interchange {A J : Type} (members : Finset A) (low : Finset J) | |
| (z : A β R) (F : A β J β R) (Y : J β R) : | |
| (β a β members, z a * β j β low, F a j * Y j) = | |
| β j β low, (β a β members, z a * F a j) * Y j := by | |
| calc | |
| _ = β a β members, β j β low, z a * (F a j * Y j) := by | |
| apply sum_congr rfl | |
| intro a ha | |
| exact mul_sum _ _ _ | |
| _ = β j β low, β a β members, z a * (F a j * Y j) := sum_comm | |
| _ = _ := by simp only [sum_mul, mul_assoc] | |
| lemma weighted_split {I J A : Type} [Fintype I] [Fintype J] | |
| [DecidableEq I] [DecidableEq J] (small : Finset I) (low : Finset J) | |
| (C : I β J β R) (hC : β i β small, β j β low, C i j = 0) | |
| (members : Finset A) (z : A β R) (X : A β I β R) (Y : J β R) : | |
| (β a β members, z a * β i, β j, C i j * X a i * Y j) = | |
| (β j β low, (β a β members, z a * β i, C i j * X a i) * Y j) + | |
| β i β small, (β a β members, z a * X a i) * | |
| (β j β lowαΆ, C i j * Y j) := by | |
| simp_rw [split_support small low C hC, mul_add] | |
| rw [sum_add_distrib] | |
| congr 1 | |
| Β· exact weighted_finite_interchange members low z (fun a j => β i, C i j * X a i) Y | |
| Β· exact weighted_finite_interchange members small z X (fun i => β j β lowαΆ, C i j * Y j) | |
| def degree {d s : β} (i : Fin d β Fin s) : β := β k, (i k).val | |
| noncomputable def lowSet (b d : β) : Finset (Fin d β Fin b) := | |
| univ.filter (fun j => 2*degree j β€ (b-3)*d) | |
| noncomputable def smallSet (m d : β) : Finset (Fin d β Fin m) := | |
| univ.filter (fun i => degree i β€ 3*d) | |
| def cutoff (b d : β) : β := ((b+3)*d)/2 | |
| def monomial {d s : β} (x i : Fin d β Fin s) : R := | |
| β k, ((x k).val : R)^(i k).val | |
| lemma source_support {d m b : β} (hb : 3 β€ b) | |
| (P : MvPolynomial (Fin d) R) (hP : P.totalDegree β€ cutoff b d) | |
| (i : Fin d β Fin m) (hi : i β smallSet m d) | |
| (j : Fin d β Fin b) (hj : j β lowSet b d) : | |
| Sparse.coefficient R m b P i j = 0 := by | |
| have hi' : 3*d < degree i := by simpa [smallSet] using hi | |
| have hj' : (b-3)*d < 2*degree j := by simpa [lowSet] using hj | |
| apply Sparse.coefficient_support R P hP i j | |
| have heq : (b+3)*d = (b-3)*d+6*d := by | |
| rw [show b+3 = (b-3)+6 by omega, add_mul] | |
| have hdiv : 2*cutoff b d β€ (b+3)*d := Nat.mul_div_le _ _ | |
| change cutoff b d < degree i + degree j | |
| omega | |
| variable {d m b : β} | |
| noncomputable def U (P : MvPolynomial (Fin d) R) (j : Fin d β Fin b) | |
| (x : Fin d β Fin m) : R := | |
| β i, Sparse.coefficient R m b P i j * monomial x i | |
| noncomputable def W (P : MvPolynomial (Fin d) R) (i : Fin d β Fin m) | |
| (y : Fin d β Fin b) : R := | |
| β j β (lowSet b d)αΆ, Sparse.coefficient R m b P i j * monomial y j | |
| theorem polynomial_group_identity [Nontrivial R] (hm : 0 < m) (hb : 3 β€ b) | |
| (P : MvPolynomial (Fin d) R) (hP : P.totalDegree β€ cutoff b d) | |
| {A : Type} (members : Finset A) (x : A β Fin d β Fin m) | |
| (y : Fin d β Fin b) (z : A β R) : | |
| (β a β members, z a * MvPolynomial.eval | |
| (fun k => ((x a k).val : R) + ((y k).val : R)) P) = | |
| (β j β lowSet b d, (β a β members, z a * U P j (x a)) * monomial y j) + | |
| β i β smallSet m d, (β a β members, z a * monomial (x a) i) * W P i y := by | |
| simp_rw [Sparse.coefficient_evaluation R hm (show 0 < b by omega)] | |
| exact weighted_split (smallSet m d) (lowSet b d) (Sparse.coefficient R m b P) | |
| (fun i hi j hj => source_support hb P hP i hi j hj) members z | |
| (fun a i => monomial (x a) i) (fun j => monomial y j) | |
| end | |
| end DeterministicThreeSum.Weighted | |
| end OAI | |