Div by monic zs to poly eq nodal erase
KZG.CommitmentScheme.div_by_monic_zs_to_poly_eq_nodal_erase
Plain-language statement
Dividing the vanishing product by one node gives the erased nodal polynomial.
Exact Lean statement
lemma div_by_monic_zs_to_poly_eq_nodal_erase {L : ℕ}
(S : Finset (Fin L)) (query : Fin L → ZMod p)
(hquery : Set.InjOn query ↑S) (i : Fin L) (hi : i ∈ S) :
let ZₛFormal artifact
Lean source
lemma div_by_monic_zs_to_poly_eq_nodal_erase {L : ℕ} (S : Finset (Fin L)) (query : Fin L → ZMod p) (hquery : Set.InjOn query ↑S) (i : Fin L) (hi : i ∈ S) : let Zₛ := ∏ s ∈ S.image query, (X - C s) (Zₛ.divByMonic (X - C (query i))).toPoly = Lagrange.nodal (S.erase i) query := by intro Zₛ have hq_toPoly : (X - C (query i) : CPolynomial (ZMod p)).toPoly = Polynomial.X - Polynomial.C (query i) := by rw [CPolynomial.toPoly_sub, X_toPoly, C_toPoly] have hmonic : (X - C (query i) : CPolynomial (ZMod p)).toPoly.Monic := by rw [hq_toPoly]; exact Polynomial.monic_X_sub_C _ rw [CPolynomial.toPoly_divByMonic _ _ hmonic, zs_to_poly_eq_nodal S query hquery, hq_toPoly, Lagrange.nodal_eq_mul_nodal_erase hi] exact Polynomial.mul_divByMonic_cancel_left _ (Polynomial.monic_X_sub_C _)- Project
- ArkLib
- License
- Apache-2.0
- Commit
- fad5cbf80877
- Source
- ArkLib/Commitments/Functional/KZG/FunctionBinding/DegreeConflict.lean:641-655
Reuse this declaration
Bring the exact result into your workflow
The import identifies the source module. Your project still needs the pinned package dependency shown on this page.
What this badge means
This completion status comes from the project or community source. It has not yet been represented here as an independent rebuild and axiom audit.
Continue in this project
Related declarations
Affine gaps lifted to interleaved codes
affine_gaps_lifted_to_interleaved_codes
Project documentation
This lemma proves the final algebraic step in the DG25 Theorem 3.1 proof. It shows that if R > e + 1, then e * (R / (R - 1)) < e + 1. The intuition is that the fraction R / (R - 1) is always greater than 1, but as R gets larger, it gets closer to 1. The hypothesis R > e + 1 provides a strong enough bound to ensure the product e * (fraction) do...
Source project: ArkLib
Person-level attribution pending.
Gadget Decompose coeff
ArkLib.Lattices.Ajtai.gadgetDecompose_coeff
Plain-language statement
The k-th coefficient (k < deg φ) of a gadget-decomposition block is exactly the corresponding digit of the corresponding input coefficient.
Source project: ArkLib
Person-level attribution pending.
Gadget Decompose lawful
ArkLib.Lattices.Ajtai.gadgetDecompose_lawful
Plain-language statement
The base-b gadget decomposition is a lawful gadget decomposition.
Source project: ArkLib
Person-level attribution pending.