All proofs
Project-declaredLean 4.31.0 · mathlib@fabf563a7c95

Lagrange zs conversion

KZG.CommitmentScheme.lagrange_zs_conversion

Plain-language statement

Barycentric conversion for interpolation divided by the vanishing polynomial at τ.

Exact Lean statement

lemma lagrange_zs_conversion {L : ℕ} (τ : ZMod p) (S : Finset (Fin L))
    (query : Fin L → ZMod p) (response : Fin L → ZMod p)
    (hτ : ∀ i ∈ S, (query i) ≠ τ) (hquery : Set.InjOn query ↑S) :
    let Zₛ

Formal artifact

Lean source

Canonical source
Full Lean sourceLean 4
lemma lagrange_zs_conversion {L : } (τ : ZMod p) (S : Finset (Fin L))    (query : Fin L  ZMod p) (response : Fin L  ZMod p)    (hτ :  i  S, (query i)  τ) (hquery : Set.InjOn query ↑S) :    let Zₛ := ∏ s  S.image query, (X - C s)    ((CLagrange.interpolate S query response).eval τ) / (Zₛ.eval τ)      = ∑ x  S, response x /        (eval (query x) (Zₛ.divByMonic (X - C (query x))) *- query x)) := by  intro Zₛ  -- Derive τ ≠ query i (Mathlib direction)  have hτ' :  i  S, τ  query i := fun i hi => Ne.symm (hτ i hi)  -- Convert CPolynomial evals to Polynomial evals  have hZₛ_toPoly : Zₛ.toPoly = Lagrange.nodal S query := zs_to_poly_eq_nodal S query hquery  have hZₛ_eval : Zₛ.eval τ = Polynomial.eval τ (Lagrange.nodal S query) := by    rw [eval_toPoly, hZₛ_toPoly]  have hinterp_eval : (CLagrange.interpolate S query response).eval τ      = Polynomial.eval τ (Lagrange.interpolate S query response) := by    rw [eval_toPoly, CLagrange.cinterpolate_eq_interpolate]  rw [hinterp_eval, hZₛ_eval]  -- Apply first barycentric form  rw [Lagrange.eval_interpolate_not_at_node response hτ']  -- Cancel nodal(τ)  have hne : Polynomial.eval τ (Lagrange.nodal S query)  0 :=    Lagrange.eval_nodal_not_at_node hτ'  rw [mul_div_cancel_left₀ _ hne]  -- Match summands  apply Finset.sum_congr rfl  intro i hi  -- Rewrite nodalWeight using eval of nodal (S.erase i)  rw [Lagrange.nodalWeight_eq_eval_nodal_erase_inv]  -- Connect divByMonic eval to nodal (S.erase i) eval  have hdiv_eval : eval (query i) (Zₛ.divByMonic (X - C (query i)))      = Polynomial.eval (query i) (Lagrange.nodal (S.erase i) query) := by    rw [eval_toPoly, div_by_monic_zs_to_poly_eq_nodal_erase S query hquery i hi]  rw [hdiv_eval]  -- Field algebra: a⁻¹ * b⁻¹ * c = c / (a * b)  have heval_ne : Polynomial.eval (query i) (Lagrange.nodal (S.erase i) query)  0 :=    Lagrange.eval_nodal_not_at_node (fun j hj =>      fun h => (Finset.ne_of_mem_erase hj) (hquery hi (Finset.mem_of_mem_erase hj) h).symm)  have hτqi_ne : τ - query i  0 := sub_ne_zero.mpr (hτ' i hi)  field_simp
Project
ArkLib
License
Apache-2.0
Commit
fad5cbf80877
Source
ArkLib/Commitments/Functional/KZG/FunctionBinding/DegreeConflict.lean:658-697

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

Project-declaredLean 4.31.0

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...

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record
Project-declaredLean 4.31.0

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.

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record
Project-declaredLean 4.31.0

Gadget Decompose lawful

ArkLib.Lattices.Ajtai.gadgetDecompose_lawful

Plain-language statement

The base-b gadget decomposition is a lawful gadget decomposition.

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record