task_id stringlengths 21 23 | challenge_id stringlengths 16 16 | proof_assistant stringclasses 1
value | session stringclasses 1
value | repo stringclasses 57
values | revision stringclasses 57
values | file_path stringlengths 13 92 | theory stringlengths 1 48 | variant int64 0 132 | challenge_type stringclasses 1
value | difficulty null | count null | by_centrality bool 1
class | ablation_prob float64 0.5 0.5 | min_depth int64 1 1 | max_depth int64 1 1 | leaves_only bool 1
class | min_size int64 0 0 | max_size stringclasses 1
value | min_centrality int64 0 0 | max_centrality stringclasses 1
value | seed int64 42 42 | n_proofs int64 1 173 | n_ablated int64 1 60 | holes_filled listlengths 1 60 | deleted_lemmas listlengths 1 1 | corollaries listlengths 1 1 | closure_size int64 1 172 | challenge_file_content stringlengths 133 350k | solution_file_content stringlengths 394 351k | solution_diff stringlengths 243 134k | manifest dict |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
ablate_abc5aacc676b_2 | 011e264d34c23d5b | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Univariate/NTTFast/Correctness/DIF.lean | DIF | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 26 | 4 | [
{
"theorem_name": "difMathPairsSpec_get_upper_current",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp [difMathPairsSpec, dif_upper_div_block stage block j hj,\n dif_upper_mod_half stage block j hj]"... | [
{
"name": "dif_upper_div_block",
"text": "private theorem dif_upper_div_block (stage block j : Nat) (hj : j < 2 ^ stage) :\n (block * 2 ^ (stage + 1) + j + 2 ^ stage) / 2 ^ (stage + 1) = block := by\n rw [show block * 2 ^ (stage + 1) + j + 2 ^ stage =\n block * 2 ^ (stage + 1) + (j + 2 ^ stage) by ... | [
{
"name": "difMathPairsSpec_get_upper_current",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 11,
"n_chars": 528,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": tru... | 2 | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Univariate.NTTFast.Correctness.Basic
/-!
# DIF NTTFast correctness
Correctness proofs for the decimation-in-frequency stage loop used by `NTT... | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Univariate.NTTFast.Correctness.Basic
/-!
# DIF NTTFast correctness
Correctness proofs for the decimation-in-frequency stage loop used by `NTT... | @@ -72,6 +72,18 @@
rw [Nat.div_eq_of_lt hlt]
simp
+private theorem dif_upper_div_block (stage block j : Nat) (hj : j < 2 ^ stage) :
+ (block * 2 ^ (stage + 1) + j + 2 ^ stage) / 2 ^ (stage + 1) = block := by
+ rw [show block * 2 ^ (stage + 1) + j + 2 ^ stage =
+ block * 2 ^ (stage + 1) + (j + 2 ^ stage... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_abc5aacc676b_3 | b9f0771b96595022 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Univariate/NTTFast/Correctness/DIF.lean | DIF | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 26 | 1 | [
{
"theorem_name": "difMathPairsSpec_get_unchanged",
"depth": 1,
"n_commands": 0,
"n_lines": 18,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp only [difMathPairsSpec, Array.getElem_ofFn]\n by_cases hltBlock : i / 2 ^ (stage + 1) < block\n · rw... | [
{
"name": "eq_lower_or_upper_of_block_pair",
"text": "private theorem eq_lower_or_upper_of_block_pair\n (stage block j i : Nat)\n (hblock : i / 2 ^ (stage + 1) = block) (hpair : i % 2 ^ stage = j) :\n i = block * 2 ^ (stage + 1) + j ∨\n i = block * 2 ^ (stage + 1) + j + 2 ^ stage := by\n let ... | [
{
"name": "difMathPairsSpec_get_unchanged",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 28,
"n_chars": 1337,
"n_subproofs": 2,
"n_tactics": 18,
"cyclomatic": 2,
"n_automation": 2,
"n_rewrites": 7,
"n_structural": 3,
"automation_only": false... | 1 | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Univariate.NTTFast.Correctness.Basic
/-!
# DIF NTTFast correctness
Correctness proofs for the decimation-in-frequency stage loop used by `NTT... | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Univariate.NTTFast.Correctness.Basic
/-!
# DIF NTTFast correctness
Correctness proofs for the decimation-in-frequency stage loop used by `NTT... | @@ -200,6 +200,49 @@
rw [if_neg hlt, if_neg hEq, if_neg hnot]
simpa [difMathPairsSpec, difMathBlocksSpec, bb, v1, v0] using hcase
+private theorem eq_lower_or_upper_of_block_pair
+ (stage block j i : Nat)
+ (hblock : i / 2 ^ (stage + 1) = block) (hpair : i % 2 ^ stage = j) :
+ i = block * 2 ^... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_abc5aacc676b_4 | c4ce05e71a550e49 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Univariate/NTTFast/Correctness/DIF.lean | DIF | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 26 | 3 | [
{
"theorem_name": "difMathPairsSpec_get_upper_current",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp [difMathPairsSpec, dif_upper_div_block stage block j hj,\n dif_upper_mod_half stage block j hj]"... | [
{
"name": "dif_upper_mod_half",
"text": "private theorem dif_upper_mod_half (stage block j : Nat) (hj : j < 2 ^ stage) :\n (block * 2 ^ (stage + 1) + j + 2 ^ stage) % 2 ^ stage = j := by\n rw [show block * 2 ^ (stage + 1) + j + 2 ^ stage =\n (block * 2 + 1) * 2 ^ stage + j by\n rw [pow_succ]\n ... | [
{
"name": "difMathValueAt_succ_upper",
"fan_in": 1,
"n_deps_direct": 8,
"n_deps_transitive": 9,
"n_lines": 103,
"n_chars": 3902,
"n_subproofs": 7,
"n_tactics": 93,
"cyclomatic": 1,
"n_automation": 22,
"n_rewrites": 41,
"n_structural": 5,
"automation_only": false,
... | 9 | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Univariate.NTTFast.Correctness.Basic
/-!
# DIF NTTFast correctness
Correctness proofs for the decimation-in-frequency stage loop used by `NTT... | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Univariate.NTTFast.Correctness.Basic
/-!
# DIF NTTFast correctness
Correctness proofs for the decimation-in-frequency stage loop used by `NTT... | @@ -92,6 +92,15 @@
rw [Nat.mul_add_mod_self_right]
exact Nat.mod_eq_of_lt hj
+private theorem dif_upper_mod_half (stage block j : Nat) (hj : j < 2 ^ stage) :
+ (block * 2 ^ (stage + 1) + j + 2 ^ stage) % 2 ^ stage = j := by
+ rw [show block * 2 ^ (stage + 1) + j + 2 ^ stage =
+ (block * 2 + 1) * 2 ^ st... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_abc5aacc676b_5 | 63c544c7af127fb3 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Univariate/NTTFast/Correctness/DIF.lean | DIF | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 26 | 1 | [
{
"theorem_name": "difMathValueAt_succ_upper",
"depth": 1,
"n_commands": 0,
"n_lines": 93,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hsubNew : D.logN - (D.logN - stage) = stage := by omega\n have hsubOld : D.logN - (D.logN - (stage + 1)) =... | [
{
"name": "dif_upper_div_half",
"text": "private theorem dif_upper_div_half (stage block j : Nat) (hj : j < 2 ^ stage) :\n (block * 2 ^ (stage + 1) + j + 2 ^ stage) / 2 ^ stage = block * 2 + 1 := by\n rw [show block * 2 ^ (stage + 1) + j + 2 ^ stage =\n (block * 2 + 1) * 2 ^ stage + j by\n rw [p... | [
{
"name": "butterflyDIFPairStep_difMathPairsSpec_succ",
"fan_in": 0,
"n_deps_direct": 8,
"n_deps_transitive": 20,
"n_lines": 64,
"n_chars": 3133,
"n_subproofs": 6,
"n_tactics": 52,
"cyclomatic": 1,
"n_automation": 11,
"n_rewrites": 18,
"n_structural": 5,
"automati... | 20 | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Univariate.NTTFast.Correctness.Basic
/-!
# DIF NTTFast correctness
Correctness proofs for the decimation-in-frequency stage loop used by `NTT... | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Univariate.NTTFast.Correctness.Basic
/-!
# DIF NTTFast correctness
Correctness proofs for the decimation-in-frequency stage loop used by `NTT... | @@ -111,6 +111,16 @@
rw [Nat.div_eq_of_lt hj]
simp
+private theorem dif_upper_div_half (stage block j : Nat) (hj : j < 2 ^ stage) :
+ (block * 2 ^ (stage + 1) + j + 2 ^ stage) / 2 ^ stage = block * 2 + 1 := by
+ rw [show block * 2 ^ (stage + 1) + j + 2 ^ stage =
+ (block * 2 + 1) * 2 ^ stage + j by
+ ... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_abc5aacc676b_6 | f7466a66f775486e | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Univariate/NTTFast/Correctness/DIF.lean | DIF | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 26 | 1 | [
{
"theorem_name": "butterflyStageDIFWithTwiddles_difMathStageSpec_succ",
"depth": 1,
"n_commands": 0,
"n_lines": 12,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n calc\n butterflyStageDIFWithTwiddles D stage twiddles\n (difMathStageSpec D ... | [
{
"name": "difMathBlocksSpec_zero",
"text": "private theorem difMathBlocksSpec_zero\n (D : NTT.Domain R) (stage : Nat) (a : Array R) :\n difMathBlocksSpec D stage 0 a = difMathStageSpec D (D.logN - (stage + 1)) a := by\n apply Array.ext\n · simp [difMathBlocksSpec, difMathStageSpec]\n · intro i hi₁... | [
{
"name": "butterflyStageDIFWithTwiddles_difMathStageSpec_succ",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 22,
"n_chars": 1170,
"n_subproofs": 0,
"n_tactics": 12,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 0,
"n_structural": 3,
"au... | 2 | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Univariate.NTTFast.Correctness.Basic
/-!
# DIF NTTFast correctness
Correctness proofs for the decimation-in-frequency stage loop used by `NTT... | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Univariate.NTTFast.Correctness.Basic
/-!
# DIF NTTFast correctness
Correctness proofs for the decimation-in-frequency stage loop used by `NTT... | @@ -159,6 +159,14 @@
exact IsPrimitiveRoot.pow D.n_pos D.primitive hprod
exact IsPrimitiveRoot.eq_neg_one_of_two_right hprim2
+private theorem difMathBlocksSpec_zero
+ (D : NTT.Domain R) (stage : Nat) (a : Array R) :
+ difMathBlocksSpec D stage 0 a = difMathStageSpec D (D.logN - (stage + 1)) a := by
+ ... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_abc5aacc676b_7 | 188256e04c14dee2 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Univariate/NTTFast/Correctness/DIF.lean | DIF | 7 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 26 | 1 | [
{
"theorem_name": "butterflyStageDIFWithTwiddles_difMathStageSpec_succ",
"depth": 1,
"n_commands": 0,
"n_lines": 12,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n calc\n butterflyStageDIFWithTwiddles D stage twiddles\n (difMathStageSpec D ... | [
{
"name": "difMathBlocksSpec_zero",
"text": "private theorem difMathBlocksSpec_zero\n (D : NTT.Domain R) (stage : Nat) (a : Array R) :\n difMathBlocksSpec D stage 0 a = difMathStageSpec D (D.logN - (stage + 1)) a := by\n apply Array.ext\n · simp [difMathBlocksSpec, difMathStageSpec]\n · intro i hi₁... | [
{
"name": "runStagesDIFWithTwiddles_eq_difMathStageSpec",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 4,
"n_lines": 35,
"n_chars": 1491,
"n_subproofs": 4,
"n_tactics": 30,
"cyclomatic": 2,
"n_automation": 6,
"n_rewrites": 8,
"n_structural": 4,
"automatio... | 4 | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Univariate.NTTFast.Correctness.Basic
/-!
# DIF NTTFast correctness
Correctness proofs for the decimation-in-frequency stage loop used by `NTT... | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Univariate.NTTFast.Correctness.Basic
/-!
# DIF NTTFast correctness
Correctness proofs for the decimation-in-frequency stage loop used by `NTT... | @@ -171,6 +171,14 @@
exact IsPrimitiveRoot.pow D.n_pos D.primitive hprod
exact IsPrimitiveRoot.eq_neg_one_of_two_right hprim2
+private theorem difMathBlocksSpec_zero
+ (D : NTT.Domain R) (stage : Nat) (a : Array R) :
+ difMathBlocksSpec D stage 0 a = difMathStageSpec D (D.logN - (stage + 1)) a := by
+ ... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_abc5aacc676b_8 | 9e7ec173b7c5ae61 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Univariate/NTTFast/Correctness/DIF.lean | DIF | 8 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 26 | 1 | [
{
"theorem_name": "butterflyStageDIFWithTwiddles_difMathStageSpec_succ",
"depth": 1,
"n_commands": 0,
"n_lines": 12,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n calc\n butterflyStageDIFWithTwiddles D stage twiddles\n (difMathStageSpec D ... | [
{
"name": "difMathBlocksSpec_zero",
"text": "private theorem difMathBlocksSpec_zero\n (D : NTT.Domain R) (stage : Nat) (a : Array R) :\n difMathBlocksSpec D stage 0 a = difMathStageSpec D (D.logN - (stage + 1)) a := by\n apply Array.ext\n · simp [difMathBlocksSpec, difMathStageSpec]\n · intro i hi₁... | [
{
"name": "runStagesDIFWithTwiddles_correct",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 6,
"n_lines": 7,
"n_chars": 374,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,... | 6 | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Univariate.NTTFast.Correctness.Basic
/-!
# DIF NTTFast correctness
Correctness proofs for the decimation-in-frequency stage loop used by `NTT... | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Univariate.NTTFast.Correctness.Basic
/-!
# DIF NTTFast correctness
Correctness proofs for the decimation-in-frequency stage loop used by `NTT... | @@ -190,6 +190,14 @@
exact IsPrimitiveRoot.pow D.n_pos D.primitive hprod
exact IsPrimitiveRoot.eq_neg_one_of_two_right hprim2
+private theorem difMathBlocksSpec_zero
+ (D : NTT.Domain R) (stage : Nat) (a : Array R) :
+ difMathBlocksSpec D stage 0 a = difMathStageSpec D (D.logN - (stage + 1)) a := by
+ ... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_74108f10a80c_0 | c0274aaf0e0cef8c | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/LinearAlgebra/PolynomialMatrix/Shifted.lean | Shifted | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 1 | [
{
"theorem_name": "rowShiftedDegreeFold_entry_le_of_some",
"depth": 1,
"n_commands": 0,
"n_lines": 23,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro xs\n induction xs with\n | nil =>\n intro acc d j e _ hmem _\n cases hmem\n | con... | [
{
"name": "rowShiftedDegreeFold_acc_le_of_some",
"text": "private theorem rowShiftedDegreeFold_acc_le_of_some [Zero F] [BEq F]\n (row : PolynomialRow F) (shift : Array Nat) :\n ∀ (xs : List Nat) (a d : Nat),\n xs.foldl\n (fun acc j ↦\n match shiftedEntryDegree? row shift j wit... | [
{
"name": "rowShiftedDegreeFold_entry_le_of_some",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 36,
"n_chars": 1272,
"n_subproofs": 1,
"n_tactics": 23,
"cyclomatic": 6,
"n_automation": 4,
"n_rewrites": 1,
"n_structural": 10,
"automation_only... | 1 | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.LinearAlgebra.PolynomialMatrix.Degree
/-!
# Shifted Degrees for Polynomial Rows
-/
namespace CompPoly
namespace PolynomialMatrix
variable ... | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.LinearAlgebra.PolynomialMatrix.Degree
/-!
# Shifted Degrees for Polynomial Rows
-/
namespace CompPoly
namespace PolynomialMatrix
variable ... | @@ -72,6 +72,30 @@
coeff := p.coeff p.natDegree }
| _, _ => none
+private theorem rowShiftedDegreeFold_acc_le_of_some [Zero F] [BEq F]
+ (row : PolynomialRow F) (shift : Array Nat) :
+ ∀ (xs : List Nat) (a d : Nat),
+ xs.foldl
+ (fun acc j ↦
+ match shiftedEntryDegree? r... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_74108f10a80c_1 | 09ee84a83e018b35 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/LinearAlgebra/PolynomialMatrix/Shifted.lean | Shifted | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 1 | [
{
"theorem_name": "rowShiftedDegree?_eq_none_iff",
"depth": 1,
"n_commands": 0,
"n_lines": 10,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [rowShiftedDegree?]\n rw [rowShiftedDegreeFold_none_iff row shift (List.range row.size) none]\n simp on... | [
{
"name": "rowIsZero_iff_forall_rowGet",
"text": "private theorem rowIsZero_iff_forall_rowGet [Zero F] [BEq F] [LawfulBEq F]\n {row : PolynomialRow F} :\n RowIsZero row ↔ ∀ j, j < row.size → rowGet row j = 0 := by\n constructor\n · intro hz j hj\n exact hz (rowGet row j) (by\n unfold rowGet\... | [
{
"name": "rowShiftedDegree?_eq_none_iff",
"fan_in": 0,
"n_deps_direct": 3,
"n_deps_transitive": 3,
"n_lines": 15,
"n_chars": 629,
"n_subproofs": 0,
"n_tactics": 10,
"cyclomatic": 2,
"n_automation": 1,
"n_rewrites": 3,
"n_structural": 5,
"automation_only": false,
... | 3 | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.LinearAlgebra.PolynomialMatrix.Degree
/-!
# Shifted Degrees for Polynomial Rows
-/
namespace CompPoly
namespace PolynomialMatrix
variable ... | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.LinearAlgebra.PolynomialMatrix.Degree
/-!
# Shifted Degrees for Polynomial Rows
-/
namespace CompPoly
namespace PolynomialMatrix
variable ... | @@ -98,10 +98,35 @@
rw [ih]
cases hx : shiftedEntryDegree? row shift x <;> cases acc <;> simp [maxOption, hx]
+private theorem rowIsZero_iff_forall_rowGet [Zero F] [BEq F] [LawfulBEq F]
+ {row : PolynomialRow F} :
+ RowIsZero row ↔ ∀ j, j < row.size → rowGet row j = 0 := by
+ constructor
+ · int... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_74108f10a80c_2 | 6653a180b37497d5 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/LinearAlgebra/PolynomialMatrix/Shifted.lean | Shifted | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 1 | [
{
"theorem_name": "shiftedEntryDegree?_le_of_rowShiftedDegree?_eq_some",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n exact rowShiftedDegreeFold_entry_le_of_some row shift (List.range row.size) none d j e\... | [
{
"name": "rowShiftedDegreeFold_entry_le_of_some",
"text": "private theorem rowShiftedDegreeFold_entry_le_of_some [Zero F] [BEq F]\n (row : PolynomialRow F) (shift : Array Nat) :\n ∀ (xs : List Nat) (acc : Option Nat) (d j e : Nat),\n xs.foldl\n (fun acc j ↦\n match shiftedEnt... | [
{
"name": "shiftedEntryDegree?_le_of_rowShiftedDegree?_eq_some",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 12,
"n_chars": 540,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 1,
"auto... | 2 | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.LinearAlgebra.PolynomialMatrix.Degree
/-!
# Shifted Degrees for Polynomial Rows
-/
namespace CompPoly
namespace PolynomialMatrix
variable ... | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.LinearAlgebra.PolynomialMatrix.Degree
/-!
# Shifted Degrees for Polynomial Rows
-/
namespace CompPoly
namespace PolynomialMatrix
variable ... | @@ -96,6 +96,41 @@
have hle := ih (max a e) d (by simpa [hx, maxOption] using h)
exact le_trans (Nat.le_max_left a e) hle
+private theorem rowShiftedDegreeFold_entry_le_of_some [Zero F] [BEq F]
+ (row : PolynomialRow F) (shift : Array Nat) :
+ ∀ (xs : List Nat) (acc : Option Nat) (d j e : ... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_74108f10a80c_3 | 4ed8161bfaf8b3fe | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/LinearAlgebra/PolynomialMatrix/Shifted.lean | Shifted | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 1 | [
{
"theorem_name": "exists_shiftedEntryDegree?_eq_of_rowShiftedDegree?_eq_some",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h :=\n rowShiftedDegreeFold_some_acc_or_mem row shift (List.range row.si... | [
{
"name": "rowShiftedDegreeFold_some_acc_or_mem",
"text": "private theorem rowShiftedDegreeFold_some_acc_or_mem [Zero F] [BEq F]\n (row : PolynomialRow F) (shift : Array Nat) :\n ∀ (xs : List Nat) (acc : Option Nat) (d : Nat),\n xs.foldl\n (fun acc j ↦\n match shiftedEntryDegr... | [
{
"name": "exists_shiftedEntryDegree?_eq_of_rowShiftedDegree?_eq_some",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 14,
"n_chars": 594,
"n_subproofs": 1,
"n_tactics": 7,
"cyclomatic": 2,
"n_automation": 2,
"n_rewrites": 0,
"n_structural": 2,
... | 1 | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.LinearAlgebra.PolynomialMatrix.Degree
/-!
# Shifted Degrees for Polynomial Rows
-/
namespace CompPoly
namespace PolynomialMatrix
variable ... | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.LinearAlgebra.PolynomialMatrix.Degree
/-!
# Shifted Degrees for Polynomial Rows
-/
namespace CompPoly
namespace PolynomialMatrix
variable ... | @@ -72,12 +72,66 @@
coeff := p.coeff p.natDegree }
| _, _ => none
+private theorem rowShiftedDegreeFold_some_acc_or_mem [Zero F] [BEq F]
+ (row : PolynomialRow F) (shift : Array Nat) :
+ ∀ (xs : List Nat) (acc : Option Nat) (d : Nat),
+ xs.foldl
+ (fun acc j ↦
+ match sh... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_662121379b5b_0 | 47621fd6775e8e71 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Univariate/Vanishing.lean | Vanishing | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 1 | [
{
"theorem_name": "buildFromTrees_poly_eq_listProduct",
"depth": 1,
"n_commands": 0,
"n_lines": 32,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro fuel\n induction fuel with\n | zero =>\n intro trees tree hbuild\n cases trees with\n... | [
{
"name": "subproductTreeListProduct_combinePairs",
"text": "private theorem subproductTreeListProduct_combinePairs\n (M : CPolynomial.MulContext F) (trees : List (CPolynomial.SubproductTree F)) :\n subproductTreeListProduct (CPolynomial.SubproductTree.combinePairs M trees) =\n subproductTreeList... | [
{
"name": "buildFromTrees_poly_eq_listProduct",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 39,
"n_chars": 1543,
"n_subproofs": 1,
"n_tactics": 32,
"cyclomatic": 6,
"n_automation": 8,
"n_rewrites": 3,
"n_structural": 8,
"automation_only": f... | 1 | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Univariate.BatchEval.SubproductTree
/-!
# Vanishing Polynomials for Array Nodes
Reusable executable construction of `∏ x in xs, (X - x)`.
-/... | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Univariate.BatchEval.SubproductTree
/-!
# Vanishing Polynomials for Array Nodes
Reusable executable construction of `∏ x in xs, (X - x)`.
-/... | @@ -48,6 +48,12 @@
rw [← CPolynomial.mul_assoc]
exact subproductTreeFold_combinePairs M rest ((acc * left.poly) * right.poly)
+private theorem subproductTreeListProduct_combinePairs
+ (M : CPolynomial.MulContext F) (trees : List (CPolynomial.SubproductTree F)) :
+ subproductTreeListProduct (CPolyn... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_662121379b5b_1 | 145d18314dd3bb2d | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Univariate/Vanishing.lean | Vanishing | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 1 | [
{
"theorem_name": "subproductTreeListProduct_map_leafFor",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n exact subproductTreeFold_map_leafFor xs 1",
"n_chars": 47,
"n_subproofs": 0,
"n_tactics":... | [
{
"name": "subproductTreeFold_map_leafFor",
"text": "private theorem subproductTreeFold_map_leafFor (xs : List F) (acc : CPolynomial F) :\n (xs.map CPolynomial.SubproductTree.leafFor).foldl\n (fun acc tree ↦ acc * CPolynomial.SubproductTree.poly tree) acc =\n xs.foldl (fun acc x ↦ acc * CPoly... | [
{
"name": "subproductTreeListProduct_map_leafFor",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 6,
"n_chars": 263,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": f... | 1 | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Univariate.BatchEval.SubproductTree
/-!
# Vanishing Polynomials for Array Nodes
Reusable executable construction of `∏ x in xs, (X - x)`.
-/... | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Univariate.BatchEval.SubproductTree
/-!
# Vanishing Polynomials for Array Nodes
Reusable executable construction of `∏ x in xs, (X - x)`.
-/... | @@ -92,9 +92,21 @@
tree (by simpa [CPolynomial.SubproductTree.buildFromTrees] using hbuild)
rw [hrec, subproductTreeListProduct_combinePairs M]
+private theorem subproductTreeFold_map_leafFor (xs : List F) (acc : CPolynomial F) :
+ (xs.map CPolynomial.SubproductTree.leafFor).foldl... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_662121379b5b_2 | 90be46189efa5c08 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Univariate/Vanishing.lean | Vanishing | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 1 | [
{
"theorem_name": "eval_foldl_linearFactor_eq_zero_of_mem",
"depth": 1,
"n_commands": 0,
"n_lines": 13,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction ys generalizing acc with\n | nil =>\n cases hx\n | cons y ys ih =>\n rw [List... | [
{
"name": "eval_linearFactor_self",
"text": "private theorem eval_linearFactor_self (x : F) :\n CPolynomial.eval x (CPolynomial.linearFactor x) = 0 := by\n rw [CPolynomial.eval_toPoly]\n simp [CPolynomial.linearFactor, CPolynomial.toPoly_add, CPolynomial.X_toPoly,\n CPolynomial.C_toPoly]\n\n",
"... | [
{
"name": "eval_foldl_linearFactor_eq_zero_of_mem",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 18,
"n_chars": 599,
"n_subproofs": 0,
"n_tactics": 13,
"cyclomatic": 4,
"n_automation": 1,
"n_rewrites": 4,
"n_structural": 5,
"automation_only"... | 2 | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Univariate.BatchEval.SubproductTree
/-!
# Vanishing Polynomials for Array Nodes
Reusable executable construction of `∏ x in xs, (X - x)`.
-/... | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Univariate.BatchEval.SubproductTree
/-!
# Vanishing Polynomials for Array Nodes
Reusable executable construction of `∏ x in xs, (X - x)`.
-/... | @@ -147,6 +147,12 @@
end VanishingPolynomialContext
+private theorem eval_linearFactor_self (x : F) :
+ CPolynomial.eval x (CPolynomial.linearFactor x) = 0 := by
+ rw [CPolynomial.eval_toPoly]
+ simp [CPolynomial.linearFactor, CPolynomial.toPoly_add, CPolynomial.X_toPoly,
+ CPolynomial.C_toPoly]
+
private... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_662121379b5b_3 | 99b9e2912e464be3 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Univariate/Vanishing.lean | Vanishing | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 1 | [
{
"theorem_name": "eval_foldl_linearFactor_eq_zero_of_mem",
"depth": 1,
"n_commands": 0,
"n_lines": 13,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction ys generalizing acc with\n | nil =>\n cases hx\n | cons y ys ih =>\n rw [List... | [
{
"name": "eval_foldl_linearFactor_eq_zero_of_acc",
"text": "private theorem eval_foldl_linearFactor_eq_zero_of_acc\n (ys : List F) {x : F} {acc : CPolynomial F}\n (hacc : CPolynomial.eval x acc = 0) :\n CPolynomial.eval x\n (ys.foldl (fun acc y ↦ acc * CPolynomial.linearFactor y) acc) = 0 := ... | [
{
"name": "eval_vanishingPolynomialArray_eq_zero_of_mem",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 8,
"n_chars": 381,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_o... | 3 | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Univariate.BatchEval.SubproductTree
/-!
# Vanishing Polynomials for Array Nodes
Reusable executable construction of `∏ x in xs, (X - x)`.
-/... | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Univariate.BatchEval.SubproductTree
/-!
# Vanishing Polynomials for Array Nodes
Reusable executable construction of `∏ x in xs, (X - x)`.
-/... | @@ -153,6 +153,19 @@
simp [CPolynomial.linearFactor, CPolynomial.toPoly_add, CPolynomial.X_toPoly,
CPolynomial.C_toPoly]
+private theorem eval_foldl_linearFactor_eq_zero_of_acc
+ (ys : List F) {x : F} {acc : CPolynomial F}
+ (hacc : CPolynomial.eval x acc = 0) :
+ CPolynomial.eval x
+ (ys.foldl ... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_995dade2e8df_0 | c784318ad6c86379 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/LinearAlgebra/PolynomialMatrix/MuldersStorjohannCorrectness/Fast.lean | Fast | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 11 | 2 | [
{
"theorem_name": "rowGet_rowSubScaledShift",
"depth": 1,
"n_commands": 0,
"n_lines": 14,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n by_cases hj : j < (rowSubScaledShift a c d b).size\n · rw [rowGet, Array.getD_eq_getD_getElem?, Array.getElem?_e... | [
{
"name": "rowSubScaledShift_size",
"text": "theorem rowSubScaledShift_size (a : PolynomialRow F) (c : F) (d : Nat)\n (b : PolynomialRow F) :\n (rowSubScaledShift a c d b).size = max a.size b.size := by\n simp [rowSubScaledShift]\n\n",
"fan_in": 2,
"n_lines": 6,
"n_chars": 190,
"n_sub... | [
{
"name": "rowGet_rowSubScaledShift",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 19,
"n_chars": 884,
"n_subproofs": 3,
"n_tactics": 14,
"cyclomatic": 1,
"n_automation": 4,
"n_rewrites": 4,
"n_structural": 0,
"automation_only": false,
"... | 1 | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.LinearAlgebra.PolynomialMatrix.MuldersStorjohannCorrectness.Minimal
/-!
# Fast Mulders-Storjohann Reduction Agrees With the Direct Definition... | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.LinearAlgebra.PolynomialMatrix.MuldersStorjohannCorrectness.Minimal
/-!
# Fast Mulders-Storjohann Reduction Agrees With the Direct Definition... | @@ -24,6 +24,11 @@
/-! ### Row-level cancellation -/
omit [DecidableEq F] in
+theorem rowSubScaledShift_size (a : PolynomialRow F) (c : F) (d : Nat)
+ (b : PolynomialRow F) :
+ (rowSubScaledShift a c d b).size = max a.size b.size := by
+ simp [rowSubScaledShift]
+
theorem rowGet_rowSubScaledShift (a : Polyn... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_995dade2e8df_1 | 32a1ab7b61923dcd | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/LinearAlgebra/PolynomialMatrix/MuldersStorjohannCorrectness/Fast.lean | Fast | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 11 | 3 | [
{
"theorem_name": "rowLeadingPositions_getD",
"depth": 1,
"n_commands": 0,
"n_lines": 10,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hM : M.getD i #[] = M[i] := by\n rw [Array.getD_eq_getD_getElem?, Array.getElem?_eq_getElem hi,\n Op... | [
{
"name": "rowLeadingPositions_size",
"text": "theorem rowLeadingPositions_size (M : PolynomialMatrix F)\n (shift : Array Nat) :\n (rowLeadingPositions M shift).size = M.size := by\n simp [rowLeadingPositions]\n\nomit [LawfulBEq F] [DecidableEq F] in\n",
"fan_in": 3,
"n_lines": 7,
"n_char... | [
{
"name": "rowLeadingPositions_getD",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 14,
"n_chars": 591,
"n_subproofs": 2,
"n_tactics": 10,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 3,
"n_structural": 1,
"automation_only": false,
"... | 1 | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.LinearAlgebra.PolynomialMatrix.MuldersStorjohannCorrectness.Minimal
/-!
# Fast Mulders-Storjohann Reduction Agrees With the Direct Definition... | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.LinearAlgebra.PolynomialMatrix.MuldersStorjohannCorrectness.Minimal
/-!
# Fast Mulders-Storjohann Reduction Agrees With the Direct Definition... | @@ -74,6 +74,12 @@
/-! ### Cached conflict scan -/
omit [LawfulBEq F] [DecidableEq F] in
+theorem rowLeadingPositions_size (M : PolynomialMatrix F)
+ (shift : Array Nat) :
+ (rowLeadingPositions M shift).size = M.size := by
+ simp [rowLeadingPositions]
+
+omit [LawfulBEq F] [DecidableEq F] in
theorem rowLea... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_995dade2e8df_2 | 67570ab81c51a438 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/LinearAlgebra/PolynomialMatrix/MuldersStorjohannCorrectness/Fast.lean | Fast | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 11 | 1 | [
{
"theorem_name": "rowSubScaledShift_eq",
"depth": 1,
"n_commands": 0,
"n_lines": 14,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n apply Array.ext\n · rw [rowSubScaledShift_size, rowSub_size, rowScaleMonomial_size]\n · intro j hj hj'\n have hl... | [
{
"name": "rowGet_rowSubScaledShift",
"text": "theorem rowGet_rowSubScaledShift (a : PolynomialRow F) (c : F) (d : Nat)\n (b : PolynomialRow F) (j : Nat) :\n rowGet (rowSubScaledShift a c d b) j =\n CPolynomial.subMulMonomial (rowGet a j) c d (rowGet b j) := by\n by_cases hj : j < (rowSubScaledS... | [
{
"name": "muldersStorjohannStepFast_eq",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 4,
"n_lines": 7,
"n_chars": 288,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
... | 4 | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.LinearAlgebra.PolynomialMatrix.MuldersStorjohannCorrectness.Minimal
/-!
# Fast Mulders-Storjohann Reduction Agrees With the Direct Definition... | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.LinearAlgebra.PolynomialMatrix.MuldersStorjohannCorrectness.Minimal
/-!
# Fast Mulders-Storjohann Reduction Agrees With the Direct Definition... | @@ -29,12 +29,40 @@
(rowSubScaledShift a c d b).size = max a.size b.size := by
simp [rowSubScaledShift]
+theorem rowGet_rowSubScaledShift (a : PolynomialRow F) (c : F) (d : Nat)
+ (b : PolynomialRow F) (j : Nat) :
+ rowGet (rowSubScaledShift a c d b) j =
+ CPolynomial.subMulMonomial (rowGet a j) c ... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_0153aee17238_1 | ee5351ccef97ccb4 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/LinearAlgebra/PolynomialMatrix/MuldersStorjohannCorrectness/MatrixRows.lean | MatrixRows | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 5 | [
{
"theorem_name": "replaceRow_shape",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp [MatrixShape, replaceRow_size, replaceRow_matrixWidth hrow]\n\nomit [BEq F] [LawfulBEq F] [DecidableEq F] in",
"n... | [
{
"name": "replaceRow_size",
"text": "theorem replaceRow_size (M : PolynomialMatrix F) (idx : Nat) (row : PolynomialRow F) :\n (replaceRow M idx row).size = M.size := by\n simp [replaceRow, Array.size_setIfInBounds]\n\nomit [BEq F] [LawfulBEq F] [DecidableEq F] in\n",
"fan_in": 5,
"n_lines": 6,
... | [
{
"name": "replaceRow_wellFormed",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 26,
"n_chars": 1102,
"n_subproofs": 7,
"n_tactics": 21,
"cyclomatic": 2,
"n_automation": 6,
"n_rewrites": 3,
"n_structural": 2,
"automation_only": false,
"ma... | 2 | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.LinearAlgebra.PolynomialMatrix.MuldersStorjohannCorrectness.RowOps
/-!
# Mulders-Storjohann Correctness Matrix Row Helpers
Replacement-row, ... | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.LinearAlgebra.PolynomialMatrix.MuldersStorjohannCorrectness.RowOps
/-!
# Mulders-Storjohann Correctness Matrix Row Helpers
Replacement-row, ... | @@ -19,6 +19,11 @@
variable {F : Type*} [Field F] [BEq F] [LawfulBEq F] [DecidableEq F]
omit [BEq F] [LawfulBEq F] [DecidableEq F] in
+theorem replaceRow_size (M : PolynomialMatrix F) (idx : Nat) (row : PolynomialRow F) :
+ (replaceRow M idx row).size = M.size := by
+ simp [replaceRow, Array.size_setIfInBounds]... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_0153aee17238_5 | a9f290cb6b70d944 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/LinearAlgebra/PolynomialMatrix/MuldersStorjohannCorrectness/MatrixRows.lean | MatrixRows | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 3 | [
{
"theorem_name": "matrix_getElem?_getD_size_of_wellFormed",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simpa [Array.getElem?_eq_getElem hi] using matrix_getD_size_of_wellFormed hM hi",
"n_chars": 85... | [
{
"name": "matrix_getD_size_of_wellFormed",
"text": "theorem matrix_getD_size_of_wellFormed\n {M : PolynomialMatrix F} (hM : WellFormed M) {i : Nat} (hi : i < M.size) :\n (M.getD i #[]).size = MatrixWidth M := by\n have hget : M.getD i #[] = M[i] := by\n simp [Array.getD_eq_getD_getElem?, Array.ge... | [
{
"name": "matrix_getElem?_getD_size_of_wellFormed",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 6,
"n_chars": 258,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only":... | 1 | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.LinearAlgebra.PolynomialMatrix.MuldersStorjohannCorrectness.RowOps
/-!
# Mulders-Storjohann Correctness Matrix Row Helpers
Replacement-row, ... | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.LinearAlgebra.PolynomialMatrix.MuldersStorjohannCorrectness.RowOps
/-!
# Mulders-Storjohann Correctness Matrix Row Helpers
Replacement-row, ... | @@ -19,9 +19,19 @@
variable {F : Type*} [Field F] [BEq F] [LawfulBEq F] [DecidableEq F]
omit [BEq F] [LawfulBEq F] [DecidableEq F] in
+theorem matrix_getD_size_of_wellFormed
+ {M : PolynomialMatrix F} (hM : WellFormed M) {i : Nat} (hi : i < M.size) :
+ (M.getD i #[]).size = MatrixWidth M := by
+ have hget : ... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_74cdf51e39ab_0 | bdd402ea2aced475 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/ToMathlib/Polynomial/BivariateWeightedDegree.lean | BivariateWeightedDegree | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 1 | [
{
"theorem_name": "natWeightedDegree_sum_le",
"depth": 1,
"n_commands": 0,
"n_lines": 8,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n classical\n induction s using Finset.induction with\n | empty =>\n simp [natWeightedDegree]\n | insert a s... | [
{
"name": "natWeightedDegree_add_le",
"text": "/-- The weighted degree of a sum is at most the maximum of the weighted degrees. -/\nlemma natWeightedDegree_add_le (p q : F[X][Y]) (u v : ℕ) :\n natWeightedDegree (p + q) u v ≤ max (natWeightedDegree p u v) (natWeightedDegree q u v) := by\n refine Finset.s... | [
{
"name": "natWeightedDegree_sum_le",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 12,
"n_chars": 537,
"n_subproofs": 0,
"n_tactics": 8,
"cyclomatic": 2,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 2,
"automation_only": false,
"m... | 1 | /-
Copyright (c) 2026 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import CompPoly.ToMathlib.Polynomial.BivariateDegree
import Mathlib.Algebra.BigOperators.Group.Finset.Basic
import Mathlib.Algebra.Polynomial.BigOperators
/-!
# Mathlib-Facing... | /-
Copyright (c) 2026 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import CompPoly.ToMathlib.Polynomial.BivariateDegree
import Mathlib.Algebra.BigOperators.Group.Finset.Basic
import Mathlib.Algebra.Polynomial.BigOperators
/-!
# Mathlib-Facing... | @@ -32,6 +32,32 @@
def monomial (i j : ℕ) : F[X][Y] :=
Polynomial.monomial j (Polynomial.monomial i 1)
+/-- The weighted degree of a sum is at most the maximum of the weighted degrees. -/
+lemma natWeightedDegree_add_le (p q : F[X][Y]) (u v : ℕ) :
+ natWeightedDegree (p + q) u v ≤ max (natWeightedDegree p u v)... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_1c0d446ca9fe_0 | 57ee3284da4086ef | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Bivariate/GuruswamiSudan/PolynomialCorrectness.lean | PolynomialCorrectness | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 34 | 3 | [
{
"theorem_name": "foldl_range_single_index",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [foldl_range_one_special (F := F) (pivot := k) x 0 n 0]\n have hin : 0 ≤ k ∧ k < 0 + n := by omega\n simp [hi... | [
{
"name": "foldl_range_one_special",
"text": "/-- Fold over a range with one distinguished nonzero entry. -/\ntheorem foldl_range_one_special {F : Type*} [AddCommMonoid F] {pivot : Nat} (x : F) :\n ∀ start len (init : F),\n (List.range' start len).foldl (fun acc j ↦ acc + if j = pivot then x else 0) i... | [
{
"name": "foldl_range_single_index",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 9,
"n_chars": 368,
"n_subproofs": 1,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
"ma... | 1 | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Bivariate.Deriv
import CompPoly.Bivariate.GuruswamiSudan.Polynomial
import CompPoly.Data.List.Lemmas
import CompPoly.LinearAlgebra.Dense
impor... | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Bivariate.Deriv
import CompPoly.Bivariate.GuruswamiSudan.Polynomial
import CompPoly.Data.List.Lemmas
import CompPoly.LinearAlgebra.Dense
impor... | @@ -25,10 +25,43 @@
namespace DenseMatrix
+/-- Fold over a range with one distinguished nonzero entry. -/
+theorem foldl_range_one_special {F : Type*} [AddCommMonoid F] {pivot : Nat} (x : F) :
+ ∀ start len (init : F),
+ (List.range' start len).foldl (fun acc j ↦ acc + if j = pivot then x else 0) init =
+ ... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_1c0d446ca9fe_1 | e34a308ad48c4572 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Bivariate/GuruswamiSudan/PolynomialCorrectness.lean | PolynomialCorrectness | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 34 | 6 | [
{
"theorem_name": "coeff_eq_zero_of_y_size_le",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n change (CPolynomial.coeff Q j).coeff i = 0\n rw [CPolynomial.coeff_eq_zero_of_size_le Q hj]\n exact CPolynomia... | [
{
"name": "coeff_zero",
"text": "/-- All bivariate coefficients of zero are zero. -/\ntheorem coeff_zero {R : Type*}\n [Semiring R] [BEq R] [LawfulBEq R] [Nontrivial R] (i j : Nat) :\n coeff (0 : CBivariate R) i j = 0 := by\n change CPolynomial.coeff (CPolynomial.coeff (0 : CBivariate R) j) i = 0\n ... | [
{
"name": "coeff_eq_zero_of_y_size_le",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 8,
"n_chars": 335,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 2,
"n_structural": 1,
"automation_only": false,
"... | 1 | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Bivariate.Deriv
import CompPoly.Bivariate.GuruswamiSudan.Polynomial
import CompPoly.Data.List.Lemmas
import CompPoly.LinearAlgebra.Dense
impor... | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Bivariate.Deriv
import CompPoly.Bivariate.GuruswamiSudan.Polynomial
import CompPoly.Data.List.Lemmas
import CompPoly.LinearAlgebra.Dense
impor... | @@ -29,9 +29,21 @@
namespace CBivariate
+/-- All bivariate coefficients of zero are zero. -/
+theorem coeff_zero {R : Type*}
+ [Semiring R] [BEq R] [LawfulBEq R] [Nontrivial R] (i j : Nat) :
+ coeff (0 : CBivariate R) i j = 0 := by
+ change CPolynomial.coeff (CPolynomial.coeff (0 : CBivariate R) j) i = 0
+ ... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_1c0d446ca9fe_2 | 5651635d1237e64c | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Bivariate/GuruswamiSudan/PolynomialCorrectness.lean | PolynomialCorrectness | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 34 | 6 | [
{
"theorem_name": "coeff_eq_zero_of_y_size_le",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n change (CPolynomial.coeff Q j).coeff i = 0\n rw [CPolynomial.coeff_eq_zero_of_size_le Q hj]\n exact CPolynomia... | [
{
"name": "coeff_zero",
"text": "/-- All bivariate coefficients of zero are zero. -/\ntheorem coeff_zero {R : Type*}\n [Semiring R] [BEq R] [LawfulBEq R] [Nontrivial R] (i j : Nat) :\n coeff (0 : CBivariate R) i j = 0 := by\n change CPolynomial.coeff (CPolynomial.coeff (0 : CBivariate R) j) i = 0\n ... | [
{
"name": "ofMonomialCoeffs_coeff",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 40,
"n_chars": 1490,
"n_subproofs": 1,
"n_tactics": 27,
"cyclomatic": 2,
"n_automation": 1,
"n_rewrites": 2,
"n_structural": 7,
"automation_only": false,
"m... | 1 | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Bivariate.Deriv
import CompPoly.Bivariate.GuruswamiSudan.Polynomial
import CompPoly.Data.List.Lemmas
import CompPoly.LinearAlgebra.Dense
impor... | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Bivariate.Deriv
import CompPoly.Bivariate.GuruswamiSudan.Polynomial
import CompPoly.Data.List.Lemmas
import CompPoly.LinearAlgebra.Dense
impor... | @@ -29,6 +29,15 @@
namespace CBivariate
+/-- All bivariate coefficients of zero are zero. -/
+theorem coeff_zero {R : Type*}
+ [Semiring R] [BEq R] [LawfulBEq R] [Nontrivial R] (i j : Nat) :
+ coeff (0 : CBivariate R) i j = 0 := by
+ change CPolynomial.coeff (CPolynomial.coeff (0 : CBivariate R) j) i = 0
+ ... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_1c0d446ca9fe_3 | eba6115d68005355 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Bivariate/GuruswamiSudan/PolynomialCorrectness.lean | PolynomialCorrectness | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 34 | 1 | [
{
"theorem_name": "monomialsWeightedDegreeLE_nodup",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simpa [monomialsWeightedDegreeLE] using\n (monomialGrid_nodup bound).filter\n (fun m ↦ xWeight * m.... | [
{
"name": "monomialGrid_nodup",
"text": "/-- The executable monomial grid has no duplicate exponent pairs. -/\ntheorem monomialGrid_nodup (bound : Nat) : (monomialGrid bound).Nodup := by\n unfold monomialGrid\n rw [List.nodup_flatMap]\n constructor\n · intro y _\n exact List.nodup_range.map (by\n ... | [
{
"name": "monomialsWeightedDegreeLE_nodup",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 8,
"n_chars": 373,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true,
... | 1 | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Bivariate.Deriv
import CompPoly.Bivariate.GuruswamiSudan.Polynomial
import CompPoly.Data.List.Lemmas
import CompPoly.LinearAlgebra.Dense
impor... | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Bivariate.Deriv
import CompPoly.Bivariate.GuruswamiSudan.Polynomial
import CompPoly.Data.List.Lemmas
import CompPoly.LinearAlgebra.Dense
impor... | @@ -29,9 +29,30 @@
namespace CBivariate
+/-- The executable monomial grid has no duplicate exponent pairs. -/
+theorem monomialGrid_nodup (bound : Nat) : (monomialGrid bound).Nodup := by
+ unfold monomialGrid
+ rw [List.nodup_flatMap]
+ constructor
+ · intro y _
+ exact List.nodup_range.map (by
+ intro... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_1c0d446ca9fe_4 | 8937399402caab06 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Bivariate/GuruswamiSudan/PolynomialCorrectness.lean | PolynomialCorrectness | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 34 | 2 | [
{
"theorem_name": "ofMonomialCoeffs_coeff_getD",
"depth": 1,
"n_commands": 0,
"n_lines": 61,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [ofMonomialCoeffs_coeff]\n have hfold : ∀ (xs : List Nat) (acc : R),\n (∀ col, col ∈ xs → col < monom... | [
{
"name": "ofMonomialCoeffs_coeff",
"text": "/-- Coefficients of a polynomial assembled from a monomial array are the folded\nsum of matching monomial coefficients. -/\ntheorem ofMonomialCoeffs_coeff {R : Type*}\n [Semiring R] [BEq R] [LawfulBEq R] [Nontrivial R] [DecidableEq R]\n (monomials : Array M... | [
{
"name": "ofMonomialCoeffs_coeff_getD",
"fan_in": 1,
"n_deps_direct": 3,
"n_deps_transitive": 5,
"n_lines": 71,
"n_chars": 2914,
"n_subproofs": 6,
"n_tactics": 61,
"cyclomatic": 5,
"n_automation": 7,
"n_rewrites": 5,
"n_structural": 16,
"automation_only": false,
... | 5 | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Bivariate.Deriv
import CompPoly.Bivariate.GuruswamiSudan.Polynomial
import CompPoly.Data.List.Lemmas
import CompPoly.LinearAlgebra.Dense
impor... | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Bivariate.Deriv
import CompPoly.Bivariate.GuruswamiSudan.Polynomial
import CompPoly.Data.List.Lemmas
import CompPoly.LinearAlgebra.Dense
impor... | @@ -76,6 +76,45 @@
rw [houter]
rw [CPolynomial.coeff_zero]
+/-- Coefficients of a polynomial assembled from a monomial array are the folded
+sum of matching monomial coefficients. -/
+theorem ofMonomialCoeffs_coeff {R : Type*}
+ [Semiring R] [BEq R] [LawfulBEq R] [Nontrivial R] [DecidableEq R]
+ (monomial... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_1c0d446ca9fe_5 | a4f957a966dca6c4 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Bivariate/GuruswamiSudan/PolynomialCorrectness.lean | PolynomialCorrectness | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 34 | 2 | [
{
"theorem_name": "ofMonomialCoeffs_coeff_getD",
"depth": 1,
"n_commands": 0,
"n_lines": 61,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [ofMonomialCoeffs_coeff]\n have hfold : ∀ (xs : List Nat) (acc : R),\n (∀ col, col ∈ xs → col < monom... | [
{
"name": "ofMonomialCoeffs_coeff",
"text": "/-- Coefficients of a polynomial assembled from a monomial array are the folded\nsum of matching monomial coefficients. -/\ntheorem ofMonomialCoeffs_coeff {R : Type*}\n [Semiring R] [BEq R] [LawfulBEq R] [Nontrivial R] [DecidableEq R]\n (monomials : Array M... | [
{
"name": "ofMonomialCoeffs_ne_zero_of_coeff_getD_ne_zero",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 6,
"n_lines": 22,
"n_chars": 917,
"n_subproofs": 2,
"n_tactics": 13,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 2,
"n_structural": 3,
"automati... | 6 | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Bivariate.Deriv
import CompPoly.Bivariate.GuruswamiSudan.Polynomial
import CompPoly.Data.List.Lemmas
import CompPoly.LinearAlgebra.Dense
impor... | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Bivariate.Deriv
import CompPoly.Bivariate.GuruswamiSudan.Polynomial
import CompPoly.Data.List.Lemmas
import CompPoly.LinearAlgebra.Dense
impor... | @@ -76,6 +76,45 @@
rw [houter]
rw [CPolynomial.coeff_zero]
+/-- Coefficients of a polynomial assembled from a monomial array are the folded
+sum of matching monomial coefficients. -/
+theorem ofMonomialCoeffs_coeff {R : Type*}
+ [Semiring R] [BEq R] [LawfulBEq R] [Nontrivial R] [DecidableEq R]
+ (monomial... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_1c0d446ca9fe_6 | a0e5efe89512c191 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Bivariate/GuruswamiSudan/PolynomialCorrectness.lean | PolynomialCorrectness | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 34 | 1 | [
{
"theorem_name": "natWeightedDegree_le_of_coeff_zero",
"depth": 1,
"n_commands": 0,
"n_lines": 16,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold natWeightedDegree\n apply Finset.sup_le\n intro j hj\n by_cases hcoeffY : f.val.coeff j = 0\n... | [
{
"name": "natDegree_mem_support_of_nonzero",
"text": "/-- The natural degree of a nonzero computable polynomial lies in its support. -/\ntheorem natDegree_mem_support_of_nonzero {R : Type*} [Zero R] [BEq R] [LawfulBEq R]\n {p : CPolynomial R} (hp : p ≠ 0) : p.natDegree ∈ p.support := by\n rcases CPolyn... | [
{
"name": "natWeightedDegree_le_of_coeff_zero",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 23,
"n_chars": 1061,
"n_subproofs": 5,
"n_tactics": 16,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 2,
"n_structural": 4,
"automation_only": f... | 1 | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Bivariate.Deriv
import CompPoly.Bivariate.GuruswamiSudan.Polynomial
import CompPoly.Data.List.Lemmas
import CompPoly.LinearAlgebra.Dense
impor... | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Bivariate.Deriv
import CompPoly.Bivariate.GuruswamiSudan.Polynomial
import CompPoly.Data.List.Lemmas
import CompPoly.LinearAlgebra.Dense
impor... | @@ -21,6 +21,15 @@
namespace CPolynomial
+/-- The natural degree of a nonzero computable polynomial lies in its support. -/
+theorem natDegree_mem_support_of_nonzero {R : Type*} [Zero R] [BEq R] [LawfulBEq R]
+ {p : CPolynomial R} (hp : p ≠ 0) : p.natDegree ∈ p.support := by
+ rcases CPolynomial.degree_eq_supp... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_1c0d446ca9fe_7 | a573939cb2d924b6 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Bivariate/GuruswamiSudan/PolynomialCorrectness.lean | PolynomialCorrectness | 7 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 34 | 2 | [
{
"theorem_name": "ofMonomialCoeffs_coeff_getD",
"depth": 1,
"n_commands": 0,
"n_lines": 61,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [ofMonomialCoeffs_coeff]\n have hfold : ∀ (xs : List Nat) (acc : R),\n (∀ col, col ∈ xs → col < monom... | [
{
"name": "ofMonomialCoeffs_coeff",
"text": "/-- Coefficients of a polynomial assembled from a monomial array are the folded\nsum of matching monomial coefficients. -/\ntheorem ofMonomialCoeffs_coeff {R : Type*}\n [Semiring R] [BEq R] [LawfulBEq R] [Nontrivial R] [DecidableEq R]\n (monomials : Array M... | [
{
"name": "ofMonomialCoeffs_coeff_eq_zero_of_weight_gt",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 28,
"n_chars": 1219,
"n_subproofs": 2,
"n_tactics": 18,
"cyclomatic": 2,
"n_automation": 0,
"n_rewrites": 6,
"n_structural": 5,
"automation... | 3 | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Bivariate.Deriv
import CompPoly.Bivariate.GuruswamiSudan.Polynomial
import CompPoly.Data.List.Lemmas
import CompPoly.LinearAlgebra.Dense
impor... | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Bivariate.Deriv
import CompPoly.Bivariate.GuruswamiSudan.Polynomial
import CompPoly.Data.List.Lemmas
import CompPoly.LinearAlgebra.Dense
impor... | @@ -62,6 +62,45 @@
rw [houter]
rw [CPolynomial.coeff_zero]
+/-- Coefficients of a polynomial assembled from a monomial array are the folded
+sum of matching monomial coefficients. -/
+theorem ofMonomialCoeffs_coeff {R : Type*}
+ [Semiring R] [BEq R] [LawfulBEq R] [Nontrivial R] [DecidableEq R]
+ (monomial... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_1c0d446ca9fe_8 | 8a88b81d487b6f9a | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Bivariate/GuruswamiSudan/PolynomialCorrectness.lean | PolynomialCorrectness | 8 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 34 | 2 | [
{
"theorem_name": "ofMonomialCoeffs_coeff_getD",
"depth": 1,
"n_commands": 0,
"n_lines": 61,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [ofMonomialCoeffs_coeff]\n have hfold : ∀ (xs : List Nat) (acc : R),\n (∀ col, col ∈ xs → col < monom... | [
{
"name": "ofMonomialCoeffs_coeff",
"text": "/-- Coefficients of a polynomial assembled from a monomial array are the folded\nsum of matching monomial coefficients. -/\ntheorem ofMonomialCoeffs_coeff {R : Type*}\n [Semiring R] [BEq R] [LawfulBEq R] [Nontrivial R] [DecidableEq R]\n (monomials : Array M... | [
{
"name": "ofMonomialCoeffs_natWeightedDegree_le",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 6,
"n_lines": 13,
"n_chars": 664,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": ... | 6 | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Bivariate.Deriv
import CompPoly.Bivariate.GuruswamiSudan.Polynomial
import CompPoly.Data.List.Lemmas
import CompPoly.LinearAlgebra.Dense
impor... | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Bivariate.Deriv
import CompPoly.Bivariate.GuruswamiSudan.Polynomial
import CompPoly.Data.List.Lemmas
import CompPoly.LinearAlgebra.Dense
impor... | @@ -71,6 +71,45 @@
rw [houter]
rw [CPolynomial.coeff_zero]
+/-- Coefficients of a polynomial assembled from a monomial array are the folded
+sum of matching monomial coefficients. -/
+theorem ofMonomialCoeffs_coeff {R : Type*}
+ [Semiring R] [BEq R] [LawfulBEq R] [Nontrivial R] [DecidableEq R]
+ (monomial... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_1c0d446ca9fe_9 | ba9626ed600c179f | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Bivariate/GuruswamiSudan/PolynomialCorrectness.lean | PolynomialCorrectness | 9 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 34 | 6 | [
{
"theorem_name": "coeff_eq_zero_of_y_size_le",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n change (CPolynomial.coeff Q j).coeff i = 0\n rw [CPolynomial.coeff_eq_zero_of_size_le Q hj]\n exact CPolynomia... | [
{
"name": "coeff_zero",
"text": "/-- All bivariate coefficients of zero are zero. -/\ntheorem coeff_zero {R : Type*}\n [Semiring R] [BEq R] [LawfulBEq R] [Nontrivial R] (i j : Nat) :\n coeff (0 : CBivariate R) i j = 0 := by\n change CPolynomial.coeff (CPolynomial.coeff (0 : CBivariate R) j) i = 0\n ... | [
{
"name": "hasseDerivativeFromTerms_coeff",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 30,
"n_chars": 1145,
"n_subproofs": 1,
"n_tactics": 20,
"cyclomatic": 2,
"n_automation": 1,
"n_rewrites": 2,
"n_structural": 7,
"automation_only": false... | 1 | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Bivariate.Deriv
import CompPoly.Bivariate.GuruswamiSudan.Polynomial
import CompPoly.Data.List.Lemmas
import CompPoly.LinearAlgebra.Dense
impor... | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Bivariate.Deriv
import CompPoly.Bivariate.GuruswamiSudan.Polynomial
import CompPoly.Data.List.Lemmas
import CompPoly.LinearAlgebra.Dense
impor... | @@ -29,6 +29,15 @@
namespace CBivariate
+/-- All bivariate coefficients of zero are zero. -/
+theorem coeff_zero {R : Type*}
+ [Semiring R] [BEq R] [LawfulBEq R] [Nontrivial R] (i j : Nat) :
+ coeff (0 : CBivariate R) i j = 0 := by
+ change CPolynomial.coeff (CPolynomial.coeff (0 : CBivariate R) j) i = 0
+ ... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_1c0d446ca9fe_10 | b991eb6e989c4de6 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Bivariate/GuruswamiSudan/PolynomialCorrectness.lean | PolynomialCorrectness | 10 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 34 | 3 | [
{
"theorem_name": "foldl_range_single_index",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [foldl_range_one_special (F := F) (pivot := k) x 0 n 0]\n have hin : 0 ≤ k ∧ k < 0 + n := by omega\n simp [hi... | [
{
"name": "foldl_range_one_special",
"text": "/-- Fold over a range with one distinguished nonzero entry. -/\ntheorem foldl_range_one_special {F : Type*} [AddCommMonoid F] {pivot : Nat} (x : F) :\n ∀ start len (init : F),\n (List.range' start len).foldl (fun acc j ↦ acc + if j = pivot then x else 0) i... | [
{
"name": "hasseDerivativeTermList_coeff_inner_fold",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 93,
"n_chars": 3421,
"n_subproofs": 10,
"n_tactics": 77,
"cyclomatic": 3,
"n_automation": 13,
"n_rewrites": 9,
"n_structural": 8,
"automation_... | 1 | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Bivariate.Deriv
import CompPoly.Bivariate.GuruswamiSudan.Polynomial
import CompPoly.Data.List.Lemmas
import CompPoly.LinearAlgebra.Dense
impor... | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Bivariate.Deriv
import CompPoly.Bivariate.GuruswamiSudan.Polynomial
import CompPoly.Data.List.Lemmas
import CompPoly.LinearAlgebra.Dense
impor... | @@ -25,6 +25,36 @@
namespace DenseMatrix
+/-- Fold over a range with one distinguished nonzero entry. -/
+theorem foldl_range_one_special {F : Type*} [AddCommMonoid F] {pivot : Nat} (x : F) :
+ ∀ start len (init : F),
+ (List.range' start len).foldl (fun acc j ↦ acc + if j = pivot then x else 0) init =
+ ... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_1c0d446ca9fe_11 | 926a416e1040bd5c | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Bivariate/GuruswamiSudan/PolynomialCorrectness.lean | PolynomialCorrectness | 11 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 34 | 1 | [
{
"theorem_name": "hasseDerivativeTermList_coeff_value",
"depth": 1,
"n_commands": 0,
"n_lines": 62,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [hasseDerivativeTermList_coeff_fold]\n let source :=\n if i + a < (Q.val.coeff (j + b)).val.siz... | [
{
"name": "coeff_eq_zero_of_y_size_le",
"text": "/-- Bivariate coefficients past the stored outer array are zero. -/\ntheorem coeff_eq_zero_of_y_size_le {R : Type*} [Zero R] (Q : CBivariate R)\n {i j : Nat} (hj : Q.val.size ≤ j) : coeff Q i j = 0 := by\n change (CPolynomial.coeff Q j).coeff i = 0\n rw ... | [
{
"name": "hasseDerivativeTermList_coeff_value",
"fan_in": 1,
"n_deps_direct": 4,
"n_deps_transitive": 5,
"n_lines": 72,
"n_chars": 2820,
"n_subproofs": 6,
"n_tactics": 62,
"cyclomatic": 1,
"n_automation": 10,
"n_rewrites": 12,
"n_structural": 4,
"automation_only"... | 5 | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Bivariate.Deriv
import CompPoly.Bivariate.GuruswamiSudan.Polynomial
import CompPoly.Data.List.Lemmas
import CompPoly.LinearAlgebra.Dense
impor... | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Bivariate.Deriv
import CompPoly.Bivariate.GuruswamiSudan.Polynomial
import CompPoly.Data.List.Lemmas
import CompPoly.LinearAlgebra.Dense
impor... | @@ -68,6 +68,13 @@
rw [houter]
rw [CPolynomial.coeff_zero]
+/-- Bivariate coefficients past the stored outer array are zero. -/
+theorem coeff_eq_zero_of_y_size_le {R : Type*} [Zero R] (Q : CBivariate R)
+ {i j : Nat} (hj : Q.val.size ≤ j) : coeff Q i j = 0 := by
+ change (CPolynomial.coeff Q j).coeff i = 0... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_1c0d446ca9fe_12 | e2c908eb29e468d8 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Bivariate/GuruswamiSudan/PolynomialCorrectness.lean | PolynomialCorrectness | 12 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 34 | 1 | [
{
"theorem_name": "hasseDerivativeTermList_coeff_value",
"depth": 1,
"n_commands": 0,
"n_lines": 62,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [hasseDerivativeTermList_coeff_fold]\n let source :=\n if i + a < (Q.val.coeff (j + b)).val.siz... | [
{
"name": "hasseDerivativeTermList_coeff_fold",
"text": "/-- The fixed coefficient of the executable Hasse term list is the matching\ncoefficient fold over the same degree ranges. -/\ntheorem hasseDerivativeTermList_coeff_fold {R : Type*} [Semiring R]\n (a b i j : Nat) (Q : CBivariate R) :\n (hasseDer... | [
{
"name": "hasseDerivative_coeff",
"fan_in": 4,
"n_deps_direct": 2,
"n_deps_transitive": 7,
"n_lines": 13,
"n_chars": 546,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 2,
"n_structural": 1,
"automation_only": false,
"max_... | 7 | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Bivariate.Deriv
import CompPoly.Bivariate.GuruswamiSudan.Polynomial
import CompPoly.Data.List.Lemmas
import CompPoly.LinearAlgebra.Dense
impor... | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Bivariate.Deriv
import CompPoly.Bivariate.GuruswamiSudan.Polynomial
import CompPoly.Data.List.Lemmas
import CompPoly.LinearAlgebra.Dense
impor... | @@ -104,6 +104,120 @@
rw [coeff_add, coeff_monomialXY, hout]
exact hfold terms 0 0 (coeff_zero i j)
+/-- The fixed coefficient of the executable Hasse term list is the matching
+coefficient fold over the same degree ranges. -/
+theorem hasseDerivativeTermList_coeff_fold {R : Type*} [Semiring R]
+ (a b ... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_1c0d446ca9fe_13 | d09b1e27730fc2e7 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Bivariate/GuruswamiSudan/PolynomialCorrectness.lean | PolynomialCorrectness | 13 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 34 | 4 | [
{
"theorem_name": "hasseDerivative_add",
"depth": 1,
"n_commands": 0,
"n_lines": 8,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [eq_iff_coeff]\n intro i j\n rw [hasseDerivative_coeff]\n rw [coeff_add]\n rw [coeff_add]\n rw [hasseDerivative... | [
{
"name": "hasseDerivative_coeff",
"text": "/-- Coefficients of the executable Hasse derivative are shifted source\ncoefficients scaled by the corresponding binomial factors. -/\ntheorem hasseDerivative_coeff {R : Type*}\n [Semiring R] [BEq R] [LawfulBEq R] [Nontrivial R] [DecidableEq R]\n (a b i j : ... | [
{
"name": "hasseDerivative_add",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 8,
"n_lines": 14,
"n_chars": 437,
"n_subproofs": 0,
"n_tactics": 8,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 6,
"n_structural": 1,
"automation_only": false,
"max_ne... | 8 | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Bivariate.Deriv
import CompPoly.Bivariate.GuruswamiSudan.Polynomial
import CompPoly.Data.List.Lemmas
import CompPoly.LinearAlgebra.Dense
impor... | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Bivariate.Deriv
import CompPoly.Bivariate.GuruswamiSudan.Polynomial
import CompPoly.Data.List.Lemmas
import CompPoly.LinearAlgebra.Dense
impor... | @@ -381,11 +381,30 @@
rw [coeff_eq_zero_of_y_size_le Q hyLe]
simp [source, hyIn]
+/-- Coefficients of the executable Hasse derivative are shifted source
+coefficients scaled by the corresponding binomial factors. -/
+theorem hasseDerivative_coeff {R : Type*}
+ [Semiring R] [BEq R] [LawfulBEq R] [Nontrivi... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_1c0d446ca9fe_14 | 1ec32bddb243fcbd | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Bivariate/GuruswamiSudan/PolynomialCorrectness.lean | PolynomialCorrectness | 14 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 34 | 4 | [
{
"theorem_name": "hasseDerivative_add",
"depth": 1,
"n_commands": 0,
"n_lines": 8,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [eq_iff_coeff]\n intro i j\n rw [hasseDerivative_coeff]\n rw [coeff_add]\n rw [coeff_add]\n rw [hasseDerivative... | [
{
"name": "hasseDerivative_coeff",
"text": "/-- Coefficients of the executable Hasse derivative are shifted source\ncoefficients scaled by the corresponding binomial factors. -/\ntheorem hasseDerivative_coeff {R : Type*}\n [Semiring R] [BEq R] [LawfulBEq R] [Nontrivial R] [DecidableEq R]\n (a b i j : ... | [
{
"name": "hasseDerivative_zero",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 8,
"n_lines": 11,
"n_chars": 320,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 2,
"n_structural": 1,
"automation_only": false,
"max_n... | 8 | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Bivariate.Deriv
import CompPoly.Bivariate.GuruswamiSudan.Polynomial
import CompPoly.Data.List.Lemmas
import CompPoly.LinearAlgebra.Dense
impor... | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Bivariate.Deriv
import CompPoly.Bivariate.GuruswamiSudan.Polynomial
import CompPoly.Data.List.Lemmas
import CompPoly.LinearAlgebra.Dense
impor... | @@ -381,11 +381,27 @@
rw [coeff_eq_zero_of_y_size_le Q hyLe]
simp [source, hyIn]
+/-- Coefficients of the executable Hasse derivative are shifted source
+coefficients scaled by the corresponding binomial factors. -/
+theorem hasseDerivative_coeff {R : Type*}
+ [Semiring R] [BEq R] [LawfulBEq R] [Nontrivi... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_1c0d446ca9fe_15 | 2eb2298aa6c352d2 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Bivariate/GuruswamiSudan/PolynomialCorrectness.lean | PolynomialCorrectness | 15 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 34 | 4 | [
{
"theorem_name": "hasseDerivative_add",
"depth": 1,
"n_commands": 0,
"n_lines": 8,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [eq_iff_coeff]\n intro i j\n rw [hasseDerivative_coeff]\n rw [coeff_add]\n rw [coeff_add]\n rw [hasseDerivative... | [
{
"name": "hasseDerivative_coeff",
"text": "/-- Coefficients of the executable Hasse derivative are shifted source\ncoefficients scaled by the corresponding binomial factors. -/\ntheorem hasseDerivative_coeff {R : Type*}\n [Semiring R] [BEq R] [LawfulBEq R] [Nontrivial R] [DecidableEq R]\n (a b i j : ... | [
{
"name": "hasseDerivative_monomialXY",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 8,
"n_lines": 37,
"n_chars": 1253,
"n_subproofs": 5,
"n_tactics": 29,
"cyclomatic": 8,
"n_automation": 6,
"n_rewrites": 9,
"n_structural": 8,
"automation_only": false,
... | 8 | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Bivariate.Deriv
import CompPoly.Bivariate.GuruswamiSudan.Polynomial
import CompPoly.Data.List.Lemmas
import CompPoly.LinearAlgebra.Dense
impor... | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Bivariate.Deriv
import CompPoly.Bivariate.GuruswamiSudan.Polynomial
import CompPoly.Data.List.Lemmas
import CompPoly.LinearAlgebra.Dense
impor... | @@ -381,6 +381,18 @@
rw [coeff_eq_zero_of_y_size_le Q hyLe]
simp [source, hyIn]
+/-- Coefficients of the executable Hasse derivative are shifted source
+coefficients scaled by the corresponding binomial factors. -/
+theorem hasseDerivative_coeff {R : Type*}
+ [Semiring R] [BEq R] [LawfulBEq R] [Nontrivia... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_1c0d446ca9fe_16 | a2d6fa05a4fc1b6e | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Bivariate/GuruswamiSudan/PolynomialCorrectness.lean | PolynomialCorrectness | 16 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 34 | 1 | [
{
"theorem_name": "hasseDerivativeTerms_eval_aux",
"depth": 1,
"n_commands": 0,
"n_lines": 8,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction terms generalizing acc with\n | nil => rfl\n | cons term terms ih =>\n simp [List.foldl]\n ... | [
{
"name": "evalEval_monomialXY",
"text": "/-- Full evaluation of a bivariate monomial has the expected closed form. -/\ntheorem evalEval_monomialXY {R : Type*}\n [CommSemiring R] [BEq R] [LawfulBEq R] [Nontrivial R] [DecidableEq R]\n (x y c : R) (n m : Nat) :\n evalEval x y (monomialXY n m c) = c *... | [
{
"name": "hasseDerivativeTerms_eval_aux",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 18,
"n_chars": 696,
"n_subproofs": 0,
"n_tactics": 8,
"cyclomatic": 2,
"n_automation": 2,
"n_rewrites": 3,
"n_structural": 1,
"automation_only": false,
... | 2 | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Bivariate.Deriv
import CompPoly.Bivariate.GuruswamiSudan.Polynomial
import CompPoly.Data.List.Lemmas
import CompPoly.LinearAlgebra.Dense
impor... | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Bivariate.Deriv
import CompPoly.Bivariate.GuruswamiSudan.Polynomial
import CompPoly.Data.List.Lemmas
import CompPoly.LinearAlgebra.Dense
impor... | @@ -37,6 +37,14 @@
rw [evalEval_toPoly, evalEval_toPoly, evalEval_toPoly, toPoly_add]
simp [Polynomial.evalEval, Polynomial.eval_add]
+/-- Full evaluation of a bivariate monomial has the expected closed form. -/
+theorem evalEval_monomialXY {R : Type*}
+ [CommSemiring R] [BEq R] [LawfulBEq R] [Nontrivial R] ... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_1c0d446ca9fe_17 | e7b4086b6caba29f | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Bivariate/GuruswamiSudan/PolynomialCorrectness.lean | PolynomialCorrectness | 17 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 34 | 1 | [
{
"theorem_name": "hasseDerivativeTerms_eval_aux",
"depth": 1,
"n_commands": 0,
"n_lines": 8,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction terms generalizing acc with\n | nil => rfl\n | cons term terms ih =>\n simp [List.foldl]\n ... | [
{
"name": "evalEval_monomialXY",
"text": "/-- Full evaluation of a bivariate monomial has the expected closed form. -/\ntheorem evalEval_monomialXY {R : Type*}\n [CommSemiring R] [BEq R] [LawfulBEq R] [Nontrivial R] [DecidableEq R]\n (x y c : R) (n m : Nat) :\n evalEval x y (monomialXY n m c) = c *... | [
{
"name": "hasseDerivativeFromTerms_eval",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 4,
"n_lines": 11,
"n_chars": 486,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 3,
"n_structural": 0,
"automation_only": false,
... | 4 | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Bivariate.Deriv
import CompPoly.Bivariate.GuruswamiSudan.Polynomial
import CompPoly.Data.List.Lemmas
import CompPoly.LinearAlgebra.Dense
impor... | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Bivariate.Deriv
import CompPoly.Bivariate.GuruswamiSudan.Polynomial
import CompPoly.Data.List.Lemmas
import CompPoly.LinearAlgebra.Dense
impor... | @@ -44,6 +44,14 @@
rw [evalEval_toPoly, toPoly_zero]
simp [Polynomial.evalEval]
+/-- Full evaluation of a bivariate monomial has the expected closed form. -/
+theorem evalEval_monomialXY {R : Type*}
+ [CommSemiring R] [BEq R] [LawfulBEq R] [Nontrivial R] [DecidableEq R]
+ (x y c : R) (n m : Nat) :
+ ev... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_1c0d446ca9fe_18 | f3743d4a7df3135b | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Bivariate/GuruswamiSudan/PolynomialCorrectness.lean | PolynomialCorrectness | 18 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 34 | 1 | [
{
"theorem_name": "hasseDerivativeFromTerms_eval",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold hasseDerivativeFromTerms hasseDerivativeEvalFromTerms\n rw [hasseDerivativeTerms_eval_aux]\n rw [eva... | [
{
"name": "hasseDerivativeTerms_eval_aux",
"text": "/-- Evaluating the materialized derivative-term fold matches the direct scalar fold. -/\ntheorem hasseDerivativeTerms_eval_aux {R : Type*}\n [CommSemiring R] [BEq R] [LawfulBEq R] [Nontrivial R] [DecidableEq R]\n (x y : R) (terms : List (HasseTerm R)... | [
{
"name": "hasseDerivative_eval_eq_eval",
"fan_in": 3,
"n_deps_direct": 1,
"n_deps_transitive": 5,
"n_lines": 9,
"n_chars": 435,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false,
... | 5 | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Bivariate.Deriv
import CompPoly.Bivariate.GuruswamiSudan.Polynomial
import CompPoly.Data.List.Lemmas
import CompPoly.LinearAlgebra.Dense
impor... | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Bivariate.Deriv
import CompPoly.Bivariate.GuruswamiSudan.Polynomial
import CompPoly.Data.List.Lemmas
import CompPoly.LinearAlgebra.Dense
impor... | @@ -52,12 +52,32 @@
rw [evalEval_toPoly, monomialXY_toPoly]
simp [Polynomial.evalEval, Polynomial.eval_monomial]
+/-- Evaluating the materialized derivative-term fold matches the direct scalar fold. -/
+theorem hasseDerivativeTerms_eval_aux {R : Type*}
+ [CommSemiring R] [BEq R] [LawfulBEq R] [Nontrivial R] ... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_1c0d446ca9fe_19 | 9b723e7f736b269b | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Bivariate/GuruswamiSudan/PolynomialCorrectness.lean | PolynomialCorrectness | 19 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 34 | 1 | [
{
"theorem_name": "hasseDeriv_eval_C_eq_eval_coeffwise_hasseDeriv",
"depth": 1,
"n_commands": 0,
"n_lines": 19,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [Polynomial.eval_eq_sum]\n induction P using Polynomial.induction_on' with\n | add P Q... | [
{
"name": "hasseDeriv_mul_C_pow",
"text": "/-- Hasse derivatives in `X` commute with multiplication by an `X`-constant\npolynomial. -/\nprivate theorem hasseDeriv_mul_C_pow {F : Type*} [Field F]\n (P : Polynomial F) (c : F) (n a : Nat) :\n Polynomial.hasseDeriv a (P * Polynomial.C c ^ n) =\n Poly... | [
{
"name": "hasseDeriv_eval_C_eq_eval_coeffwise_hasseDeriv",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 28,
"n_chars": 958,
"n_subproofs": 0,
"n_tactics": 19,
"cyclomatic": 2,
"n_automation": 6,
"n_rewrites": 5,
"n_structural": 5,
"automati... | 1 | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Bivariate.Deriv
import CompPoly.Bivariate.GuruswamiSudan.Polynomial
import CompPoly.Data.List.Lemmas
import CompPoly.LinearAlgebra.Dense
impor... | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Bivariate.Deriv
import CompPoly.Bivariate.GuruswamiSudan.Polynomial
import CompPoly.Data.List.Lemmas
import CompPoly.LinearAlgebra.Dense
impor... | @@ -29,6 +29,20 @@
namespace CBivariate
+/-- Hasse derivatives in `X` commute with multiplication by an `X`-constant
+polynomial. -/
+private theorem hasseDeriv_mul_C_pow {F : Type*} [Field F]
+ (P : Polynomial F) (c : F) (n a : Nat) :
+ Polynomial.hasseDeriv a (P * Polynomial.C c ^ n) =
+ Polynomial.ha... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_1c0d446ca9fe_20 | b429f18ccdf015ca | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Bivariate/GuruswamiSudan/PolynomialCorrectness.lean | PolynomialCorrectness | 20 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 34 | 4 | [
{
"theorem_name": "hasseDerivative_add",
"depth": 1,
"n_commands": 0,
"n_lines": 8,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [eq_iff_coeff]\n intro i j\n rw [hasseDerivative_coeff]\n rw [coeff_add]\n rw [coeff_add]\n rw [hasseDerivative... | [
{
"name": "hasseDerivative_coeff",
"text": "/-- Coefficients of the executable Hasse derivative are shifted source\ncoefficients scaled by the corresponding binomial factors. -/\ntheorem hasseDerivative_coeff {R : Type*}\n [Semiring R] [BEq R] [LawfulBEq R] [Nontrivial R] [DecidableEq R]\n (a b i j : ... | [
{
"name": "toPoly_hasseDerivative_eq_coeffwise_hasseDeriv_hasseDeriv",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 9,
"n_lines": 18,
"n_chars": 726,
"n_subproofs": 0,
"n_tactics": 9,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 5,
"n_structural": 1,
... | 9 | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Bivariate.Deriv
import CompPoly.Bivariate.GuruswamiSudan.Polynomial
import CompPoly.Data.List.Lemmas
import CompPoly.LinearAlgebra.Dense
impor... | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Bivariate.Deriv
import CompPoly.Bivariate.GuruswamiSudan.Polynomial
import CompPoly.Data.List.Lemmas
import CompPoly.LinearAlgebra.Dense
impor... | @@ -381,6 +381,18 @@
rw [coeff_eq_zero_of_y_size_le Q hyLe]
simp [source, hyIn]
+/-- Coefficients of the executable Hasse derivative are shifted source
+coefficients scaled by the corresponding binomial factors. -/
+theorem hasseDerivative_coeff {R : Type*}
+ [Semiring R] [BEq R] [LawfulBEq R] [Nontrivia... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_1c0d446ca9fe_21 | 287bc17afd7f0579 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Bivariate/GuruswamiSudan/PolynomialCorrectness.lean | PolynomialCorrectness | 21 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 34 | 3 | [
{
"theorem_name": "eval_hasseDeriv_eval_hasseDeriv_toPoly",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [← CBivariate.hasseDerivative_eval_eq_eval]\n rw [CBivariate.evalEval_toPoly]\n rw [Polynomial.... | [
{
"name": "hasseDerivative_eval_eq_eval",
"text": "/-- Correctness of executable Hasse derivative evaluation. -/\ntheorem hasseDerivative_eval_eq_eval {R : Type*}\n [CommSemiring R] [BEq R] [LawfulBEq R] [Nontrivial R] [DecidableEq R]\n (a b : Nat) (x y : R) (Q : CBivariate R) :\n evalEval x y (has... | [
{
"name": "eval_hasseDeriv_eval_hasseDeriv_toPoly",
"fan_in": 1,
"n_deps_direct": 3,
"n_deps_transitive": 18,
"n_lines": 15,
"n_chars": 726,
"n_subproofs": 0,
"n_tactics": 6,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 5,
"n_structural": 0,
"automation_only"... | 18 | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Bivariate.Deriv
import CompPoly.Bivariate.GuruswamiSudan.Polynomial
import CompPoly.Data.List.Lemmas
import CompPoly.LinearAlgebra.Dense
impor... | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Bivariate.Deriv
import CompPoly.Bivariate.GuruswamiSudan.Polynomial
import CompPoly.Data.List.Lemmas
import CompPoly.LinearAlgebra.Dense
impor... | @@ -443,6 +443,14 @@
rw [hasseDerivativeTerms_eval_aux]
rw [evalEval_zero]
+/-- Correctness of executable Hasse derivative evaluation. -/
+theorem hasseDerivative_eval_eq_eval {R : Type*}
+ [CommSemiring R] [BEq R] [LawfulBEq R] [Nontrivial R] [DecidableEq R]
+ (a b : Nat) (x y : R) (Q : CBivariate R) :
+... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_1c0d446ca9fe_22 | 45b153a5abe70084 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Bivariate/GuruswamiSudan/PolynomialCorrectness.lean | PolynomialCorrectness | 22 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 34 | 3 | [
{
"theorem_name": "eval_hasseDeriv_eval_hasseDeriv_toPoly",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [← CBivariate.hasseDerivative_eval_eq_eval]\n rw [CBivariate.evalEval_toPoly]\n rw [Polynomial.... | [
{
"name": "hasseDerivative_eval_eq_eval",
"text": "/-- Correctness of executable Hasse derivative evaluation. -/\ntheorem hasseDerivative_eval_eq_eval {R : Type*}\n [CommSemiring R] [BEq R] [LawfulBEq R] [Nontrivial R] [DecidableEq R]\n (a b : Nat) (x y : R) (Q : CBivariate R) :\n evalEval x y (has... | [
{
"name": "coeff_shiftC_eq_hasseDerivativeEval",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 19,
"n_lines": 19,
"n_chars": 735,
"n_subproofs": 0,
"n_tactics": 11,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 9,
"n_structural": 1,
"automation_only": ... | 19 | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Bivariate.Deriv
import CompPoly.Bivariate.GuruswamiSudan.Polynomial
import CompPoly.Data.List.Lemmas
import CompPoly.LinearAlgebra.Dense
impor... | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Bivariate.Deriv
import CompPoly.Bivariate.GuruswamiSudan.Polynomial
import CompPoly.Data.List.Lemmas
import CompPoly.LinearAlgebra.Dense
impor... | @@ -443,6 +443,14 @@
rw [hasseDerivativeTerms_eval_aux]
rw [evalEval_zero]
+/-- Correctness of executable Hasse derivative evaluation. -/
+theorem hasseDerivative_eval_eq_eval {R : Type*}
+ [CommSemiring R] [BEq R] [LawfulBEq R] [Nontrivial R] [DecidableEq R]
+ (a b : Nat) (x y : R) (Q : CBivariate R) :
+... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_1c0d446ca9fe_23 | cb74b537d0960b92 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Bivariate/GuruswamiSudan/PolynomialCorrectness.lean | PolynomialCorrectness | 23 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 34 | 3 | [
{
"theorem_name": "eval_hasseDeriv_eval_hasseDeriv_toPoly",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [← CBivariate.hasseDerivative_eval_eq_eval]\n rw [CBivariate.evalEval_toPoly]\n rw [Polynomial.... | [
{
"name": "hasseDerivative_eval_eq_eval",
"text": "/-- Correctness of executable Hasse derivative evaluation. -/\ntheorem hasseDerivative_eval_eq_eval {R : Type*}\n [CommSemiring R] [BEq R] [LawfulBEq R] [Nontrivial R] [DecidableEq R]\n (a b : Nat) (x y : R) (Q : CBivariate R) :\n evalEval x y (has... | [
{
"name": "hasMultiplicity_iff_hasMultiplicityAtLeast",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 20,
"n_lines": 17,
"n_chars": 636,
"n_subproofs": 0,
"n_tactics": 9,
"cyclomatic": 2,
"n_automation": 0,
"n_rewrites": 3,
"n_structural": 5,
"automation_o... | 20 | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Bivariate.Deriv
import CompPoly.Bivariate.GuruswamiSudan.Polynomial
import CompPoly.Data.List.Lemmas
import CompPoly.LinearAlgebra.Dense
impor... | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Bivariate.Deriv
import CompPoly.Bivariate.GuruswamiSudan.Polynomial
import CompPoly.Data.List.Lemmas
import CompPoly.LinearAlgebra.Dense
impor... | @@ -443,6 +443,14 @@
rw [hasseDerivativeTerms_eval_aux]
rw [evalEval_zero]
+/-- Correctness of executable Hasse derivative evaluation. -/
+theorem hasseDerivative_eval_eq_eval {R : Type*}
+ [CommSemiring R] [BEq R] [LawfulBEq R] [Nontrivial R] [DecidableEq R]
+ (a b : Nat) (x y : R) (Q : CBivariate R) :
+... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_1c0d446ca9fe_24 | b09945db389ead85 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Bivariate/GuruswamiSudan/PolynomialCorrectness.lean | PolynomialCorrectness | 24 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 34 | 1 | [
{
"theorem_name": "eval_hasseDeriv_eval_hasseDeriv_toPoly",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [← CBivariate.hasseDerivative_eval_eq_eval]\n rw [CBivariate.evalEval_toPoly]\n rw [Polynomial.... | [
{
"name": "hasseDeriv_eval_C_eq_eval_coeffwise_hasseDeriv",
"text": "/-- Hasse differentiating the inner-variable polynomial after evaluating the\nouter variable at a constant equals evaluating the coefficientwise Hasse\nderivative. -/\nprivate theorem hasseDeriv_eval_C_eq_eval_coeffwise_hasseDeriv {F : Typ... | [
{
"name": "satisfiesMultiplicityConstraints_iff_hasMultiplicity",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 21,
"n_lines": 18,
"n_chars": 775,
"n_subproofs": 0,
"n_tactics": 9,
"cyclomatic": 2,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 5,
"au... | 21 | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Bivariate.Deriv
import CompPoly.Bivariate.GuruswamiSudan.Polynomial
import CompPoly.Data.List.Lemmas
import CompPoly.LinearAlgebra.Dense
impor... | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Bivariate.Deriv
import CompPoly.Bivariate.GuruswamiSudan.Polynomial
import CompPoly.Data.List.Lemmas
import CompPoly.LinearAlgebra.Dense
impor... | @@ -465,6 +465,33 @@
rw [Polynomial.hasseDeriv_coeff]
ring
+/-- Hasse differentiating the inner-variable polynomial after evaluating the
+outer variable at a constant equals evaluating the coefficientwise Hasse
+derivative. -/
+private theorem hasseDeriv_eval_C_eq_eval_coeffwise_hasseDeriv {F : Type*}
+ [Fie... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_1c0d446ca9fe_25 | 6c17da5dad7acb4d | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Bivariate/GuruswamiSudan/PolynomialCorrectness.lean | PolynomialCorrectness | 25 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 34 | 1 | [
{
"theorem_name": "eval_hasseDeriv_eval_hasseDeriv_toPoly",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [← CBivariate.hasseDerivative_eval_eq_eval]\n rw [CBivariate.evalEval_toPoly]\n rw [Polynomial.... | [
{
"name": "hasseDeriv_eval_C_eq_eval_coeffwise_hasseDeriv",
"text": "/-- Hasse differentiating the inner-variable polynomial after evaluating the\nouter variable at a constant equals evaluating the coefficientwise Hasse\nderivative. -/\nprivate theorem hasseDeriv_eval_C_eq_eval_coeffwise_hasseDeriv {F : Typ... | [
{
"name": "multiplicityAtLeastBool_iff_hasMultiplicity",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 21,
"n_lines": 30,
"n_chars": 1276,
"n_subproofs": 4,
"n_tactics": 22,
"cyclomatic": 3,
"n_automation": 7,
"n_rewrites": 1,
"n_structural": 8,
"automatio... | 21 | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Bivariate.Deriv
import CompPoly.Bivariate.GuruswamiSudan.Polynomial
import CompPoly.Data.List.Lemmas
import CompPoly.LinearAlgebra.Dense
impor... | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Bivariate.Deriv
import CompPoly.Bivariate.GuruswamiSudan.Polynomial
import CompPoly.Data.List.Lemmas
import CompPoly.LinearAlgebra.Dense
impor... | @@ -465,6 +465,33 @@
rw [Polynomial.hasseDeriv_coeff]
ring
+/-- Hasse differentiating the inner-variable polynomial after evaluating the
+outer variable at a constant equals evaluating the coefficientwise Hasse
+derivative. -/
+private theorem hasseDeriv_eval_C_eq_eval_coeffwise_hasseDeriv {F : Type*}
+ [Fie... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_1c0d446ca9fe_26 | d2a18e557dd3be30 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Bivariate/GuruswamiSudan/PolynomialCorrectness.lean | PolynomialCorrectness | 26 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 34 | 1 | [
{
"theorem_name": "toPoly_hasseDerivative_eq_coeffwise_hasseDeriv_hasseDeriv",
"depth": 1,
"n_commands": 0,
"n_lines": 9,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n ext j n\n rw [coeff_coeffwise_hasseDeriv_sum]\n rw [Polynomial.hasseDeriv_coeff... | [
{
"name": "coeff_coeffwise_hasseDeriv_sum",
"text": "/-- The `j`-th coefficient of the coefficientwise Hasse-derivative outer sum is\nthe Hasse derivative of the `j`-th coefficient. -/\nprivate theorem coeff_coeffwise_hasseDeriv_sum {F : Type*} [Field F]\n (P : Polynomial (Polynomial F)) (a j : Nat) :\n ... | [
{
"name": "satisfiesMultiplicityConstraintsBool_iff_hasMultiplicity",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 22,
"n_lines": 25,
"n_chars": 1226,
"n_subproofs": 3,
"n_tactics": 16,
"cyclomatic": 3,
"n_automation": 6,
"n_rewrites": 0,
"n_structural": 6,
... | 22 | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Bivariate.Deriv
import CompPoly.Bivariate.GuruswamiSudan.Polynomial
import CompPoly.Data.List.Lemmas
import CompPoly.LinearAlgebra.Dense
impor... | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Bivariate.Deriv
import CompPoly.Bivariate.GuruswamiSudan.Polynomial
import CompPoly.Data.List.Lemmas
import CompPoly.LinearAlgebra.Dense
impor... | @@ -492,6 +492,30 @@
| monomial _n _coeff =>
simp [Polynomial.sum_monomial_index, hasseDeriv_mul_C_pow]
+/-- The `j`-th coefficient of the coefficientwise Hasse-derivative outer sum is
+the Hasse derivative of the `j`-th coefficient. -/
+private theorem coeff_coeffwise_hasseDeriv_sum {F : Type*} [Field F]
+... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_1c0d446ca9fe_27 | 1c6be3c316fa2a05 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Bivariate/GuruswamiSudan/PolynomialCorrectness.lean | PolynomialCorrectness | 27 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 34 | 1 | [
{
"theorem_name": "toPoly_hasseDerivative_eq_coeffwise_hasseDeriv_hasseDeriv",
"depth": 1,
"n_commands": 0,
"n_lines": 9,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n ext j n\n rw [coeff_coeffwise_hasseDeriv_sum]\n rw [Polynomial.hasseDeriv_coeff... | [
{
"name": "coeff_coeffwise_hasseDeriv_sum",
"text": "/-- The `j`-th coefficient of the coefficientwise Hasse-derivative outer sum is\nthe Hasse derivative of the `j`-th coefficient. -/\nprivate theorem coeff_coeffwise_hasseDeriv_sum {F : Type*} [Field F]\n (P : Polynomial (Polynomial F)) (a j : Nat) :\n ... | [
{
"name": "multiplicityAtLeastBool_iff_checkMultiplicity",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 22,
"n_lines": 10,
"n_chars": 447,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automatio... | 22 | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Bivariate.Deriv
import CompPoly.Bivariate.GuruswamiSudan.Polynomial
import CompPoly.Data.List.Lemmas
import CompPoly.LinearAlgebra.Dense
impor... | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Bivariate.Deriv
import CompPoly.Bivariate.GuruswamiSudan.Polynomial
import CompPoly.Data.List.Lemmas
import CompPoly.LinearAlgebra.Dense
impor... | @@ -492,6 +492,30 @@
| monomial _n _coeff =>
simp [Polynomial.sum_monomial_index, hasseDeriv_mul_C_pow]
+/-- The `j`-th coefficient of the coefficientwise Hasse-derivative outer sum is
+the Hasse derivative of the `j`-th coefficient. -/
+private theorem coeff_coeffwise_hasseDeriv_sum {F : Type*} [Field F]
+... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_1c0d446ca9fe_28 | 60284aea460738d0 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Bivariate/GuruswamiSudan/PolynomialCorrectness.lean | PolynomialCorrectness | 28 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 34 | 1 | [
{
"theorem_name": "eval_hasseDeriv_eval_hasseDeriv_toPoly",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [← CBivariate.hasseDerivative_eval_eq_eval]\n rw [CBivariate.evalEval_toPoly]\n rw [Polynomial.... | [
{
"name": "toPoly_hasseDerivative_eq_coeffwise_hasseDeriv_hasseDeriv",
"text": "/-- The executable bivariate Hasse derivative matches the Mathlib-side\ncoefficientwise inner Hasse derivative of the outer Hasse derivative. -/\nprivate theorem toPoly_hasseDerivative_eq_coeffwise_hasseDeriv_hasseDeriv {F : Typ... | [
{
"name": "satisfiesMultiplicityConstraintsBool_iff_checkMultiplicity",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 23,
"n_lines": 16,
"n_chars": 798,
"n_subproofs": 0,
"n_tactics": 7,
"cyclomatic": 2,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 5,
... | 23 | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Bivariate.Deriv
import CompPoly.Bivariate.GuruswamiSudan.Polynomial
import CompPoly.Data.List.Lemmas
import CompPoly.LinearAlgebra.Dense
impor... | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Bivariate.Deriv
import CompPoly.Bivariate.GuruswamiSudan.Polynomial
import CompPoly.Data.List.Lemmas
import CompPoly.LinearAlgebra.Dense
impor... | @@ -516,6 +516,23 @@
exact hj (h ▸ hk)
rw [Polynomial.coeff_monomial, if_neg hkj]
+/-- The executable bivariate Hasse derivative matches the Mathlib-side
+coefficientwise inner Hasse derivative of the outer Hasse derivative. -/
+private theorem toPoly_hasseDerivative_eq_coeffwise_hasseDeriv_hasseDeriv... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_1c0d446ca9fe_29 | 3db7f893dc867619 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Bivariate/GuruswamiSudan/PolynomialCorrectness.lean | PolynomialCorrectness | 29 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 34 | 1 | [
{
"theorem_name": "hasseDerivativeTerms_eval_aux",
"depth": 1,
"n_commands": 0,
"n_lines": 8,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction terms generalizing acc with\n | nil => rfl\n | cons term terms ih =>\n simp [List.foldl]\n ... | [
{
"name": "evalEval_monomialXY",
"text": "/-- Full evaluation of a bivariate monomial has the expected closed form. -/\ntheorem evalEval_monomialXY {R : Type*}\n [CommSemiring R] [BEq R] [LawfulBEq R] [Nontrivial R] [DecidableEq R]\n (x y c : R) (n m : Nat) :\n evalEval x y (monomialXY n m c) = c *... | [
{
"name": "hasseDerivativeEval_add",
"fan_in": 0,
"n_deps_direct": 3,
"n_deps_transitive": 15,
"n_lines": 12,
"n_chars": 521,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 4,
"n_structural": 0,
"automation_only": false,
"m... | 15 | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Bivariate.Deriv
import CompPoly.Bivariate.GuruswamiSudan.Polynomial
import CompPoly.Data.List.Lemmas
import CompPoly.LinearAlgebra.Dense
impor... | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Bivariate.Deriv
import CompPoly.Bivariate.GuruswamiSudan.Polynomial
import CompPoly.Data.List.Lemmas
import CompPoly.LinearAlgebra.Dense
impor... | @@ -421,6 +421,14 @@
rw [evalEval_toPoly, toPoly_zero]
simp [Polynomial.evalEval]
+/-- Full evaluation of a bivariate monomial has the expected closed form. -/
+theorem evalEval_monomialXY {R : Type*}
+ [CommSemiring R] [BEq R] [LawfulBEq R] [Nontrivial R] [DecidableEq R]
+ (x y c : R) (n m : Nat) :
+ ... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_1c0d446ca9fe_30 | 0b36372741a3bda8 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Bivariate/GuruswamiSudan/PolynomialCorrectness.lean | PolynomialCorrectness | 30 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 34 | 1 | [
{
"theorem_name": "hasseDerivativeTerms_eval_aux",
"depth": 1,
"n_commands": 0,
"n_lines": 8,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction terms generalizing acc with\n | nil => rfl\n | cons term terms ih =>\n simp [List.foldl]\n ... | [
{
"name": "evalEval_monomialXY",
"text": "/-- Full evaluation of a bivariate monomial has the expected closed form. -/\ntheorem evalEval_monomialXY {R : Type*}\n [CommSemiring R] [BEq R] [LawfulBEq R] [Nontrivial R] [DecidableEq R]\n (x y c : R) (n m : Nat) :\n evalEval x y (monomialXY n m c) = c *... | [
{
"name": "hasseDerivativeEval_zero",
"fan_in": 0,
"n_deps_direct": 3,
"n_deps_transitive": 15,
"n_lines": 9,
"n_chars": 367,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 2,
"n_structural": 0,
"automation_only": false,
"m... | 15 | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Bivariate.Deriv
import CompPoly.Bivariate.GuruswamiSudan.Polynomial
import CompPoly.Data.List.Lemmas
import CompPoly.LinearAlgebra.Dense
impor... | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Bivariate.Deriv
import CompPoly.Bivariate.GuruswamiSudan.Polynomial
import CompPoly.Data.List.Lemmas
import CompPoly.LinearAlgebra.Dense
impor... | @@ -418,6 +418,14 @@
rw [evalEval_toPoly, toPoly_zero]
simp [Polynomial.evalEval]
+/-- Full evaluation of a bivariate monomial has the expected closed form. -/
+theorem evalEval_monomialXY {R : Type*}
+ [CommSemiring R] [BEq R] [LawfulBEq R] [Nontrivial R] [DecidableEq R]
+ (x y c : R) (n m : Nat) :
+ ... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_a29a1f06b15c_0 | 59e04bee827e7967 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Bivariate/GuruswamiSudan/Root/RothRuckenstein/Correctness.lean | Correctness | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 26 | 1 | [
{
"theorem_name": "substituteYRootPlusXY_eq_fold",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp [substituteYRootPlusXY, Std.Legacy.Range.forIn_eq_forIn_range',\n cbivariate_default_eq_zero]",
"... | [
{
"name": "cbivariate_default_eq_zero",
"text": "private theorem cbivariate_default_eq_zero {F : Type*}\n [Field F] [BEq F] [LawfulBEq F] :\n (default : CBivariate F) = 0 := rfl\n\n",
"fan_in": 1,
"n_lines": 5,
"n_chars": 134,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
... | [
{
"name": "substituteYRootPlusXY_eq_fold",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 22,
"n_chars": 769,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true,
... | 1 | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Bivariate.GuruswamiSudan.Root.RothRuckenstein.Lemmas
/-!
# Roth-Ruckenstein Root Correctness
Correctness statements for the Roth-Ruckenstein... | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Bivariate.GuruswamiSudan.Root.RothRuckenstein.Lemmas
/-!
# Roth-Ruckenstein Root Correctness
Correctness statements for the Roth-Ruckenstein... | @@ -96,6 +96,10 @@
pow_ne_zero order Polynomial.X_ne_zero
exact (mul_eq_zero.mp hrootPoly).resolve_left hx
+private theorem cbivariate_default_eq_zero {F : Type*}
+ [Field F] [BEq F] [LawfulBEq F] :
+ (default : CBivariate F) = 0 := rfl
+
private theorem cpoly_default_eq_zero {R : Type*} [Zero ... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_a29a1f06b15c_1 | 95b78fef87adc7b8 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Bivariate/GuruswamiSudan/Root/RothRuckenstein/Correctness.lean | Correctness | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 26 | 2 | [
{
"theorem_name": "substituteYRootPlusXY_coeff_fold",
"depth": 1,
"n_commands": 0,
"n_lines": 121,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [substituteYRootPlusXY_eq_fold]\n let outerStep : CBivariate F → Nat → CBivariate F :=\n fun out ... | [
{
"name": "substituteYRootPlusXY_eq_fold",
"text": "private theorem substituteYRootPlusXY_eq_fold {F : Type*}\n [Field F] [BEq F] [LawfulBEq F] [DecidableEq F]\n (Q : CBivariate F) (a : F) :\n substituteYRootPlusXY Q a =\n (List.range' 0 Q.val.size).foldl\n (fun out y ↦\n let c... | [
{
"name": "substituteYRootPlusXY_coeff_fold",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 141,
"n_chars": 5672,
"n_subproofs": 3,
"n_tactics": 121,
"cyclomatic": 4,
"n_automation": 6,
"n_rewrites": 6,
"n_structural": 18,
"automation_only": ... | 2 | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Bivariate.GuruswamiSudan.Root.RothRuckenstein.Lemmas
/-!
# Roth-Ruckenstein Root Correctness
Correctness statements for the Roth-Ruckenstein... | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Bivariate.GuruswamiSudan.Root.RothRuckenstein.Lemmas
/-!
# Roth-Ruckenstein Root Correctness
Correctness statements for the Roth-Ruckenstein... | @@ -103,6 +103,27 @@
private theorem cpoly_default_eq_zero {R : Type*} [Zero R] :
(default : CPolynomial R) = 0 := rfl
+private theorem substituteYRootPlusXY_eq_fold {F : Type*}
+ [Field F] [BEq F] [LawfulBEq F] [DecidableEq F]
+ (Q : CBivariate F) (a : F) :
+ substituteYRootPlusXY Q a =
+ (List.r... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_a29a1f06b15c_2 | 9f0046d79723348d | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Bivariate/GuruswamiSudan/Root/RothRuckenstein/Correctness.lean | Correctness | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 26 | 1 | [
{
"theorem_name": "substituteYRootPlusXY_inner_fold_target",
"depth": 1,
"n_commands": 0,
"n_lines": 21,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [List.foldl_congr_of_mem\n (f := fun acc x₀ ↦\n let coeff := coeffY.coeff x₀\n (Li... | [
{
"name": "substituteYRootPlusXY_term_fold_target",
"text": "private theorem substituteYRootPlusXY_term_fold_target {F : Type*}\n [Field F] (a coeff : F) (x y x₀ : Nat) (acc : F) :\n (List.range' 0 (y + 1)).foldl\n (fun acc t ↦\n acc +\n if x + y = x₀ + t ∧ y = t then\n ... | [
{
"name": "substituteYRootPlusXY_inner_fold_target",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 37,
"n_chars": 1301,
"n_subproofs": 1,
"n_tactics": 22,
"cyclomatic": 2,
"n_automation": 3,
"n_rewrites": 4,
"n_structural": 1,
"automation_onl... | 1 | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Bivariate.GuruswamiSudan.Root.RothRuckenstein.Lemmas
/-!
# Roth-Ruckenstein Root Correctness
Correctness statements for the Roth-Ruckenstein... | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Bivariate.GuruswamiSudan.Root.RothRuckenstein.Lemmas
/-!
# Roth-Ruckenstein Root Correctness
Correctness statements for the Roth-Ruckenstein... | @@ -264,6 +264,44 @@
exact hinner (List.range' 0 coeffY.val.size) out acc hacc
exact houter (List.range' 0 Q.val.size) 0 0 (CBivariate.coeff_zero i j)
+private theorem substituteYRootPlusXY_term_fold_target {F : Type*}
+ [Field F] (a coeff : F) (x y x₀ : Nat) (acc : F) :
+ (List.range' 0 (y + 1)).fo... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_a29a1f06b15c_3 | a70c7dab3b0df0f1 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Bivariate/GuruswamiSudan/Root/RothRuckenstein/Correctness.lean | Correctness | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 26 | 1 | [
{
"theorem_name": "substituteYRootPlusXY_inner_fold_zero_of_y_lt",
"depth": 1,
"n_commands": 0,
"n_lines": 20,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [List.foldl_congr_of_mem\n (f := fun acc x₀ ↦\n let coeff := coeffY.coeff x₀\n ... | [
{
"name": "substituteYRootPlusXY_term_fold_zero_of_y_lt",
"text": "private theorem substituteYRootPlusXY_term_fold_zero_of_y_lt {F : Type*}\n [Field F] (a coeff : F) (x y y₀ x₀ : Nat) (acc : F) (hy₀ : y₀ < y) :\n (List.range' 0 (y₀ + 1)).foldl\n (fun acc t ↦\n acc +\n if x +... | [
{
"name": "substituteYRootPlusXY_inner_fold_zero_of_y_lt",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 36,
"n_chars": 1249,
"n_subproofs": 0,
"n_tactics": 20,
"cyclomatic": 2,
"n_automation": 2,
"n_rewrites": 1,
"n_structural": 4,
"automati... | 1 | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Bivariate.GuruswamiSudan.Root.RothRuckenstein.Lemmas
/-!
# Roth-Ruckenstein Root Correctness
Correctness statements for the Roth-Ruckenstein... | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Bivariate.GuruswamiSudan.Root.RothRuckenstein.Lemmas
/-!
# Roth-Ruckenstein Root Correctness
Correctness statements for the Roth-Ruckenstein... | @@ -302,6 +302,37 @@
exact fun h ↦ hty h.2.symm
simp [hnot, hty]
+private theorem substituteYRootPlusXY_term_fold_zero_of_y_lt {F : Type*}
+ [Field F] (a coeff : F) (x y y₀ x₀ : Nat) (acc : F) (hy₀ : y₀ < y) :
+ (List.range' 0 (y₀ + 1)).foldl
+ (fun acc t ↦
+ acc +
+ i... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_a29a1f06b15c_4 | ea8d472fa3edec33 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Bivariate/GuruswamiSudan/Root/RothRuckenstein/Correctness.lean | Correctness | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 26 | 1 | [
{
"theorem_name": "substituteYRootPlusXY_coeff_top",
"depth": 1,
"n_commands": 0,
"n_lines": 36,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [substituteYRootPlusXY_coeff_fold]\n rw [hQsize]\n rw [List.foldl_congr_of_mem\n (f := fun acc y₀ ... | [
{
"name": "substituteYRootPlusXY_inner_fold_target",
"text": "private theorem substituteYRootPlusXY_inner_fold_target {F : Type*}\n [Field F] (a : F) (coeffY : CPolynomial F) (x y : Nat) (acc : F)\n (hsize : coeffY.val.size = x + 1) :\n (List.range' 0 coeffY.val.size).foldl\n (fun acc x₀ ↦\n... | [
{
"name": "substituteYRootPlusXY_ne_zero",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 8,
"n_lines": 26,
"n_chars": 1067,
"n_subproofs": 6,
"n_tactics": 21,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 2,
"n_structural": 4,
"automation_only": false,... | 8 | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Bivariate.GuruswamiSudan.Root.RothRuckenstein.Lemmas
/-!
# Roth-Ruckenstein Root Correctness
Correctness statements for the Roth-Ruckenstein... | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Bivariate.GuruswamiSudan.Root.RothRuckenstein.Lemmas
/-!
# Roth-Ruckenstein Root Correctness
Correctness statements for the Roth-Ruckenstein... | @@ -333,6 +333,42 @@
have hnot : ¬(x + y = x₀ + t ∧ y = t) := fun h ↦ hty h.2
simp [hnot]
+private theorem substituteYRootPlusXY_inner_fold_target {F : Type*}
+ [Field F] (a : F) (coeffY : CPolynomial F) (x y : Nat) (acc : F)
+ (hsize : coeffY.val.size = x + 1) :
+ (List.range' 0 coeffY.val.size).f... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_a29a1f06b15c_5 | 9d47e210c636f87f | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Bivariate/GuruswamiSudan/Root/RothRuckenstein/Correctness.lean | Correctness | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 26 | 1 | [
{
"theorem_name": "cpoly_range_fold_monomial_mul_pow",
"depth": 1,
"n_commands": 0,
"n_lines": 9,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [list_foldl_add_eq_sum]\n rw [list_sum_map_mul_right]\n have hrow := cpoly_eq_range_fold coeffY\n r... | [
{
"name": "cpoly_eq_range_fold",
"text": "private theorem cpoly_eq_range_fold {F : Type*}\n [Field F] [BEq F] [LawfulBEq F] [DecidableEq F]\n (p : CPolynomial F) :\n p =\n (List.range' 0 p.val.size).foldl\n (fun acc i ↦ acc + CPolynomial.monomial i (p.coeff i)) 0 := by\n have hprefix :... | [
{
"name": "cpoly_range_fold_monomial_mul_pow",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 17,
"n_chars": 626,
"n_subproofs": 1,
"n_tactics": 9,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 4,
"n_structural": 0,
"automation_only": fals... | 2 | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Bivariate.GuruswamiSudan.Root.RothRuckenstein.Lemmas
/-!
# Roth-Ruckenstein Root Correctness
Correctness statements for the Roth-Ruckenstein... | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Bivariate.GuruswamiSudan.Root.RothRuckenstein.Lemmas
/-!
# Roth-Ruckenstein Root Correctness
Correctness statements for the Roth-Ruckenstein... | @@ -495,13 +495,41 @@
rw [List.range_succ, List.foldl_append]
simp
+private theorem cpoly_eq_range_fold {F : Type*}
+ [Field F] [BEq F] [LawfulBEq F] [DecidableEq F]
+ (p : CPolynomial F) :
+ p =
+ (List.range' 0 p.val.size).foldl
+ (fun acc i ↦ acc + CPolynomial.monomial i (p.coeff... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_a29a1f06b15c_6 | 0cee722448f243ef | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Bivariate/GuruswamiSudan/Root/RothRuckenstein/Correctness.lean | Correctness | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 26 | 1 | [
{
"theorem_name": "composeY_substituteYRootPlusXY_term_fold",
"depth": 1,
"n_commands": 0,
"n_lines": 29,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [composeY_foldl_add\n (fun t ↦\n CBivariate.monomialXY (x + t) t\n (coeff * (Na... | [
{
"name": "composeY_foldl_add",
"text": "private theorem composeY_foldl_add {F : Type*}\n [Field F] [BEq F] [LawfulBEq F] [DecidableEq F]\n (f : Nat → CBivariate F) (p : CPolynomial F) :\n ∀ (xs : List Nat) (out : CBivariate F) (acc : CPolynomial F),\n CBivariate.composeY out p = acc →\n ... | [
{
"name": "composeY_substituteYRootPlusXY_term_fold",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 43,
"n_chars": 1625,
"n_subproofs": 1,
"n_tactics": 29,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 6,
"n_structural": 1,
"automation_on... | 2 | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Bivariate.GuruswamiSudan.Root.RothRuckenstein.Lemmas
/-!
# Roth-Ruckenstein Root Correctness
Correctness statements for the Roth-Ruckenstein... | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Bivariate.GuruswamiSudan.Root.RothRuckenstein.Lemmas
/-!
# Roth-Ruckenstein Root Correctness
Correctness statements for the Roth-Ruckenstein... | @@ -547,6 +547,24 @@
Polynomial.monomial x c from
CPolynomial.monomial_toPoly (R := F) x c]
+private theorem composeY_foldl_add {F : Type*}
+ [Field F] [BEq F] [LawfulBEq F] [DecidableEq F]
+ (f : Nat → CBivariate F) (p : CPolynomial F) :
+ ∀ (xs : List Nat) (out : CBivariate F) (acc : CPolynomia... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_a29a1f06b15c_7 | 58824efd7ab1efd4 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Bivariate/GuruswamiSudan/Root/RothRuckenstein/Correctness.lean | Correctness | 7 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 26 | 1 | [
{
"theorem_name": "composeY_substituteYRootPlusXY_term_fold",
"depth": 1,
"n_commands": 0,
"n_lines": 29,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [composeY_foldl_add\n (fun t ↦\n CBivariate.monomialXY (x + t) t\n (coeff * (Na... | [
{
"name": "composeY_monomialXY",
"text": "private theorem composeY_monomialXY {F : Type*}\n [Field F] [BEq F] [LawfulBEq F] [DecidableEq F]\n (p : CPolynomial F) (x y : Nat) (c : F) :\n CBivariate.composeY (CBivariate.monomialXY x y c) p =\n CPolynomial.monomial x c * p ^ y := by\n apply (CPo... | [
{
"name": "composeY_substituteYRootPlusXY_eq",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 9,
"n_lines": 44,
"n_chars": 1680,
"n_subproofs": 1,
"n_tactics": 38,
"cyclomatic": 2,
"n_automation": 2,
"n_rewrites": 5,
"n_structural": 5,
"automation_only": fa... | 9 | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Bivariate.GuruswamiSudan.Root.RothRuckenstein.Lemmas
/-!
# Roth-Ruckenstein Root Correctness
Correctness statements for the Roth-Ruckenstein... | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Bivariate.GuruswamiSudan.Root.RothRuckenstein.Lemmas
/-!
# Roth-Ruckenstein Root Correctness
Correctness statements for the Roth-Ruckenstein... | @@ -531,6 +531,22 @@
simp only [zero_add] at hrow
rw [← hrow]
+private theorem composeY_monomialXY {F : Type*}
+ [Field F] [BEq F] [LawfulBEq F] [DecidableEq F]
+ (p : CPolynomial F) (x y : Nat) (c : F) :
+ CBivariate.composeY (CBivariate.monomialXY x y c) p =
+ CPolynomial.monomial x c * p ^ y :=... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_a29a1f06b15c_8 | 4cd31d662ed1acb9 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Bivariate/GuruswamiSudan/Root/RothRuckenstein/Correctness.lean | Correctness | 8 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 26 | 1 | [
{
"theorem_name": "composeY_substituteYRootPlusXY_inner_fold",
"depth": 1,
"n_commands": 0,
"n_lines": 33,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n let q := CPolynomial.C a + CPolynomial.X * p\n let innerStep : CBivariate F → Nat → CBivariate ... | [
{
"name": "cpoly_range_fold_monomial_mul_pow",
"text": "private theorem cpoly_range_fold_monomial_mul_pow {F : Type*}\n [Field F] [BEq F] [LawfulBEq F] [DecidableEq F]\n (coeffY q : CPolynomial F) (y : Nat) (acc : CPolynomial F) :\n (List.range' 0 coeffY.val.size).foldl\n (fun acc x ↦ acc + ... | [
{
"name": "transformedRothRuckensteinRootPrefixesWithFuel_complete_aux",
"fan_in": 1,
"n_deps_direct": 7,
"n_deps_transitive": 24,
"n_lines": 84,
"n_chars": 4015,
"n_subproofs": 11,
"n_tactics": 74,
"cyclomatic": 2,
"n_automation": 5,
"n_rewrites": 9,
"n_structural": ... | 24 | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Bivariate.GuruswamiSudan.Root.RothRuckenstein.Lemmas
/-!
# Roth-Ruckenstein Root Correctness
Correctness statements for the Roth-Ruckenstein... | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Bivariate.GuruswamiSudan.Root.RothRuckenstein.Lemmas
/-!
# Roth-Ruckenstein Root Correctness
Correctness statements for the Roth-Ruckenstein... | @@ -515,6 +515,22 @@
rw [List.range_eq_range'] at hprefix
exact hprefix
+private theorem cpoly_range_fold_monomial_mul_pow {F : Type*}
+ [Field F] [BEq F] [LawfulBEq F] [DecidableEq F]
+ (coeffY q : CPolynomial F) (y : Nat) (acc : CPolynomial F) :
+ (List.range' 0 coeffY.val.size).foldl
+ (fun a... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_ded8e1210b6a_2 | 053eba0f03e2c24b | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Bivariate/GuruswamiSudan/Interpolation/LeeOSullivan/Correctness/Divisibility.lean | Divisibility | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 11 | 1 | [
{
"theorem_name": "lee_hasseDeriv_eval_C_eq_eval_coeffwise_hasseDeriv",
"depth": 1,
"n_commands": 0,
"n_lines": 21,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [Polynomial.eval_eq_sum]\n induction P using Polynomial.induction_on' with\n | add... | [
{
"name": "lee_hasseDeriv_mul_C_pow",
"text": "private theorem lee_hasseDeriv_mul_C_pow\n (P : Polynomial F) (c : F) (n a : Nat) :\n Polynomial.hasseDeriv a (P * Polynomial.C c ^ n) =\n Polynomial.hasseDeriv a P * Polynomial.C c ^ n := by\n rw [show Polynomial.C c ^ n = Polynomial.C (c ^ n) by r... | [
{
"name": "lee_eval_hasseDeriv_eval_hasseDeriv_toPoly",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 4,
"n_lines": 12,
"n_chars": 531,
"n_subproofs": 0,
"n_tactics": 6,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 5,
"n_structural": 0,
"automation_on... | 4 | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Bivariate.GuruswamiSudan.Interpolation.LeeOSullivan.Correctness.Basis
/-!
# Lee-O'Sullivan Divisibility Helpers
Hasse-derivative and vanishi... | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Bivariate.GuruswamiSudan.Interpolation.LeeOSullivan.Correctness.Basis
/-!
# Lee-O'Sullivan Divisibility Helpers
Hasse-derivative and vanishi... | @@ -23,6 +23,19 @@
variable {F : Type*} [Field F] [BEq F] [LawfulBEq F] [DecidableEq F]
omit [BEq F] [LawfulBEq F] [DecidableEq F] in
+private theorem lee_hasseDeriv_mul_C_pow
+ (P : Polynomial F) (c : F) (n a : Nat) :
+ Polynomial.hasseDeriv a (P * Polynomial.C c ^ n) =
+ Polynomial.hasseDeriv a P * Pol... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_ded8e1210b6a_6 | 3bde807449224d1a | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Bivariate/GuruswamiSudan/Interpolation/LeeOSullivan/Correctness/Divisibility.lean | Divisibility | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 11 | 1 | [
{
"theorem_name": "lee_eval_hasseDeriv_eval_hasseDeriv_toPoly",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [← CBivariate.hasseDerivative_eval_eq_eval]\n rw [CBivariate.evalEval_toPoly]\n rw [Polynom... | [
{
"name": "lee_hasseDeriv_eval_C_eq_eval_coeffwise_hasseDeriv",
"text": "private theorem lee_hasseDeriv_eval_C_eq_eval_coeffwise_hasseDeriv\n (P : Polynomial (Polynomial F)) (y : F) (a : Nat) :\n Polynomial.hasseDeriv a (Polynomial.eval (Polynomial.C y) P) =\n Polynomial.eval (Polynomial.C y)\n ... | [
{
"name": "coeffY_dvd_vanishingPolynomial_pow_of_multiplicity",
"fan_in": 0,
"n_deps_direct": 4,
"n_deps_transitive": 11,
"n_lines": 58,
"n_chars": 2593,
"n_subproofs": 8,
"n_tactics": 47,
"cyclomatic": 3,
"n_automation": 6,
"n_rewrites": 9,
"n_structural": 13,
"a... | 11 | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Bivariate.GuruswamiSudan.Interpolation.LeeOSullivan.Correctness.Basis
/-!
# Lee-O'Sullivan Divisibility Helpers
Hasse-derivative and vanishi... | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Bivariate.GuruswamiSudan.Interpolation.LeeOSullivan.Correctness.Basis
/-!
# Lee-O'Sullivan Divisibility Helpers
Hasse-derivative and vanishi... | @@ -36,6 +36,31 @@
ring
omit [BEq F] [LawfulBEq F] [DecidableEq F] in
+private theorem lee_hasseDeriv_eval_C_eq_eval_coeffwise_hasseDeriv
+ (P : Polynomial (Polynomial F)) (y : F) (a : Nat) :
+ Polynomial.hasseDeriv a (Polynomial.eval (Polynomial.C y) P) =
+ Polynomial.eval (Polynomial.C y)
+ (P... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_0cc19b2a7869_0 | d7dd4ebf1bebd885 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Univariate/Roots/RootProduct.lean | RootProduct | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 17 | 8 | [
{
"theorem_name": "finiteFieldRootProductWith_toPoly_eq_normalize_gcd",
"depth": 1,
"n_commands": 0,
"n_lines": 30,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n dsimp\n unfold finiteFieldRootProductWith\n unfold CPolynomial.Raw.Roots.FiniteField.... | [
{
"name": "raw_monicNormalize_trim",
"text": "private theorem raw_monicNormalize_trim {F : Type*} [Field F] [BEq F] [LawfulBEq F]\n (p : CPolynomial.Raw F) :\n (CPolynomial.Raw.monicNormalize p).trim = CPolynomial.Raw.monicNormalize p := by\n unfold CPolynomial.Raw.monicNormalize\n let q := p.trim\n... | [
{
"name": "finiteFieldRootProductWith_toPoly_eq_normalize_gcd",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 43,
"n_chars": 1931,
"n_subproofs": 4,
"n_tactics": 30,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 8,
"n_structural": 8,
"aut... | 2 | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Univariate.Raw.Modular
import CompPoly.Univariate.EuclideanAlgorithm
import CompPoly.Univariate.Roots.Context
/-!
# Finite-Field Root Product... | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Univariate.Raw.Modular
import CompPoly.Univariate.EuclideanAlgorithm
import CompPoly.Univariate.Roots.Context
/-!
# Finite-Field Root Product... | @@ -66,6 +66,48 @@
finiteFieldRootProductWith CPolynomial.Raw.MulContext.naive
CPolynomial.Raw.ModContext.naive ctx p
+private theorem raw_monicNormalize_trim {F : Type*} [Field F] [BEq F] [LawfulBEq F]
+ (p : CPolynomial.Raw F) :
+ (CPolynomial.Raw.monicNormalize p).trim = CPolynomial.Raw.monicNormaliz... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_0cc19b2a7869_1 | cfa7864e75fdc270 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Univariate/Roots/RootProduct.lean | RootProduct | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 17 | 1 | [
{
"theorem_name": "raw_monicNormalize_toPoly_eq_normalize",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h := CPolynomial.monicNormalize_toPoly_eq_normalize (CPolynomial.ofArray p)\n unfold CPolynomi... | [
{
"name": "raw_monicNormalize_trim_arg",
"text": "private theorem raw_monicNormalize_trim_arg {F : Type*} [Field F] [BEq F] [LawfulBEq F]\n (p : CPolynomial.Raw F) :\n CPolynomial.Raw.monicNormalize p.trim = CPolynomial.Raw.monicNormalize p := by\n unfold CPolynomial.Raw.monicNormalize\n rw [CPolyno... | [
{
"name": "raw_monicNormalize_toPoly_eq_normalize",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 12,
"n_chars": 481,
"n_subproofs": 1,
"n_tactics": 6,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 3,
"n_structural": 1,
"automation_only":... | 1 | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Univariate.Raw.Modular
import CompPoly.Univariate.EuclideanAlgorithm
import CompPoly.Univariate.Roots.Context
/-!
# Finite-Field Root Product... | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Univariate.Raw.Modular
import CompPoly.Univariate.EuclideanAlgorithm
import CompPoly.Univariate.Roots.Context
/-!
# Finite-Field Root Product... | @@ -66,11 +66,22 @@
finiteFieldRootProductWith CPolynomial.Raw.MulContext.naive
CPolynomial.Raw.ModContext.naive ctx p
+private theorem raw_monicNormalize_trim_arg {F : Type*} [Field F] [BEq F] [LawfulBEq F]
+ (p : CPolynomial.Raw F) :
+ CPolynomial.Raw.monicNormalize p.trim = CPolynomial.Raw.monicNorma... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_0cc19b2a7869_2 | 497e132a753a973f | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Univariate/Roots/RootProduct.lean | RootProduct | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 17 | 2 | [
{
"theorem_name": "raw_monicNormalize_toPoly_monic",
"depth": 1,
"n_commands": 0,
"n_lines": 12,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [raw_monicNormalize_toPoly_eq_normalize]\n have hpC : CPolynomial.ofArray p ≠ 0 := by\n intro h\n ... | [
{
"name": "raw_monicNormalize_toPoly_eq_normalize",
"text": "private theorem raw_monicNormalize_toPoly_eq_normalize {F : Type*}\n [Field F] [BEq F] [LawfulBEq F] [DecidableEq F]\n (p : CPolynomial.Raw F) :\n (CPolynomial.ofArray (CPolynomial.Raw.monicNormalize p)).toPoly =\n normalize (CPolyno... | [
{
"name": "raw_monicNormalize_toPoly_monic",
"fan_in": 4,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 17,
"n_chars": 670,
"n_subproofs": 3,
"n_tactics": 12,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 3,
"n_structural": 4,
"automation_only": false... | 2 | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Univariate.Raw.Modular
import CompPoly.Univariate.EuclideanAlgorithm
import CompPoly.Univariate.Roots.Context
/-!
# Finite-Field Root Product... | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Univariate.Raw.Modular
import CompPoly.Univariate.EuclideanAlgorithm
import CompPoly.Univariate.Roots.Context
/-!
# Finite-Field Root Product... | @@ -72,10 +72,32 @@
unfold CPolynomial.Raw.monicNormalize
rw [CPolynomial.Raw.Trim.trim_twice]
+private theorem raw_monicNormalize_toPoly_eq_normalize {F : Type*}
+ [Field F] [BEq F] [LawfulBEq F] [DecidableEq F]
+ (p : CPolynomial.Raw F) :
+ (CPolynomial.ofArray (CPolynomial.Raw.monicNormalize p)).toP... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_0cc19b2a7869_3 | e882bec3fd178729 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Univariate/Roots/RootProduct.lean | RootProduct | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 17 | 1 | [
{
"theorem_name": "raw_monicNormalize_toPoly_eq_normalize",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h := CPolynomial.monicNormalize_toPoly_eq_normalize (CPolynomial.ofArray p)\n unfold CPolynomi... | [
{
"name": "raw_monicNormalize_trim_arg",
"text": "private theorem raw_monicNormalize_trim_arg {F : Type*} [Field F] [BEq F] [LawfulBEq F]\n (p : CPolynomial.Raw F) :\n CPolynomial.Raw.monicNormalize p.trim = CPolynomial.Raw.monicNormalize p := by\n unfold CPolynomial.Raw.monicNormalize\n rw [CPolyno... | [
{
"name": "raw_mulModWith_toPoly_eq_modByMonic",
"fan_in": 1,
"n_deps_direct": 3,
"n_deps_transitive": 5,
"n_lines": 24,
"n_chars": 1237,
"n_subproofs": 3,
"n_tactics": 16,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 6,
"n_structural": 3,
"automation_only": ... | 5 | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Univariate.Raw.Modular
import CompPoly.Univariate.EuclideanAlgorithm
import CompPoly.Univariate.Roots.Context
/-!
# Finite-Field Root Product... | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Univariate.Raw.Modular
import CompPoly.Univariate.EuclideanAlgorithm
import CompPoly.Univariate.Roots.Context
/-!
# Finite-Field Root Product... | @@ -108,11 +108,22 @@
· exact hr
· simpa [q] using CPolynomial.Raw.Trim.trim_twice p
+private theorem raw_monicNormalize_trim_arg {F : Type*} [Field F] [BEq F] [LawfulBEq F]
+ (p : CPolynomial.Raw F) :
+ CPolynomial.Raw.monicNormalize p.trim = CPolynomial.Raw.monicNormalize p := by
+ unfold CPolyno... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_0cc19b2a7869_4 | 9fc451d8ede4c322 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Univariate/Roots/RootProduct.lean | RootProduct | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 17 | 3 | [
{
"theorem_name": "polynomial_pow_modByMonic_congr",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro n\n induction n with\n | zero => simp\n | succ n ih =>\n rw [pow_succ, pow_succ]\n exact... | [
{
"name": "polynomial_mul_modByMonic_congr",
"text": "private theorem polynomial_mul_modByMonic_congr {F : Type*} [Field F]\n {a b c d m : Polynomial F}\n (ha : a %ₘ m = b %ₘ m) (hc : c %ₘ m = d %ₘ m) :\n (a * c) %ₘ m = (b * d) %ₘ m := by\n calc\n (a * c) %ₘ m = (a %ₘ m * (c %ₘ m)) %ₘ m := by\n... | [
{
"name": "polynomial_pow_modByMonic_congr",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 11,
"n_chars": 313,
"n_subproofs": 0,
"n_tactics": 7,
"cyclomatic": 2,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 3,
"automation_only": false,... | 1 | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Univariate.Raw.Modular
import CompPoly.Univariate.EuclideanAlgorithm
import CompPoly.Univariate.Roots.Context
/-!
# Finite-Field Root Product... | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Univariate.Raw.Modular
import CompPoly.Univariate.EuclideanAlgorithm
import CompPoly.Univariate.Roots.Context
/-!
# Finite-Field Root Product... | @@ -66,13 +66,27 @@
finiteFieldRootProductWith CPolynomial.Raw.MulContext.naive
CPolynomial.Raw.ModContext.naive ctx p
+private theorem polynomial_mul_modByMonic_congr {F : Type*} [Field F]
+ {a b c d m : Polynomial F}
+ (ha : a %ₘ m = b %ₘ m) (hc : c %ₘ m = d %ₘ m) :
+ (a * c) %ₘ m = (b * d) %ₘ m :=... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_0cc19b2a7869_5 | 879b05a5568946b7 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Univariate/Roots/RootProduct.lean | RootProduct | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 17 | 4 | [
{
"theorem_name": "raw_mulModWith_toPoly_eq_modByMonic",
"depth": 1,
"n_commands": 0,
"n_lines": 16,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold CPolynomial.Raw.mulModWith\n have hzero : ¬modulus.trim == (0 : CPolynomial.Raw F) := by\n ... | [
{
"name": "raw_monicNormalize_toPoly_monic",
"text": "private theorem raw_monicNormalize_toPoly_monic {F : Type*}\n [Field F] [BEq F] [LawfulBEq F] [DecidableEq F]\n {p : CPolynomial.Raw F} (hp : p.trim ≠ 0) :\n (CPolynomial.ofArray (CPolynomial.Raw.monicNormalize p)).toPoly.Monic := by\n rw [raw_... | [
{
"name": "raw_powModBinaryAuxWith_toPoly_modByMonic",
"fan_in": 1,
"n_deps_direct": 5,
"n_deps_transitive": 9,
"n_lines": 101,
"n_chars": 4847,
"n_subproofs": 12,
"n_tactics": 90,
"cyclomatic": 3,
"n_automation": 7,
"n_rewrites": 14,
"n_structural": 8,
"automatio... | 9 | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Univariate.Raw.Modular
import CompPoly.Univariate.EuclideanAlgorithm
import CompPoly.Univariate.Roots.Context
/-!
# Finite-Field Root Product... | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Univariate.Raw.Modular
import CompPoly.Univariate.EuclideanAlgorithm
import CompPoly.Univariate.Roots.Context
/-!
# Finite-Field Root Product... | @@ -125,6 +125,22 @@
rw [raw_monicNormalize_trim_arg] at h
exact h
+private theorem raw_monicNormalize_toPoly_monic {F : Type*}
+ [Field F] [BEq F] [LawfulBEq F] [DecidableEq F]
+ {p : CPolynomial.Raw F} (hp : p.trim ≠ 0) :
+ (CPolynomial.ofArray (CPolynomial.Raw.monicNormalize p)).toPoly.Monic := by
+... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_0cc19b2a7869_6 | ed6b4f2ceae24faf | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Univariate/Roots/RootProduct.lean | RootProduct | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 17 | 4 | [
{
"theorem_name": "raw_mulModWith_toPoly_eq_modByMonic",
"depth": 1,
"n_commands": 0,
"n_lines": 16,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold CPolynomial.Raw.mulModWith\n have hzero : ¬modulus.trim == (0 : CPolynomial.Raw F) := by\n ... | [
{
"name": "raw_monicNormalize_toPoly_monic",
"text": "private theorem raw_monicNormalize_toPoly_monic {F : Type*}\n [Field F] [BEq F] [LawfulBEq F] [DecidableEq F]\n {p : CPolynomial.Raw F} (hp : p.trim ≠ 0) :\n (CPolynomial.ofArray (CPolynomial.Raw.monicNormalize p)).toPoly.Monic := by\n rw [raw_... | [
{
"name": "raw_powModWith_X_toPoly_modByMonic",
"fan_in": 1,
"n_deps_direct": 6,
"n_deps_transitive": 10,
"n_lines": 43,
"n_chars": 2079,
"n_subproofs": 5,
"n_tactics": 33,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 8,
"n_structural": 4,
"automation_only": ... | 10 | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Univariate.Raw.Modular
import CompPoly.Univariate.EuclideanAlgorithm
import CompPoly.Univariate.Roots.Context
/-!
# Finite-Field Root Product... | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Univariate.Raw.Modular
import CompPoly.Univariate.EuclideanAlgorithm
import CompPoly.Univariate.Roots.Context
/-!
# Finite-Field Root Product... | @@ -125,6 +125,22 @@
rw [raw_monicNormalize_trim_arg] at h
exact h
+private theorem raw_monicNormalize_toPoly_monic {F : Type*}
+ [Field F] [BEq F] [LawfulBEq F] [DecidableEq F]
+ {p : CPolynomial.Raw F} (hp : p.trim ≠ 0) :
+ (CPolynomial.ofArray (CPolynomial.Raw.monicNormalize p)).toPoly.Monic := by
+... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_0cc19b2a7869_7 | f59e862ba1906e85 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Univariate/Roots/RootProduct.lean | RootProduct | 7 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 17 | 2 | [
{
"theorem_name": "raw_monicNormalize_toPoly_monic",
"depth": 1,
"n_commands": 0,
"n_lines": 12,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [raw_monicNormalize_toPoly_eq_normalize]\n have hpC : CPolynomial.ofArray p ≠ 0 := by\n intro h\n ... | [
{
"name": "raw_monicNormalize_toPoly_eq_normalize",
"text": "private theorem raw_monicNormalize_toPoly_eq_normalize {F : Type*}\n [Field F] [BEq F] [LawfulBEq F] [DecidableEq F]\n (p : CPolynomial.Raw F) :\n (CPolynomial.ofArray (CPolynomial.Raw.monicNormalize p)).toPoly =\n normalize (CPolyno... | [
{
"name": "raw_xModWith_toPoly_modByMonic",
"fan_in": 1,
"n_deps_direct": 4,
"n_deps_transitive": 6,
"n_lines": 23,
"n_chars": 1169,
"n_subproofs": 2,
"n_tactics": 14,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 4,
"n_structural": 4,
"automation_only": false... | 6 | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Univariate.Raw.Modular
import CompPoly.Univariate.EuclideanAlgorithm
import CompPoly.Univariate.Roots.Context
/-!
# Finite-Field Root Product... | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Univariate.Raw.Modular
import CompPoly.Univariate.EuclideanAlgorithm
import CompPoly.Univariate.Roots.Context
/-!
# Finite-Field Root Product... | @@ -114,10 +114,32 @@
unfold CPolynomial.Raw.monicNormalize
rw [CPolynomial.Raw.Trim.trim_twice]
+private theorem raw_monicNormalize_toPoly_eq_normalize {F : Type*}
+ [Field F] [BEq F] [LawfulBEq F] [DecidableEq F]
+ (p : CPolynomial.Raw F) :
+ (CPolynomial.ofArray (CPolynomial.Raw.monicNormalize p)).t... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_0cc19b2a7869_8 | a239d83018759f9b | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Univariate/Roots/RootProduct.lean | RootProduct | 8 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 17 | 4 | [
{
"theorem_name": "raw_mulModWith_toPoly_eq_modByMonic",
"depth": 1,
"n_commands": 0,
"n_lines": 16,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold CPolynomial.Raw.mulModWith\n have hzero : ¬modulus.trim == (0 : CPolynomial.Raw F) := by\n ... | [
{
"name": "raw_monicNormalize_toPoly_monic",
"text": "private theorem raw_monicNormalize_toPoly_monic {F : Type*}\n [Field F] [BEq F] [LawfulBEq F] [DecidableEq F]\n {p : CPolynomial.Raw F} (hp : p.trim ≠ 0) :\n (CPolynomial.ofArray (CPolynomial.Raw.monicNormalize p)).toPoly.Monic := by\n rw [raw_... | [
{
"name": "raw_xPowSubXModWith_toPoly_modByMonic",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 12,
"n_lines": 19,
"n_chars": 1020,
"n_subproofs": 0,
"n_tactics": 9,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 5,
"n_structural": 0,
"automation_only"... | 12 | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Univariate.Raw.Modular
import CompPoly.Univariate.EuclideanAlgorithm
import CompPoly.Univariate.Roots.Context
/-!
# Finite-Field Root Product... | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Univariate.Raw.Modular
import CompPoly.Univariate.EuclideanAlgorithm
import CompPoly.Univariate.Roots.Context
/-!
# Finite-Field Root Product... | @@ -125,6 +125,22 @@
rw [raw_monicNormalize_trim_arg] at h
exact h
+private theorem raw_monicNormalize_toPoly_monic {F : Type*}
+ [Field F] [BEq F] [LawfulBEq F] [DecidableEq F]
+ {p : CPolynomial.Raw F} (hp : p.trim ≠ 0) :
+ (CPolynomial.ofArray (CPolynomial.Raw.monicNormalize p)).toPoly.Monic := by
+... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_0cc19b2a7869_9 | 26a309c675bed9fe | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Univariate/Roots/RootProduct.lean | RootProduct | 9 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 17 | 4 | [
{
"theorem_name": "raw_mulModWith_toPoly_eq_modByMonic",
"depth": 1,
"n_commands": 0,
"n_lines": 16,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold CPolynomial.Raw.mulModWith\n have hzero : ¬modulus.trim == (0 : CPolynomial.Raw F) := by\n ... | [
{
"name": "raw_monicNormalize_toPoly_monic",
"text": "private theorem raw_monicNormalize_toPoly_monic {F : Type*}\n [Field F] [BEq F] [LawfulBEq F] [DecidableEq F]\n {p : CPolynomial.Raw F} (hp : p.trim ≠ 0) :\n (CPolynomial.ofArray (CPolynomial.Raw.monicNormalize p)).toPoly.Monic := by\n rw [raw_... | [
{
"name": "finiteFieldRootProductWith_dvd_frobenius_of_context",
"fan_in": 0,
"n_deps_direct": 5,
"n_deps_transitive": 16,
"n_lines": 72,
"n_chars": 3047,
"n_subproofs": 12,
"n_tactics": 60,
"cyclomatic": 1,
"n_automation": 3,
"n_rewrites": 13,
"n_structural": 13,
... | 16 | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Univariate.Raw.Modular
import CompPoly.Univariate.EuclideanAlgorithm
import CompPoly.Univariate.Roots.Context
/-!
# Finite-Field Root Product... | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Univariate.Raw.Modular
import CompPoly.Univariate.EuclideanAlgorithm
import CompPoly.Univariate.Roots.Context
/-!
# Finite-Field Root Product... | @@ -202,6 +202,22 @@
rw [raw_monicNormalize_trim_arg] at h
exact h
+private theorem raw_monicNormalize_toPoly_monic {F : Type*}
+ [Field F] [BEq F] [LawfulBEq F] [DecidableEq F]
+ {p : CPolynomial.Raw F} (hp : p.trim ≠ 0) :
+ (CPolynomial.ofArray (CPolynomial.Raw.monicNormalize p)).toPoly.Monic := by
+... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_0cc19b2a7869_10 | c7aaa4021af91d43 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Univariate/Roots/RootProduct.lean | RootProduct | 10 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 17 | 8 | [
{
"theorem_name": "finiteFieldRootProductWith_toPoly_eq_normalize_gcd",
"depth": 1,
"n_commands": 0,
"n_lines": 30,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n dsimp\n unfold finiteFieldRootProductWith\n unfold CPolynomial.Raw.Roots.FiniteField.... | [
{
"name": "raw_monicNormalize_trim",
"text": "private theorem raw_monicNormalize_trim {F : Type*} [Field F] [BEq F] [LawfulBEq F]\n (p : CPolynomial.Raw F) :\n (CPolynomial.Raw.monicNormalize p).trim = CPolynomial.Raw.monicNormalize p := by\n unfold CPolynomial.Raw.monicNormalize\n let q := p.trim\n... | [
{
"name": "raw_gcdMonicWithFuel_trim_ne_zero_of_left",
"fan_in": 2,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 29,
"n_chars": 1068,
"n_subproofs": 1,
"n_tactics": 24,
"cyclomatic": 2,
"n_automation": 2,
"n_rewrites": 7,
"n_structural": 11,
"automation_... | 2 | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Univariate.Raw.Modular
import CompPoly.Univariate.EuclideanAlgorithm
import CompPoly.Univariate.Roots.Context
/-!
# Finite-Field Root Product... | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Univariate.Raw.Modular
import CompPoly.Univariate.EuclideanAlgorithm
import CompPoly.Univariate.Roots.Context
/-!
# Finite-Field Root Product... | @@ -92,18 +92,67 @@
exact hsize
exact hp (by simpa using hpempty)
+private theorem raw_monicNormalize_trim {F : Type*} [Field F] [BEq F] [LawfulBEq F]
+ (p : CPolynomial.Raw F) :
+ (CPolynomial.Raw.monicNormalize p).trim = CPolynomial.Raw.monicNormalize p := by
+ unfold CPolynomial.Raw.monicNormali... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_0cc19b2a7869_11 | 80f173a3edff16a6 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Univariate/Roots/RootProduct.lean | RootProduct | 11 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 17 | 8 | [
{
"theorem_name": "finiteFieldRootProductWith_toPoly_eq_normalize_gcd",
"depth": 1,
"n_commands": 0,
"n_lines": 30,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n dsimp\n unfold finiteFieldRootProductWith\n unfold CPolynomial.Raw.Roots.FiniteField.... | [
{
"name": "raw_monicNormalize_trim",
"text": "private theorem raw_monicNormalize_trim {F : Type*} [Field F] [BEq F] [LawfulBEq F]\n (p : CPolynomial.Raw F) :\n (CPolynomial.Raw.monicNormalize p).trim = CPolynomial.Raw.monicNormalize p := by\n unfold CPolynomial.Raw.monicNormalize\n let q := p.trim\n... | [
{
"name": "monicNormalize_ne_zero_of_ne_zero",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 20,
"n_chars": 683,
"n_subproofs": 2,
"n_tactics": 14,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 4,
"n_structural": 6,
"automation_only": fal... | 2 | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Univariate.Raw.Modular
import CompPoly.Univariate.EuclideanAlgorithm
import CompPoly.Univariate.Roots.Context
/-!
# Finite-Field Root Product... | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Univariate.Raw.Modular
import CompPoly.Univariate.EuclideanAlgorithm
import CompPoly.Univariate.Roots.Context
/-!
# Finite-Field Root Product... | @@ -92,11 +92,66 @@
exact hsize
exact hp (by simpa using hpempty)
+private theorem raw_monicNormalize_trim {F : Type*} [Field F] [BEq F] [LawfulBEq F]
+ (p : CPolynomial.Raw F) :
+ (CPolynomial.Raw.monicNormalize p).trim = CPolynomial.Raw.monicNormalize p := by
+ unfold CPolynomial.Raw.monicNormali... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_0cc19b2a7869_12 | 17d4ce7351742c53 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Univariate/Roots/RootProduct.lean | RootProduct | 12 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 17 | 8 | [
{
"theorem_name": "finiteFieldRootProductWith_toPoly_eq_normalize_gcd",
"depth": 1,
"n_commands": 0,
"n_lines": 30,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n dsimp\n unfold finiteFieldRootProductWith\n unfold CPolynomial.Raw.Roots.FiniteField.... | [
{
"name": "raw_monicNormalize_trim",
"text": "private theorem raw_monicNormalize_trim {F : Type*} [Field F] [BEq F] [LawfulBEq F]\n (p : CPolynomial.Raw F) :\n (CPolynomial.Raw.monicNormalize p).trim = CPolynomial.Raw.monicNormalize p := by\n unfold CPolynomial.Raw.monicNormalize\n let q := p.trim\n... | [
{
"name": "gcdMonic_ne_zero_of_left",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 19,
"n_chars": 687,
"n_subproofs": 2,
"n_tactics": 14,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 4,
"n_structural": 6,
"automation_only": false,
"... | 3 | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Univariate.Raw.Modular
import CompPoly.Univariate.EuclideanAlgorithm
import CompPoly.Univariate.Roots.Context
/-!
# Finite-Field Root Product... | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Univariate.Raw.Modular
import CompPoly.Univariate.EuclideanAlgorithm
import CompPoly.Univariate.Roots.Context
/-!
# Finite-Field Root Product... | @@ -92,18 +92,67 @@
exact hsize
exact hp (by simpa using hpempty)
+private theorem raw_monicNormalize_trim {F : Type*} [Field F] [BEq F] [LawfulBEq F]
+ (p : CPolynomial.Raw F) :
+ (CPolynomial.Raw.monicNormalize p).trim = CPolynomial.Raw.monicNormalize p := by
+ unfold CPolynomial.Raw.monicNormali... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_0cc19b2a7869_13 | eeb208fbeb398884 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Univariate/Roots/RootProduct.lean | RootProduct | 13 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 17 | 8 | [
{
"theorem_name": "finiteFieldRootProductWith_toPoly_eq_normalize_gcd",
"depth": 1,
"n_commands": 0,
"n_lines": 30,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n dsimp\n unfold finiteFieldRootProductWith\n unfold CPolynomial.Raw.Roots.FiniteField.... | [
{
"name": "raw_monicNormalize_trim",
"text": "private theorem raw_monicNormalize_trim {F : Type*} [Field F] [BEq F] [LawfulBEq F]\n (p : CPolynomial.Raw F) :\n (CPolynomial.Raw.monicNormalize p).trim = CPolynomial.Raw.monicNormalize p := by\n unfold CPolynomial.Raw.monicNormalize\n let q := p.trim\n... | [
{
"name": "finiteFieldRootProductWith_ne_zero_of_ne_zero",
"fan_in": 0,
"n_deps_direct": 3,
"n_deps_transitive": 3,
"n_lines": 34,
"n_chars": 1386,
"n_subproofs": 2,
"n_tactics": 26,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 7,
"n_structural": 10,
"automat... | 3 | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Univariate.Raw.Modular
import CompPoly.Univariate.EuclideanAlgorithm
import CompPoly.Univariate.Roots.Context
/-!
# Finite-Field Root Product... | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Univariate.Raw.Modular
import CompPoly.Univariate.EuclideanAlgorithm
import CompPoly.Univariate.Roots.Context
/-!
# Finite-Field Root Product... | @@ -92,18 +92,67 @@
exact hsize
exact hp (by simpa using hpempty)
+private theorem raw_monicNormalize_trim {F : Type*} [Field F] [BEq F] [LawfulBEq F]
+ (p : CPolynomial.Raw F) :
+ (CPolynomial.Raw.monicNormalize p).trim = CPolynomial.Raw.monicNormalize p := by
+ unfold CPolynomial.Raw.monicNormali... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_34b7f1635128_0 | 3633bb2773f8ca10 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Multivariate/HornerLemmas.lean | HornerLemmas | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 17 | 1 | [
{
"theorem_name": "insertHornerGroupDesc_pairwise",
"depth": 1,
"n_commands": 0,
"n_lines": 26,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro groups\n induction groups with\n | nil =>\n intro _\n simp [descendingByExponent, insertH... | [
{
"name": "mem_insertHornerGroupDesc",
"text": "private lemma mem_insertHornerGroupDesc {n : ℕ} {S : Type*}\n (group x : HornerGroup n S) :\n ∀ groups, x ∈ insertHornerGroupDesc group groups ↔ x = group ∨ x ∈ groups := by\n intro groups\n induction groups with\n | nil =>\n simp [insertHornerGr... | [
{
"name": "insertHornerGroupDesc_pairwise",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 31,
"n_chars": 1125,
"n_subproofs": 0,
"n_tactics": 26,
"cyclomatic": 4,
"n_automation": 6,
"n_rewrites": 3,
"n_structural": 14,
"automation_only": fals... | 1 | /-
Copyright (c) 2025 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Frantisek Silvasi, Julian Sutherland, Andrei Burdușa, Derek Sorensen, Dimitris Mitsios
-/
import CompPoly.Multivariate.CMvPolynomial
/-!
# Correctness lemmas for multivariate Horner evaluat... | /-
Copyright (c) 2025 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Frantisek Silvasi, Julian Sutherland, Andrei Burdușa, Derek Sorensen, Dimitris Mitsios
-/
import CompPoly.Multivariate.CMvPolynomial
/-!
# Correctness lemmas for multivariate Horner evaluat... | @@ -55,6 +55,18 @@
/-! ### Shared list algebra -/
+private lemma mem_insertHornerGroupDesc {n : ℕ} {S : Type*}
+ (group x : HornerGroup n S) :
+ ∀ groups, x ∈ insertHornerGroupDesc group groups ↔ x = group ∨ x ∈ groups := by
+ intro groups
+ induction groups with
+ | nil =>
+ simp [insertHornerGroupD... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_34b7f1635128_1 | 7dedea48988b0d79 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Multivariate/HornerLemmas.lean | HornerLemmas | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 17 | 1 | [
{
"theorem_name": "sortHornerGroups_descending",
"depth": 1,
"n_commands": 0,
"n_lines": 18,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold sortHornerGroups\n have hsort :\n ∀ (groups sorted : List (HornerGroup n S)),\n descending... | [
{
"name": "insertHornerGroupDesc_pairwise",
"text": "private lemma insertHornerGroupDesc_pairwise {n : ℕ} {S : Type*}\n (group : HornerGroup n S) :\n ∀ groups, descendingByExponent groups →\n descendingByExponent (insertHornerGroupDesc group groups) := by\n intro groups\n induction groups with\... | [
{
"name": "sortHornerGroups_descending",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 22,
"n_chars": 801,
"n_subproofs": 1,
"n_tactics": 18,
"cyclomatic": 2,
"n_automation": 2,
"n_rewrites": 1,
"n_structural": 7,
"automation_only": false,
... | 2 | /-
Copyright (c) 2025 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Frantisek Silvasi, Julian Sutherland, Andrei Burdușa, Derek Sorensen, Dimitris Mitsios
-/
import CompPoly.Multivariate.CMvPolynomial
/-!
# Correctness lemmas for multivariate Horner evaluat... | /-
Copyright (c) 2025 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Frantisek Silvasi, Julian Sutherland, Andrei Burdușa, Derek Sorensen, Dimitris Mitsios
-/
import CompPoly.Multivariate.CMvPolynomial
/-!
# Correctness lemmas for multivariate Horner evaluat... | @@ -67,6 +67,36 @@
· simp [insertHornerGroupDesc, h]
· simp [insertHornerGroupDesc, h, ih, or_left_comm]
+private lemma insertHornerGroupDesc_pairwise {n : ℕ} {S : Type*}
+ (group : HornerGroup n S) :
+ ∀ groups, descendingByExponent groups →
+ descendingByExponent (insertHornerGroupDesc grou... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_34b7f1635128_2 | 3ba054c899c5c2cf | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Multivariate/HornerLemmas.lean | HornerLemmas | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 17 | 1 | [
{
"theorem_name": "hornerGroups_descending",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold hornerGroups\n exact sortHornerGroups_descending (collectHornerGroups k terms)",
"n_chars": 91,
"n_... | [
{
"name": "sortHornerGroups_descending",
"text": "private lemma sortHornerGroups_descending {n : ℕ} {S : Type*}\n (groups : List (HornerGroup n S)) :\n descendingByExponent (sortHornerGroups groups) := by\n unfold sortHornerGroups\n have hsort :\n ∀ (groups sorted : List (HornerGroup n S)),\n ... | [
{
"name": "hornerGroups_descending",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 9,
"n_chars": 296,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false,
"max... | 3 | /-
Copyright (c) 2025 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Frantisek Silvasi, Julian Sutherland, Andrei Burdușa, Derek Sorensen, Dimitris Mitsios
-/
import CompPoly.Multivariate.CMvPolynomial
/-!
# Correctness lemmas for multivariate Horner evaluat... | /-
Copyright (c) 2025 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Frantisek Silvasi, Julian Sutherland, Andrei Burdușa, Derek Sorensen, Dimitris Mitsios
-/
import CompPoly.Multivariate.CMvPolynomial
/-!
# Correctness lemmas for multivariate Horner evaluat... | @@ -97,9 +97,32 @@
· exact Nat.le_of_not_gt hlt
· exact hsorted.1 y hy
+private lemma sortHornerGroups_descending {n : ℕ} {S : Type*}
+ (groups : List (HornerGroup n S)) :
+ descendingByExponent (sortHornerGroups groups) := by
+ unfold sortHornerGroups
+ have hsort :
+ ∀ (groups sorted ... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_34b7f1635128_3 | c68e71b0c1d41240 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Multivariate/HornerLemmas.lean | HornerLemmas | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 17 | 1 | [
{
"theorem_name": "groupWeightedSpec_sortGroups",
"depth": 1,
"n_commands": 0,
"n_lines": 12,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro groups\n induction groups with\n | nil =>\n intro sorted\n simp\n | cons group groups ih =... | [
{
"name": "groupWeightedSpec_insertHornerGroupDesc",
"text": "private lemma groupWeightedSpec_insertHornerGroupDesc {n : ℕ} {S : Type*}\n [CommSemiring S] (weight : HornerTerm n S → S) (x : S)\n (group : HornerGroup n S) :\n ∀ groups,\n ((insertHornerGroupDesc group groups).map (groupWeightedS... | [
{
"name": "groupWeightedSpec_sortGroups",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 20,
"n_chars": 727,
"n_subproofs": 0,
"n_tactics": 12,
"cyclomatic": 2,
"n_automation": 3,
"n_rewrites": 2,
"n_structural": 4,
"automation_only": false,
... | 1 | /-
Copyright (c) 2025 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Frantisek Silvasi, Julian Sutherland, Andrei Burdușa, Derek Sorensen, Dimitris Mitsios
-/
import CompPoly.Multivariate.CMvPolynomial
/-!
# Correctness lemmas for multivariate Horner evaluat... | /-
Copyright (c) 2025 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Frantisek Silvasi, Julian Sutherland, Andrei Burdușa, Derek Sorensen, Dimitris Mitsios
-/
import CompPoly.Multivariate.CMvPolynomial
/-!
# Correctness lemmas for multivariate Horner evaluat... | @@ -55,6 +55,23 @@
/-! ### Shared list algebra -/
+private lemma groupWeightedSpec_insertHornerGroupDesc {n : ℕ} {S : Type*}
+ [CommSemiring S] (weight : HornerTerm n S → S) (x : S)
+ (group : HornerGroup n S) :
+ ∀ groups,
+ ((insertHornerGroupDesc group groups).map (groupWeightedSpec weight x)).sum... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_34b7f1635128_4 | ce23744e51bf51cf | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Multivariate/HornerLemmas.lean | HornerLemmas | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 17 | 1 | [
{
"theorem_name": "groupWeightedSpec_groupTerms",
"depth": 1,
"n_commands": 0,
"n_lines": 13,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro terms\n induction terms with\n | nil =>\n intro groups\n simp [termsWeightedSpec]\n | cons... | [
{
"name": "groupWeightedSpec_insertHornerTerm",
"text": "private lemma groupWeightedSpec_insertHornerTerm {n : ℕ} {S : Type*}\n [CommSemiring S] (k : ℕ) (weight : HornerTerm n S → S) (x : S)\n (term : HornerTerm n S) :\n ∀ groups,\n ((insertHornerTerm (hornerExponent k term.1) term groups).map... | [
{
"name": "groupWeightedSpec_groupTerms",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 21,
"n_chars": 763,
"n_subproofs": 0,
"n_tactics": 13,
"cyclomatic": 2,
"n_automation": 4,
"n_rewrites": 2,
"n_structural": 4,
"automation_only": false,
... | 1 | /-
Copyright (c) 2025 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Frantisek Silvasi, Julian Sutherland, Andrei Burdușa, Derek Sorensen, Dimitris Mitsios
-/
import CompPoly.Multivariate.CMvPolynomial
/-!
# Correctness lemmas for multivariate Horner evaluat... | /-
Copyright (c) 2025 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Frantisek Silvasi, Julian Sutherland, Andrei Burdușa, Derek Sorensen, Dimitris Mitsios
-/
import CompPoly.Multivariate.CMvPolynomial
/-!
# Correctness lemmas for multivariate Horner evaluat... | @@ -55,6 +55,30 @@
/-! ### Shared list algebra -/
+private lemma groupWeightedSpec_insertHornerTerm {n : ℕ} {S : Type*}
+ [CommSemiring S] (k : ℕ) (weight : HornerTerm n S → S) (x : S)
+ (term : HornerTerm n S) :
+ ∀ groups,
+ ((insertHornerTerm (hornerExponent k term.1) term groups).map
+ (... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_34b7f1635128_5 | c23bce01959a7824 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Multivariate/HornerLemmas.lean | HornerLemmas | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 17 | 1 | [
{
"theorem_name": "groupWeightedSpec_sortHornerGroups",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold sortHornerGroups\n rw [groupWeightedSpec_sortGroups]\n simp",
"n_chars": 72,
"n_subproo... | [
{
"name": "groupWeightedSpec_sortGroups",
"text": "private lemma groupWeightedSpec_sortGroups {n : ℕ} {S : Type*}\n [CommSemiring S] (weight : HornerTerm n S → S) (x : S) :\n ∀ (groups sorted : List (HornerGroup n S)),\n ((groups.foldl (fun sorted group ↦ insertHornerGroupDesc group sorted) sorte... | [
{
"name": "groupWeightedSpec_sortHornerGroups",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 10,
"n_chars": 371,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 2,
"n_structural": 0,
"automation_only": fal... | 2 | /-
Copyright (c) 2025 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Frantisek Silvasi, Julian Sutherland, Andrei Burdușa, Derek Sorensen, Dimitris Mitsios
-/
import CompPoly.Multivariate.CMvPolynomial
/-!
# Correctness lemmas for multivariate Horner evaluat... | /-
Copyright (c) 2025 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Frantisek Silvasi, Julian Sutherland, Andrei Burdușa, Derek Sorensen, Dimitris Mitsios
-/
import CompPoly.Multivariate.CMvPolynomial
/-!
# Correctness lemmas for multivariate Horner evaluat... | @@ -72,11 +72,33 @@
rw [ih]
simp [add_assoc, add_left_comm, add_comm]
+private lemma groupWeightedSpec_sortGroups {n : ℕ} {S : Type*}
+ [CommSemiring S] (weight : HornerTerm n S → S) (x : S) :
+ ∀ (groups sorted : List (HornerGroup n S)),
+ ((groups.foldl (fun sorted group ↦ insertHornerG... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_34b7f1635128_6 | b8fe31dad37b645a | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Multivariate/HornerLemmas.lean | HornerLemmas | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 17 | 1 | [
{
"theorem_name": "groupWeightedSpec_collectHornerGroups",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold collectHornerGroups\n rw [groupWeightedSpec_groupTerms]\n simp",
"n_chars": 75,
"n_s... | [
{
"name": "groupWeightedSpec_groupTerms",
"text": "private lemma groupWeightedSpec_groupTerms {n : ℕ} {S : Type*}\n [CommSemiring S] (k : ℕ) (weight : HornerTerm n S → S) (x : S) :\n ∀ (terms : List (HornerTerm n S)) groups,\n (((terms.foldl\n (fun groups term ↦ insertHornerTerm (hornerExp... | [
{
"name": "groupWeightedSpec_collectHornerGroups",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 10,
"n_chars": 378,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 2,
"n_structural": 0,
"automation_only": ... | 2 | /-
Copyright (c) 2025 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Frantisek Silvasi, Julian Sutherland, Andrei Burdușa, Derek Sorensen, Dimitris Mitsios
-/
import CompPoly.Multivariate.CMvPolynomial
/-!
# Correctness lemmas for multivariate Horner evaluat... | /-
Copyright (c) 2025 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Frantisek Silvasi, Julian Sutherland, Andrei Burdușa, Derek Sorensen, Dimitris Mitsios
-/
import CompPoly.Multivariate.CMvPolynomial
/-!
# Correctness lemmas for multivariate Horner evaluat... | @@ -79,11 +79,34 @@
rw [ih]
simp [add_assoc, add_comm]
+private lemma groupWeightedSpec_groupTerms {n : ℕ} {S : Type*}
+ [CommSemiring S] (k : ℕ) (weight : HornerTerm n S → S) (x : S) :
+ ∀ (terms : List (HornerTerm n S)) groups,
+ (((terms.foldl
+ (fun groups term ↦ insertHornerTe... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_34b7f1635128_7 | a67373be77a30b82 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Multivariate/HornerLemmas.lean | HornerLemmas | 7 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 17 | 1 | [
{
"theorem_name": "groupWeightedSpec_hornerGroups",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold hornerGroups\n rw [groupWeightedSpec_sortHornerGroups]\n rw [groupWeightedSpec_collectHornerGroups]... | [
{
"name": "groupWeightedSpec_collectHornerGroups",
"text": "private lemma groupWeightedSpec_collectHornerGroups {n : ℕ} {S : Type*}\n [CommSemiring S] (k : ℕ) (weight : HornerTerm n S → S) (x : S)\n (terms : List (HornerTerm n S)) :\n ((collectHornerGroups k terms).map (groupWeightedSpec weight x))... | [
{
"name": "groupWeightedSpec_hornerGroups",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 6,
"n_lines": 12,
"n_chars": 449,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 3,
"n_structural": 0,
"automation_only": false,
... | 6 | /-
Copyright (c) 2025 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Frantisek Silvasi, Julian Sutherland, Andrei Burdușa, Derek Sorensen, Dimitris Mitsios
-/
import CompPoly.Multivariate.CMvPolynomial
/-!
# Correctness lemmas for multivariate Horner evaluat... | /-
Copyright (c) 2025 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Frantisek Silvasi, Julian Sutherland, Andrei Burdușa, Derek Sorensen, Dimitris Mitsios
-/
import CompPoly.Multivariate.CMvPolynomial
/-!
# Correctness lemmas for multivariate Horner evaluat... | @@ -144,11 +144,23 @@
rw [groupWeightedSpec_sortGroups]
simp
+private lemma groupWeightedSpec_collectHornerGroups {n : ℕ} {S : Type*}
+ [CommSemiring S] (k : ℕ) (weight : HornerTerm n S → S) (x : S)
+ (terms : List (HornerTerm n S)) :
+ ((collectHornerGroups k terms).map (groupWeightedSpec weight x)).s... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_34b7f1635128_8 | 85891aebcb95b135 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Multivariate/HornerLemmas.lean | HornerLemmas | 8 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 17 | 1 | [
{
"theorem_name": "evalSparseHornerGroups_eq_sparseGroupsSpec",
"depth": 1,
"n_commands": 0,
"n_lines": 19,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro groups hsorted\n cases groups with\n | nil =>\n simp [evalSparseHornerGroups, spar... | [
{
"name": "evalSparseHornerGroups_foldl_invariant",
"text": "private lemma evalSparseHornerGroups_foldl_invariant {S : Type*} [CommSemiring S]\n (x : S) :\n ∀ (groups : List (ℕ × S)) (state : ℕ × S),\n descendingByExponent (state :: groups) →\n let finalState := groups.foldl\n (fu... | [
{
"name": "evalSparseHornerGroups_eq_sparseGroupsSpec",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 26,
"n_chars": 903,
"n_subproofs": 0,
"n_tactics": 19,
"cyclomatic": 2,
"n_automation": 2,
"n_rewrites": 3,
"n_structural": 2,
"automation_o... | 1 | /-
Copyright (c) 2025 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Frantisek Silvasi, Julian Sutherland, Andrei Burdușa, Derek Sorensen, Dimitris Mitsios
-/
import CompPoly.Multivariate.CMvPolynomial
/-!
# Correctness lemmas for multivariate Horner evaluat... | /-
Copyright (c) 2025 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Frantisek Silvasi, Julian Sutherland, Andrei Burdușa, Derek Sorensen, Dimitris Mitsios
-/
import CompPoly.Multivariate.CMvPolynomial
/-!
# Correctness lemmas for multivariate Horner evaluat... | @@ -55,6 +55,43 @@
/-! ### Shared list algebra -/
+private lemma evalSparseHornerGroups_foldl_invariant {S : Type*} [CommSemiring S]
+ (x : S) :
+ ∀ (groups : List (ℕ × S)) (state : ℕ × S),
+ descendingByExponent (state :: groups) →
+ let finalState := groups.foldl
+ (fun state group ↦
+... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_34b7f1635128_9 | e6bbcb04718235f8 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Multivariate/HornerLemmas.lean | HornerLemmas | 9 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 17 | 1 | [
{
"theorem_name": "evalSparseHornerGroups_eq_sparseGroupsSpec",
"depth": 1,
"n_commands": 0,
"n_lines": 19,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro groups hsorted\n cases groups with\n | nil =>\n simp [evalSparseHornerGroups, spar... | [
{
"name": "evalSparseHornerGroups_foldl_invariant",
"text": "private lemma evalSparseHornerGroups_foldl_invariant {S : Type*} [CommSemiring S]\n (x : S) :\n ∀ (groups : List (ℕ × S)) (state : ℕ × S),\n descendingByExponent (state :: groups) →\n let finalState := groups.foldl\n (fu... | [
{
"name": "eval₂HornerTerms_eq_eval₂HornerTermsSpec",
"fan_in": 1,
"n_deps_direct": 9,
"n_deps_transitive": 15,
"n_lines": 46,
"n_chars": 2106,
"n_subproofs": 0,
"n_tactics": 21,
"cyclomatic": 1,
"n_automation": 3,
"n_rewrites": 3,
"n_structural": 5,
"automation_o... | 13 | /-
Copyright (c) 2025 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Frantisek Silvasi, Julian Sutherland, Andrei Burdușa, Derek Sorensen, Dimitris Mitsios
-/
import CompPoly.Multivariate.CMvPolynomial
/-!
# Correctness lemmas for multivariate Horner evaluat... | /-
Copyright (c) 2025 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Frantisek Silvasi, Julian Sutherland, Andrei Burdușa, Derek Sorensen, Dimitris Mitsios
-/
import CompPoly.Multivariate.CMvPolynomial
/-!
# Correctness lemmas for multivariate Horner evaluat... | @@ -253,6 +253,43 @@
/-! ### Sparse Horner over evaluated groups -/
+private lemma evalSparseHornerGroups_foldl_invariant {S : Type*} [CommSemiring S]
+ (x : S) :
+ ∀ (groups : List (ℕ × S)) (state : ℕ × S),
+ descendingByExponent (state :: groups) →
+ let finalState := groups.foldl
+ (f... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_34b7f1635128_10 | 248b94f7aee2c66b | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Multivariate/HornerLemmas.lean | HornerLemmas | 10 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 17 | 1 | [
{
"theorem_name": "eval₂HornerTerms_fold_eq_eval₂_fold",
"depth": 1,
"n_commands": 0,
"n_lines": 12,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro terms\n induction terms with\n | nil =>\n intro init\n simp\n | cons term terms ih ... | [
{
"name": "eval₂HornerTermSpec_eq_evalMonomial",
"text": "private lemma eval₂HornerTermSpec_eq_evalMonomial {S : Type*} {n : ℕ}\n [CommSemiring S] (vs : Fin n → S) (m : CMvMonomial n) (c : S) :\n eval₂HornerTermSpec\n (fun k ↦ if h : k < n then vs ⟨k, h⟩ else 0) n 0 (m, c) =\n c * MonoR.ev... | [
{
"name": "eval₂HornerTerms_fold_eq_eval₂_fold",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 24,
"n_chars": 872,
"n_subproofs": 0,
"n_tactics": 12,
"cyclomatic": 2,
"n_automation": 2,
"n_rewrites": 2,
"n_structural": 5,
"automation_only": f... | 1 | /-
Copyright (c) 2025 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Frantisek Silvasi, Julian Sutherland, Andrei Burdușa, Derek Sorensen, Dimitris Mitsios
-/
import CompPoly.Multivariate.CMvPolynomial
/-!
# Correctness lemmas for multivariate Horner evaluat... | /-
Copyright (c) 2025 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Frantisek Silvasi, Julian Sutherland, Andrei Burdușa, Derek Sorensen, Dimitris Mitsios
-/
import CompPoly.Multivariate.CMvPolynomial
/-!
# Correctness lemmas for multivariate Horner evaluat... | @@ -81,6 +81,22 @@
rw [hprod]
ac_rfl
+private lemma eval₂HornerTermSpec_eq_evalMonomial {S : Type*} {n : ℕ}
+ [CommSemiring S] (vs : Fin n → S) (m : CMvMonomial n) (c : S) :
+ eval₂HornerTermSpec
+ (fun k ↦ if h : k < n then vs ⟨k, h⟩ else 0) n 0 (m, c) =
+ c * MonoR.evalMonomial vs m ... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_34b7f1635128_11 | 62a108439640a539 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Multivariate/HornerLemmas.lean | HornerLemmas | 11 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 17 | 1 | [
{
"theorem_name": "eval₂HornerTerms_fold_eq_eval₂_fold",
"depth": 1,
"n_commands": 0,
"n_lines": 12,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro terms\n induction terms with\n | nil =>\n intro init\n simp\n | cons term terms ih ... | [
{
"name": "eval₂HornerTermSpec_eq_evalMonomial",
"text": "private lemma eval₂HornerTermSpec_eq_evalMonomial {S : Type*} {n : ℕ}\n [CommSemiring S] (vs : Fin n → S) (m : CMvMonomial n) (c : S) :\n eval₂HornerTermSpec\n (fun k ↦ if h : k < n then vs ⟨k, h⟩ else 0) n 0 (m, c) =\n c * MonoR.ev... | [
{
"name": "eval₂Horner_eq_eval₂",
"fan_in": 1,
"n_deps_direct": 3,
"n_deps_transitive": 18,
"n_lines": 28,
"n_chars": 1177,
"n_subproofs": 1,
"n_tactics": 23,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 5,
"n_structural": 1,
"automation_only": false,
"ma... | 16 | /-
Copyright (c) 2025 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Frantisek Silvasi, Julian Sutherland, Andrei Burdușa, Derek Sorensen, Dimitris Mitsios
-/
import CompPoly.Multivariate.CMvPolynomial
/-!
# Correctness lemmas for multivariate Horner evaluat... | /-
Copyright (c) 2025 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Frantisek Silvasi, Julian Sutherland, Andrei Burdușa, Derek Sorensen, Dimitris Mitsios
-/
import CompPoly.Multivariate.CMvPolynomial
/-!
# Correctness lemmas for multivariate Horner evaluat... | @@ -404,6 +404,22 @@
rw [hprod]
ac_rfl
+private lemma eval₂HornerTermSpec_eq_evalMonomial {S : Type*} {n : ℕ}
+ [CommSemiring S] (vs : Fin n → S) (m : CMvMonomial n) (c : S) :
+ eval₂HornerTermSpec
+ (fun k ↦ if h : k < n then vs ⟨k, h⟩ else 0) n 0 (m, c) =
+ c * MonoR.evalMonomial vs ... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_34b7f1635128_12 | 16803bb3215e41f9 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Multivariate/HornerLemmas.lean | HornerLemmas | 12 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 17 | 1 | [
{
"theorem_name": "eval₂Horner_eq_eval₂",
"depth": 1,
"n_commands": 0,
"n_lines": 23,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold eval₂Horner eval₂\n rw [eval₂HornerTerms_eq_eval₂HornerTermsSpec]\n unfold eval₂HornerTermsSpec\n have hfol... | [
{
"name": "eval₂HornerTerms_fold_eq_eval₂_fold",
"text": "private lemma eval₂HornerTerms_fold_eq_eval₂_fold {R S : Type*} {n : ℕ}\n [Semiring R] [CommSemiring S] (f : R →+* S) (vs : Fin n → S) :\n ∀ (terms : List (CMvMonomial n × R)) (init : S),\n (terms.map fun term ↦ (term.1, f term.2)).foldl\n... | [
{
"name": "evalHorner_eq_eval",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 19,
"n_lines": 7,
"n_chars": 290,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": false,
"max_nes... | 17 | /-
Copyright (c) 2025 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Frantisek Silvasi, Julian Sutherland, Andrei Burdușa, Derek Sorensen, Dimitris Mitsios
-/
import CompPoly.Multivariate.CMvPolynomial
/-!
# Correctness lemmas for multivariate Horner evaluat... | /-
Copyright (c) 2025 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Frantisek Silvasi, Julian Sutherland, Andrei Burdușa, Derek Sorensen, Dimitris Mitsios
-/
import CompPoly.Multivariate.CMvPolynomial
/-!
# Correctness lemmas for multivariate Horner evaluat... | @@ -420,10 +420,55 @@
simp [Vector.get]
rfl
+private lemma eval₂HornerTerms_fold_eq_eval₂_fold {R S : Type*} {n : ℕ}
+ [Semiring R] [CommSemiring S] (f : R →+* S) (vs : Fin n → S) :
+ ∀ (terms : List (CMvMonomial n × R)) (init : S),
+ (terms.map fun term ↦ (term.1, f term.2)).foldl
+ (fun ... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_e48e8cb3f61d_0 | 8d5d6d60b3c93dd9 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Fields/Binary/BF128Ghash/XPowTwoPowModCertificate.lean | XPowTwoPowModCertificate | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 129 | 1 | [
{
"theorem_name": "X_pow_2_pow_64_eq",
"depth": 1,
"n_commands": 0,
"n_lines": 74,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have s0 : X^(2^0) % ghashPoly = r0 % ghashPoly := by rw [pow_zero, pow_one, r0, X_ZMod2Poly_eq_X]\n have s1 := chain_st... | [
{
"name": "step_38",
"text": "lemma step_38 : r37^2 = (toPoly (to256 q38Val)) * ghashPoly + r38 := by\n rw [ghashPoly_eq_P_val]\n apply verify_square_step_correct r37Val q38Val r38Val; rfl -- Kernel check\n\n",
"fan_in": 1,
"n_lines": 5,
"n_chars": 176,
"n_subproofs": 0,
"n_tactics": 4... | [
{
"name": "X_pow_2_pow_64_eq",
"fan_in": 1,
"n_deps_direct": 64,
"n_deps_transitive": 64,
"n_lines": 78,
"n_chars": 2925,
"n_subproofs": 65,
"n_tactics": 74,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 5,
"n_structural": 2,
"automation_only": false,
"max... | 64 | /-
Copyright (c) 2024-2025 ArkLib Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Chung Thai Nguyen, Quang Dao
-/
import CompPoly.Fields.Binary.BF128Ghash.Prelude
/-!
# XPowTwoPow Mod Certificate
Certificates for modular arithmetic in the BF128Ghash fie... | /-
Copyright (c) 2024-2025 ArkLib Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Chung Thai Nguyen, Quang Dao
-/
import CompPoly.Fields.Binary.BF128Ghash.Prelude
/-!
# XPowTwoPow Mod Certificate
Certificates for modular arithmetic in the BF128Ghash fie... | @@ -281,6 +281,10 @@
def q38Val : B128 := BitVec.ofNat 128 1745017709983535898810543976869807188
def r38Val : B128 := BitVec.ofNat 128 311928417185453978908537250809886516984
noncomputable def r38 := toPoly r38Val
+lemma step_38 : r37^2 = (toPoly (to256 q38Val)) * ghashPoly + r38 := by
+ rw [ghashPoly_eq_P_val]
+ ... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_e48e8cb3f61d_1 | 0cabdbcab74a8821 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Fields/Binary/BF128Ghash/XPowTwoPowModCertificate.lean | XPowTwoPowModCertificate | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 129 | 1 | [
{
"theorem_name": "X_pow_2_pow_128_eq",
"depth": 1,
"n_commands": 0,
"n_lines": 81,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hr64_mod : r64 % ghashPoly = r64 := by\n rw [r64, r64Val, Polynomial.mod_eq_self_iff]\n · conv_rhs => rw [gh... | [
{
"name": "step_75",
"text": "lemma step_75 : r74^2 = (toPoly (to256 q75Val)) * ghashPoly + r75 := by\n rw [ghashPoly_eq_P_val]\n apply verify_square_step_correct r74Val q75Val r75Val; rfl -- Kernel check\n\n",
"fan_in": 1,
"n_lines": 5,
"n_chars": 176,
"n_subproofs": 0,
"n_tactics": 4... | [
{
"name": "X_pow_2_pow_128_eq",
"fan_in": 0,
"n_deps_direct": 65,
"n_deps_transitive": 129,
"n_lines": 84,
"n_chars": 3131,
"n_subproofs": 67,
"n_tactics": 80,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 7,
"n_structural": 3,
"automation_only": false,
"m... | 129 | /-
Copyright (c) 2024-2025 ArkLib Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Chung Thai Nguyen, Quang Dao
-/
import CompPoly.Fields.Binary.BF128Ghash.Prelude
/-!
# XPowTwoPow Mod Certificate
Certificates for modular arithmetic in the BF128Ghash fie... | /-
Copyright (c) 2024-2025 ArkLib Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Chung Thai Nguyen, Quang Dao
-/
import CompPoly.Fields.Binary.BF128Ghash.Prelude
/-!
# XPowTwoPow Mod Certificate
Certificates for modular arithmetic in the BF128Ghash fie... | @@ -540,6 +540,10 @@
def q75Val : B128 := BitVec.ofNat 128 113342978110273067672708979424336364922
def r75Val : B128 := BitVec.ofNat 128 122383803109284106894334171034010591779
noncomputable def r75 := toPoly r75Val
+lemma step_75 : r74^2 = (toPoly (to256 q75Val)) * ghashPoly + r75 := by
+ rw [ghashPoly_eq_P_val]
+... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_906ebcc514c9_0 | 570b8797b2094862 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Univariate/Roots/Enumeration.lean | Enumeration | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 1 | [
{
"theorem_name": "enumeratedLinearFactors_complete",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n refine ⟨CPolynomial.linearFactor a, ?_, linearFactor_isRootFactorCandidate a⟩\n rw [enumeratedLinearFacto... | [
{
"name": "rootsInFieldByEnumeration_complete",
"text": "/-- Complete enumeration finds every root. -/\ntheorem rootsInFieldByEnumeration_complete {F : Type*}\n [Field F] [BEq F] [LawfulBEq F]\n (enumeration : FieldEnumeration F) {p : CPolynomial F} {a : F}\n (hroot : CPolynomial.eval a p = 0) :\n ... | [
{
"name": "enumeratedLinearFactors_complete",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 15,
"n_chars": 628,
"n_subproofs": 0,
"n_tactics": 6,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false... | 1 | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Univariate.Roots.Correctness
/-!
# Exhaustive Finite-Field Root Enumeration
Reusable lazy field-enumeration contexts for finite-field root s... | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Univariate.Roots.Correctness
/-!
# Exhaustive Finite-Field Root Enumeration
Reusable lazy field-enumeration contexts for finite-field root s... | @@ -50,6 +50,16 @@
(enumeration : FieldEnumeration F) (p : CPolynomial F) : Array F :=
(Array.ofFn enumeration.elem).filter fun a ↦ CPolynomial.evalHorner a p == 0
+/-- Complete enumeration finds every root. -/
+theorem rootsInFieldByEnumeration_complete {F : Type*}
+ [Field F] [BEq F] [LawfulBEq F]
+ (... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_5cb9bdce429f_0 | 5470160c7b83ecdd | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Data/ExtTreeMap/DTreeMap.lean | DTreeMap | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 1 | [
{
"theorem_name": "Const.get?_mergeWith",
"depth": 1,
"n_commands": 0,
"n_lines": 176,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n letI : Ord α := ⟨cmp⟩\n let l : List (α × β) := toList t₂\n let pred : (α × β) → Bool := fun p => (cmp p.1 k == .e... | [
{
"name": "Const.get?_foldl_no_touch",
"text": "theorem Const.get?_foldl_no_touch\n [TransCmp cmp] [LawfulEqCmp cmp]\n (k : α) (f : α → β → β → β)\n (l : List (α × β)) (t : DTreeMap α (fun _ => β) cmp)\n (hno : ∀ p ∈ l, cmp p.1 k ≠ .eq) :\n Const.get? (l.foldl (fun acc p =>\n Const.alter... | [
{
"name": "Const.get?_mergeWith",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 193,
"n_chars": 8985,
"n_subproofs": 31,
"n_tactics": 168,
"cyclomatic": 16,
"n_automation": 20,
"n_rewrites": 1,
"n_structural": 18,
"automation_only": false,
... | 1 | /-
Copyright (c) 2025 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Markus Himmel
-/
import Std.Data.DTreeMap.Lemmas
/-!
# Auxiliary lemmas for `Std.DTreeMap`
Lemmas about `mergeWith` and `filter` on `Std.DTreeMap` (and its internal
implementation) that ar... | /-
Copyright (c) 2025 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Markus Himmel
-/
import Std.Data.DTreeMap.Lemmas
/-!
# Auxiliary lemmas for `Std.DTreeMap`
Lemmas about `mergeWith` and `filter` on `Std.DTreeMap` (and its internal
implementation) that ar... | @@ -26,6 +26,38 @@
variable {α : Type u} {β : Type v} {cmp : α → α → Ordering}
-- Folding alters at keys ≠ `k` does not change `get? _ k`.
+theorem Const.get?_foldl_no_touch
+ [TransCmp cmp] [LawfulEqCmp cmp]
+ (k : α) (f : α → β → β → β)
+ (l : List (α × β)) (t : DTreeMap α (fun _ => β) cmp)
+ (hno : ∀... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_910d484d204c_0 | 35943cdb3f85b1bb | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Univariate/ToPoly/Core.lean | Core | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 11 | 5 | [
{
"theorem_name": "toPoly_toImpl",
"depth": 1,
"n_commands": 0,
"n_lines": 13,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n ext n\n rw [coeff_toPoly]\n rcases toImpl_elim p with ⟨rfl, h⟩ | ⟨_, h⟩\n · simp [h]\n rw [h]\n by_cases h : n < p.natD... | [
{
"name": "toImpl_elim",
"text": "/-- Case analysis for `toImpl`: either the polynomial is zero or has a specific form. -/\nlemma toImpl_elim (p : Q[X]) :\n (p = 0 ∧ p.toImpl = #[])\n ∨ (p ≠ 0 ∧ p.toImpl = .ofFn (fun i : Fin (p.natDegree + 1) => p.coeff i)) := by\n unfold toImpl\n by_cases hbot : p.de... | [
{
"name": "toPoly_toImpl",
"fan_in": 2,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 18,
"n_chars": 581,
"n_subproofs": 0,
"n_tactics": 13,
"cyclomatic": 2,
"n_automation": 5,
"n_rewrites": 2,
"n_structural": 3,
"automation_only": false,
"max_nesting... | 2 | /-
Copyright (c) 2025 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao, Gregor Mitscha-Baude, Derek Sorensen
-/
import Mathlib.Algebra.Polynomial.Inductions
import Mathlib.Algebra.Ring.TransferInstance
import Mathlib.Algebra.Tropical.Basic
import Math... | /-
Copyright (c) 2025 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao, Gregor Mitscha-Baude, Derek Sorensen
-/
import Mathlib.Algebra.Polynomial.Inductions
import Mathlib.Algebra.Ring.TransferInstance
import Mathlib.Algebra.Tropical.Basic
import Math... | @@ -110,10 +110,36 @@
have h2 : n < i + 1 := by linarith
simp [hgt, h1, h2]
+/-- Case analysis for `toImpl`: either the polynomial is zero or has a specific form. -/
+lemma toImpl_elim (p : Q[X]) :
+ (p = 0 ∧ p.toImpl = #[])
+ ∨ (p ≠ 0 ∧ p.toImpl = .ofFn (fun i : Fin (p.natDegree + 1) => p.coeff i)) := ... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_910d484d204c_1 | 896c31d79dd154c0 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Univariate/ToPoly/Core.lean | Core | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 11 | 6 | [
{
"theorem_name": "toPoly_toImpl",
"depth": 1,
"n_commands": 0,
"n_lines": 13,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n ext n\n rw [coeff_toPoly]\n rcases toImpl_elim p with ⟨rfl, h⟩ | ⟨_, h⟩\n · simp [h]\n rw [h]\n by_cases h : n < p.natD... | [
{
"name": "coeff_toPoly",
"text": "/-- The coefficients of `p.toPoly` match those of `p`. -/\nlemma coeff_toPoly {p : CPolynomial.Raw Q} {n : ℕ} : p.toPoly.coeff n = p.coeff n := by\n unfold Raw.toPoly Raw.eval₂\n\n let f := fun (acc: Q[X]) ((a,i): Q × ℕ) ↦ acc + Polynomial.C a * Polynomial.X ^ i\n chang... | [
{
"name": "toPoly_trim",
"fan_in": 4,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 7,
"n_chars": 215,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false,
"max_nesting": 2... | 1 | /-
Copyright (c) 2025 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao, Gregor Mitscha-Baude, Derek Sorensen
-/
import Mathlib.Algebra.Polynomial.Inductions
import Mathlib.Algebra.Ring.TransferInstance
import Mathlib.Algebra.Tropical.Basic
import Math... | /-
Copyright (c) 2025 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao, Gregor Mitscha-Baude, Derek Sorensen
-/
import Mathlib.Algebra.Polynomial.Inductions
import Mathlib.Algebra.Ring.TransferInstance
import Mathlib.Algebra.Tropical.Basic
import Math... | @@ -74,6 +74,42 @@
· congr; exact Polynomial.eval_zero
simp
+/-- The coefficients of `p.toPoly` match those of `p`. -/
+lemma coeff_toPoly {p : CPolynomial.Raw Q} {n : ℕ} : p.toPoly.coeff n = p.coeff n := by
+ unfold Raw.toPoly Raw.eval₂
+
+ let f := fun (acc: Q[X]) ((a,i): Q × ℕ) ↦ acc + Polynomial.C a * Pol... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_910d484d204c_2 | 0cb9ce8f70527cf6 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Univariate/ToPoly/Core.lean | Core | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 11 | 4 | [
{
"theorem_name": "toPoly_add",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n change (p.add q).toPoly = p.toPoly + q.toPoly; unfold add\n rw [toPoly_trim, toPoly_addRaw]",
"n_chars": 97,
"n_subproo... | [
{
"name": "toPoly_trim",
"text": "/-- Trimming doesn't change the `toPoly` image. -/\n@[grind =]\nlemma toPoly_trim [LawfulBEq R] {p : CPolynomial.Raw R} : p.trim.toPoly = p.toPoly := by\n ext n\n rw [coeff_toPoly, coeff_toPoly, Trim.coeff_eq_coeff]\n\n",
"fan_in": 4,
"n_lines": 7,
"n_chars": ... | [
{
"name": "toPoly_add",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 7,
"n_chars": 212,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 3,
"n_structural": 0,
"automation_only": false,
"max_nesting": 2
... | 3 | /-
Copyright (c) 2025 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao, Gregor Mitscha-Baude, Derek Sorensen
-/
import Mathlib.Algebra.Polynomial.Inductions
import Mathlib.Algebra.Ring.TransferInstance
import Mathlib.Algebra.Tropical.Basic
import Math... | /-
Copyright (c) 2025 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao, Gregor Mitscha-Baude, Derek Sorensen
-/
import Mathlib.Algebra.Polynomial.Inductions
import Mathlib.Algebra.Ring.TransferInstance
import Mathlib.Algebra.Tropical.Basic
import Math... | @@ -141,6 +141,12 @@
symm
exact coeff_eq_zero_of_natDegree_lt h
+/-- Trimming doesn't change the `toPoly` image. -/
+@[grind =]
+lemma toPoly_trim [LawfulBEq R] {p : CPolynomial.Raw R} : p.trim.toPoly = p.toPoly := by
+ ext n
+ rw [coeff_toPoly, coeff_toPoly, Trim.coeff_eq_coeff]
+
/-- `toPoly` preserves add... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_910d484d204c_3 | 09063f3ef6bf6f2b | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Univariate/ToPoly/Core.lean | Core | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 11 | 1 | [
{
"theorem_name": "isCanonical_toImpl",
"depth": 1,
"n_commands": 0,
"n_lines": 8,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rcases toImpl_elim p with ⟨rfl, h⟩ | ⟨h_nz, _⟩\n · simpa [h] using (Trim.isCanonical_empty (R := R))\n · intro hp\n ... | [
{
"name": "getLast_toImpl",
"text": "/-- The last coefficient of `toImpl p` is the leading coefficient of `p`. -/\nlemma getLast_toImpl {p : Q[X]} (hp : p ≠ 0) : let h : p.toImpl.size > 0 := toImpl_nonzero hp;\n p.toImpl[p.toImpl.size - 1] = p.leadingCoeff := by\n rcases toImpl_elim p with ⟨rfl, _⟩ | ⟨_... | [
{
"name": "trim_toImpl",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 4,
"n_lines": 6,
"n_chars": 223,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": false,
"max_nesting": 2... | 3 | /-
Copyright (c) 2025 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao, Gregor Mitscha-Baude, Derek Sorensen
-/
import Mathlib.Algebra.Polynomial.Inductions
import Mathlib.Algebra.Ring.TransferInstance
import Mathlib.Algebra.Tropical.Basic
import Math... | /-
Copyright (c) 2025 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao, Gregor Mitscha-Baude, Derek Sorensen
-/
import Mathlib.Algebra.Polynomial.Inductions
import Mathlib.Algebra.Ring.TransferInstance
import Mathlib.Algebra.Tropical.Basic
import Math... | @@ -179,13 +179,22 @@
suffices h : p.toImpl ≠ #[] from Array.size_pos_iff.mpr h
simp [h]
+/-- The last coefficient of `toImpl p` is the leading coefficient of `p`. -/
+lemma getLast_toImpl {p : Q[X]} (hp : p ≠ 0) : let h : p.toImpl.size > 0 := toImpl_nonzero hp;
+ p.toImpl[p.toImpl.size - 1] = p.leadingCoeff... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_910d484d204c_4 | 8772eff6c7a3fcce | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Univariate/ToPoly/Core.lean | Core | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 11 | 4 | [
{
"theorem_name": "toPoly_add",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n change (p.add q).toPoly = p.toPoly + q.toPoly; unfold add\n rw [toPoly_trim, toPoly_addRaw]",
"n_chars": 97,
"n_subproo... | [
{
"name": "toPoly_trim",
"text": "/-- Trimming doesn't change the `toPoly` image. -/\n@[grind =]\nlemma toPoly_trim [LawfulBEq R] {p : CPolynomial.Raw R} : p.trim.toPoly = p.toPoly := by\n ext n\n rw [coeff_toPoly, coeff_toPoly, Trim.coeff_eq_coeff]\n\n",
"fan_in": 4,
"n_lines": 7,
"n_chars": ... | [
{
"name": "ofArray_toPoly",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 7,
"n_chars": 233,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false,
"max_nesting"... | 2 | /-
Copyright (c) 2025 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao, Gregor Mitscha-Baude, Derek Sorensen
-/
import Mathlib.Algebra.Polynomial.Inductions
import Mathlib.Algebra.Ring.TransferInstance
import Mathlib.Algebra.Tropical.Basic
import Math... | /-
Copyright (c) 2025 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao, Gregor Mitscha-Baude, Derek Sorensen
-/
import Mathlib.Algebra.Polynomial.Inductions
import Mathlib.Algebra.Ring.TransferInstance
import Mathlib.Algebra.Tropical.Basic
import Math... | @@ -141,6 +141,12 @@
symm
exact coeff_eq_zero_of_natDegree_lt h
+/-- Trimming doesn't change the `toPoly` image. -/
+@[grind =]
+lemma toPoly_trim [LawfulBEq R] {p : CPolynomial.Raw R} : p.trim.toPoly = p.toPoly := by
+ ext n
+ rw [coeff_toPoly, coeff_toPoly, Trim.coeff_eq_coeff]
+
/-- `toPoly` preserves add... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_910d484d204c_6 | 5be24d503ef92fa4 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Univariate/ToPoly/Core.lean | Core | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 11 | 1 | [
{
"theorem_name": "isCanonical_toImpl",
"depth": 1,
"n_commands": 0,
"n_lines": 8,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rcases toImpl_elim p with ⟨rfl, h⟩ | ⟨h_nz, _⟩\n · simpa [h] using (Trim.isCanonical_empty (R := R))\n · intro hp\n ... | [
{
"name": "getLast_toImpl",
"text": "/-- The last coefficient of `toImpl p` is the leading coefficient of `p`. -/\nlemma getLast_toImpl {p : Q[X]} (hp : p ≠ 0) : let h : p.toImpl.size > 0 := toImpl_nonzero hp;\n p.toImpl[p.toImpl.size - 1] = p.leadingCoeff := by\n rcases toImpl_elim p with ⟨rfl, _⟩ | ⟨_... | [
{
"name": "Raw.toPoly_natDegree_lt_trim_size_of_pos",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 9,
"n_lines": 16,
"n_chars": 634,
"n_subproofs": 4,
"n_tactics": 11,
"cyclomatic": 2,
"n_automation": 4,
"n_rewrites": 1,
"n_structural": 1,
"automation_onl... | 8 | /-
Copyright (c) 2025 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao, Gregor Mitscha-Baude, Derek Sorensen
-/
import Mathlib.Algebra.Polynomial.Inductions
import Mathlib.Algebra.Ring.TransferInstance
import Mathlib.Algebra.Tropical.Basic
import Math... | /-
Copyright (c) 2025 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao, Gregor Mitscha-Baude, Derek Sorensen
-/
import Mathlib.Algebra.Polynomial.Inductions
import Mathlib.Algebra.Ring.TransferInstance
import Mathlib.Algebra.Tropical.Basic
import Math... | @@ -179,13 +179,22 @@
suffices h : p.toImpl ≠ #[] from Array.size_pos_iff.mpr h
simp [h]
+/-- The last coefficient of `toImpl p` is the leading coefficient of `p`. -/
+lemma getLast_toImpl {p : Q[X]} (hp : p ≠ 0) : let h : p.toImpl.size > 0 := toImpl_nonzero hp;
+ p.toImpl[p.toImpl.size - 1] = p.leadingCoeff... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.