Download data/lean/OAI/Computability/DeterministicSum/PolynomialBounds.lean from introvoyz045/math: direct link, hf CLI and curl.
- Browser
- Download file 5.06 kB
-
https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/Computability/DeterministicSum/PolynomialBounds.lean
- Command line
-
hf download hf://datasets/introvoyz045/math/data/lean/OAI/Computability/DeterministicSum/PolynomialBounds.lean
-
curl -L -o PolynomialBounds.lean https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/Computability/DeterministicSum/PolynomialBounds.lean
5.06 kB
| import Mathlib | |
| import OAI.Computability.DeterministicSum.Interpolation | |
| namespace OAI | |
| /-! Individual-degree bounds and Newton polynomial conversion. -/ | |
| namespace DeterministicThreeSum.Newton | |
| open Finset | |
| open scoped BigOperators | |
| noncomputable section | |
| variable {R : Type*} [CommRing R] {q d : β} | |
| noncomputable def univariate (node : Fin q β R) (j : Fin q) : Polynomial R := | |
| β a β Iio j, (Polynomial.X-Polynomial.C (node a)) | |
| lemma univariate_degree (node : Fin q β R) (j : Fin q) : | |
| (univariate node j).natDegree β€ j.val := by | |
| classical | |
| rcases subsingleton_or_nontrivial R with hR | hR | |
| Β· have := hR | |
| have hz : univariate node j = 0 := Subsingleton.elim _ _ | |
| simp [hz] | |
| have := hR | |
| apply (Polynomial.natDegree_prod_le _ _).trans | |
| simp | |
| noncomputable def conversion (node : Fin q β R) (j v : Fin q) : R := | |
| (univariate node j).coeff v.val | |
| lemma conversion_zero (node : Fin q β R) (j v : Fin q) (hjv : j < v) : | |
| conversion node j v = 0 := | |
| Polynomial.coeff_eq_zero_of_natDegree_lt ((univariate_degree node j).trans_lt hjv) | |
| lemma univariate_factor (node : Fin q β R) (j : Fin q) (k : Fin d) : | |
| (β a β Iio j, (MvPolynomial.X k-MvPolynomial.C (node a))) = | |
| β v : Fin q, MvPolynomial.C (conversion node j v)*MvPolynomial.X k^v.val := by | |
| classical | |
| have hpoly := Polynomial.as_sum_range' (univariate node j) q | |
| ((univariate_degree node j).trans_lt j.isLt) | |
| have hm := congrArg (Polynomial.toMvPolynomial (R:=R) k) hpoly | |
| simpa only [univariate,map_prod,map_sub,Polynomial.toMvPolynomial_X, | |
| Polynomial.toMvPolynomial_C,map_sum,β Polynomial.C_mul_X_pow_eq_monomial,map_mul,map_pow, | |
| β Fin.sum_univ_eq_sum_range,conversion] using hm | |
| lemma basis_expansion (node : Fin q β R) (j : Fin d β Fin q) : | |
| basisPolynomial node j = β v : Fin d β Fin q, | |
| MvPolynomial.C (β i, conversion node (j i) (v i)) * | |
| β i : Fin d, MvPolynomial.X i^(v i).val := by | |
| classical | |
| unfold basisPolynomial | |
| simp_rw [univariate_factor] | |
| rw [Fintype.prod_sum (fun i : Fin d => fun v : Fin q => | |
| MvPolynomial.C (conversion node (j i) v)*MvPolynomial.X i^v.val)] | |
| apply sum_congr rfl | |
| intro v hv | |
| rw [prod_mul_distrib,β map_prod] | |
| noncomputable def exponentVector (v : Fin d β Fin q) : Fin d ββ β := | |
| Finsupp.equivFunOnFinite.symm (fun i => (v i).val) | |
| @[simp] lemma exponentVector_apply (v : Fin d β Fin q) (i : Fin d) : | |
| exponentVector v i = (v i).val := by simp [exponentVector] | |
| lemma indicator_exponentVector (v : Fin d β Fin q) : | |
| Finsupp.indicator univ (fun i _ => (v i).val) = exponentVector v := by | |
| ext i | |
| simp | |
| lemma exponentVector_injective : Function.Injective (exponentVector (d:=d) (q:=q)) := by | |
| intro v w h | |
| funext i | |
| apply Fin.ext | |
| simpa using congrArg (fun z : Fin d ββ β => z i) h | |
| lemma coefficient_basis (node : Fin q β R) (j v : Fin d β Fin q) : | |
| (basisPolynomial node j).coeff (exponentVector v) = | |
| β i, conversion node (j i) (v i) := by | |
| classical | |
| rw [basis_expansion,MvPolynomial.coeff_sum] | |
| simp only [MvPolynomial.coeff_C_mul,MvPolynomial.coeff_prod_X_pow, | |
| indicator_exponentVector,exponentVector_injective.eq_iff] | |
| simp | |
| lemma coefficient_truncated (node : Fin q β R) (f : (Fin d β Fin q) β R) | |
| (D : β) (v : Fin d β Fin q) : | |
| (truncatedPolynomial node f D).coeff (exponentVector v) = | |
| β j : Fin d β Fin q, (if degree j β€ D then coefficients node f j else 0)* | |
| β i, conversion node (j i) (v i) := by | |
| classical | |
| simp only [truncatedPolynomial,MvPolynomial.coeff_sum,sum_filter] | |
| apply sum_congr rfl | |
| intro j hj | |
| split_ifs <;> simp_all [coefficient_basis] | |
| lemma basis_individual_degree (node : Fin q β R) (j : Fin d β Fin q) (k : Fin d) : | |
| (basisPolynomial node j).degreeOf k β€ (j k).val := by | |
| classical | |
| rcases subsingleton_or_nontrivial R with hR | hR | |
| Β· have := hR | |
| have hz : basisPolynomial node j = 0 := Subsingleton.elim _ _ | |
| simp [hz] | |
| have := hR | |
| unfold basisPolynomial | |
| apply (MvPolynomial.degreeOf_prod_le k _ _).trans | |
| calc | |
| (β i : Fin d, (β a β Iio (j i), (MvPolynomial.X i-MvPolynomial.C (node a))).degreeOf k) β€ | |
| β i : Fin d, if i=k then (j i).val else 0 := by | |
| apply sum_le_sum | |
| intro i hi | |
| apply (MvPolynomial.degreeOf_prod_le k _ _).trans | |
| calc | |
| _ β€ β _a β Iio (j i), if k=i then 1 else 0 := sum_le_sum (by | |
| intro a ha | |
| exact (MvPolynomial.degreeOf_sub_le k _ _).trans (by simp [MvPolynomial.degreeOf_X])) | |
| _ = _ := by by_cases hik : i=k <;> simp [hik,Ne.symm] | |
| _ = _ := by simp | |
| lemma truncated_individual_degree (node : Fin q β R) (f : (Fin d β Fin q) β R) | |
| (D : β) (k : Fin d) (hq : 0 < q) : | |
| (truncatedPolynomial node f D).degreeOf k < q := by | |
| classical | |
| apply (MvPolynomial.degreeOf_sum_le k _ _).trans_lt | |
| apply Finset.sup_lt_iff hq |>.mpr | |
| intro j hj | |
| exact (MvPolynomial.degreeOf_C_mul_le _ _ _).trans_lt | |
| ((basis_individual_degree node j k).trans_lt (j k).isLt) | |
| end | |
| end DeterministicThreeSum.Newton | |
| end OAI | |