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_60b7d09d8486_0 | 59291d86f31da924 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Univariate/Roots/Correctness.lean | Correctness | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 41 | 1 | [
{
"theorem_name": "mem_eraseDups",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold Array.eraseDups at h\n rcases xs with ⟨l⟩\n simp at h ⊢\n have hh := mem_eraseDups_fold a l #[] h\n simpa using hh... | [
{
"name": "mem_eraseDups_fold",
"text": "private lemma mem_eraseDups_fold {α : Type*} [BEq α] [LawfulBEq α]\n (a : α) : ∀ (xs : List α) (out : Array α),\n a ∈ List.foldl (fun out x ↦ if x ∈ out then out else out.push x) out xs →\n a ∈ out ∨ a ∈ xs := by\n intro xs\n induction xs with\n | n... | [
{
"name": "mem_eraseDups",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 9,
"n_chars": 267,
"n_subproofs": 1,
"n_tactics": 6,
"cyclomatic": 2,
"n_automation": 2,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false,
"max_nesting":... | 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.Backend
import CompPoly.Univariate.Roots.Splitter
import CompPoly.Univariate.EuclideanAlgorithm
import CompPoly.Univariate.To... | /-
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.Backend
import CompPoly.Univariate.Roots.Splitter
import CompPoly.Univariate.EuclideanAlgorithm
import CompPoly.Univariate.To... | @@ -20,8 +20,39 @@
namespace CPolynomial
+private lemma mem_eraseDups_fold {α : Type*} [BEq α] [LawfulBEq α]
+ (a : α) : ∀ (xs : List α) (out : Array α),
+ a ∈ List.foldl (fun out x ↦ if x ∈ out then out else out.push x) out xs →
+ a ∈ out ∨ a ∈ xs := by
+ intro xs
+ induction xs with
+ | nil =>
... | {
"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_60b7d09d8486_1 | 59719e042f3a1255 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Univariate/Roots/Correctness.lean | Correctness | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 41 | 1 | [
{
"theorem_name": "mem_eraseDups_of_mem",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold Array.eraseDups\n rcases xs with ⟨l⟩\n simp at h ⊢\n exact mem_eraseDups_fold_of_mem a l #[] (Or.inr h)",
... | [
{
"name": "mem_eraseDups_fold_of_mem",
"text": "private lemma mem_eraseDups_fold_of_mem {α : Type*} [BEq α] [LawfulBEq α]\n (a : α) : ∀ (xs : List α) (out : Array α),\n a ∈ out ∨ a ∈ xs →\n a ∈ List.foldl (fun out x ↦ if x ∈ out then out else out.push x) out xs := by\n intro xs\n induction ... | [
{
"name": "mem_eraseDups_of_mem",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 8,
"n_chars": 263,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 2,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 2,
"automation_only": false,
"max_ne... | 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.Backend
import CompPoly.Univariate.Roots.Splitter
import CompPoly.Univariate.EuclideanAlgorithm
import CompPoly.Univariate.To... | /-
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.Backend
import CompPoly.Univariate.Roots.Splitter
import CompPoly.Univariate.EuclideanAlgorithm
import CompPoly.Univariate.To... | @@ -20,8 +20,44 @@
namespace CPolynomial
+private lemma mem_eraseDups_fold_of_mem {α : Type*} [BEq α] [LawfulBEq α]
+ (a : α) : ∀ (xs : List α) (out : Array α),
+ a ∈ out ∨ a ∈ xs →
+ a ∈ List.foldl (fun out x ↦ if x ∈ out then out else out.push x) out xs := by
+ intro xs
+ induction xs with
+ | ... | {
"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_60b7d09d8486_2 | 0d10f0f54add347d | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Univariate/Roots/Correctness.lean | Correctness | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 41 | 1 | [
{
"theorem_name": "Raw.eval_smul",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [← CPolynomial.Raw.eval_toPoly_eq_eval, Raw.toPoly_smul]\n rw [Polynomial.smul_eq_C_mul, Polynomial.eval_mul, Polynomial.... | [
{
"name": "Raw.toPoly_smul",
"text": "private theorem Raw.toPoly_smul {F : Type*} [Field F] [BEq F] [LawfulBEq F]\n (c : F) (p : CPolynomial.Raw F) :\n (CPolynomial.Raw.smul c p).toPoly = c • p.toPoly := by\n ext i\n rw [Polynomial.coeff_smul]\n rw [CPolynomial.Raw.coeff_toPoly, CPolynomial.Raw.coe... | [
{
"name": "Raw.eval_smul",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 8,
"n_chars": 351,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 2,
"n_structural": 0,
"automation_only": false,
"max_nesting":... | 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.Backend
import CompPoly.Univariate.Roots.Splitter
import CompPoly.Univariate.EuclideanAlgorithm
import CompPoly.Univariate.To... | /-
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.Backend
import CompPoly.Univariate.Roots.Splitter
import CompPoly.Univariate.EuclideanAlgorithm
import CompPoly.Univariate.To... | @@ -20,9 +20,20 @@
namespace CPolynomial
+private theorem Raw.toPoly_smul {F : Type*} [Field F] [BEq F] [LawfulBEq F]
+ (c : F) (p : CPolynomial.Raw F) :
+ (CPolynomial.Raw.smul c p).toPoly = c • p.toPoly := by
+ ext i
+ rw [Polynomial.coeff_smul]
+ rw [CPolynomial.Raw.coeff_toPoly, CPolynomial.Raw.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_60b7d09d8486_3 | 2b1d57f31732a109 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Univariate/Roots/Correctness.lean | Correctness | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 41 | 8 | [
{
"theorem_name": "Raw.eval_smul",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [← CPolynomial.Raw.eval_toPoly_eq_eval, Raw.toPoly_smul]\n rw [Polynomial.smul_eq_C_mul, Polynomial.eval_mul, Polynomial.... | [
{
"name": "Raw.eval_mul",
"text": "private theorem Raw.eval_mul {F : Type*} [Field F] [BEq F] [LawfulBEq F]\n (a : F) (p q : CPolynomial.Raw F) :\n (p * q).eval a = p.eval a * q.eval a := by\n rw [← CPolynomial.Raw.eval_toPoly_eq_eval, CPolynomial.Raw.toPoly_mul,\n Polynomial.eval_mul, CPolynomial... | [
{
"name": "Raw.eval_C_smul",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 6,
"n_chars": 222,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
"max_nesting... | 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.Roots.Backend
import CompPoly.Univariate.Roots.Splitter
import CompPoly.Univariate.EuclideanAlgorithm
import CompPoly.Univariate.To... | /-
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.Backend
import CompPoly.Univariate.Roots.Splitter
import CompPoly.Univariate.EuclideanAlgorithm
import CompPoly.Univariate.To... | @@ -20,6 +20,13 @@
namespace CPolynomial
+private theorem Raw.eval_mul {F : Type*} [Field F] [BEq F] [LawfulBEq F]
+ (a : F) (p q : CPolynomial.Raw F) :
+ (p * q).eval a = p.eval a * q.eval a := by
+ rw [← CPolynomial.Raw.eval_toPoly_eq_eval, CPolynomial.Raw.toPoly_mul,
+ Polynomial.eval_mul, CPolynomial... | {
"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_60b7d09d8486_4 | 05b4eb6f66d05a02 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Univariate/Roots/Correctness.lean | Correctness | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 41 | 1 | [
{
"theorem_name": "Raw.eval_smul",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [← CPolynomial.Raw.eval_toPoly_eq_eval, Raw.toPoly_smul]\n rw [Polynomial.smul_eq_C_mul, Polynomial.eval_mul, Polynomial.... | [
{
"name": "Raw.toPoly_smul",
"text": "private theorem Raw.toPoly_smul {F : Type*} [Field F] [BEq F] [LawfulBEq F]\n (c : F) (p : CPolynomial.Raw F) :\n (CPolynomial.Raw.smul c p).toPoly = c • p.toPoly := by\n ext i\n rw [Polynomial.coeff_smul]\n rw [CPolynomial.Raw.coeff_toPoly, CPolynomial.Raw.coe... | [
{
"name": "Raw.eval_monicNormalize_eq_zero_of_eval_eq_zero",
"fan_in": 11,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 13,
"n_chars": 568,
"n_subproofs": 0,
"n_tactics": 8,
"cyclomatic": 1,
"n_automation": 3,
"n_rewrites": 3,
"n_structural": 0,
"automat... | 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.Roots.Backend
import CompPoly.Univariate.Roots.Splitter
import CompPoly.Univariate.EuclideanAlgorithm
import CompPoly.Univariate.To... | /-
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.Backend
import CompPoly.Univariate.Roots.Splitter
import CompPoly.Univariate.EuclideanAlgorithm
import CompPoly.Univariate.To... | @@ -20,9 +20,20 @@
namespace CPolynomial
+private theorem Raw.toPoly_smul {F : Type*} [Field F] [BEq F] [LawfulBEq F]
+ (c : F) (p : CPolynomial.Raw F) :
+ (CPolynomial.Raw.smul c p).toPoly = c • p.toPoly := by
+ ext i
+ rw [Polynomial.coeff_smul]
+ rw [CPolynomial.Raw.coeff_toPoly, CPolynomial.Raw.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_60b7d09d8486_5 | 81f5495c5cea0173 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Univariate/Roots/Correctness.lean | Correctness | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 41 | 8 | [
{
"theorem_name": "Raw.eval_smul",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [← CPolynomial.Raw.eval_toPoly_eq_eval, Raw.toPoly_smul]\n rw [Polynomial.smul_eq_C_mul, Polynomial.eval_mul, Polynomial.... | [
{
"name": "Raw.eval_mul",
"text": "private theorem Raw.eval_mul {F : Type*} [Field F] [BEq F] [LawfulBEq F]\n (a : F) (p q : CPolynomial.Raw F) :\n (p * q).eval a = p.eval a * q.eval a := by\n rw [← CPolynomial.Raw.eval_toPoly_eq_eval, CPolynomial.Raw.toPoly_mul,\n Polynomial.eval_mul, CPolynomial... | [
{
"name": "Raw.eval_mod_eq_zero_of_left_right",
"fan_in": 1,
"n_deps_direct": 3,
"n_deps_transitive": 3,
"n_lines": 17,
"n_chars": 638,
"n_subproofs": 2,
"n_tactics": 11,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 4,
"n_structural": 0,
"automation_only": fa... | 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.Roots.Backend
import CompPoly.Univariate.Roots.Splitter
import CompPoly.Univariate.EuclideanAlgorithm
import CompPoly.Univariate.To... | /-
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.Backend
import CompPoly.Univariate.Roots.Splitter
import CompPoly.Univariate.EuclideanAlgorithm
import CompPoly.Univariate.To... | @@ -20,6 +20,13 @@
namespace CPolynomial
+private theorem Raw.eval_mul {F : Type*} [Field F] [BEq F] [LawfulBEq F]
+ (a : F) (p q : CPolynomial.Raw F) :
+ (p * q).eval a = p.eval a * q.eval a := by
+ rw [← CPolynomial.Raw.eval_toPoly_eq_eval, CPolynomial.Raw.toPoly_mul,
+ Polynomial.eval_mul, CPolynomial... | {
"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_60b7d09d8486_6 | 2a2240cf6f5650f4 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Univariate/Roots/Correctness.lean | Correctness | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 41 | 8 | [
{
"theorem_name": "Raw.eval_smul",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [← CPolynomial.Raw.eval_toPoly_eq_eval, Raw.toPoly_smul]\n rw [Polynomial.smul_eq_C_mul, Polynomial.eval_mul, Polynomial.... | [
{
"name": "Raw.eval_mul",
"text": "private theorem Raw.eval_mul {F : Type*} [Field F] [BEq F] [LawfulBEq F]\n (a : F) (p q : CPolynomial.Raw F) :\n (p * q).eval a = p.eval a * q.eval a := by\n rw [← CPolynomial.Raw.eval_toPoly_eq_eval, CPolynomial.Raw.toPoly_mul,\n Polynomial.eval_mul, CPolynomial... | [
{
"name": "Raw.eval_gcdMonicWithFuel_eq_zero_of_left_right",
"fan_in": 3,
"n_deps_direct": 2,
"n_deps_transitive": 7,
"n_lines": 32,
"n_chars": 1103,
"n_subproofs": 0,
"n_tactics": 26,
"cyclomatic": 2,
"n_automation": 2,
"n_rewrites": 6,
"n_structural": 12,
"autom... | 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.Univariate.Roots.Backend
import CompPoly.Univariate.Roots.Splitter
import CompPoly.Univariate.EuclideanAlgorithm
import CompPoly.Univariate.To... | /-
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.Backend
import CompPoly.Univariate.Roots.Splitter
import CompPoly.Univariate.EuclideanAlgorithm
import CompPoly.Univariate.To... | @@ -35,6 +35,13 @@
rw [Polynomial.smul_eq_C_mul, Polynomial.eval_mul, Polynomial.eval_C,
CPolynomial.Raw.eval_toPoly_eq_eval]
+private theorem Raw.eval_mul {F : Type*} [Field F] [BEq F] [LawfulBEq F]
+ (a : F) (p q : CPolynomial.Raw F) :
+ (p * q).eval a = p.eval a * q.eval a := by
+ rw [← CPolynomial.... | {
"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_60b7d09d8486_7 | 184a9907ffae0627 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Univariate/Roots/Correctness.lean | Correctness | 7 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 41 | 11 | [
{
"theorem_name": "Raw.eval_gcdMonicWithFuel_eq_zero_of_left_right",
"depth": 1,
"n_commands": 0,
"n_lines": 26,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro fuel\n induction fuel with\n | zero =>\n intro p q hp _hq\n unfold CPoly... | [
{
"name": "Raw.eval_monicNormalize_eq_zero_of_eval_eq_zero",
"text": "private theorem Raw.eval_monicNormalize_eq_zero_of_eval_eq_zero {F : Type*}\n [Field F] [BEq F] [LawfulBEq F]\n {p : CPolynomial.Raw F} {a : F} (hp : p.eval a = 0) :\n (CPolynomial.Raw.monicNormalize p).eval a = 0 := by\n unfold... | [
{
"name": "monicNormalize_root_of_root",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 10,
"n_chars": 483,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 3,
"n_structural": 1,
"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.Roots.Backend
import CompPoly.Univariate.Roots.Splitter
import CompPoly.Univariate.EuclideanAlgorithm
import CompPoly.Univariate.To... | /-
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.Backend
import CompPoly.Univariate.Roots.Splitter
import CompPoly.Univariate.EuclideanAlgorithm
import CompPoly.Univariate.To... | @@ -47,10 +47,26 @@
rw [← CPolynomial.Raw.eval_toPoly_eq_eval]
simp [CPolynomial.Raw.toPoly_C]
+private theorem Raw.eval_monicNormalize_eq_zero_of_eval_eq_zero {F : Type*}
+ [Field F] [BEq F] [LawfulBEq F]
+ {p : CPolynomial.Raw F} {a : F} (hp : p.eval a = 0) :
+ (CPolynomial.Raw.monicNormalize p).eval... | {
"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_60b7d09d8486_8 | 2c4210585130aeae | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Univariate/Roots/Correctness.lean | Correctness | 8 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 41 | 8 | [
{
"theorem_name": "Raw.eval_smul",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [← CPolynomial.Raw.eval_toPoly_eq_eval, Raw.toPoly_smul]\n rw [Polynomial.smul_eq_C_mul, Polynomial.eval_mul, Polynomial.... | [
{
"name": "Raw.eval_mul",
"text": "private theorem Raw.eval_mul {F : Type*} [Field F] [BEq F] [LawfulBEq F]\n (a : F) (p q : CPolynomial.Raw F) :\n (p * q).eval a = p.eval a * q.eval a := by\n rw [← CPolynomial.Raw.eval_toPoly_eq_eval, CPolynomial.Raw.toPoly_mul,\n Polynomial.eval_mul, CPolynomial... | [
{
"name": "gcdMonic_root_of_left_right",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 8,
"n_lines": 12,
"n_chars": 531,
"n_subproofs": 0,
"n_tactics": 6,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 4,
"n_structural": 1,
"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.Univariate.Roots.Backend
import CompPoly.Univariate.Roots.Splitter
import CompPoly.Univariate.EuclideanAlgorithm
import CompPoly.Univariate.To... | /-
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.Backend
import CompPoly.Univariate.Roots.Splitter
import CompPoly.Univariate.EuclideanAlgorithm
import CompPoly.Univariate.To... | @@ -35,6 +35,13 @@
rw [Polynomial.smul_eq_C_mul, Polynomial.eval_mul, Polynomial.eval_C,
CPolynomial.Raw.eval_toPoly_eq_eval]
+private theorem Raw.eval_mul {F : Type*} [Field F] [BEq F] [LawfulBEq F]
+ (a : F) (p q : CPolynomial.Raw F) :
+ (p * q).eval a = p.eval a * q.eval a := by
+ rw [← CPolynomial.... | {
"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_60b7d09d8486_9 | ce067fcea9ec12fe | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Univariate/Roots/Correctness.lean | Correctness | 9 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 41 | 11 | [
{
"theorem_name": "Raw.eval_gcdMonicWithFuel_eq_zero_of_left_right",
"depth": 1,
"n_commands": 0,
"n_lines": 26,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro fuel\n induction fuel with\n | zero =>\n intro p q hp _hq\n unfold CPoly... | [
{
"name": "Raw.eval_monicNormalize_eq_zero_of_eval_eq_zero",
"text": "private theorem Raw.eval_monicNormalize_eq_zero_of_eval_eq_zero {F : Type*}\n [Field F] [BEq F] [LawfulBEq F]\n {p : CPolynomial.Raw F} {a : F} (hp : p.eval a = 0) :\n (CPolynomial.Raw.monicNormalize p).eval a = 0 := by\n unfold... | [
{
"name": "monicNormalize_div_root_of_dvd_of_root_of_ne_root",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 5,
"n_lines": 13,
"n_chars": 536,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automa... | 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.Roots.Backend
import CompPoly.Univariate.Roots.Splitter
import CompPoly.Univariate.EuclideanAlgorithm
import CompPoly.Univariate.To... | /-
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.Backend
import CompPoly.Univariate.Roots.Splitter
import CompPoly.Univariate.EuclideanAlgorithm
import CompPoly.Univariate.To... | @@ -47,10 +47,26 @@
rw [← CPolynomial.Raw.eval_toPoly_eq_eval]
simp [CPolynomial.Raw.toPoly_C]
+private theorem Raw.eval_monicNormalize_eq_zero_of_eval_eq_zero {F : Type*}
+ [Field F] [BEq F] [LawfulBEq F]
+ {p : CPolynomial.Raw F} {a : F} (hp : p.eval a = 0) :
+ (CPolynomial.Raw.monicNormalize p).eval... | {
"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_60b7d09d8486_10 | 23897629a52459a3 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Univariate/Roots/Correctness.lean | Correctness | 10 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 41 | 1 | [
{
"theorem_name": "normXgcd_fst_root_of_left_right",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n exact normXgcd_root_of_left_right hp hq",
"n_chars": 45,
"n_subproofs": 0,
"n_tactics": 2,
... | [
{
"name": "normXgcd_root_of_left_right",
"text": "/-- The normalized extended gcd contains every common root. -/\ntheorem normXgcd_root_of_left_right {F : Type*} [Field F] [BEq F] [LawfulBEq F]\n {p q : CPolynomial F} {a : F}\n (hp : CPolynomial.eval a p = 0) (hq : CPolynomial.eval a q = 0) :\n CPo... | [
{
"name": "normXgcd_fst_root_of_left_right",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 10,
"n_chars": 398,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"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.Backend
import CompPoly.Univariate.Roots.Splitter
import CompPoly.Univariate.EuclideanAlgorithm
import CompPoly.Univariate.To... | /-
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.Backend
import CompPoly.Univariate.Roots.Splitter
import CompPoly.Univariate.EuclideanAlgorithm
import CompPoly.Univariate.To... | @@ -27,13 +27,28 @@
Polynomial.eval_mul, CPolynomial.Raw.eval_toPoly_eq_eval,
CPolynomial.Raw.eval_toPoly_eq_eval]
+/-- The normalized extended gcd contains every common root. -/
+theorem normXgcd_root_of_left_right {F : Type*} [Field F] [BEq F] [LawfulBEq F]
+ {p q : CPolynomial F} {a : F}
+ (hp : CP... | {
"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_60b7d09d8486_11 | 83a38d3cc027cf13 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Univariate/Roots/Correctness.lean | Correctness | 11 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 41 | 1 | [
{
"theorem_name": "mem_eraseDups",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold Array.eraseDups at h\n rcases xs with ⟨l⟩\n simp at h ⊢\n have hh := mem_eraseDups_fold a l #[] h\n simpa using hh... | [
{
"name": "mem_eraseDups_fold",
"text": "private lemma mem_eraseDups_fold {α : Type*} [BEq α] [LawfulBEq α]\n (a : α) : ∀ (xs : List α) (out : Array α),\n a ∈ List.foldl (fun out x ↦ if x ∈ out then out else out.push x) out xs →\n a ∈ out ∨ a ∈ xs := by\n intro xs\n induction xs with\n | n... | [
{
"name": "mem_rootsFromLinearFactors_eval_eq_zero",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 17,
"n_chars": 668,
"n_subproofs": 2,
"n_tactics": 11,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 1,
"n_structural": 1,
"automation_only... | 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.Roots.Backend
import CompPoly.Univariate.Roots.Splitter
import CompPoly.Univariate.EuclideanAlgorithm
import CompPoly.Univariate.To... | /-
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.Backend
import CompPoly.Univariate.Roots.Splitter
import CompPoly.Univariate.EuclideanAlgorithm
import CompPoly.Univariate.To... | @@ -20,8 +20,39 @@
namespace CPolynomial
+private lemma mem_eraseDups_fold {α : Type*} [BEq α] [LawfulBEq α]
+ (a : α) : ∀ (xs : List α) (out : Array α),
+ a ∈ List.foldl (fun out x ↦ if x ∈ out then out else out.push x) out xs →
+ a ∈ out ∨ a ∈ xs := by
+ intro xs
+ induction xs with
+ | nil =>
... | {
"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_60b7d09d8486_12 | 714e1eb9a0f8cf61 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Univariate/Roots/Correctness.lean | Correctness | 12 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 41 | 1 | [
{
"theorem_name": "mem_eraseDups_of_mem",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold Array.eraseDups\n rcases xs with ⟨l⟩\n simp at h ⊢\n exact mem_eraseDups_fold_of_mem a l #[] (Or.inr h)",
... | [
{
"name": "mem_eraseDups_fold_of_mem",
"text": "private lemma mem_eraseDups_fold_of_mem {α : Type*} [BEq α] [LawfulBEq α]\n (a : α) : ∀ (xs : List α) (out : Array α),\n a ∈ out ∨ a ∈ xs →\n a ∈ List.foldl (fun out x ↦ if x ∈ out then out else out.push x) out xs := by\n intro xs\n induction ... | [
{
"name": "mem_rootsFromLinearFactors_of_candidate",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 16,
"n_chars": 830,
"n_subproofs": 2,
"n_tactics": 9,
"cyclomatic": 1,
"n_automation": 3,
"n_rewrites": 2,
"n_structural": 1,
"automation_only"... | 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.Roots.Backend
import CompPoly.Univariate.Roots.Splitter
import CompPoly.Univariate.EuclideanAlgorithm
import CompPoly.Univariate.To... | /-
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.Backend
import CompPoly.Univariate.Roots.Splitter
import CompPoly.Univariate.EuclideanAlgorithm
import CompPoly.Univariate.To... | @@ -20,8 +20,44 @@
namespace CPolynomial
+private lemma mem_eraseDups_fold_of_mem {α : Type*} [BEq α] [LawfulBEq α]
+ (a : α) : ∀ (xs : List α) (out : Array α),
+ a ∈ out ∨ a ∈ xs →
+ a ∈ List.foldl (fun out x ↦ if x ∈ out then out else out.push x) out xs := by
+ intro xs
+ induction xs with
+ | ... | {
"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_60b7d09d8486_13 | c61559a48648a136 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Univariate/Roots/Correctness.lean | Correctness | 13 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 41 | 1 | [
{
"theorem_name": "raw_eval_powModBinaryAux_naive",
"depth": 1,
"n_commands": 0,
"n_lines": 44,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro n\n induction n using Nat.strongRecOn generalizing acc current with\n | ind n ih =>\n cases n ... | [
{
"name": "raw_eval_mulMod_naive_eq_mul",
"text": "private theorem raw_eval_mulMod_naive_eq_mul {F : Type*}\n [Field F] [BEq F] [LawfulBEq F]\n {modulus p q : CPolynomial.Raw F} {a : F}\n (hmod : modulus.eval a = 0) :\n (CPolynomial.Raw.mulModWith CPolynomial.Raw.MulContext.naive\n CPolynom... | [
{
"name": "raw_eval_powModBinaryAux_naive",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 53,
"n_chars": 2048,
"n_subproofs": 5,
"n_tactics": 44,
"cyclomatic": 3,
"n_automation": 11,
"n_rewrites": 7,
"n_structural": 3,
"automation_only": fals... | 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.Backend
import CompPoly.Univariate.Roots.Splitter
import CompPoly.Univariate.EuclideanAlgorithm
import CompPoly.Univariate.To... | /-
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.Backend
import CompPoly.Univariate.Roots.Splitter
import CompPoly.Univariate.EuclideanAlgorithm
import CompPoly.Univariate.To... | @@ -63,6 +63,24 @@
namespace FiniteField
+private theorem raw_eval_mulMod_naive_eq_mul {F : Type*}
+ [Field F] [BEq F] [LawfulBEq F]
+ {modulus p q : CPolynomial.Raw F} {a : F}
+ (hmod : modulus.eval a = 0) :
+ (CPolynomial.Raw.mulModWith CPolynomial.Raw.MulContext.naive
+ CPolynomial.Raw.ModConte... | {
"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_60b7d09d8486_14 | a5577ceee4e51bab | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Univariate/Roots/Correctness.lean | Correctness | 14 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 41 | 3 | [
{
"theorem_name": "raw_eval_powMod_naive_X",
"depth": 1,
"n_commands": 0,
"n_lines": 13,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold CPolynomial.Raw.powModWith\n by_cases hzero : modulus.trim = (#[] : CPolynomial.Raw F)\n · simp [hzero]\n... | [
{
"name": "raw_eval_one",
"text": "private theorem raw_eval_one {F : Type*} [Field F] (a : F) :\n (1 : CPolynomial.Raw F).eval a = 1 := by\n rw [← CPolynomial.Raw.eval_toPoly_eq_eval]\n simp\n\n",
"fan_in": 3,
"n_lines": 6,
"n_chars": 161,
"n_subproofs": 0,
"n_tactics": 3,
"cycl... | [
{
"name": "raw_eval_powMod_naive_X",
"fan_in": 1,
"n_deps_direct": 3,
"n_deps_transitive": 4,
"n_lines": 20,
"n_chars": 961,
"n_subproofs": 2,
"n_tactics": 13,
"cyclomatic": 1,
"n_automation": 4,
"n_rewrites": 3,
"n_structural": 0,
"automation_only": false,
"m... | 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.Roots.Backend
import CompPoly.Univariate.Roots.Splitter
import CompPoly.Univariate.EuclideanAlgorithm
import CompPoly.Univariate.To... | /-
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.Backend
import CompPoly.Univariate.Roots.Splitter
import CompPoly.Univariate.EuclideanAlgorithm
import CompPoly.Univariate.To... | @@ -133,6 +133,11 @@
omega
simp [hpow]
+private theorem raw_eval_one {F : Type*} [Field F] (a : F) :
+ (1 : CPolynomial.Raw F).eval a = 1 := by
+ rw [← CPolynomial.Raw.eval_toPoly_eq_eval]
+ simp
+
private theorem raw_eval_X {F : Type*} [Field F] (a : F) :
(CPolynomial.Raw.X : 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_60b7d09d8486_15 | 97e934bc648e1e05 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Univariate/Roots/Correctness.lean | Correctness | 15 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 41 | 4 | [
{
"theorem_name": "raw_eval_powMod_naive_X",
"depth": 1,
"n_commands": 0,
"n_lines": 13,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold CPolynomial.Raw.powModWith\n by_cases hzero : modulus.trim = (#[] : CPolynomial.Raw F)\n · simp [hzero]\n... | [
{
"name": "raw_eval_X",
"text": "private theorem raw_eval_X {F : Type*} [Field F] (a : F) :\n (CPolynomial.Raw.X : CPolynomial.Raw F).eval a = a := by\n rw [← CPolynomial.Raw.eval_toPoly_eq_eval]\n simp [CPolynomial.Raw.toPoly_X]\n\n",
"fan_in": 4,
"n_lines": 6,
"n_chars": 202,
"n_subpr... | [
{
"name": "raw_eval_xMod_naive",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 15,
"n_chars": 760,
"n_subproofs": 2,
"n_tactics": 10,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 2,
"n_structural": 0,
"automation_only": false,
"max_n... | 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.Backend
import CompPoly.Univariate.Roots.Splitter
import CompPoly.Univariate.EuclideanAlgorithm
import CompPoly.Univariate.To... | /-
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.Backend
import CompPoly.Univariate.Roots.Splitter
import CompPoly.Univariate.EuclideanAlgorithm
import CompPoly.Univariate.To... | @@ -63,14 +63,24 @@
namespace FiniteField
+private theorem raw_eval_X {F : Type*} [Field F] (a : F) :
+ (CPolynomial.Raw.X : CPolynomial.Raw F).eval a = a := by
+ rw [← CPolynomial.Raw.eval_toPoly_eq_eval]
+ simp [CPolynomial.Raw.toPoly_X]
+
private theorem raw_eval_xMod_naive {F : Type*}
[Field F] [BEq... | {
"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_60b7d09d8486_16 | 1c1ae2c4034ff297 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Univariate/Roots/Correctness.lean | Correctness | 16 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 41 | 3 | [
{
"theorem_name": "raw_eval_powMod_naive_X",
"depth": 1,
"n_commands": 0,
"n_lines": 13,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold CPolynomial.Raw.powModWith\n by_cases hzero : modulus.trim = (#[] : CPolynomial.Raw F)\n · simp [hzero]\n... | [
{
"name": "raw_eval_one",
"text": "private theorem raw_eval_one {F : Type*} [Field F] (a : F) :\n (1 : CPolynomial.Raw F).eval a = 1 := by\n rw [← CPolynomial.Raw.eval_toPoly_eq_eval]\n simp\n\n",
"fan_in": 3,
"n_lines": 6,
"n_chars": 161,
"n_subproofs": 0,
"n_tactics": 3,
"cycl... | [
{
"name": "raw_eval_xPowSubXMod_naive",
"fan_in": 1,
"n_deps_direct": 3,
"n_deps_transitive": 7,
"n_lines": 12,
"n_chars": 489,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 2,
"n_structural": 0,
"automation_only": false,
... | 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.Univariate.Roots.Backend
import CompPoly.Univariate.Roots.Splitter
import CompPoly.Univariate.EuclideanAlgorithm
import CompPoly.Univariate.To... | /-
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.Backend
import CompPoly.Univariate.Roots.Splitter
import CompPoly.Univariate.EuclideanAlgorithm
import CompPoly.Univariate.To... | @@ -133,6 +133,11 @@
omega
simp [hpow]
+private theorem raw_eval_one {F : Type*} [Field F] (a : F) :
+ (1 : CPolynomial.Raw F).eval a = 1 := by
+ rw [← CPolynomial.Raw.eval_toPoly_eq_eval]
+ simp
+
private theorem raw_eval_X {F : Type*} [Field F] (a : F) :
(CPolynomial.Raw.X : 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_60b7d09d8486_17 | 9066c38ea8f2c4db | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Univariate/Roots/Correctness.lean | Correctness | 17 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 41 | 4 | [
{
"theorem_name": "raw_eval_mulModWith_eq_mul",
"depth": 1,
"n_commands": 0,
"n_lines": 14,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold CPolynomial.Raw.mulModWith\n by_cases hzero : modulus.trim = (#[] : CPolynomial.Raw F)\n · simp [hzero... | [
{
"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_eval_mulModWith_eq_mul",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 22,
"n_chars": 1064,
"n_subproofs": 3,
"n_tactics": 14,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 4,
"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.Backend
import CompPoly.Univariate.Roots.Splitter
import CompPoly.Univariate.EuclideanAlgorithm
import CompPoly.Univariate.To... | /-
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.Backend
import CompPoly.Univariate.Roots.Splitter
import CompPoly.Univariate.EuclideanAlgorithm
import CompPoly.Univariate.To... | @@ -63,6 +63,48 @@
namespace FiniteField
+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.monicNormalize
+ let q := p.trim
+ by_cases ... | {
"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_60b7d09d8486_18 | 0c9e554718c72fb7 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Univariate/Roots/Correctness.lean | Correctness | 18 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 41 | 4 | [
{
"theorem_name": "raw_eval_mulModWith_eq_mul",
"depth": 1,
"n_commands": 0,
"n_lines": 14,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold CPolynomial.Raw.mulModWith\n by_cases hzero : modulus.trim = (#[] : CPolynomial.Raw F)\n · simp [hzero... | [
{
"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_eval_powModBinaryAuxWith",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 50,
"n_chars": 1882,
"n_subproofs": 5,
"n_tactics": 41,
"cyclomatic": 3,
"n_automation": 11,
"n_rewrites": 7,
"n_structural": 3,
"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.Roots.Backend
import CompPoly.Univariate.Roots.Splitter
import CompPoly.Univariate.EuclideanAlgorithm
import CompPoly.Univariate.To... | /-
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.Backend
import CompPoly.Univariate.Roots.Splitter
import CompPoly.Univariate.EuclideanAlgorithm
import CompPoly.Univariate.To... | @@ -63,6 +63,48 @@
namespace FiniteField
+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.monicNormalize
+ let q := p.trim
+ by_cases ... | {
"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_60b7d09d8486_19 | 7df741d212d8fa38 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Univariate/Roots/Correctness.lean | Correctness | 19 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 41 | 4 | [
{
"theorem_name": "raw_eval_powMod_naive_X",
"depth": 1,
"n_commands": 0,
"n_lines": 13,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold CPolynomial.Raw.powModWith\n by_cases hzero : modulus.trim = (#[] : CPolynomial.Raw F)\n · simp [hzero]\n... | [
{
"name": "raw_eval_X",
"text": "private theorem raw_eval_X {F : Type*} [Field F] (a : F) :\n (CPolynomial.Raw.X : CPolynomial.Raw F).eval a = a := by\n rw [← CPolynomial.Raw.eval_toPoly_eq_eval]\n simp [CPolynomial.Raw.toPoly_X]\n\n",
"fan_in": 4,
"n_lines": 6,
"n_chars": 202,
"n_subpr... | [
{
"name": "raw_eval_powModWith_X",
"fan_in": 2,
"n_deps_direct": 4,
"n_deps_transitive": 5,
"n_lines": 26,
"n_chars": 1218,
"n_subproofs": 3,
"n_tactics": 19,
"cyclomatic": 1,
"n_automation": 5,
"n_rewrites": 6,
"n_structural": 1,
"automation_only": false,
"ma... | 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.Roots.Backend
import CompPoly.Univariate.Roots.Splitter
import CompPoly.Univariate.EuclideanAlgorithm
import CompPoly.Univariate.To... | /-
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.Backend
import CompPoly.Univariate.Roots.Splitter
import CompPoly.Univariate.EuclideanAlgorithm
import CompPoly.Univariate.To... | @@ -68,6 +68,11 @@
rw [← CPolynomial.Raw.eval_toPoly_eq_eval]
simp
+private theorem raw_eval_X {F : Type*} [Field F] (a : F) :
+ (CPolynomial.Raw.X : CPolynomial.Raw F).eval a = a := by
+ rw [← CPolynomial.Raw.eval_toPoly_eq_eval]
+ simp [CPolynomial.Raw.toPoly_X]
+
private theorem raw_monicNormalize_trim... | {
"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_60b7d09d8486_20 | 786f9f6aa582b44a | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Univariate/Roots/Correctness.lean | Correctness | 20 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 41 | 3 | [
{
"theorem_name": "raw_eval_powMod_naive_X",
"depth": 1,
"n_commands": 0,
"n_lines": 13,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold CPolynomial.Raw.powModWith\n by_cases hzero : modulus.trim = (#[] : CPolynomial.Raw F)\n · simp [hzero]\n... | [
{
"name": "raw_eval_one",
"text": "private theorem raw_eval_one {F : Type*} [Field F] (a : F) :\n (1 : CPolynomial.Raw F).eval a = 1 := by\n rw [← CPolynomial.Raw.eval_toPoly_eq_eval]\n simp\n\n",
"fan_in": 3,
"n_lines": 6,
"n_chars": 161,
"n_subproofs": 0,
"n_tactics": 3,
"cycl... | [
{
"name": "raw_eval_powModWith_eq_pow",
"fan_in": 0,
"n_deps_direct": 3,
"n_deps_transitive": 4,
"n_lines": 29,
"n_chars": 1293,
"n_subproofs": 3,
"n_tactics": 19,
"cyclomatic": 1,
"n_automation": 5,
"n_rewrites": 6,
"n_structural": 1,
"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.Univariate.Roots.Backend
import CompPoly.Univariate.Roots.Splitter
import CompPoly.Univariate.EuclideanAlgorithm
import CompPoly.Univariate.To... | /-
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.Backend
import CompPoly.Univariate.Roots.Splitter
import CompPoly.Univariate.EuclideanAlgorithm
import CompPoly.Univariate.To... | @@ -63,6 +63,11 @@
namespace FiniteField
+private theorem raw_eval_one {F : Type*} [Field F] (a : F) :
+ (1 : CPolynomial.Raw F).eval a = 1 := by
+ rw [← CPolynomial.Raw.eval_toPoly_eq_eval]
+ simp
+
private theorem raw_monicNormalize_trim {F : Type*} [Field F] [BEq F] [LawfulBEq F]
(p : CPolynomial.Raw... | {
"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_60b7d09d8486_21 | 9d7b735cc9468ab9 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Univariate/Roots/Correctness.lean | Correctness | 21 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 41 | 4 | [
{
"theorem_name": "raw_eval_powMod_naive_X",
"depth": 1,
"n_commands": 0,
"n_lines": 13,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold CPolynomial.Raw.powModWith\n by_cases hzero : modulus.trim = (#[] : CPolynomial.Raw F)\n · simp [hzero]\n... | [
{
"name": "raw_eval_X",
"text": "private theorem raw_eval_X {F : Type*} [Field F] (a : F) :\n (CPolynomial.Raw.X : CPolynomial.Raw F).eval a = a := by\n rw [← CPolynomial.Raw.eval_toPoly_eq_eval]\n simp [CPolynomial.Raw.toPoly_X]\n\n",
"fan_in": 4,
"n_lines": 6,
"n_chars": 202,
"n_subpr... | [
{
"name": "raw_eval_xModWith",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 19,
"n_chars": 943,
"n_subproofs": 3,
"n_tactics": 13,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 3,
"n_structural": 1,
"automation_only": false,
"max_nes... | 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.Roots.Backend
import CompPoly.Univariate.Roots.Splitter
import CompPoly.Univariate.EuclideanAlgorithm
import CompPoly.Univariate.To... | /-
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.Backend
import CompPoly.Univariate.Roots.Splitter
import CompPoly.Univariate.EuclideanAlgorithm
import CompPoly.Univariate.To... | @@ -63,6 +63,11 @@
namespace FiniteField
+private theorem raw_eval_X {F : Type*} [Field F] (a : F) :
+ (CPolynomial.Raw.X : CPolynomial.Raw F).eval a = a := by
+ rw [← CPolynomial.Raw.eval_toPoly_eq_eval]
+ simp [CPolynomial.Raw.toPoly_X]
+
private theorem raw_monicNormalize_trim {F : Type*} [Field F] [BEq 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_60b7d09d8486_22 | 8201633eac318e95 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Univariate/Roots/Correctness.lean | Correctness | 22 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 41 | 4 | [
{
"theorem_name": "raw_eval_powMod_naive_X",
"depth": 1,
"n_commands": 0,
"n_lines": 13,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold CPolynomial.Raw.powModWith\n by_cases hzero : modulus.trim = (#[] : CPolynomial.Raw F)\n · simp [hzero]\n... | [
{
"name": "raw_eval_X",
"text": "private theorem raw_eval_X {F : Type*} [Field F] (a : F) :\n (CPolynomial.Raw.X : CPolynomial.Raw F).eval a = a := by\n rw [← CPolynomial.Raw.eval_toPoly_eq_eval]\n simp [CPolynomial.Raw.toPoly_X]\n\n",
"fan_in": 4,
"n_lines": 6,
"n_chars": 202,
"n_subpr... | [
{
"name": "raw_eval_xPowSubXModWith",
"fan_in": 1,
"n_deps_direct": 3,
"n_deps_transitive": 8,
"n_lines": 12,
"n_chars": 495,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 2,
"n_structural": 0,
"automation_only": false,
"m... | 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.Univariate.Roots.Backend
import CompPoly.Univariate.Roots.Splitter
import CompPoly.Univariate.EuclideanAlgorithm
import CompPoly.Univariate.To... | /-
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.Backend
import CompPoly.Univariate.Roots.Splitter
import CompPoly.Univariate.EuclideanAlgorithm
import CompPoly.Univariate.To... | @@ -68,6 +68,11 @@
rw [← CPolynomial.Raw.eval_toPoly_eq_eval]
simp
+private theorem raw_eval_X {F : Type*} [Field F] (a : F) :
+ (CPolynomial.Raw.X : CPolynomial.Raw F).eval a = a := by
+ rw [← CPolynomial.Raw.eval_toPoly_eq_eval]
+ simp [CPolynomial.Raw.toPoly_X]
+
private theorem raw_eval_sub {F : Type*... | {
"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_60b7d09d8486_23 | def99d754ca2270d | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Univariate/Roots/Correctness.lean | Correctness | 23 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 41 | 4 | [
{
"theorem_name": "Raw.eval_smul",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [← CPolynomial.Raw.eval_toPoly_eq_eval, Raw.toPoly_smul]\n rw [Polynomial.smul_eq_C_mul, Polynomial.eval_mul, Polynomial.... | [
{
"name": "Raw.eval_C",
"text": "private theorem Raw.eval_C {F : Type*} [Field F] (a c : F) :\n (CPolynomial.Raw.C c).eval a = c := by\n rw [← CPolynomial.Raw.eval_toPoly_eq_eval]\n simp [CPolynomial.Raw.toPoly_C]\n\n",
"fan_in": 4,
"n_lines": 6,
"n_chars": 186,
"n_subproofs": 0,
"n... | [
{
"name": "finiteFieldRootProductWith_complete",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 17,
"n_lines": 31,
"n_chars": 1401,
"n_subproofs": 2,
"n_tactics": 23,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 6,
"n_structural": 4,
"automation_only":... | 17 | /-
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.Backend
import CompPoly.Univariate.Roots.Splitter
import CompPoly.Univariate.EuclideanAlgorithm
import CompPoly.Univariate.To... | /-
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.Backend
import CompPoly.Univariate.Roots.Splitter
import CompPoly.Univariate.EuclideanAlgorithm
import CompPoly.Univariate.To... | @@ -42,9 +42,15 @@
Polynomial.eval_mul, CPolynomial.Raw.eval_toPoly_eq_eval,
CPolynomial.Raw.eval_toPoly_eq_eval]
+private theorem Raw.eval_C {F : Type*} [Field F] (a c : F) :
+ (CPolynomial.Raw.C c).eval a = c := by
+ rw [← CPolynomial.Raw.eval_toPoly_eq_eval]
+ simp [CPolynomial.Raw.toPoly_C]
+
priv... | {
"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_60b7d09d8486_25 | 5e9b69923071424a | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Univariate/Roots/Correctness.lean | Correctness | 25 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 41 | 2 | [
{
"theorem_name": "mem_rootsFromLinearFactors_eval_eq_zero",
"depth": 1,
"n_commands": 0,
"n_lines": 11,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [rootsFromLinearFactors] at h\n have h' :\n a ∈ (validateRootCandidates p\n (List.... | [
{
"name": "mem_validateRootCandidates_eval_eq_zero",
"text": "/-- Validation makes returned candidates sound for the original polynomial. -/\ntheorem mem_validateRootCandidates_eval_eq_zero {F : Type*}\n [Field F] [BEq F] [LawfulBEq F]\n {p : CPolynomial F} {candidates : Array F} {a : F}\n (h : a ∈... | [
{
"name": "finiteFieldRootProduct_validated_sound",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 10,
"n_chars": 435,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"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.Roots.Backend
import CompPoly.Univariate.Roots.Splitter
import CompPoly.Univariate.EuclideanAlgorithm
import CompPoly.Univariate.To... | /-
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.Backend
import CompPoly.Univariate.Roots.Splitter
import CompPoly.Univariate.EuclideanAlgorithm
import CompPoly.Univariate.To... | @@ -20,6 +20,16 @@
namespace CPolynomial
+/-- Validation makes returned candidates sound for the original polynomial. -/
+theorem mem_validateRootCandidates_eval_eq_zero {F : Type*}
+ [Field F] [BEq F] [LawfulBEq F]
+ {p : CPolynomial F} {candidates : Array F} {a : F}
+ (h : a ∈ (validateRootCandidates 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_60b7d09d8486_26 | 6f4194325bba4050 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Univariate/Roots/Correctness.lean | Correctness | 26 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 41 | 1 | [
{
"theorem_name": "mem_rootsFromLinearFactors_eval_eq_zero",
"depth": 1,
"n_commands": 0,
"n_lines": 11,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [rootsFromLinearFactors] at h\n have h' :\n a ∈ (validateRootCandidates p\n (List.... | [
{
"name": "mem_eraseDups",
"text": "private lemma mem_eraseDups {α : Type*} [BEq α] [LawfulBEq α]\n {xs : Array α} {a : α} (h : a ∈ xs.eraseDups) : a ∈ xs := by\n unfold Array.eraseDups at h\n rcases xs with ⟨l⟩\n simp at h ⊢\n have hh := mem_eraseDups_fold a l #[] h\n simpa using hh\n\n",
"fan_... | [
{
"name": "rootsInFiniteFieldWith_sound",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 4,
"n_lines": 18,
"n_chars": 673,
"n_subproofs": 0,
"n_tactics": 9,
"cyclomatic": 4,
"n_automation": 2,
"n_rewrites": 1,
"n_structural": 2,
"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.Univariate.Roots.Backend
import CompPoly.Univariate.Roots.Splitter
import CompPoly.Univariate.EuclideanAlgorithm
import CompPoly.Univariate.To... | /-
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.Backend
import CompPoly.Univariate.Roots.Splitter
import CompPoly.Univariate.EuclideanAlgorithm
import CompPoly.Univariate.To... | @@ -46,6 +46,14 @@
| inr hax => exact Or.inr (by simp [hax])
| inr hxs => exact Or.inr (by simp [hxs])
+private lemma mem_eraseDups {α : Type*} [BEq α] [LawfulBEq α]
+ {xs : Array α} {a : α} (h : a ∈ xs.eraseDups) : a ∈ xs := by
+ unfold Array.eraseDups at h
+ rcases xs with ⟨l⟩
+ simp at ... | {
"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_60b7d09d8486_27 | d228abfe3f605d11 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Univariate/Roots/Correctness.lean | Correctness | 27 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 41 | 1 | [
{
"theorem_name": "mem_rootsFromLinearFactors_eval_eq_zero",
"depth": 1,
"n_commands": 0,
"n_lines": 11,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [rootsFromLinearFactors] at h\n have h' :\n a ∈ (validateRootCandidates p\n (List.... | [
{
"name": "mem_eraseDups",
"text": "private lemma mem_eraseDups {α : Type*} [BEq α] [LawfulBEq α]\n {xs : Array α} {a : α} (h : a ∈ xs.eraseDups) : a ∈ xs := by\n unfold Array.eraseDups at h\n rcases xs with ⟨l⟩\n simp at h ⊢\n have hh := mem_eraseDups_fold a l #[] h\n simpa using hh\n\n",
"fan_... | [
{
"name": "rootsInFiniteField_sound",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 5,
"n_lines": 12,
"n_chars": 499,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": false,
"m... | 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.Roots.Backend
import CompPoly.Univariate.Roots.Splitter
import CompPoly.Univariate.EuclideanAlgorithm
import CompPoly.Univariate.To... | /-
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.Backend
import CompPoly.Univariate.Roots.Splitter
import CompPoly.Univariate.EuclideanAlgorithm
import CompPoly.Univariate.To... | @@ -46,6 +46,14 @@
| inr hax => exact Or.inr (by simp [hax])
| inr hxs => exact Or.inr (by simp [hxs])
+private lemma mem_eraseDups {α : Type*} [BEq α] [LawfulBEq α]
+ {xs : Array α} {a : α} (h : a ∈ xs.eraseDups) : a ∈ xs := by
+ unfold Array.eraseDups at h
+ rcases xs with ⟨l⟩
+ simp at ... | {
"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_60b7d09d8486_28 | 73407ffa426f7f81 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Univariate/Roots/Correctness.lean | Correctness | 28 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 41 | 2 | [
{
"theorem_name": "linearFactor_isRepresentedLinearFactor",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold isRepresentedLinearFactor\n have hlin := linearFactor_isLinearFactor a\n have hcoeff : ¬(CP... | [
{
"name": "linearFactor_isLinearFactor",
"text": "/-- Every explicit `X - a` factor is represented as a nonconstant linear factor. -/\ntheorem linearFactor_isLinearFactor {F : Type*} [Field F] [BEq F] [LawfulBEq F]\n (a : F) : IsLinearFactor (CPolynomial.linearFactor a) := by\n constructor\n · rw [CPol... | [
{
"name": "linearFactor_isRepresentedLinearFactor",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 11,
"n_chars": 542,
"n_subproofs": 2,
"n_tactics": 6,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 1,
"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.Univariate.Roots.Backend
import CompPoly.Univariate.Roots.Splitter
import CompPoly.Univariate.EuclideanAlgorithm
import CompPoly.Univariate.To... | /-
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.Backend
import CompPoly.Univariate.Roots.Splitter
import CompPoly.Univariate.EuclideanAlgorithm
import CompPoly.Univariate.To... | @@ -24,10 +24,38 @@
namespace FiniteField
+/-- Every explicit `X - a` factor is represented as a nonconstant linear factor. -/
+theorem linearFactor_isLinearFactor {F : Type*} [Field F] [BEq F] [LawfulBEq F]
+ (a : F) : IsLinearFactor (CPolynomial.linearFactor a) := by
+ constructor
+ · rw [CPolynomial.linear... | {
"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_60b7d09d8486_29 | 47a4fbd02c1590c4 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Univariate/Roots/Correctness.lean | Correctness | 29 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 41 | 2 | [
{
"theorem_name": "linearFactor_isRepresentedLinearFactor",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold isRepresentedLinearFactor\n have hlin := linearFactor_isLinearFactor a\n have hcoeff : ¬(CP... | [
{
"name": "linearFactor_isLinearFactor",
"text": "/-- Every explicit `X - a` factor is represented as a nonconstant linear factor. -/\ntheorem linearFactor_isLinearFactor {F : Type*} [Field F] [BEq F] [LawfulBEq F]\n (a : F) : IsLinearFactor (CPolynomial.linearFactor a) := by\n constructor\n · rw [CPol... | [
{
"name": "linearFactor_isRootFactorCandidate",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 16,
"n_chars": 771,
"n_subproofs": 2,
"n_tactics": 11,
"cyclomatic": 2,
"n_automation": 3,
"n_rewrites": 3,
"n_structural": 2,
"automation_only": fa... | 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.Backend
import CompPoly.Univariate.Roots.Splitter
import CompPoly.Univariate.EuclideanAlgorithm
import CompPoly.Univariate.To... | /-
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.Backend
import CompPoly.Univariate.Roots.Splitter
import CompPoly.Univariate.EuclideanAlgorithm
import CompPoly.Univariate.To... | @@ -24,12 +24,35 @@
namespace FiniteField
+/-- Every explicit `X - a` factor is represented as a nonconstant linear factor. -/
+theorem linearFactor_isLinearFactor {F : Type*} [Field F] [BEq F] [LawfulBEq F]
+ (a : F) : IsLinearFactor (CPolynomial.linearFactor a) := by
+ constructor
+ · rw [CPolynomial.linear... | {
"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_60b7d09d8486_30 | 31cccbee78be0fa7 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Univariate/Roots/Correctness.lean | Correctness | 30 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 41 | 4 | [
{
"theorem_name": "raw_eval_powMod_naive_X",
"depth": 1,
"n_commands": 0,
"n_lines": 13,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold CPolynomial.Raw.powModWith\n by_cases hzero : modulus.trim = (#[] : CPolynomial.Raw F)\n · simp [hzero]\n... | [
{
"name": "raw_eval_X",
"text": "private theorem raw_eval_X {F : Type*} [Field F] (a : F) :\n (CPolynomial.Raw.X : CPolynomial.Raw F).eval a = a := by\n rw [← CPolynomial.Raw.eval_toPoly_eq_eval]\n simp [CPolynomial.Raw.toPoly_X]\n\n",
"fan_in": 4,
"n_lines": 6,
"n_chars": 202,
"n_subpr... | [
{
"name": "eval_xPowModWith_eq_pow",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 6,
"n_lines": 12,
"n_chars": 584,
"n_subproofs": 0,
"n_tactics": 6,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 3,
"n_structural": 1,
"automation_only": false,
"ma... | 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.Roots.Backend
import CompPoly.Univariate.Roots.Splitter
import CompPoly.Univariate.EuclideanAlgorithm
import CompPoly.Univariate.To... | /-
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.Backend
import CompPoly.Univariate.Roots.Splitter
import CompPoly.Univariate.EuclideanAlgorithm
import CompPoly.Univariate.To... | @@ -68,6 +68,11 @@
rw [← CPolynomial.Raw.eval_toPoly_eq_eval]
simp
+private theorem raw_eval_X {F : Type*} [Field F] (a : F) :
+ (CPolynomial.Raw.X : CPolynomial.Raw F).eval a = a := by
+ rw [← CPolynomial.Raw.eval_toPoly_eq_eval]
+ simp [CPolynomial.Raw.toPoly_X]
+
private theorem raw_monicNormalize_trim... | {
"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_60b7d09d8486_31 | 1fdbd0a19ea0c7d2 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Univariate/Roots/Correctness.lean | Correctness | 31 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 41 | 4 | [
{
"theorem_name": "Raw.eval_smul",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [← CPolynomial.Raw.eval_toPoly_eq_eval, Raw.toPoly_smul]\n rw [Polynomial.smul_eq_C_mul, Polynomial.eval_mul, Polynomial.... | [
{
"name": "Raw.eval_C",
"text": "private theorem Raw.eval_C {F : Type*} [Field F] (a c : F) :\n (CPolynomial.Raw.C c).eval a = c := by\n rw [← CPolynomial.Raw.eval_toPoly_eq_eval]\n simp [CPolynomial.Raw.toPoly_C]\n\n",
"fan_in": 4,
"n_lines": 6,
"n_chars": 186,
"n_subproofs": 0,
"n... | [
{
"name": "rootsInFiniteFieldWith_complete",
"fan_in": 1,
"n_deps_direct": 4,
"n_deps_transitive": 24,
"n_lines": 43,
"n_chars": 2029,
"n_subproofs": 5,
"n_tactics": 31,
"cyclomatic": 5,
"n_automation": 4,
"n_rewrites": 1,
"n_structural": 6,
"automation_only": fal... | 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.Univariate.Roots.Backend
import CompPoly.Univariate.Roots.Splitter
import CompPoly.Univariate.EuclideanAlgorithm
import CompPoly.Univariate.To... | /-
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.Backend
import CompPoly.Univariate.Roots.Splitter
import CompPoly.Univariate.EuclideanAlgorithm
import CompPoly.Univariate.To... | @@ -81,9 +81,15 @@
Polynomial.eval_mul, CPolynomial.Raw.eval_toPoly_eq_eval,
CPolynomial.Raw.eval_toPoly_eq_eval]
+private theorem Raw.eval_C {F : Type*} [Field F] (a c : F) :
+ (CPolynomial.Raw.C c).eval a = c := by
+ rw [← CPolynomial.Raw.eval_toPoly_eq_eval]
+ simp [CPolynomial.Raw.toPoly_C]
+
priv... | {
"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_60b7d09d8486_32 | 8f39daece71d3e91 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Univariate/Roots/Correctness.lean | Correctness | 32 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 41 | 4 | [
{
"theorem_name": "Raw.eval_smul",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [← CPolynomial.Raw.eval_toPoly_eq_eval, Raw.toPoly_smul]\n rw [Polynomial.smul_eq_C_mul, Polynomial.eval_mul, Polynomial.... | [
{
"name": "Raw.eval_C",
"text": "private theorem Raw.eval_C {F : Type*} [Field F] (a c : F) :\n (CPolynomial.Raw.C c).eval a = c := by\n rw [← CPolynomial.Raw.eval_toPoly_eq_eval]\n simp [CPolynomial.Raw.toPoly_C]\n\n",
"fan_in": 4,
"n_lines": 6,
"n_chars": 186,
"n_subproofs": 0,
"n... | [
{
"name": "rootsInFiniteField_complete",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 25,
"n_lines": 17,
"n_chars": 722,
"n_subproofs": 0,
"n_tactics": 6,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 3,
"automation_only": false,
... | 25 | /-
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.Backend
import CompPoly.Univariate.Roots.Splitter
import CompPoly.Univariate.EuclideanAlgorithm
import CompPoly.Univariate.To... | /-
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.Backend
import CompPoly.Univariate.Roots.Splitter
import CompPoly.Univariate.EuclideanAlgorithm
import CompPoly.Univariate.To... | @@ -81,9 +81,15 @@
Polynomial.eval_mul, CPolynomial.Raw.eval_toPoly_eq_eval,
CPolynomial.Raw.eval_toPoly_eq_eval]
+private theorem Raw.eval_C {F : Type*} [Field F] (a c : F) :
+ (CPolynomial.Raw.C c).eval a = c := by
+ rw [← CPolynomial.Raw.eval_toPoly_eq_eval]
+ simp [CPolynomial.Raw.toPoly_C]
+
priv... | {
"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_60b7d09d8486_33 | 9eafc1f3ca4c92df | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Univariate/Roots/Correctness.lean | Correctness | 33 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 41 | 4 | [
{
"theorem_name": "Raw.eval_smul",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [← CPolynomial.Raw.eval_toPoly_eq_eval, Raw.toPoly_smul]\n rw [Polynomial.smul_eq_C_mul, Polynomial.eval_mul, Polynomial.... | [
{
"name": "Raw.eval_C",
"text": "private theorem Raw.eval_C {F : Type*} [Field F] (a c : F) :\n (CPolynomial.Raw.C c).eval a = c := by\n rw [← CPolynomial.Raw.eval_toPoly_eq_eval]\n simp [CPolynomial.Raw.toPoly_C]\n\n",
"fan_in": 4,
"n_lines": 6,
"n_chars": 186,
"n_subproofs": 0,
"n... | [
{
"name": "rootsInFiniteField_spec",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 32,
"n_lines": 18,
"n_chars": 736,
"n_subproofs": 0,
"n_tactics": 6,
"cyclomatic": 2,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 5,
"automation_only": false,
"m... | 32 | /-
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.Backend
import CompPoly.Univariate.Roots.Splitter
import CompPoly.Univariate.EuclideanAlgorithm
import CompPoly.Univariate.To... | /-
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.Backend
import CompPoly.Univariate.Roots.Splitter
import CompPoly.Univariate.EuclideanAlgorithm
import CompPoly.Univariate.To... | @@ -115,9 +115,15 @@
Polynomial.eval_mul, CPolynomial.Raw.eval_toPoly_eq_eval,
CPolynomial.Raw.eval_toPoly_eq_eval]
+private theorem Raw.eval_C {F : Type*} [Field F] (a c : F) :
+ (CPolynomial.Raw.C c).eval a = c := by
+ rw [← CPolynomial.Raw.eval_toPoly_eq_eval]
+ simp [CPolynomial.Raw.toPoly_C]
+
pr... | {
"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_5889e799fcd7_0 | dc4659d6fa626e02 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Univariate/NTT/Transform.lean | Transform | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 1 | [
{
"theorem_name": "bitRevNat_odd",
"depth": 1,
"n_commands": 0,
"n_lines": 8,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [bitRevNat_odd_or]\n have hlt : bitRevNat bits b < 2 ^ bits := bitRevNat_lt bits b\n have hand : 2 ^ bits &&& bitRevNat ... | [
{
"name": "bitRevNat_odd_or",
"text": "theorem bitRevNat_odd_or (bits b : Nat) :\n bitRevNat (bits + 1) (2 * b + 1) = (1 <<< bits) ||| bitRevNat bits b := by\n rw [bitRevNat, Nat.and_one_is_mod, Nat.shiftRight_eq_div_pow]\n have hdiv : (2 * b + 1) / 2 = b := by\n have h2 : 0 < 2 := by decide\n si... | [
{
"name": "bitRevNat_odd",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 11,
"n_chars": 463,
"n_subproofs": 2,
"n_tactics": 8,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 2,
"n_structural": 1,
"automation_only": false,
"max_nesting"... | 2 | /-
Copyright (c) 2026 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Salih Erdem Koçak, Doran Pamukçu
-/
import CompPoly.Univariate.NTT.Domain
import CompPoly.Data.Nat.Bitwise
/-!
# Shared radix-2 NTT transform
This file provides the root-parametric bit-rev... | /-
Copyright (c) 2026 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Salih Erdem Koçak, Doran Pamukçu
-/
import CompPoly.Univariate.NTT.Domain
import CompPoly.Data.Nat.Bitwise
/-!
# Shared radix-2 NTT transform
This file provides the root-parametric bit-rev... | @@ -43,8 +43,25 @@
· rw [Nat.and_one_is_mod]
exact Nat.mod_lt _ (by decide : 0 < 2)
+theorem bitRevNat_odd_or (bits b : Nat) :
+ bitRevNat (bits + 1) (2 * b + 1) = (1 <<< bits) ||| bitRevNat bits b := by
+ rw [bitRevNat, Nat.and_one_is_mod, Nat.shiftRight_eq_div_pow]
+ have hdiv : (2 * b + 1) / 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_5889e799fcd7_1 | 6d70dc245a7699b3 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Univariate/NTT/Transform.lean | Transform | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 1 | [
{
"theorem_name": "butterflyStage_eq_butterflyStageSpec",
"depth": 1,
"n_commands": 0,
"n_lines": 42,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n let blockSize : Nat := 2 ^ (stage + 1)\n let half : Nat := 2 ^ stage\n let wm := D.omega ^ (D.n / b... | [
{
"name": "foldl_range_eq_rec_fst",
"text": "private theorem foldl_range_eq_rec_fst {α β : Type*}\n (f : Nat → α × β → α × β) (x : α × β) (n : Nat) :\n (List.foldl (fun acc i => f i acc) x (List.range n)).1 =\n (Nat.rec (motive := fun _ => α × β) x (fun i acc => f i acc) n).1 := by\n simpa using... | [
{
"name": "butterflyStage_eq_butterflyStageSpec",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 52,
"n_chars": 1886,
"n_subproofs": 2,
"n_tactics": 42,
"cyclomatic": 1,
"n_automation": 3,
"n_rewrites": 1,
"n_structural": 3,
"automation_only":... | 1 | /-
Copyright (c) 2026 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Salih Erdem Koçak, Doran Pamukçu
-/
import CompPoly.Univariate.NTT.Domain
import CompPoly.Data.Nat.Bitwise
/-!
# Shared radix-2 NTT transform
This file provides the root-parametric bit-rev... | /-
Copyright (c) 2026 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Salih Erdem Koçak, Doran Pamukçu
-/
import CompPoly.Univariate.NTT.Domain
import CompPoly.Data.Nat.Bitwise
/-!
# Shared radix-2 NTT transform
This file provides the root-parametric bit-rev... | @@ -27,6 +27,15 @@
| n + 1 => by
simp [List.range_succ, List.foldl_append, foldl_range_eq_rec f x n]
+private theorem foldl_range_eq_rec_fst {α β : Type*}
+ (f : Nat → α × β → α × β) (x : α × β) (n : Nat) :
+ (List.foldl (fun acc i => f i acc) x (List.range n)).1 =
+ (Nat.rec (motive := 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_5889e799fcd7_2 | 754c5f85d729d02d | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Univariate/NTT/Transform.lean | Transform | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 1 | [
{
"theorem_name": "size_butterflyStage",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [butterflyStage_eq_butterflyStageSpec D stage a]\n exact size_butterflyStageSpec D stage a",
"n_chars": 99,
... | [
{
"name": "size_butterflyStageSpec",
"text": "theorem size_butterflyStageSpec (D : Domain R) (stage : Nat) (a : Array R) :\n (butterflyStageSpec D stage a).size = a.size := by\n simp [butterflyStageSpec, size_butterflyStageSpec_aux]\n\n",
"fan_in": 1,
"n_lines": 5,
"n_chars": 190,
"n_sub... | [
{
"name": "size_butterflyStage",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 6,
"n_chars": 221,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false,
"max_nes... | 3 | /-
Copyright (c) 2026 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Salih Erdem Koçak, Doran Pamukçu
-/
import CompPoly.Univariate.NTT.Domain
import CompPoly.Data.Nat.Bitwise
/-!
# Shared radix-2 NTT transform
This file provides the root-parametric bit-rev... | /-
Copyright (c) 2026 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Salih Erdem Koçak, Doran Pamukçu
-/
import CompPoly.Univariate.NTT.Domain
import CompPoly.Data.Nat.Bitwise
/-!
# Shared radix-2 NTT transform
This file provides the root-parametric bit-rev... | @@ -173,8 +173,14 @@
| n + 1, acc => by
simp [size_butterflyStageSpec_aux blockSize half wm n acc]
+theorem size_butterflyStageSpec (D : Domain R) (stage : Nat) (a : Array R) :
+ (butterflyStageSpec D stage a).size = a.size := by
+ simp [butterflyStageSpec, size_butterflyStageSpec_aux]
+
theorem size_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_a5b299e82abe_0 | 591297b605d873c0 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Univariate/NTTFast/Correctness/Basic.lean | Basic | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 1 | [
{
"theorem_name": "butterflyDITInner_eq_butterflyBlockStep",
"depth": 1,
"n_commands": 0,
"n_lines": 10,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n change butterflyDITInner twiddles half 0 (block * blockSize + 0)\n (block * blockSize + 0 + h... | [
{
"name": "foldl_range_eq_rec_fst",
"text": "/-- First projections of pair-valued folds over `List.range` match natural recursion. -/\ntheorem foldl_range_eq_rec_fst {α β : Type*}\n (f : Nat → α × β → α × β) (x : α × β) (n : Nat) :\n (List.foldl (fun acc i ↦ f i acc) x (List.range n)).1 =\n (Nat.... | [
{
"name": "butterflyDITInner_eq_butterflyBlockStep",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 16,
"n_chars": 876,
"n_subproofs": 0,
"n_tactics": 10,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 2,
"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.Univariate.NTT.FastMul
import CompPoly.Univariate.NTTFast.FastMul
/-!
# Basic NTTFast correctness facts
Cached-plan well-formedness, twiddle-... | /-
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.NTT.FastMul
import CompPoly.Univariate.NTTFast.FastMul
/-!
# Basic NTTFast correctness facts
Cached-plan well-formedness, twiddle-... | @@ -77,6 +77,16 @@
| n + 1 => by
simp [List.range_succ, List.foldl_append, foldl_range_eq_rec f x n]
+/-- First projections of pair-valued folds over `List.range` match natural recursion. -/
+theorem foldl_range_eq_rec_fst {α β : Type*}
+ (f : Nat → α × β → α × β) (x : α × β) (n : Nat) :
+ (List.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_942d477320e8_0 | 81d9ba6e23dea2c9 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Univariate/EuclideanAlgorithm.lean | EuclideanAlgorithm | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 16 | 1 | [
{
"theorem_name": "xgcd_bezout",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold xgcd\n apply xgcdAux_bezout p q threshold p.val.size\n all_goals (simp only [Bezout]; ring)",
"n_chars": 104,
... | [
{
"name": "xgcdAux_bezout",
"text": "/-- `xgcdAux` preserves the Bezout identity. -/\ntheorem xgcdAux_bezout [Field R] [BEq R] [LawfulBEq R]\n (p q : CPolynomial R) (threshold n : ℕ)\n {r r' : CPolynomial R} {s t s' t'}\n (h : Bezout p q (r, s, t)) (h' : Bezout p q (r', s', t')) :\n Bezout p q (... | [
{
"name": "xgcd_bezout",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 14,
"n_chars": 409,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false,
"max_nesting": ... | 1 | /-
Copyright (c) 2026 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Juan Conejero, Valerii Huhnin
-/
import CompPoly.Univariate.Basic
import CompPoly.Univariate.DivisionCorrectness
import CompPoly.ToMathlib.Order.WithBot
/-!
# Extended Euclidean Algorithm f... | /-
Copyright (c) 2026 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Juan Conejero, Valerii Huhnin
-/
import CompPoly.Univariate.Basic
import CompPoly.Univariate.DivisionCorrectness
import CompPoly.ToMathlib.Order.WithBot
/-!
# Extended Euclidean Algorithm f... | @@ -70,10 +70,26 @@
CPolynomial R × CPolynomial R × CPolynomial R → Prop
| (r, s, t) => r = s * p + t * q
+/-- `xgcdAux` preserves the Bezout identity. -/
+theorem xgcdAux_bezout [Field R] [BEq R] [LawfulBEq R]
+ (p q : CPolynomial R) (threshold n : ℕ)
+ {r r' : CPolynomial R} {s t s' t'}
+ (h : Bezo... | {
"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_942d477320e8_1 | b15d8f0c4aca94ca | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Univariate/EuclideanAlgorithm.lean | EuclideanAlgorithm | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 16 | 4 | [
{
"theorem_name": "xgcdAux_toPoly_eq_gcd",
"depth": 1,
"n_commands": 0,
"n_lines": 14,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction n generalizing r r' s t s' t' with\n | zero =>\n have hr : r = 0 := (toPoly_eq_zero_iff r).mp\n (... | [
{
"name": "toPoly_sub_div_mul",
"text": "private lemma toPoly_sub_div_mul [Field R] [BEq R] [LawfulBEq R]\n (r r' a b : CPolynomial R) :\n (a - (r' / r) * b).toPoly = a.toPoly - (r'.toPoly / r.toPoly) * b.toPoly := by\n rw [show r' / r = r'.div r from rfl, toPoly_sub, toPoly_mul, div_toPoly_eq_div]\n... | [
{
"name": "xgcdAux_toPoly_eq_gcd",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 23,
"n_chars": 1083,
"n_subproofs": 2,
"n_tactics": 16,
"cyclomatic": 3,
"n_automation": 2,
"n_rewrites": 5,
"n_structural": 2,
"automation_only": false,
"ma... | 1 | /-
Copyright (c) 2026 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Juan Conejero, Valerii Huhnin
-/
import CompPoly.Univariate.Basic
import CompPoly.Univariate.DivisionCorrectness
import CompPoly.ToMathlib.Order.WithBot
/-!
# Extended Euclidean Algorithm f... | /-
Copyright (c) 2026 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Juan Conejero, Valerii Huhnin
-/
import CompPoly.Univariate.Basic
import CompPoly.Univariate.DivisionCorrectness
import CompPoly.ToMathlib.Order.WithBot
/-!
# Extended Euclidean Algorithm f... | @@ -70,6 +70,11 @@
CPolynomial R × CPolynomial R × CPolynomial R → Prop
| (r, s, t) => r = s * p + t * q
+private lemma toPoly_sub_div_mul [Field R] [BEq R] [LawfulBEq R]
+ (r r' a b : CPolynomial R) :
+ (a - (r' / r) * b).toPoly = a.toPoly - (r'.toPoly / r.toPoly) * b.toPoly := by
+ rw [show r' / 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_942d477320e8_2 | badbf54f6a9cd403 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Univariate/EuclideanAlgorithm.lean | EuclideanAlgorithm | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 16 | 4 | [
{
"theorem_name": "xgcdAux_toPoly_eq_gcd",
"depth": 1,
"n_commands": 0,
"n_lines": 14,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction n generalizing r r' s t s' t' with\n | zero =>\n have hr : r = 0 := (toPoly_eq_zero_iff r).mp\n (... | [
{
"name": "toPoly_sub_div_mul",
"text": "private lemma toPoly_sub_div_mul [Field R] [BEq R] [LawfulBEq R]\n (r r' a b : CPolynomial R) :\n (a - (r' / r) * b).toPoly = a.toPoly - (r'.toPoly / r.toPoly) * b.toPoly := by\n rw [show r' / r = r'.div r from rfl, toPoly_sub, toPoly_mul, div_toPoly_eq_div]\n... | [
{
"name": "xgcd_toPoly_eq_gcd",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 8,
"n_chars": 391,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 2,
"n_structural": 2,
"automation_only": false,
"max_nest... | 2 | /-
Copyright (c) 2026 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Juan Conejero, Valerii Huhnin
-/
import CompPoly.Univariate.Basic
import CompPoly.Univariate.DivisionCorrectness
import CompPoly.ToMathlib.Order.WithBot
/-!
# Extended Euclidean Algorithm f... | /-
Copyright (c) 2026 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Juan Conejero, Valerii Huhnin
-/
import CompPoly.Univariate.Basic
import CompPoly.Univariate.DivisionCorrectness
import CompPoly.ToMathlib.Order.WithBot
/-!
# Extended Euclidean Algorithm f... | @@ -70,6 +70,11 @@
CPolynomial R × CPolynomial R × CPolynomial R → Prop
| (r, s, t) => r = s * p + t * q
+private lemma toPoly_sub_div_mul [Field R] [BEq R] [LawfulBEq R]
+ (r r' a b : CPolynomial R) :
+ (a - (r' / r) * b).toPoly = a.toPoly - (r'.toPoly / r.toPoly) * b.toPoly := by
+ rw [show r' / 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_942d477320e8_3 | 5b7d9e91ec48f1eb | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Univariate/EuclideanAlgorithm.lean | EuclideanAlgorithm | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 16 | 4 | [
{
"theorem_name": "xgcdAux_toPoly_eq_gcd",
"depth": 1,
"n_commands": 0,
"n_lines": 14,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction n generalizing r r' s t s' t' with\n | zero =>\n have hr : r = 0 := (toPoly_eq_zero_iff r).mp\n (... | [
{
"name": "toPoly_sub_div_mul",
"text": "private lemma toPoly_sub_div_mul [Field R] [BEq R] [LawfulBEq R]\n (r r' a b : CPolynomial R) :\n (a - (r' / r) * b).toPoly = a.toPoly - (r'.toPoly / r.toPoly) * b.toPoly := by\n rw [show r' / r = r'.div r from rfl, toPoly_sub, toPoly_mul, div_toPoly_eq_div]\n... | [
{
"name": "xgcdAux_toPoly_eq_xgcdAux",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 27,
"n_chars": 1217,
"n_subproofs": 2,
"n_tactics": 19,
"cyclomatic": 5,
"n_automation": 4,
"n_rewrites": 7,
"n_structural": 2,
"automation_only": false,
... | 1 | /-
Copyright (c) 2026 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Juan Conejero, Valerii Huhnin
-/
import CompPoly.Univariate.Basic
import CompPoly.Univariate.DivisionCorrectness
import CompPoly.ToMathlib.Order.WithBot
/-!
# Extended Euclidean Algorithm f... | /-
Copyright (c) 2026 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Juan Conejero, Valerii Huhnin
-/
import CompPoly.Univariate.Basic
import CompPoly.Univariate.DivisionCorrectness
import CompPoly.ToMathlib.Order.WithBot
/-!
# Extended Euclidean Algorithm f... | @@ -70,6 +70,11 @@
CPolynomial R × CPolynomial R × CPolynomial R → Prop
| (r, s, t) => r = s * p + t * q
+private lemma toPoly_sub_div_mul [Field R] [BEq R] [LawfulBEq R]
+ (r r' a b : CPolynomial R) :
+ (a - (r' / r) * b).toPoly = a.toPoly - (r'.toPoly / r.toPoly) * b.toPoly := by
+ rw [show r' / 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_942d477320e8_4 | ef4aff3bab0c03ba | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Univariate/EuclideanAlgorithm.lean | EuclideanAlgorithm | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 16 | 4 | [
{
"theorem_name": "xgcdAux_toPoly_eq_gcd",
"depth": 1,
"n_commands": 0,
"n_lines": 14,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction n generalizing r r' s t s' t' with\n | zero =>\n have hr : r = 0 := (toPoly_eq_zero_iff r).mp\n (... | [
{
"name": "toPoly_sub_div_mul",
"text": "private lemma toPoly_sub_div_mul [Field R] [BEq R] [LawfulBEq R]\n (r r' a b : CPolynomial R) :\n (a - (r' / r) * b).toPoly = a.toPoly - (r'.toPoly / r.toPoly) * b.toPoly := by\n rw [show r' / r = r'.div r from rfl, toPoly_sub, toPoly_mul, div_toPoly_eq_div]\n... | [
{
"name": "xgcd_toPoly_eq_xgcd",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 16,
"n_chars": 569,
"n_subproofs": 1,
"n_tactics": 7,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 3,
"n_structural": 2,
"automation_only": false,
"max_ne... | 2 | /-
Copyright (c) 2026 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Juan Conejero, Valerii Huhnin
-/
import CompPoly.Univariate.Basic
import CompPoly.Univariate.DivisionCorrectness
import CompPoly.ToMathlib.Order.WithBot
/-!
# Extended Euclidean Algorithm f... | /-
Copyright (c) 2026 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Juan Conejero, Valerii Huhnin
-/
import CompPoly.Univariate.Basic
import CompPoly.Univariate.DivisionCorrectness
import CompPoly.ToMathlib.Order.WithBot
/-!
# Extended Euclidean Algorithm f... | @@ -70,6 +70,11 @@
CPolynomial R × CPolynomial R × CPolynomial R → Prop
| (r, s, t) => r = s * p + t * q
+private lemma toPoly_sub_div_mul [Field R] [BEq R] [LawfulBEq R]
+ (r r' a b : CPolynomial R) :
+ (a - (r' / r) * b).toPoly = a.toPoly - (r'.toPoly / r.toPoly) * b.toPoly := by
+ rw [show r' / 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_942d477320e8_5 | da87cab3a8183006 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Univariate/EuclideanAlgorithm.lean | EuclideanAlgorithm | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 16 | 1 | [
{
"theorem_name": "xgcd_bezout",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold xgcd\n apply xgcdAux_bezout p q threshold p.val.size\n all_goals (simp only [Bezout]; ring)",
"n_chars": 104,
... | [
{
"name": "xgcdAux_bezout",
"text": "/-- `xgcdAux` preserves the Bezout identity. -/\ntheorem xgcdAux_bezout [Field R] [BEq R] [LawfulBEq R]\n (p q : CPolynomial R) (threshold n : ℕ)\n {r r' : CPolynomial R} {s t s' t'}\n (h : Bezout p q (r, s, t)) (h' : Bezout p q (r', s', t')) :\n Bezout p q (... | [
{
"name": "normXgcd_bezout",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 19,
"n_chars": 871,
"n_subproofs": 1,
"n_tactics": 14,
"cyclomatic": 1,
"n_automation": 3,
"n_rewrites": 3,
"n_structural": 1,
"automation_only": false,
"max_nesti... | 2 | /-
Copyright (c) 2026 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Juan Conejero, Valerii Huhnin
-/
import CompPoly.Univariate.Basic
import CompPoly.Univariate.DivisionCorrectness
import CompPoly.ToMathlib.Order.WithBot
/-!
# Extended Euclidean Algorithm f... | /-
Copyright (c) 2026 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Juan Conejero, Valerii Huhnin
-/
import CompPoly.Univariate.Basic
import CompPoly.Univariate.DivisionCorrectness
import CompPoly.ToMathlib.Order.WithBot
/-!
# Extended Euclidean Algorithm f... | @@ -70,10 +70,26 @@
CPolynomial R × CPolynomial R × CPolynomial R → Prop
| (r, s, t) => r = s * p + t * q
+/-- `xgcdAux` preserves the Bezout identity. -/
+theorem xgcdAux_bezout [Field R] [BEq R] [LawfulBEq R]
+ (p q : CPolynomial R) (threshold n : ℕ)
+ {r r' : CPolynomial R} {s t s' t'}
+ (h : Bezo... | {
"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_942d477320e8_6 | d5623dd5cbf561c0 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Univariate/EuclideanAlgorithm.lean | EuclideanAlgorithm | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 16 | 4 | [
{
"theorem_name": "xgcdAux_toPoly_eq_gcd",
"depth": 1,
"n_commands": 0,
"n_lines": 14,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction n generalizing r r' s t s' t' with\n | zero =>\n have hr : r = 0 := (toPoly_eq_zero_iff r).mp\n (... | [
{
"name": "toPoly_sub_div_mul",
"text": "private lemma toPoly_sub_div_mul [Field R] [BEq R] [LawfulBEq R]\n (r r' a b : CPolynomial R) :\n (a - (r' / r) * b).toPoly = a.toPoly - (r'.toPoly / r.toPoly) * b.toPoly := by\n rw [show r' / r = r'.div r from rfl, toPoly_sub, toPoly_mul, div_toPoly_eq_div]\n... | [
{
"name": "normXgcd_fst_toPoly",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 13,
"n_chars": 566,
"n_subproofs": 0,
"n_tactics": 7,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
"max_ne... | 3 | /-
Copyright (c) 2026 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Juan Conejero, Valerii Huhnin
-/
import CompPoly.Univariate.Basic
import CompPoly.Univariate.DivisionCorrectness
import CompPoly.ToMathlib.Order.WithBot
/-!
# Extended Euclidean Algorithm f... | /-
Copyright (c) 2026 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Juan Conejero, Valerii Huhnin
-/
import CompPoly.Univariate.Basic
import CompPoly.Univariate.DivisionCorrectness
import CompPoly.ToMathlib.Order.WithBot
/-!
# Extended Euclidean Algorithm f... | @@ -70,6 +70,11 @@
CPolynomial R × CPolynomial R × CPolynomial R → Prop
| (r, s, t) => r = s * p + t * q
+private lemma toPoly_sub_div_mul [Field R] [BEq R] [LawfulBEq R]
+ (r r' a b : CPolynomial R) :
+ (a - (r' / r) * b).toPoly = a.toPoly - (r'.toPoly / r.toPoly) * b.toPoly := by
+ rw [show r' / 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_942d477320e8_7 | 341173bcf6ba1b15 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Univariate/EuclideanAlgorithm.lean | EuclideanAlgorithm | 7 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 16 | 4 | [
{
"theorem_name": "normXgcd_bezout",
"depth": 1,
"n_commands": 0,
"n_lines": 14,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold normXgcd\n have h := xgcd_bezout p q threshold\n simp only [Bezout] at h ⊢\n rw [h]\n apply toPolyLinearEquiv.i... | [
{
"name": "Raw.toPoly_smul",
"text": "private theorem Raw.toPoly_smul [Semiring R] [BEq R] [LawfulBEq R]\n (c : R) (p : CPolynomial.Raw R) :\n (c • p).toPoly = c • p.toPoly := by\n ext i\n rw [Polynomial.coeff_smul]\n rw [CPolynomial.Raw.coeff_toPoly, CPolynomial.Raw.coeff_toPoly]\n exact CPolynom... | [
{
"name": "monicNormalize_toPoly_eq_normalize",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 27,
"n_chars": 1268,
"n_subproofs": 4,
"n_tactics": 22,
"cyclomatic": 1,
"n_automation": 3,
"n_rewrites": 10,
"n_structural": 2,
"automation_only": ... | 1 | /-
Copyright (c) 2026 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Juan Conejero, Valerii Huhnin
-/
import CompPoly.Univariate.Basic
import CompPoly.Univariate.DivisionCorrectness
import CompPoly.ToMathlib.Order.WithBot
/-!
# Extended Euclidean Algorithm f... | /-
Copyright (c) 2026 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Juan Conejero, Valerii Huhnin
-/
import CompPoly.Univariate.Basic
import CompPoly.Univariate.DivisionCorrectness
import CompPoly.ToMathlib.Order.WithBot
/-!
# Extended Euclidean Algorithm f... | @@ -79,6 +79,14 @@
let c := res.1.leadingCoeff⁻¹
(c • res.1, c • res.2.1, c • res.2.2)
+private theorem Raw.toPoly_smul [Semiring R] [BEq R] [LawfulBEq R]
+ (c : R) (p : CPolynomial.Raw R) :
+ (c • p).toPoly = c • p.toPoly := by
+ ext i
+ rw [Polynomial.coeff_smul]
+ rw [CPolynomial.Raw.coeff_toPoly, 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_942d477320e8_8 | c22d46d71daba93c | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Univariate/EuclideanAlgorithm.lean | EuclideanAlgorithm | 8 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 16 | 4 | [
{
"theorem_name": "normXgcd_bezout",
"depth": 1,
"n_commands": 0,
"n_lines": 14,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold normXgcd\n have h := xgcd_bezout p q threshold\n simp only [Bezout] at h ⊢\n rw [h]\n apply toPolyLinearEquiv.i... | [
{
"name": "Raw.toPoly_smul",
"text": "private theorem Raw.toPoly_smul [Semiring R] [BEq R] [LawfulBEq R]\n (c : R) (p : CPolynomial.Raw R) :\n (c • p).toPoly = c • p.toPoly := by\n ext i\n rw [Polynomial.coeff_smul]\n rw [CPolynomial.Raw.coeff_toPoly, CPolynomial.Raw.coeff_toPoly]\n exact CPolynom... | [
{
"name": "gcdMonicWithFuel_toPoly_eq_normalize_gcd",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 66,
"n_chars": 3573,
"n_subproofs": 8,
"n_tactics": 59,
"cyclomatic": 2,
"n_automation": 3,
"n_rewrites": 14,
"n_structural": 14,
"automation_... | 2 | /-
Copyright (c) 2026 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Juan Conejero, Valerii Huhnin
-/
import CompPoly.Univariate.Basic
import CompPoly.Univariate.DivisionCorrectness
import CompPoly.ToMathlib.Order.WithBot
/-!
# Extended Euclidean Algorithm f... | /-
Copyright (c) 2026 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Juan Conejero, Valerii Huhnin
-/
import CompPoly.Univariate.Basic
import CompPoly.Univariate.DivisionCorrectness
import CompPoly.ToMathlib.Order.WithBot
/-!
# Extended Euclidean Algorithm f... | @@ -79,6 +79,14 @@
let c := res.1.leadingCoeff⁻¹
(c • res.1, c • res.2.1, c • res.2.2)
+private theorem Raw.toPoly_smul [Semiring R] [BEq R] [LawfulBEq R]
+ (c : R) (p : CPolynomial.Raw R) :
+ (c • p).toPoly = c • p.toPoly := by
+ ext i
+ rw [Polynomial.coeff_smul]
+ rw [CPolynomial.Raw.coeff_toPoly, 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_942d477320e8_9 | e87abb69deba4037 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Univariate/EuclideanAlgorithm.lean | EuclideanAlgorithm | 9 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 16 | 4 | [
{
"theorem_name": "normXgcd_bezout",
"depth": 1,
"n_commands": 0,
"n_lines": 14,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold normXgcd\n have h := xgcd_bezout p q threshold\n simp only [Bezout] at h ⊢\n rw [h]\n apply toPolyLinearEquiv.i... | [
{
"name": "Raw.toPoly_smul",
"text": "private theorem Raw.toPoly_smul [Semiring R] [BEq R] [LawfulBEq R]\n (c : R) (p : CPolynomial.Raw R) :\n (c • p).toPoly = c • p.toPoly := by\n ext i\n rw [Polynomial.coeff_smul]\n rw [CPolynomial.Raw.coeff_toPoly, CPolynomial.Raw.coeff_toPoly]\n exact CPolynom... | [
{
"name": "gcdMonic_toPoly_eq_normalize_gcd",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 22,
"n_chars": 950,
"n_subproofs": 3,
"n_tactics": 14,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 2,
"n_structural": 3,
"automation_only": fals... | 3 | /-
Copyright (c) 2026 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Juan Conejero, Valerii Huhnin
-/
import CompPoly.Univariate.Basic
import CompPoly.Univariate.DivisionCorrectness
import CompPoly.ToMathlib.Order.WithBot
/-!
# Extended Euclidean Algorithm f... | /-
Copyright (c) 2026 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Juan Conejero, Valerii Huhnin
-/
import CompPoly.Univariate.Basic
import CompPoly.Univariate.DivisionCorrectness
import CompPoly.ToMathlib.Order.WithBot
/-!
# Extended Euclidean Algorithm f... | @@ -79,6 +79,14 @@
let c := res.1.leadingCoeff⁻¹
(c • res.1, c • res.2.1, c • res.2.2)
+private theorem Raw.toPoly_smul [Semiring R] [BEq R] [LawfulBEq R]
+ (c : R) (p : CPolynomial.Raw R) :
+ (c • p).toPoly = c • p.toPoly := by
+ ext i
+ rw [Polynomial.coeff_smul]
+ rw [CPolynomial.Raw.coeff_toPoly, 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_942d477320e8_10 | dff54e0ae051de21 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Univariate/EuclideanAlgorithm.lean | EuclideanAlgorithm | 10 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 16 | 4 | [
{
"theorem_name": "xgcdAux_toPoly_eq_gcd",
"depth": 1,
"n_commands": 0,
"n_lines": 14,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction n generalizing r r' s t s' t' with\n | zero =>\n have hr : r = 0 := (toPoly_eq_zero_iff r).mp\n (... | [
{
"name": "toPoly_sub_div_mul",
"text": "private lemma toPoly_sub_div_mul [Field R] [BEq R] [LawfulBEq R]\n (r r' a b : CPolynomial R) :\n (a - (r' / r) * b).toPoly = a.toPoly - (r'.toPoly / r.toPoly) * b.toPoly := by\n rw [show r' / r = r'.div r from rfl, toPoly_sub, toPoly_mul, div_toPoly_eq_div]\n... | [
{
"name": "gcdMonic_eq_normXgcd_fst",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 8,
"n_lines": 11,
"n_chars": 449,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 2,
"n_structural": 1,
"automation_only": false,
"m... | 8 | /-
Copyright (c) 2026 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Juan Conejero, Valerii Huhnin
-/
import CompPoly.Univariate.Basic
import CompPoly.Univariate.DivisionCorrectness
import CompPoly.ToMathlib.Order.WithBot
/-!
# Extended Euclidean Algorithm f... | /-
Copyright (c) 2026 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Juan Conejero, Valerii Huhnin
-/
import CompPoly.Univariate.Basic
import CompPoly.Univariate.DivisionCorrectness
import CompPoly.ToMathlib.Order.WithBot
/-!
# Extended Euclidean Algorithm f... | @@ -70,6 +70,11 @@
CPolynomial R × CPolynomial R × CPolynomial R → Prop
| (r, s, t) => r = s * p + t * q
+private lemma toPoly_sub_div_mul [Field R] [BEq R] [LawfulBEq R]
+ (r r' a b : CPolynomial R) :
+ (a - (r' / r) * b).toPoly = a.toPoly - (r'.toPoly / r.toPoly) * b.toPoly := by
+ rw [show r' / 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_942d477320e8_11 | 67d82e42de4eda28 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Univariate/EuclideanAlgorithm.lean | EuclideanAlgorithm | 11 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 16 | 4 | [
{
"theorem_name": "xgcdAux_toPoly_eq_gcd",
"depth": 1,
"n_commands": 0,
"n_lines": 14,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction n generalizing r r' s t s' t' with\n | zero =>\n have hr : r = 0 := (toPoly_eq_zero_iff r).mp\n (... | [
{
"name": "toPoly_sub_div_mul",
"text": "private lemma toPoly_sub_div_mul [Field R] [BEq R] [LawfulBEq R]\n (r r' a b : CPolynomial R) :\n (a - (r' / r) * b).toPoly = a.toPoly - (r'.toPoly / r.toPoly) * b.toPoly := by\n rw [show r' / r = r'.div r from rfl, toPoly_sub, toPoly_mul, div_toPoly_eq_div]\n... | [
{
"name": "normXgcd_snd_toPoly",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 5,
"n_lines": 14,
"n_chars": 628,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 2,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false,
"max_ne... | 5 | /-
Copyright (c) 2026 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Juan Conejero, Valerii Huhnin
-/
import CompPoly.Univariate.Basic
import CompPoly.Univariate.DivisionCorrectness
import CompPoly.ToMathlib.Order.WithBot
/-!
# Extended Euclidean Algorithm f... | /-
Copyright (c) 2026 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Juan Conejero, Valerii Huhnin
-/
import CompPoly.Univariate.Basic
import CompPoly.Univariate.DivisionCorrectness
import CompPoly.ToMathlib.Order.WithBot
/-!
# Extended Euclidean Algorithm f... | @@ -70,6 +70,11 @@
CPolynomial R × CPolynomial R × CPolynomial R → Prop
| (r, s, t) => r = s * p + t * q
+private lemma toPoly_sub_div_mul [Field R] [BEq R] [LawfulBEq R]
+ (r r' a b : CPolynomial R) :
+ (a - (r' / r) * b).toPoly = a.toPoly - (r'.toPoly / r.toPoly) * b.toPoly := by
+ rw [show r' / 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_942d477320e8_12 | 81f6a3427e61cc8f | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Univariate/EuclideanAlgorithm.lean | EuclideanAlgorithm | 12 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 16 | 4 | [
{
"theorem_name": "xgcdAux_toPoly_eq_gcd",
"depth": 1,
"n_commands": 0,
"n_lines": 14,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction n generalizing r r' s t s' t' with\n | zero =>\n have hr : r = 0 := (toPoly_eq_zero_iff r).mp\n (... | [
{
"name": "toPoly_sub_div_mul",
"text": "private lemma toPoly_sub_div_mul [Field R] [BEq R] [LawfulBEq R]\n (r r' a b : CPolynomial R) :\n (a - (r' / r) * b).toPoly = a.toPoly - (r'.toPoly / r.toPoly) * b.toPoly := by\n rw [show r' / r = r'.div r from rfl, toPoly_sub, toPoly_mul, div_toPoly_eq_div]\n... | [
{
"name": "normXgcd_fst_comm",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 4,
"n_lines": 14,
"n_chars": 517,
"n_subproofs": 0,
"n_tactics": 9,
"cyclomatic": 2,
"n_automation": 0,
"n_rewrites": 2,
"n_structural": 3,
"automation_only": false,
"max_nest... | 4 | /-
Copyright (c) 2026 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Juan Conejero, Valerii Huhnin
-/
import CompPoly.Univariate.Basic
import CompPoly.Univariate.DivisionCorrectness
import CompPoly.ToMathlib.Order.WithBot
/-!
# Extended Euclidean Algorithm f... | /-
Copyright (c) 2026 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Juan Conejero, Valerii Huhnin
-/
import CompPoly.Univariate.Basic
import CompPoly.Univariate.DivisionCorrectness
import CompPoly.ToMathlib.Order.WithBot
/-!
# Extended Euclidean Algorithm f... | @@ -70,6 +70,11 @@
CPolynomial R × CPolynomial R × CPolynomial R → Prop
| (r, s, t) => r = s * p + t * q
+private lemma toPoly_sub_div_mul [Field R] [BEq R] [LawfulBEq R]
+ (r r' a b : CPolynomial R) :
+ (a - (r' / r) * b).toPoly = a.toPoly - (r'.toPoly / r.toPoly) * b.toPoly := by
+ rw [show r' / 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_942d477320e8_13 | fae5f58a7e8be6b1 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Univariate/EuclideanAlgorithm.lean | EuclideanAlgorithm | 13 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 16 | 1 | [
{
"theorem_name": "BezoutDegreeInvariant.step",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n refine ⟨(by rw [h.bez, h.bez']; ring), h.bez, ?_, ?_, ?_, ?_⟩\n · ring_nf; simpa [mul_comm] using h.det.neg\n ... | [
{
"name": "cofactor_degree_grows",
"text": "/-- One Euclidean step grows the cofactor degree: `deg t < deg (t' - (r'/r) t)`. -/\nprivate lemma cofactor_degree_grows [Field F]\n (r r' t t' : F[X]) (hr : r ≠ 0)\n (hrr : r.degree < r'.degree) (htt : t'.degree < t.degree) :\n t.degree < (t' - r' / r * ... | [
{
"name": "BezoutDegreeInvariant.step",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 14,
"n_chars": 733,
"n_subproofs": 0,
"n_tactics": 10,
"cyclomatic": 1,
"n_automation": 3,
"n_rewrites": 3,
"n_structural": 3,
"automation_only": false,
... | 1 | /-
Copyright (c) 2026 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Juan Conejero, Valerii Huhnin
-/
import CompPoly.Univariate.Basic
import CompPoly.Univariate.DivisionCorrectness
import CompPoly.ToMathlib.Order.WithBot
/-!
# Extended Euclidean Algorithm f... | /-
Copyright (c) 2026 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Juan Conejero, Valerii Huhnin
-/
import CompPoly.Univariate.Basic
import CompPoly.Univariate.DivisionCorrectness
import CompPoly.ToMathlib.Order.WithBot
/-!
# Extended Euclidean Algorithm f... | @@ -113,6 +113,16 @@
BezoutDegreeInvariant
g₀.toPoly g₁.toPoly threshold r.toPoly s.toPoly t.toPoly r'.toPoly s'.toPoly t'.toPoly
+/-- One Euclidean step grows the cofactor degree: `deg t < deg (t' - (r'/r) t)`. -/
+private lemma cofactor_degree_grows [Field F]
+ (r r' t t' : F[X]) (hr : r ≠ 0)
+ (hrr :... | {
"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_942d477320e8_14 | c287fd24e92d1a5a | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Univariate/EuclideanAlgorithm.lean | EuclideanAlgorithm | 14 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 16 | 4 | [
{
"theorem_name": "xgcdAux_toPoly_eq_gcd",
"depth": 1,
"n_commands": 0,
"n_lines": 14,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction n generalizing r r' s t s' t' with\n | zero =>\n have hr : r = 0 := (toPoly_eq_zero_iff r).mp\n (... | [
{
"name": "toPoly_sub_div_mul",
"text": "private lemma toPoly_sub_div_mul [Field R] [BEq R] [LawfulBEq R]\n (r r' a b : CPolynomial R) :\n (a - (r' / r) * b).toPoly = a.toPoly - (r'.toPoly / r.toPoly) * b.toPoly := by\n rw [show r' / r = r'.div r from rfl, toPoly_sub, toPoly_mul, div_toPoly_eq_div]\n... | [
{
"name": "xgcdAux_stopSpec_of_invariant",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 27,
"n_chars": 1468,
"n_subproofs": 3,
"n_tactics": 23,
"cyclomatic": 2,
"n_automation": 5,
"n_rewrites": 4,
"n_structural": 7,
"automation_only": false,... | 1 | /-
Copyright (c) 2026 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Juan Conejero, Valerii Huhnin
-/
import CompPoly.Univariate.Basic
import CompPoly.Univariate.DivisionCorrectness
import CompPoly.ToMathlib.Order.WithBot
/-!
# Extended Euclidean Algorithm f... | /-
Copyright (c) 2026 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Juan Conejero, Valerii Huhnin
-/
import CompPoly.Univariate.Basic
import CompPoly.Univariate.DivisionCorrectness
import CompPoly.ToMathlib.Order.WithBot
/-!
# Extended Euclidean Algorithm f... | @@ -70,6 +70,11 @@
CPolynomial R × CPolynomial R × CPolynomial R → Prop
| (r, s, t) => r = s * p + t * q
+private lemma toPoly_sub_div_mul [Field R] [BEq R] [LawfulBEq R]
+ (r r' a b : CPolynomial R) :
+ (a - (r' / r) * b).toPoly = a.toPoly - (r'.toPoly / r.toPoly) * b.toPoly := by
+ rw [show r' / 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_942d477320e8_15 | d9fb9796854a2713 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Univariate/EuclideanAlgorithm.lean | EuclideanAlgorithm | 15 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 16 | 4 | [
{
"theorem_name": "xgcdAux_toPoly_eq_gcd",
"depth": 1,
"n_commands": 0,
"n_lines": 14,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction n generalizing r r' s t s' t' with\n | zero =>\n have hr : r = 0 := (toPoly_eq_zero_iff r).mp\n (... | [
{
"name": "toPoly_sub_div_mul",
"text": "private lemma toPoly_sub_div_mul [Field R] [BEq R] [LawfulBEq R]\n (r r' a b : CPolynomial R) :\n (a - (r' / r) * b).toPoly = a.toPoly - (r'.toPoly / r.toPoly) * b.toPoly := by\n rw [show r' / r = r'.div r from rfl, toPoly_sub, toPoly_mul, div_toPoly_eq_div]\n... | [
{
"name": "xgcd_stopSpec",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 34,
"n_chars": 2141,
"n_subproofs": 10,
"n_tactics": 31,
"cyclomatic": 4,
"n_automation": 10,
"n_rewrites": 5,
"n_structural": 7,
"automation_only": false,
"max_nest... | 2 | /-
Copyright (c) 2026 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Juan Conejero, Valerii Huhnin
-/
import CompPoly.Univariate.Basic
import CompPoly.Univariate.DivisionCorrectness
import CompPoly.ToMathlib.Order.WithBot
/-!
# Extended Euclidean Algorithm f... | /-
Copyright (c) 2026 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Juan Conejero, Valerii Huhnin
-/
import CompPoly.Univariate.Basic
import CompPoly.Univariate.DivisionCorrectness
import CompPoly.ToMathlib.Order.WithBot
/-!
# Extended Euclidean Algorithm f... | @@ -70,6 +70,11 @@
CPolynomial R × CPolynomial R × CPolynomial R → Prop
| (r, s, t) => r = s * p + t * q
+private lemma toPoly_sub_div_mul [Field R] [BEq R] [LawfulBEq R]
+ (r r' a b : CPolynomial R) :
+ (a - (r' / r) * b).toPoly = a.toPoly - (r'.toPoly / r.toPoly) * b.toPoly := by
+ rw [show r' / 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_e24f0014e69b_0 | 1f1cb3bf03746234 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Multivariate/Restrict.lean | Restrict | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 2 | [
{
"theorem_name": "coeff_restrictTotalDegree",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simpa [CMvPolynomial.restrictTotalDegree] using\n (coeff_restrictBy (keep := fun m => m.totalDegree ≤ d) m p)"... | [
{
"name": "coeff_restrictBy",
"text": "/-- Coefficient of `restrictBy keep p` at `m`: `p.coeff m` if `keep m`, else `0`. -/\nlemma coeff_restrictBy (keep : CMvMonomial n → Prop) [DecidablePred keep]\n (m : CMvMonomial n) (p : CMvPolynomial n R) :\n (CMvPolynomial.restrictBy keep p).coeff m = if keep m... | [
{
"name": "coeff_restrictTotalDegree",
"fan_in": 6,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 9,
"n_chars": 393,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true,
"ma... | 1 | /-
Copyright (c) 2025 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Fawad Haider
-/
import CompPoly.Multivariate.Operations
/-!
# Lemmas for `CMvPolynomial.restrictBy`, `restrictTotalDegree`, and `restrictDegree`
Degree-bounded restriction of multivariate ... | /-
Copyright (c) 2025 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Fawad Haider
-/
import CompPoly.Multivariate.Operations
/-!
# Lemmas for `CMvPolynomial.restrictBy`, `restrictTotalDegree`, and `restrictDegree`
Degree-bounded restriction of multivariate ... | @@ -22,17 +22,48 @@
variable {n : ℕ} {R : Type*} [Zero R] [BEq R] [LawfulBEq R]
+/-- Coefficient of `restrictBy keep p` at `m`: `p.coeff m` if `keep m`, else `0`. -/
+lemma coeff_restrictBy (keep : CMvMonomial n → Prop) [DecidablePred keep]
+ (m : CMvMonomial n) (p : CMvPolynomial n R) :
+ (CMvPolynomial.res... | {
"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_e24f0014e69b_1 | 95e22b010fb02452 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Multivariate/Restrict.lean | Restrict | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 6 | [
{
"theorem_name": "coeff_restrictTotalDegree_eq_self_of_le",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp [coeff_restrictTotalDegree, h]",
"n_chars": 41,
"n_subproofs": 0,
"n_tactics": 2,
... | [
{
"name": "coeff_restrictTotalDegree",
"text": "/-- Coeff at `m`: `p.coeff m` if `m.totalDegree ≤ d`, else `0`. -/\n@[simp]\nlemma coeff_restrictTotalDegree (d : ℕ) (m : CMvMonomial n) (p : CMvPolynomial n R) :\n (CMvPolynomial.restrictTotalDegree d p).coeff m =\n if m.totalDegree ≤ d then p.coeff m... | [
{
"name": "coeff_restrictTotalDegree_eq_self_of_le",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 7,
"n_chars": 330,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"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: Fawad Haider
-/
import CompPoly.Multivariate.Operations
/-!
# Lemmas for `CMvPolynomial.restrictBy`, `restrictTotalDegree`, and `restrictDegree`
Degree-bounded restriction of multivariate ... | /-
Copyright (c) 2025 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Fawad Haider
-/
import CompPoly.Multivariate.Operations
/-!
# Lemmas for `CMvPolynomial.restrictBy`, `restrictTotalDegree`, and `restrictDegree`
Degree-bounded restriction of multivariate ... | @@ -49,6 +49,14 @@
· cases hopt : p.1[m]? <;> simp [hk, Option.filter]
· cases hopt : p.1[m]? <;> simp [hk, Option.filter]
+/-- Coeff at `m`: `p.coeff m` if `m.totalDegree ≤ d`, else `0`. -/
+@[simp]
+lemma coeff_restrictTotalDegree (d : ℕ) (m : CMvMonomial n) (p : CMvPolynomial n R) :
+ (CMvPolynomial.restr... | {
"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_e24f0014e69b_2 | f4346819932fc9d9 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Multivariate/Restrict.lean | Restrict | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 6 | [
{
"theorem_name": "coeff_restrictTotalDegree_eq_self_of_le",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp [coeff_restrictTotalDegree, h]",
"n_chars": 41,
"n_subproofs": 0,
"n_tactics": 2,
... | [
{
"name": "coeff_restrictTotalDegree",
"text": "/-- Coeff at `m`: `p.coeff m` if `m.totalDegree ≤ d`, else `0`. -/\n@[simp]\nlemma coeff_restrictTotalDegree (d : ℕ) (m : CMvMonomial n) (p : CMvPolynomial n R) :\n (CMvPolynomial.restrictTotalDegree d p).coeff m =\n if m.totalDegree ≤ d then p.coeff m... | [
{
"name": "coeff_restrictTotalDegree_eq_zero_of_lt",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 7,
"n_chars": 331,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"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: Fawad Haider
-/
import CompPoly.Multivariate.Operations
/-!
# Lemmas for `CMvPolynomial.restrictBy`, `restrictTotalDegree`, and `restrictDegree`
Degree-bounded restriction of multivariate ... | /-
Copyright (c) 2025 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Fawad Haider
-/
import CompPoly.Multivariate.Operations
/-!
# Lemmas for `CMvPolynomial.restrictBy`, `restrictTotalDegree`, and `restrictDegree`
Degree-bounded restriction of multivariate ... | @@ -49,6 +49,14 @@
· cases hopt : p.1[m]? <;> simp [hk, Option.filter]
· cases hopt : p.1[m]? <;> simp [hk, Option.filter]
+/-- Coeff at `m`: `p.coeff m` if `m.totalDegree ≤ d`, else `0`. -/
+@[simp]
+lemma coeff_restrictTotalDegree (d : ℕ) (m : CMvMonomial n) (p : CMvPolynomial n R) :
+ (CMvPolynomial.restr... | {
"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_e24f0014e69b_3 | 9039d663a4fe853c | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Multivariate/Restrict.lean | Restrict | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 6 | [
{
"theorem_name": "coeff_restrictDegree_eq_self_of_le",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp [coeff_restrictDegree, h]",
"n_chars": 36,
"n_subproofs": 0,
"n_tactics": 2,
"cyclo... | [
{
"name": "coeff_restrictDegree",
"text": "/-- Coefficient of `restrictDegree d p` at `m`: `p.coeff m` if `∀ i, m.degreeOf i ≤ d`, else `0`. -/\n@[simp]\nlemma coeff_restrictDegree (d : ℕ) (m : CMvMonomial n) (p : CMvPolynomial n R) :\n (CMvPolynomial.restrictDegree d p).coeff m =\n if ∀ i : Fin n, ... | [
{
"name": "coeff_restrictDegree_eq_self_of_le",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 7,
"n_chars": 330,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true... | 2 | /-
Copyright (c) 2025 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Fawad Haider
-/
import CompPoly.Multivariate.Operations
/-!
# Lemmas for `CMvPolynomial.restrictBy`, `restrictTotalDegree`, and `restrictDegree`
Degree-bounded restriction of multivariate ... | /-
Copyright (c) 2025 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Fawad Haider
-/
import CompPoly.Multivariate.Operations
/-!
# Lemmas for `CMvPolynomial.restrictBy`, `restrictTotalDegree`, and `restrictDegree`
Degree-bounded restriction of multivariate ... | @@ -57,10 +57,19 @@
simpa [CMvPolynomial.restrictTotalDegree] using
(coeff_restrictBy (keep := fun m => m.totalDegree ≤ d) m p)
+/-- Coefficient of `restrictDegree d p` at `m`: `p.coeff m` if `∀ i, m.degreeOf i ≤ d`, else `0`. -/
+@[simp]
+lemma coeff_restrictDegree (d : ℕ) (m : CMvMonomial n) (p : CMvPolynom... | {
"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_e24f0014e69b_4 | fb24f53d96a43136 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Multivariate/Restrict.lean | Restrict | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 6 | [
{
"theorem_name": "coeff_restrictDegree_eq_self_of_le",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp [coeff_restrictDegree, h]",
"n_chars": 36,
"n_subproofs": 0,
"n_tactics": 2,
"cyclo... | [
{
"name": "coeff_restrictDegree",
"text": "/-- Coefficient of `restrictDegree d p` at `m`: `p.coeff m` if `∀ i, m.degreeOf i ≤ d`, else `0`. -/\n@[simp]\nlemma coeff_restrictDegree (d : ℕ) (m : CMvMonomial n) (p : CMvPolynomial n R) :\n (CMvPolynomial.restrictDegree d p).coeff m =\n if ∀ i : Fin n, ... | [
{
"name": "coeff_restrictDegree_eq_zero_of_not_le",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 7,
"n_chars": 331,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"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: Fawad Haider
-/
import CompPoly.Multivariate.Operations
/-!
# Lemmas for `CMvPolynomial.restrictBy`, `restrictTotalDegree`, and `restrictDegree`
Degree-bounded restriction of multivariate ... | /-
Copyright (c) 2025 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Fawad Haider
-/
import CompPoly.Multivariate.Operations
/-!
# Lemmas for `CMvPolynomial.restrictBy`, `restrictTotalDegree`, and `restrictDegree`
Degree-bounded restriction of multivariate ... | @@ -57,10 +57,19 @@
simpa [CMvPolynomial.restrictTotalDegree] using
(coeff_restrictBy (keep := fun m => m.totalDegree ≤ d) m p)
+/-- Coefficient of `restrictDegree d p` at `m`: `p.coeff m` if `∀ i, m.degreeOf i ≤ d`, else `0`. -/
+@[simp]
+lemma coeff_restrictDegree (d : ℕ) (m : CMvMonomial n) (p : CMvPolynom... | {
"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_e24f0014e69b_5 | 517f754f957fa843 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Multivariate/Restrict.lean | Restrict | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 6 | [
{
"theorem_name": "coeff_restrictTotalDegree_eq_self_of_le",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp [coeff_restrictTotalDegree, h]",
"n_chars": 41,
"n_subproofs": 0,
"n_tactics": 2,
... | [
{
"name": "coeff_restrictTotalDegree",
"text": "/-- Coeff at `m`: `p.coeff m` if `m.totalDegree ≤ d`, else `0`. -/\n@[simp]\nlemma coeff_restrictTotalDegree (d : ℕ) (m : CMvMonomial n) (p : CMvPolynomial n R) :\n (CMvPolynomial.restrictTotalDegree d p).coeff m =\n if m.totalDegree ≤ d then p.coeff m... | [
{
"name": "totalDegree_le_of_mem_monomials_restrictTotalDegree",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 17,
"n_chars": 850,
"n_subproofs": 3,
"n_tactics": 11,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 0,
"n_structural": 2,
"aut... | 2 | /-
Copyright (c) 2025 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Fawad Haider
-/
import CompPoly.Multivariate.Operations
/-!
# Lemmas for `CMvPolynomial.restrictBy`, `restrictTotalDegree`, and `restrictDegree`
Degree-bounded restriction of multivariate ... | /-
Copyright (c) 2025 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Fawad Haider
-/
import CompPoly.Multivariate.Operations
/-!
# Lemmas for `CMvPolynomial.restrictBy`, `restrictTotalDegree`, and `restrictDegree`
Degree-bounded restriction of multivariate ... | @@ -49,6 +49,14 @@
· cases hopt : p.1[m]? <;> simp [hk, Option.filter]
· cases hopt : p.1[m]? <;> simp [hk, Option.filter]
+/-- Coeff at `m`: `p.coeff m` if `m.totalDegree ≤ d`, else `0`. -/
+@[simp]
+lemma coeff_restrictTotalDegree (d : ℕ) (m : CMvMonomial n) (p : CMvPolynomial n R) :
+ (CMvPolynomial.restr... | {
"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_e24f0014e69b_6 | e4c5b62b77db5d4a | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Multivariate/Restrict.lean | Restrict | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 6 | [
{
"theorem_name": "coeff_restrictDegree_eq_self_of_le",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp [coeff_restrictDegree, h]",
"n_chars": 36,
"n_subproofs": 0,
"n_tactics": 2,
"cyclo... | [
{
"name": "coeff_restrictDegree",
"text": "/-- Coefficient of `restrictDegree d p` at `m`: `p.coeff m` if `∀ i, m.degreeOf i ≤ d`, else `0`. -/\n@[simp]\nlemma coeff_restrictDegree (d : ℕ) (m : CMvMonomial n) (p : CMvPolynomial n R) :\n (CMvPolynomial.restrictDegree d p).coeff m =\n if ∀ i : Fin n, ... | [
{
"name": "degreeOf_le_of_mem_monomials_restrictDegree",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 17,
"n_chars": 856,
"n_subproofs": 3,
"n_tactics": 11,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 0,
"n_structural": 2,
"automation_... | 2 | /-
Copyright (c) 2025 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Fawad Haider
-/
import CompPoly.Multivariate.Operations
/-!
# Lemmas for `CMvPolynomial.restrictBy`, `restrictTotalDegree`, and `restrictDegree`
Degree-bounded restriction of multivariate ... | /-
Copyright (c) 2025 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Fawad Haider
-/
import CompPoly.Multivariate.Operations
/-!
# Lemmas for `CMvPolynomial.restrictBy`, `restrictTotalDegree`, and `restrictDegree`
Degree-bounded restriction of multivariate ... | @@ -57,6 +57,14 @@
simpa [CMvPolynomial.restrictTotalDegree] using
(coeff_restrictBy (keep := fun m => m.totalDegree ≤ d) m p)
+/-- Coefficient of `restrictDegree d p` at `m`: `p.coeff m` if `∀ i, m.degreeOf i ≤ d`, else `0`. -/
+@[simp]
+lemma coeff_restrictDegree (d : ℕ) (m : CMvMonomial n) (p : CMvPolynomi... | {
"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_e24f0014e69b_7 | 1174b0b8dd33b55c | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Multivariate/Restrict.lean | Restrict | 7 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 1 | [
{
"theorem_name": "vector_ofFn_sum_eq_finSum",
"depth": 1,
"n_commands": 0,
"n_lines": 9,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n calc\n (Vector.ofFn s).sum = (Array.ofFn s).sum := by\n simp [Vector.sum, Vector.toArray_ofFn]\n _ = (... | [
{
"name": "list_ofFn_sum_eq_finSum",
"text": "/-- `List.ofFn s` sum equals `∑ i, s i`. -/\nprivate lemma list_ofFn_sum_eq_finSum {n : ℕ} (s : Fin n → ℕ) :\n (List.ofFn s).sum = ∑ i : Fin n, s i := by\n have hfin : (∑ x : Fin (List.ofFn s).length, (List.ofFn s)[x.1]) = (List.ofFn s).sum := by\n simpa ... | [
{
"name": "vector_ofFn_sum_eq_finSum",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 13,
"n_chars": 519,
"n_subproofs": 0,
"n_tactics": 9,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 3,
"automation_only": false,
"... | 1 | /-
Copyright (c) 2025 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Fawad Haider
-/
import CompPoly.Multivariate.Operations
/-!
# Lemmas for `CMvPolynomial.restrictBy`, `restrictTotalDegree`, and `restrictDegree`
Degree-bounded restriction of multivariate ... | /-
Copyright (c) 2025 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Fawad Haider
-/
import CompPoly.Multivariate.Operations
/-!
# Lemmas for `CMvPolynomial.restrictBy`, `restrictTotalDegree`, and `restrictDegree`
Degree-bounded restriction of multivariate ... | @@ -65,9 +65,42 @@
simpa [CMvPolynomial.restrictDegree] using
(coeff_restrictBy (keep := fun m => ∀ i : Fin n, m.degreeOf i ≤ d) m p)
+/-- `List.ofFn s` sum equals `∑ i, s i`. -/
+private lemma list_ofFn_sum_eq_finSum {n : ℕ} (s : Fin n → ℕ) :
+ (List.ofFn s).sum = ∑ i : Fin n, s i := by
+ have hfin : (∑ ... | {
"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_e24f0014e69b_8 | f6e77b16479ff6fe | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Multivariate/Restrict.lean | Restrict | 8 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 1 | [
{
"theorem_name": "totalDegree_eq_finsupp_sum",
"depth": 1,
"n_commands": 0,
"n_lines": 9,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hof : (CMvMonomial.ofFinsupp m.toFinsupp).totalDegree =\n Finsupp.sum m.toFinsupp (fun _ e => e) := by... | [
{
"name": "vector_ofFn_sum_eq_finSum",
"text": "/-- `Vector.ofFn s` sum equals `∑ i, s i`. -/\nprivate lemma vector_ofFn_sum_eq_finSum {n : ℕ} (s : Fin n → ℕ) :\n (Vector.ofFn s).sum = ∑ i : Fin n, s i := by\n calc\n (Vector.ofFn s).sum = (Array.ofFn s).sum := by\n simp [Vector.sum, Vector.toArr... | [
{
"name": "totalDegree_eq_finsupp_sum",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 13,
"n_chars": 573,
"n_subproofs": 1,
"n_tactics": 9,
"cyclomatic": 1,
"n_automation": 3,
"n_rewrites": 2,
"n_structural": 1,
"automation_only": false,
... | 2 | /-
Copyright (c) 2025 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Fawad Haider
-/
import CompPoly.Multivariate.Operations
/-!
# Lemmas for `CMvPolynomial.restrictBy`, `restrictTotalDegree`, and `restrictDegree`
Degree-bounded restriction of multivariate ... | /-
Copyright (c) 2025 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Fawad Haider
-/
import CompPoly.Multivariate.Operations
/-!
# Lemmas for `CMvPolynomial.restrictBy`, `restrictTotalDegree`, and `restrictDegree`
Degree-bounded restriction of multivariate ... | @@ -90,6 +90,18 @@
exact congrArg s hx
exact hfin_get.symm.trans hsum_cast
+/-- `Vector.ofFn s` sum equals `∑ i, s i`. -/
+private lemma vector_ofFn_sum_eq_finSum {n : ℕ} (s : Fin n → ℕ) :
+ (Vector.ofFn s).sum = ∑ i : Fin n, s i := by
+ calc
+ (Vector.ofFn s).sum = (Array.ofFn s).sum := by
+ simp... | {
"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_e24f0014e69b_9 | 206f6a1f5dc13ea9 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Multivariate/Restrict.lean | Restrict | 9 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 1 | [
{
"theorem_name": "totalDegree_restrictTotalDegree_le",
"depth": 1,
"n_commands": 0,
"n_lines": 12,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n classical\n unfold CMvPolynomial.totalDegree\n refine Finset.sup_le ?_\n intro s hs\n have hs' : s ... | [
{
"name": "totalDegree_eq_finsupp_sum",
"text": "/-- Monomial `totalDegree` equals `Finsupp.sum` of its exponents. -/\nprivate lemma totalDegree_eq_finsupp_sum {n : ℕ} (m : CMvMonomial n) :\n m.totalDegree = Finsupp.sum m.toFinsupp (fun _ e => e) := by\n have hof : (CMvMonomial.ofFinsupp m.toFinsupp).to... | [
{
"name": "totalDegree_restrictTotalDegree_le",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 6,
"n_lines": 18,
"n_chars": 735,
"n_subproofs": 2,
"n_tactics": 12,
"cyclomatic": 2,
"n_automation": 2,
"n_rewrites": 1,
"n_structural": 4,
"automation_only": fa... | 6 | /-
Copyright (c) 2025 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Fawad Haider
-/
import CompPoly.Multivariate.Operations
/-!
# Lemmas for `CMvPolynomial.restrictBy`, `restrictTotalDegree`, and `restrictDegree`
Degree-bounded restriction of multivariate ... | /-
Copyright (c) 2025 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Fawad Haider
-/
import CompPoly.Multivariate.Operations
/-!
# Lemmas for `CMvPolynomial.restrictBy`, `restrictTotalDegree`, and `restrictDegree`
Degree-bounded restriction of multivariate ... | @@ -118,11 +118,34 @@
exact congrArg List.sum (Array.toList_ofFn (f := s))
_ = ∑ i : Fin n, s i := list_ofFn_sum_eq_finSum s
+/-- Monomial `totalDegree` equals `Finsupp.sum` of its exponents. -/
+private lemma totalDegree_eq_finsupp_sum {n : ℕ} (m : CMvMonomial n) :
+ m.totalDegree = Finsupp.sum m.toFi... | {
"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_e24f0014e69b_10 | 9e6a90dda8b7800c | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Multivariate/Restrict.lean | Restrict | 10 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 6 | [
{
"theorem_name": "coeff_restrictTotalDegree_eq_self_of_le",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp [coeff_restrictTotalDegree, h]",
"n_chars": 41,
"n_subproofs": 0,
"n_tactics": 2,
... | [
{
"name": "coeff_restrictTotalDegree",
"text": "/-- Coeff at `m`: `p.coeff m` if `m.totalDegree ≤ d`, else `0`. -/\n@[simp]\nlemma coeff_restrictTotalDegree (d : ℕ) (m : CMvMonomial n) (p : CMvPolynomial n R) :\n (CMvPolynomial.restrictTotalDegree d p).coeff m =\n if m.totalDegree ≤ d then p.coeff m... | [
{
"name": "restrictTotalDegree_zero",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 9,
"n_chars": 289,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": false,
"ma... | 2 | /-
Copyright (c) 2025 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Fawad Haider
-/
import CompPoly.Multivariate.Operations
/-!
# Lemmas for `CMvPolynomial.restrictBy`, `restrictTotalDegree`, and `restrictDegree`
Degree-bounded restriction of multivariate ... | /-
Copyright (c) 2025 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Fawad Haider
-/
import CompPoly.Multivariate.Operations
/-!
# Lemmas for `CMvPolynomial.restrictBy`, `restrictTotalDegree`, and `restrictDegree`
Degree-bounded restriction of multivariate ... | @@ -49,6 +49,14 @@
· cases hopt : p.1[m]? <;> simp [hk, Option.filter]
· cases hopt : p.1[m]? <;> simp [hk, Option.filter]
+/-- Coeff at `m`: `p.coeff m` if `m.totalDegree ≤ d`, else `0`. -/
+@[simp]
+lemma coeff_restrictTotalDegree (d : ℕ) (m : CMvMonomial n) (p : CMvPolynomial n R) :
+ (CMvPolynomial.restr... | {
"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_e24f0014e69b_11 | 5ccffb6dff0fef66 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Multivariate/Restrict.lean | Restrict | 11 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 6 | [
{
"theorem_name": "coeff_restrictDegree_eq_self_of_le",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp [coeff_restrictDegree, h]",
"n_chars": 36,
"n_subproofs": 0,
"n_tactics": 2,
"cyclo... | [
{
"name": "coeff_restrictDegree",
"text": "/-- Coefficient of `restrictDegree d p` at `m`: `p.coeff m` if `∀ i, m.degreeOf i ≤ d`, else `0`. -/\n@[simp]\nlemma coeff_restrictDegree (d : ℕ) (m : CMvMonomial n) (p : CMvPolynomial n R) :\n (CMvPolynomial.restrictDegree d p).coeff m =\n if ∀ i : Fin n, ... | [
{
"name": "restrictDegree_zero",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 9,
"n_chars": 269,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": false,
"max_nes... | 2 | /-
Copyright (c) 2025 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Fawad Haider
-/
import CompPoly.Multivariate.Operations
/-!
# Lemmas for `CMvPolynomial.restrictBy`, `restrictTotalDegree`, and `restrictDegree`
Degree-bounded restriction of multivariate ... | /-
Copyright (c) 2025 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Fawad Haider
-/
import CompPoly.Multivariate.Operations
/-!
# Lemmas for `CMvPolynomial.restrictBy`, `restrictTotalDegree`, and `restrictDegree`
Degree-bounded restriction of multivariate ... | @@ -57,6 +57,14 @@
simpa [CMvPolynomial.restrictTotalDegree] using
(coeff_restrictBy (keep := fun m => m.totalDegree ≤ d) m p)
+/-- Coefficient of `restrictDegree d p` at `m`: `p.coeff m` if `∀ i, m.degreeOf i ≤ d`, else `0`. -/
+@[simp]
+lemma coeff_restrictDegree (d : ℕ) (m : CMvMonomial n) (p : CMvPolynomi... | {
"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_30952e0d54a4_0 | b4de0d0a4a164ef9 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Bivariate/GuruswamiSudan/CoreCorrectness.lean | CoreCorrectness | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 24 | 1 | [
{
"theorem_name": "gsCore_complete_of_roots_all_valid_witnesses",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rcases interpContext.complete points params hdistinct hInterpExists with ⟨Q, hQ⟩\n exact gsCo... | [
{
"name": "gsCore_complete_of_interpolate",
"text": "/-- Completeness for the concrete interpolation polynomial returned by the\ninterpolation backend. -/\ntheorem gsCore_complete_of_interpolate {F : Type*}\n [Field F] [BEq F] [LawfulBEq F] [DecidableEq F]\n {points : Array (Prod F F)}\n {interpCon... | [
{
"name": "gsCore_complete_of_roots_all_valid_witnesses",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 21,
"n_chars": 959,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 2,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 2,
"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.GuruswamiSudan.Filter
import CompPoly.Bivariate.GuruswamiSudan.PolynomialCorrectness
import CompPoly.Bivariate.GuruswamiSudan.Root.C... | /-
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.Filter
import CompPoly.Bivariate.GuruswamiSudan.PolynomialCorrectness
import CompPoly.Bivariate.GuruswamiSudan.Root.C... | @@ -20,6 +20,23 @@
namespace GuruswamiSudan
+/-- Completeness for the concrete interpolation polynomial returned by the
+interpolation backend. -/
+theorem gsCore_complete_of_interpolate {F : Type*}
+ [Field F] [BEq F] [LawfulBEq F] [DecidableEq F]
+ {points : Array (Prod F F)}
+ {interpContext : GSInterp... | {
"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_30952e0d54a4_1 | 3b3802728f52e3aa | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Bivariate/GuruswamiSudan/CoreCorrectness.lean | CoreCorrectness | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 24 | 1 | [
{
"theorem_name": "eval_composeY_eq_zero_of_matched_point",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rcases hQ with ⟨_hQne, _hQdeg, hQmult⟩\n have hderiv := hQmult point hpoint 0 0 (by omega)\n rw [C... | [
{
"name": "eval_composeY_eq_evalEval",
"text": "/-- Evaluating `Q(X, p(X))` at `x` agrees with full bivariate evaluation at\n`(x, p(x))`. -/\nprivate theorem eval_composeY_eq_evalEval {F : Type*}\n [Field F] [BEq F] [LawfulBEq F] [DecidableEq F]\n (Q : CBivariate F) (p : CPolynomial F) (x : F) :\n ... | [
{
"name": "eval_composeY_eq_zero_of_matched_point",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 18,
"n_chars": 807,
"n_subproofs": 1,
"n_tactics": 6,
"cyclomatic": 2,
"n_automation": 1,
"n_rewrites": 2,
"n_structural": 2,
"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.Bivariate.GuruswamiSudan.Filter
import CompPoly.Bivariate.GuruswamiSudan.PolynomialCorrectness
import CompPoly.Bivariate.GuruswamiSudan.Root.C... | /-
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.Filter
import CompPoly.Bivariate.GuruswamiSudan.PolynomialCorrectness
import CompPoly.Bivariate.GuruswamiSudan.Root.C... | @@ -20,6 +20,22 @@
namespace GuruswamiSudan
+/-- Evaluating `Q(X, p(X))` at `x` agrees with full bivariate evaluation at
+`(x, p(x))`. -/
+private theorem eval_composeY_eq_evalEval {F : Type*}
+ [Field F] [BEq F] [LawfulBEq F] [DecidableEq F]
+ (Q : CBivariate F) (p : CPolynomial F) (x : F) :
+ 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_30952e0d54a4_2 | dc62bc9799aab65e | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Bivariate/GuruswamiSudan/CoreCorrectness.lean | CoreCorrectness | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 24 | 2 | [
{
"theorem_name": "matchingPointCount_le_natDegree_composeY_of_ne_zero",
"depth": 1,
"n_commands": 0,
"n_lines": 28,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n let matched := points.toList.filter fun point ↦ CPolynomial.eval point.1 p == point.2\... | [
{
"name": "matchedX_nodup",
"text": "/-- Filtering matching packed points preserves distinct `x`-coordinates. -/\nprivate theorem matchedX_nodup {F : Type*} [Semiring F] [BEq F]\n {points : Array (F × F)} {p : CPolynomial F}\n (hdistinct : DistinctXCoordinates points) :\n ((points.toList.filter\n ... | [
{
"name": "matchingPointCount_le_natDegree_composeY_of_ne_zero",
"fan_in": 1,
"n_deps_direct": 3,
"n_deps_transitive": 4,
"n_lines": 41,
"n_chars": 2192,
"n_subproofs": 10,
"n_tactics": 28,
"cyclomatic": 3,
"n_automation": 5,
"n_rewrites": 3,
"n_structural": 7,
"a... | 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.Filter
import CompPoly.Bivariate.GuruswamiSudan.PolynomialCorrectness
import CompPoly.Bivariate.GuruswamiSudan.Root.C... | /-
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.Filter
import CompPoly.Bivariate.GuruswamiSudan.PolynomialCorrectness
import CompPoly.Bivariate.GuruswamiSudan.Root.C... | @@ -84,6 +84,15 @@
simp [step, pred, hfalse, Nat.add_comm]
simpa [pred, step] using hfold data 0
+/-- Filtering matching packed points preserves distinct `x`-coordinates. -/
+private theorem matchedX_nodup {F : Type*} [Semiring F] [BEq F]
+ {points : Array (F × F)} {p : CPolynomial F}
+ (h... | {
"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_30952e0d54a4_3 | 8e285c4479684fe0 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Bivariate/GuruswamiSudan/CoreCorrectness.lean | CoreCorrectness | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 24 | 1 | [
{
"theorem_name": "natDegree_composeY_toPoly_le_weightedDegreeBound",
"depth": 1,
"n_commands": 0,
"n_lines": 8,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rcases hQ with ⟨_hQne, hQdeg, _hQmult⟩\n have hpN := toPoly_natDegree_le_pred_of_degreeLt... | [
{
"name": "toPoly_natDegree_le_pred_of_degreeLt",
"text": "/-- `degreeLt p k` gives the Mathlib-side bound `natDegree p ≤ k - 1`. -/\nprivate theorem toPoly_natDegree_le_pred_of_degreeLt {F : Type*}\n [Field F] [BEq F] [LawfulBEq F]\n {p : CPolynomial F} {k : Nat} (hp : degreeLt p k) :\n p.toPoly.n... | [
{
"name": "natDegree_composeY_toPoly_le_weightedDegreeBound",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 18,
"n_chars": 876,
"n_subproofs": 2,
"n_tactics": 8,
"cyclomatic": 2,
"n_automation": 0,
"n_rewrites": 2,
"n_structural": 2,
"automat... | 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.Filter
import CompPoly.Bivariate.GuruswamiSudan.PolynomialCorrectness
import CompPoly.Bivariate.GuruswamiSudan.Root.C... | /-
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.Filter
import CompPoly.Bivariate.GuruswamiSudan.PolynomialCorrectness
import CompPoly.Bivariate.GuruswamiSudan.Root.C... | @@ -20,6 +20,27 @@
namespace GuruswamiSudan
+/-- `degreeLt p k` gives the Mathlib-side bound `natDegree p ≤ k - 1`. -/
+private theorem toPoly_natDegree_le_pred_of_degreeLt {F : Type*}
+ [Field F] [BEq F] [LawfulBEq F]
+ {p : CPolynomial F} {k : Nat} (hp : degreeLt p k) :
+ p.toPoly.natDegree ≤ k - 1 := 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_30952e0d54a4_4 | 5489909bc6eb33ff | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Bivariate/GuruswamiSudan/CoreCorrectness.lean | CoreCorrectness | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 24 | 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": 956,
"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.GuruswamiSudan.Filter
import CompPoly.Bivariate.GuruswamiSudan.PolynomialCorrectness
import CompPoly.Bivariate.GuruswamiSudan.Root.C... | /-
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.Filter
import CompPoly.Bivariate.GuruswamiSudan.PolynomialCorrectness
import CompPoly.Bivariate.GuruswamiSudan.Root.C... | @@ -20,6 +20,20 @@
namespace GuruswamiSudan
+/-- 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) =
+ Polynomia... | {
"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_30952e0d54a4_5 | 6f87878eb6e020fe | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Bivariate/GuruswamiSudan/CoreCorrectness.lean | CoreCorrectness | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 24 | 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": "toPoly_hasseDerivative_eq_coeffwise_hasseDeriv_hasseDeriv",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 18,
"n_chars": 726,
"n_subproofs": 0,
"n_tactics": 9,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 5,
"n_structural": 1,
... | 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.Filter
import CompPoly.Bivariate.GuruswamiSudan.PolynomialCorrectness
import CompPoly.Bivariate.GuruswamiSudan.Root.C... | /-
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.Filter
import CompPoly.Bivariate.GuruswamiSudan.PolynomialCorrectness
import CompPoly.Bivariate.GuruswamiSudan.Root.C... | @@ -20,6 +20,30 @@
namespace GuruswamiSudan
+/-- 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]
+ (P : Polynomial (Polynomial F)) (a j : Nat) :
+ ((P.sum 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_30952e0d54a4_6 | 51451f6fd68c6afb | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Bivariate/GuruswamiSudan/CoreCorrectness.lean | CoreCorrectness | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 24 | 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": "eval_hasseDeriv_eval_hasseDeriv_toPoly",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 4,
"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":... | 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.Filter
import CompPoly.Bivariate.GuruswamiSudan.PolynomialCorrectness
import CompPoly.Bivariate.GuruswamiSudan.Root.C... | /-
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.Filter
import CompPoly.Bivariate.GuruswamiSudan.PolynomialCorrectness
import CompPoly.Bivariate.GuruswamiSudan.Root.C... | @@ -85,6 +85,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_30952e0d54a4_7 | a0ae45cf69fc0b84 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Bivariate/GuruswamiSudan/CoreCorrectness.lean | CoreCorrectness | 7 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 24 | 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": "shifted_coeff_eq_hasseDerivativeEval",
"fan_in": 1,
"n_deps_direct": 3,
"n_deps_transitive": 7,
"n_lines": 15,
"n_chars": 679,
"n_subproofs": 0,
"n_tactics": 6,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 4,
"n_structural": 1,
"automation_only": f... | 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.GuruswamiSudan.Filter
import CompPoly.Bivariate.GuruswamiSudan.PolynomialCorrectness
import CompPoly.Bivariate.GuruswamiSudan.Root.C... | /-
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.Filter
import CompPoly.Bivariate.GuruswamiSudan.PolynomialCorrectness
import CompPoly.Bivariate.GuruswamiSudan.Root.C... | @@ -107,6 +107,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_30952e0d54a4_8 | f71219af3f5ccfd2 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Bivariate/GuruswamiSudan/CoreCorrectness.lean | CoreCorrectness | 8 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 24 | 1 | [
{
"theorem_name": "X_pow_dvd_eval_of_total_coeff_zero",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [Polynomial.eval_eq_sum]\n apply Finset.dvd_sum\n intro b _hb\n exact X_pow_dvd_mul_pow_of_total_c... | [
{
"name": "X_pow_dvd_mul_pow_of_total_coeff_zero",
"text": "/-- If the `b`-th coefficient of a shifted bivariate polynomial has no terms\nbelow `X^(m - b)` and `U` is divisible by `X`, then the `b`-th evaluated term is\ndivisible by `X^m`. -/\nprivate theorem X_pow_dvd_mul_pow_of_total_coeff_zero {F : Type*... | [
{
"name": "X_pow_dvd_eval_of_total_coeff_zero",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 15,
"n_chars": 621,
"n_subproofs": 0,
"n_tactics": 6,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 3,
"automation_only": fal... | 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.Filter
import CompPoly.Bivariate.GuruswamiSudan.PolynomialCorrectness
import CompPoly.Bivariate.GuruswamiSudan.Root.C... | /-
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.Filter
import CompPoly.Bivariate.GuruswamiSudan.PolynomialCorrectness
import CompPoly.Bivariate.GuruswamiSudan.Root.C... | @@ -20,6 +20,36 @@
namespace GuruswamiSudan
+/-- If the `b`-th coefficient of a shifted bivariate polynomial has no terms
+below `X^(m - b)` and `U` is divisible by `X`, then the `b`-th evaluated term is
+divisible by `X^m`. -/
+private theorem X_pow_dvd_mul_pow_of_total_coeff_zero {F : Type*} [Field F]
+ {A U ... | {
"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_30952e0d54a4_9 | 6d0004212c9fc340 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Bivariate/GuruswamiSudan/CoreCorrectness.lean | CoreCorrectness | 9 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 24 | 1 | [
{
"theorem_name": "rootMultiplicity_composeY_toPoly_of_matched_point",
"depth": 1,
"n_commands": 0,
"n_lines": 23,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n let R : Polynomial F := (CBivariate.composeY Q p).toPoly\n have hRne : R ≠ 0 := by\n ... | [
{
"name": "X_dvd_taylor_sub_C_eval",
"text": "/-- If `P(x) = y`, the nonconstant Taylor tail `P(X + x) - y` is divisible by\n`X`. -/\nprivate theorem X_dvd_taylor_sub_C_eval {F : Type*} [Field F]\n (P : Polynomial F) (x y : F) (h : P.eval x = y) :\n Polynomial.X ∣ Polynomial.taylor x P - Polynomial.C ... | [
{
"name": "rootMultiplicity_composeY_toPoly_of_matched_point",
"fan_in": 1,
"n_deps_direct": 4,
"n_deps_transitive": 12,
"n_lines": 33,
"n_chars": 1655,
"n_subproofs": 4,
"n_tactics": 23,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 7,
"n_structural": 5,
"aut... | 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.Bivariate.GuruswamiSudan.Filter
import CompPoly.Bivariate.GuruswamiSudan.PolynomialCorrectness
import CompPoly.Bivariate.GuruswamiSudan.Root.C... | /-
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.Filter
import CompPoly.Bivariate.GuruswamiSudan.PolynomialCorrectness
import CompPoly.Bivariate.GuruswamiSudan.Root.C... | @@ -168,6 +168,15 @@
rw [Polynomial.hom_eval₂]
simp [Polynomial.eval_map, Polynomial.taylorAlgHom, Polynomial.taylor_apply]
+/-- If `P(x) = y`, the nonconstant Taylor tail `P(X + x) - y` is divisible by
+`X`. -/
+private theorem X_dvd_taylor_sub_C_eval {F : Type*} [Field F]
+ (P : Polynomial F) (x y : F) (h ... | {
"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_30952e0d54a4_10 | c599981ffd09e015 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Bivariate/GuruswamiSudan/CoreCorrectness.lean | CoreCorrectness | 10 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 24 | 1 | [
{
"theorem_name": "rootMultiplicity_composeY_toPoly_of_matched_point",
"depth": 1,
"n_commands": 0,
"n_lines": 23,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n let R : Polynomial F := (CBivariate.composeY Q p).toPoly\n have hRne : R ≠ 0 := by\n ... | [
{
"name": "taylor_composeY_toPoly_eq",
"text": "/-- Taylor shifting `Q(X, p(X))` at `x` is the same as shifting `Q` in both\nvariables and substituting the positive-order part of `p(X + x)`. -/\nprivate theorem taylor_composeY_toPoly_eq {F : Type*}\n [Field F] [BEq F] [LawfulBEq F] [DecidableEq F]\n (... | [
{
"name": "composeY_eq_zero_of_enough_matching_multiplicity_points",
"fan_in": 1,
"n_deps_direct": 6,
"n_deps_transitive": 21,
"n_lines": 62,
"n_chars": 2940,
"n_subproofs": 13,
"n_tactics": 48,
"cyclomatic": 3,
"n_automation": 7,
"n_rewrites": 4,
"n_structural": 6,
... | 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.GuruswamiSudan.Filter
import CompPoly.Bivariate.GuruswamiSudan.PolynomialCorrectness
import CompPoly.Bivariate.GuruswamiSudan.Root.C... | /-
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.Filter
import CompPoly.Bivariate.GuruswamiSudan.PolynomialCorrectness
import CompPoly.Bivariate.GuruswamiSudan.Root.C... | @@ -303,6 +303,22 @@
rw [Polynomial.taylor_coeff]
exact eval_hasseDeriv_eval_hasseDeriv_toPoly Q x y a b
+/-- Taylor shifting `Q(X, p(X))` at `x` is the same as shifting `Q` in both
+variables and substituting the positive-order part of `p(X + x)`. -/
+private theorem taylor_composeY_toPoly_eq {F : Type*}
+ ... | {
"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_30952e0d54a4_11 | 77eb7c58f3751ade | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Bivariate/GuruswamiSudan/CoreCorrectness.lean | CoreCorrectness | 11 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 24 | 1 | [
{
"theorem_name": "rootMultiplicity_composeY_toPoly_of_matched_point",
"depth": 1,
"n_commands": 0,
"n_lines": 23,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n let R : Polynomial F := (CBivariate.composeY Q p).toPoly\n have hRne : R ≠ 0 := by\n ... | [
{
"name": "taylor_composeY_toPoly_eq",
"text": "/-- Taylor shifting `Q(X, p(X))` at `x` is the same as shifting `Q` in both\nvariables and substituting the positive-order part of `p(X + x)`. -/\nprivate theorem taylor_composeY_toPoly_eq {F : Type*}\n [Field F] [BEq F] [LawfulBEq F] [DecidableEq F]\n (... | [
{
"name": "gsCore_complete_of_enough_matches",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 24,
"n_lines": 20,
"n_chars": 907,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 3,
"automation_only": fal... | 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.Filter
import CompPoly.Bivariate.GuruswamiSudan.PolynomialCorrectness
import CompPoly.Bivariate.GuruswamiSudan.Root.C... | /-
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.Filter
import CompPoly.Bivariate.GuruswamiSudan.PolynomialCorrectness
import CompPoly.Bivariate.GuruswamiSudan.Root.C... | @@ -340,6 +340,22 @@
rw [Polynomial.taylor_coeff]
exact eval_hasseDeriv_eval_hasseDeriv_toPoly Q x y a b
+/-- Taylor shifting `Q(X, p(X))` at `x` is the same as shifting `Q` in both
+variables and substituting the positive-order part of `p(X + x)`. -/
+private theorem taylor_composeY_toPoly_eq {F : Type*}
+ ... | {
"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_3fd8d6744785_0 | 489b7e568a4b3d83 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Univariate/Barycentric.lean | Barycentric | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 1 | [
{
"theorem_name": "BarycentricDomain.eval_eq_interpolate_eval",
"depth": 1,
"n_commands": 0,
"n_lines": 12,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n -- Unfold BarycentricDomain.eval and split on whether ∃ i, dom.nodes i = z.\n by_cases hz : ∃ ... | [
{
"name": "BarycentricDomain.eval_off_node_eq",
"text": "private theorem BarycentricDomain.eval_off_node_eq (dom : BarycentricDomain R n)\n (y : Fin n → R) (z : R) (hne : ∀ i : Fin n, z ≠ dom.nodes i) (hn : 0 < n) :\n (∑ i : Fin n, dom.weights i * y i * (z - dom.nodes i)⁻¹) /\n (∑ i : Fin n, dom.we... | [
{
"name": "BarycentricDomain.eval_eq_interpolate_eval",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 16,
"n_chars": 771,
"n_subproofs": 1,
"n_tactics": 18,
"cyclomatic": 3,
"n_automation": 4,
"n_rewrites": 1,
"n_structural": 4,
"automation_o... | 2 | /-
Copyright (c) 2025 CompPoly, Elias Judin, Harmonic. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Elias Judin, Aristotle (Harmonic)
-/
import Mathlib.LinearAlgebra.Lagrange
import CompPoly.Univariate.Lagrange
/-!
# Barycentric Interpolation
This file provides a *... | /-
Copyright (c) 2025 CompPoly, Elias Judin, Harmonic. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Elias Judin, Aristotle (Harmonic)
-/
import Mathlib.LinearAlgebra.Lagrange
import CompPoly.Univariate.Lagrange
/-!
# Barycentric Interpolation
This file provides a *... | @@ -102,6 +102,21 @@
/-! ### Equivalence with `Lagrange.interpolate` -/
+private theorem BarycentricDomain.eval_off_node_eq (dom : BarycentricDomain R n)
+ (y : Fin n → R) (z : R) (hne : ∀ i : Fin n, z ≠ dom.nodes i) (hn : 0 < n) :
+ (∑ i : Fin n, dom.weights i * y i * (z - dom.nodes i)⁻¹) /
+ (∑ i : Fin ... | {
"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_3fd8d6744785_1 | ceabba909ccf9e40 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Univariate/Barycentric.lean | Barycentric | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 1 | [
{
"theorem_name": "BarycentricDomain.ofPow_eval_eq_interpolatePow_eval",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [BarycentricDomain.eval_eq_cinterpolate_eval]\n rfl",
"n_chars": 60,
"n_sub... | [
{
"name": "BarycentricDomain.eval_eq_cinterpolate_eval",
"text": "/-- The barycentric evaluator equals\n`(CLagrange.interpolate Finset.univ dom.nodes y).eval z`. -/\ntheorem BarycentricDomain.eval_eq_cinterpolate_eval [BEq R] [LawfulBEq R]\n (dom : BarycentricDomain R n) (y : Fin n → R) (z : R) :\n do... | [
{
"name": "BarycentricDomain.ofPow_eval_eq_interpolatePow_eval",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 10,
"n_chars": 420,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 0,
"auto... | 1 | /-
Copyright (c) 2025 CompPoly, Elias Judin, Harmonic. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Elias Judin, Aristotle (Harmonic)
-/
import Mathlib.LinearAlgebra.Lagrange
import CompPoly.Univariate.Lagrange
/-!
# Barycentric Interpolation
This file provides a *... | /-
Copyright (c) 2025 CompPoly, Elias Judin, Harmonic. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Elias Judin, Aristotle (Harmonic)
-/
import Mathlib.LinearAlgebra.Lagrange
import CompPoly.Univariate.Lagrange
/-!
# Barycentric Interpolation
This file provides a *... | @@ -132,6 +132,15 @@
(fun i => Ne.symm (hz i)) (Nat.succ_pos n) using 1
simp [Lagrange.interpolate]
+/-- The barycentric evaluator equals
+`(CLagrange.interpolate Finset.univ dom.nodes y).eval z`. -/
+theorem BarycentricDomain.eval_eq_cinterpolate_eval [BEq R] [LawfulBEq R]
+ (dom : BarycentricDomain 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_e179eb17a3a8_0 | 1e7eaef2e76b3d66 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Bivariate/GuruswamiSudan/Root/ShiftedSubstitution/Lemmas.lean | Lemmas | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 1 | [
{
"theorem_name": "composeY_substituteYPolynomialPlusXPowerY",
"depth": 1,
"n_commands": 0,
"n_lines": 35,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n let q := f + CPolynomial.X ^ t * g\n let contribution : Nat → CBivariate F := fun y ↦\n let ... | [
{
"name": "shiftedSubstitutionCoeffTerm_sum",
"text": "/-- The univariate coefficient sum produced by one `Y`-coefficient in shifted\nsubstitution composes to the corresponding binomial expansion. -/\ntheorem shiftedSubstitutionCoeffTerm_sum {F : Type*}\n [Field F] [BEq F] [LawfulBEq F] [DecidableEq F]\n... | [
{
"name": "composeY_substituteYPolynomialPlusXPowerY",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 42,
"n_chars": 1722,
"n_subproofs": 1,
"n_tactics": 35,
"cyclomatic": 2,
"n_automation": 2,
"n_rewrites": 7,
"n_structural": 5,
"automation_o... | 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.Common.Lemmas
import CompPoly.Bivariate.GuruswamiSudan.Root.ShiftedSubstitution
/-!
# Shifted Substitution Lemm... | /-
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.Common.Lemmas
import CompPoly.Bivariate.GuruswamiSudan.Root.ShiftedSubstitution
/-!
# Shifted Substitution Lemm... | @@ -18,6 +18,28 @@
namespace GuruswamiSudan
+/-- The univariate coefficient sum produced by one `Y`-coefficient in shifted
+substitution composes to the corresponding binomial expansion. -/
+theorem shiftedSubstitutionCoeffTerm_sum {F : Type*}
+ [Field F] [BEq F] [LawfulBEq F] [DecidableEq F]
+ (coeffY f g :... | {
"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_5feefe22ea54_0 | 37bf4737ce382543 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Univariate/BatchEval/Correctness.lean | Correctness | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 8 | 1 | [
{
"theorem_name": "valid_leafFor",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro y hy\n simp at hy\n subst y\n exact eval_linearFactor x",
"n_chars": 67,
"n_subproofs": 0,
"n_tactics": ... | [
{
"name": "eval_linearFactor",
"text": "private theorem eval_linearFactor [Field R] [BEq R] [LawfulBEq R] (x : R) :\n (linearFactor x).eval x = 0 := by\n rw [eval_toPoly]\n simp [linearFactor, toPoly_add, X_toPoly, C_toPoly]\n\n",
"fan_in": 1,
"n_lines": 6,
"n_chars": 188,
"n_subproofs"... | [
{
"name": "valid_leafFor",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 8,
"n_chars": 167,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 2,
"automation_only": false,
"max_nesting":... | 1 | /-
Copyright (c) 2026 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Univariate.BatchEval.SubproductTree
import CompPoly.Univariate.ToPoly.Impl
/-!
# Batch Evaluation Correctness
Correctness theorems for univariate batch-ev... | /-
Copyright (c) 2026 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Univariate.BatchEval.SubproductTree
import CompPoly.Univariate.ToPoly.Impl
/-!
# Batch Evaluation Correctness
Correctness theorems for univariate batch-ev... | @@ -17,6 +17,11 @@
variable {R : Type*}
+private theorem eval_linearFactor [Field R] [BEq R] [LawfulBEq R] (x : R) :
+ (linearFactor x).eval x = 0 := by
+ rw [eval_toPoly]
+ simp [linearFactor, toPoly_add, X_toPoly, C_toPoly]
+
private theorem eval_modContext_eq_self_of_eval_eq_zero
[Field R] [BEq R] [L... | {
"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_5feefe22ea54_1 | 45df15d2d6c327a0 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Univariate/BatchEval/Correctness.lean | Correctness | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 8 | 1 | [
{
"theorem_name": "buildFromTrees_exists_of_length_le",
"depth": 1,
"n_commands": 0,
"n_lines": 28,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro fuel\n induction fuel with\n | zero =>\n intro trees hne hlen\n cases trees with\n ... | [
{
"name": "length_combinePairs_pair_le",
"text": "private theorem length_combinePairs_pair_le [Field R] [BEq R] [LawfulBEq R]\n (M : MulContext R) (left right : SubproductTree R)\n (rest : List (SubproductTree R)) :\n (combinePairs M (left :: right :: rest)).length ≤ rest.length + 1 := by\n simpa ... | [
{
"name": "buildFromTrees_exists_of_length_le",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 33,
"n_chars": 1293,
"n_subproofs": 4,
"n_tactics": 28,
"cyclomatic": 6,
"n_automation": 9,
"n_rewrites": 0,
"n_structural": 10,
"automation_only": ... | 1 | /-
Copyright (c) 2026 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Univariate.BatchEval.SubproductTree
import CompPoly.Univariate.ToPoly.Impl
/-!
# Batch Evaluation Correctness
Correctness theorems for univariate batch-ev... | /-
Copyright (c) 2026 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Univariate.BatchEval.SubproductTree
import CompPoly.Univariate.ToPoly.Impl
/-!
# Batch Evaluation Correctness
Correctness theorems for univariate batch-ev... | @@ -107,6 +107,12 @@
Nat.succ_le_succ
(Nat.le_trans (length_combinePairs_le M rest) (Nat.le_succ rest.length))
+private theorem length_combinePairs_pair_le [Field R] [BEq R] [LawfulBEq R]
+ (M : MulContext R) (left right : SubproductTree R)
+ (rest : List (SubproductTree R)) :
+ (combineP... | {
"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_5feefe22ea54_2 | 21ad03c54206d893 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Univariate/BatchEval/Correctness.lean | Correctness | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 8 | 1 | [
{
"theorem_name": "buildList_exists_of_nonempty",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hleaves : 0 < (xs.map leafFor).length := by\n simpa using hxs\n simpa [buildList] using\n buildFro... | [
{
"name": "buildFromTrees_exists_of_length_le",
"text": "private theorem buildFromTrees_exists_of_length_le [Field R] [BEq R] [LawfulBEq R]\n (M : MulContext R) :\n ∀ (fuel : ℕ) (trees : List (SubproductTree R)), 0 < trees.length →\n trees.length ≤ fuel + 1 → ∃ tree, buildFromTrees M fuel trees =... | [
{
"name": "buildList_exists_of_nonempty",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 10,
"n_chars": 395,
"n_subproofs": 1,
"n_tactics": 6,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,
... | 2 | /-
Copyright (c) 2026 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Univariate.BatchEval.SubproductTree
import CompPoly.Univariate.ToPoly.Impl
/-!
# Batch Evaluation Correctness
Correctness theorems for univariate batch-ev... | /-
Copyright (c) 2026 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Univariate.BatchEval.SubproductTree
import CompPoly.Univariate.ToPoly.Impl
/-!
# Batch Evaluation Correctness
Correctness theorems for univariate batch-ev... | @@ -123,9 +123,46 @@
| _ :: _ :: _, _ => by
simp [combinePairs]
+private theorem buildFromTrees_exists_of_length_le [Field R] [BEq R] [LawfulBEq R]
+ (M : MulContext R) :
+ ∀ (fuel : ℕ) (trees : List (SubproductTree R)), 0 < trees.length →
+ trees.length ≤ fuel + 1 → ∃ tree, buildFromTrees M fuel... | {
"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_5feefe22ea54_3 | 7c8b3bce61a040f2 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Univariate/BatchEval/Correctness.lean | Correctness | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 8 | 1 | [
{
"theorem_name": "buildList_valid_points",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h :=\n buildFromTrees_valid_points M (xs.map leafFor).length (xs.map leafFor) tree\n (by simpa [buildLi... | [
{
"name": "buildFromTrees_valid_points",
"text": "private theorem buildFromTrees_valid_points [Field R] [BEq R] [LawfulBEq R]\n (M : MulContext R) :\n ∀ (fuel : ℕ) (trees : List (SubproductTree R)) (tree : SubproductTree R),\n buildFromTrees M fuel trees = some tree → List.Forall isValid trees →\... | [
{
"name": "buildList_valid_points",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 10,
"n_chars": 438,
"n_subproofs": 1,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": false,
"max... | 1 | /-
Copyright (c) 2026 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Univariate.BatchEval.SubproductTree
import CompPoly.Univariate.ToPoly.Impl
/-!
# Batch Evaluation Correctness
Correctness theorems for univariate batch-ev... | /-
Copyright (c) 2026 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Univariate.BatchEval.SubproductTree
import CompPoly.Univariate.ToPoly.Impl
/-!
# Batch Evaluation Correctness
Correctness theorems for univariate batch-ev... | @@ -130,10 +130,56 @@
| _ :: xs => by
simp [pointsList, points, leafFor, pointsList_map_leafFor xs]
+private theorem buildFromTrees_valid_points [Field R] [BEq R] [LawfulBEq R]
+ (M : MulContext R) :
+ ∀ (fuel : ℕ) (trees : List (SubproductTree R)) (tree : SubproductTree R),
+ buildFromTrees M fu... | {
"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_5feefe22ea54_4 | 2e8e23d320421358 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Univariate/BatchEval/Correctness.lean | Correctness | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 8 | 1 | [
{
"theorem_name": "buildArray_valid_points",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n exact buildList_valid_points M (by simpa [buildArray] using hbuild)",
"n_chars": 73,
"n_subproofs": 0,
... | [
{
"name": "buildList_valid_points",
"text": "private theorem buildList_valid_points [Field R] [BEq R] [LawfulBEq R]\n (M : MulContext R) {xs : List R} {tree : SubproductTree R}\n (hbuild : buildList M xs = some tree) :\n isValid tree ∧ points tree = xs := by\n have h :=\n buildFromTrees_valid_p... | [
{
"name": "buildArray_valid_points",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 7,
"n_chars": 303,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": false,
"max... | 2 | /-
Copyright (c) 2026 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Univariate.BatchEval.SubproductTree
import CompPoly.Univariate.ToPoly.Impl
/-!
# Batch Evaluation Correctness
Correctness theorems for univariate batch-ev... | /-
Copyright (c) 2026 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Univariate.BatchEval.SubproductTree
import CompPoly.Univariate.ToPoly.Impl
/-!
# Batch Evaluation Correctness
Correctness theorems for univariate batch-ev... | @@ -172,10 +172,20 @@
exact ⟨hnext.1,
hnext.2.trans (pointsList_combinePairs M (head :: second :: rest))⟩
+private theorem buildList_valid_points [Field R] [BEq R] [LawfulBEq R]
+ (M : MulContext R) {xs : List R} {tree : SubproductTree R}
+ (hbuild : buildList M xs = some tree) :... | {
"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_5feefe22ea54_5 | 7a3fd60489adf733 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Univariate/BatchEval/Correctness.lean | Correctness | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 8 | 1 | [
{
"theorem_name": "buildArray_valid_points",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n exact buildList_valid_points M (by simpa [buildArray] using hbuild)",
"n_chars": 73,
"n_subproofs": 0,
... | [
{
"name": "buildList_valid_points",
"text": "private theorem buildList_valid_points [Field R] [BEq R] [LawfulBEq R]\n (M : MulContext R) {xs : List R} {tree : SubproductTree R}\n (hbuild : buildList M xs = some tree) :\n isValid tree ∧ points tree = xs := by\n have h :=\n buildFromTrees_valid_p... | [
{
"name": "evalBatchSubproduct_eq_evalBatch",
"fan_in": 0,
"n_deps_direct": 3,
"n_deps_transitive": 9,
"n_lines": 23,
"n_chars": 1014,
"n_subproofs": 5,
"n_tactics": 18,
"cyclomatic": 3,
"n_automation": 4,
"n_rewrites": 1,
"n_structural": 5,
"automation_only": fal... | 7 | /-
Copyright (c) 2026 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Univariate.BatchEval.SubproductTree
import CompPoly.Univariate.ToPoly.Impl
/-!
# Batch Evaluation Correctness
Correctness theorems for univariate batch-ev... | /-
Copyright (c) 2026 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Univariate.BatchEval.SubproductTree
import CompPoly.Univariate.ToPoly.Impl
/-!
# Batch Evaluation Correctness
Correctness theorems for univariate batch-ev... | @@ -219,10 +219,20 @@
exact ⟨hnext.1,
hnext.2.trans (pointsList_combinePairs M (head :: second :: rest))⟩
+private theorem buildList_valid_points [Field R] [BEq R] [LawfulBEq R]
+ (M : MulContext R) {xs : List R} {tree : SubproductTree R}
+ (hbuild : buildList M xs = some tree) :... | {
"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_11e0022718bd_0 | b77db71d36a78298 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Data/Fin/BigOperators.lean | BigOperators | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 1 | [
{
"theorem_name": "Fin.lt_iff_le_pred",
"depth": 1,
"n_commands": 0,
"n_lines": 9,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h_b_sub_1 : (b - 1).val = b.val - 1 := Fin.val_sub_one (a := b) (h_a_sub_1 := h_b)\n constructor\n · intro h\n ... | [
{
"name": "Fin.val_sub_one",
"text": "lemma Fin.val_sub_one (a : Fin r) (h_a_sub_1 : a > 0) : (a - 1).val = a.val - 1 := by\n rw [Fin.val_sub_one_of_ne_zero (by omega)] -- can use Fin.sub_val_of_le\n\n",
"fan_in": 1,
"n_lines": 4,
"n_chars": 161,
"n_subproofs": 0,
"n_tactics": 2,
"c... | [
{
"name": "Fin.lt_iff_le_pred",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 11,
"n_chars": 294,
"n_subproofs": 1,
"n_tactics": 9,
"cyclomatic": 2,
"n_automation": 2,
"n_rewrites": 0,
"n_structural": 5,
"automation_only": false,
"max_nes... | 1 | /-
Copyright (c) 2025 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Chung Thai Nguyen, Quang Dao
-/
import Mathlib.Algebra.Order.Star.Basic
import Mathlib.Algebra.Ring.Regular
import Mathlib.Data.Fintype.BigOperators
import Mathlib.Order.Interval.Finset.Nat
... | /-
Copyright (c) 2025 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Chung Thai Nguyen, Quang Dao
-/
import Mathlib.Algebra.Order.Star.Basic
import Mathlib.Algebra.Ring.Regular
import Mathlib.Data.Fintype.BigOperators
import Mathlib.Order.Interval.Finset.Nat
... | @@ -23,8 +23,11 @@
subst h_eq
rfl
+lemma Fin.val_sub_one (a : Fin r) (h_a_sub_1 : a > 0) : (a - 1).val = a.val - 1 := by
+ rw [Fin.val_sub_one_of_ne_zero (by omega)] -- can use Fin.sub_val_of_le
+
lemma Fin.lt_iff_le_pred (a b : Fin r) (h_b : b > 0) : a < b ↔ a ≤ b - 1 := by
- have h_b_sub_1 : (b - 1).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_11e0022718bd_1 | 7036b41f07da6ef5 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Data/Fin/BigOperators.lean | BigOperators | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 1 | [
{
"theorem_name": "Fin.le_succ",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n apply Fin.le_of_lt\n exact Fin.lt_succ' (a := a) (h_a_add_1 := h_a_add_1)",
"n_chars": 79,
"n_subproofs": 0,
"n_ta... | [
{
"name": "Fin.lt_succ'",
"text": "lemma Fin.lt_succ' (a : Fin r) (h_a_add_1 : a + 1 < r) : a < a + 1 := by\n apply Fin.mk_lt_of_lt_val\n rw [Fin.val_add_one' (a := a) (h_a_add_1 := h_a_add_1)]\n exact Nat.lt_succ_self a.val\n\n",
"fan_in": 1,
"n_lines": 6,
"n_chars": 191,
"n_subproofs": ... | [
{
"name": "Fin.le_succ",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 5,
"n_chars": 151,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 2,
"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: Chung Thai Nguyen, Quang Dao
-/
import Mathlib.Algebra.Order.Star.Basic
import Mathlib.Algebra.Ring.Regular
import Mathlib.Data.Fintype.BigOperators
import Mathlib.Order.Interval.Finset.Nat
... | /-
Copyright (c) 2025 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Chung Thai Nguyen, Quang Dao
-/
import Mathlib.Algebra.Order.Star.Basic
import Mathlib.Algebra.Ring.Regular
import Mathlib.Data.Fintype.BigOperators
import Mathlib.Order.Interval.Finset.Nat
... | @@ -23,8 +23,15 @@
subst h_eq
rfl
-lemma Fin.le_succ (a : Fin r) (h_a_add_1 : a + 1 < r) : a ≤ a + 1 := sorry
+lemma Fin.lt_succ' (a : Fin r) (h_a_add_1 : a + 1 < r) : a < a + 1 := by
+ apply Fin.mk_lt_of_lt_val
+ rw [Fin.val_add_one' (a := a) (h_a_add_1 := h_a_add_1)]
+ exact Nat.lt_succ_self a.val
+lemma... | {
"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_11e0022718bd_2 | 06eb0f018b51876a | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Data/Fin/BigOperators.lean | BigOperators | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 1 | [
{
"theorem_name": "Fin.sum_univ_pow_two_even_add_odd",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [show (2 ^ (n + 1) : ℕ) = 2 * 2 ^ n from by rw [pow_succ, Nat.mul_comm]]\n exact (Fin.sum_univ_split_... | [
{
"name": "Fin.sum_univ_split_even_add_odd",
"text": "/--\nSplits a sum over `Fin (2 * r)` into a sum over even indices and a sum over odd indices.\nUseful for Fast Fourier Transform (FFT) type recursions.\n-/\ntheorem Fin.sum_univ_split_even_add_odd {r : ℕ} {M : Type*} [AddCommMonoid M]\n (f : Fin (2 * ... | [
{
"name": "Fin.sum_univ_pow_two_even_add_odd",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 8,
"n_chars": 463,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 3,
"n_structural": 1,
"automation_only": false... | 1 | /-
Copyright (c) 2025 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Chung Thai Nguyen, Quang Dao
-/
import Mathlib.Algebra.Order.Star.Basic
import Mathlib.Algebra.Ring.Regular
import Mathlib.Data.Fintype.BigOperators
import Mathlib.Order.Interval.Finset.Nat
... | /-
Copyright (c) 2025 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Chung Thai Nguyen, Quang Dao
-/
import Mathlib.Algebra.Order.Star.Basic
import Mathlib.Algebra.Ring.Regular
import Mathlib.Data.Fintype.BigOperators
import Mathlib.Order.Interval.Finset.Nat
... | @@ -88,10 +88,64 @@
· simp [i_next]
termination_by (r - 1 - i.val)
+/--
+Splits a sum over `Fin (2 * r)` into a sum over even indices and a sum over odd indices.
+Useful for Fast Fourier Transform (FFT) type recursions.
+-/
+theorem Fin.sum_univ_split_even_add_odd {r : ℕ} {M : Type*} [AddCommMonoid M]
+ (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_4727ed4bcbbb_0 | bfbeb9f31711bbd6 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Data/Array/Lemmas.lean | Lemmas | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 1 | [
{
"theorem_name": "rightpad_getElem_eq_getD",
"depth": 1,
"n_commands": 0,
"n_lines": 9,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp_rw [rightpad_toList] at h ⊢\n -- By definition of `rightpad`, the element at position `i` in the right-padde... | [
{
"name": "rightpad_toList",
"text": "lemma rightpad_toList {a : Array α} {n : Nat} {unit : α} :\n a.rightpad n unit = mk (a.toList.rightpad n unit) := by\n induction h : a.toList with\n | nil => simp_all\n | cons hd tl ih => simp_all [size_eq_length_toList]\n\n",
"fan_in": 1,
"n_lines": 7,
... | [
{
"name": "rightpad_getElem_eq_getD",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 12,
"n_chars": 527,
"n_subproofs": 1,
"n_tactics": 6,
"cyclomatic": 2,
"n_automation": 2,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": false,
"m... | 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
-/
import CompPoly.Data.List.Lemmas
import Mathlib.Algebra.Order.Ring.Nat
import Mathlib.Algebra.Order.Star.Basic
import Mathlib.Data.Nat.Log
/-!
# Auxiliary... | /-
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
-/
import CompPoly.Data.List.Lemmas
import Mathlib.Algebra.Order.Ring.Nat
import Mathlib.Algebra.Order.Star.Basic
import Mathlib.Data.Nat.Log
/-!
# Auxiliary... | @@ -37,8 +37,22 @@
def toNum {R : Type _} [Zero R] [DecidableEq R] (a : Array R) : ℕ :=
(a.map (fun r => if r = 0 then 0 else 1)).reverse.foldl (fun acc elem => (acc * 2) + elem) 0
+lemma rightpad_toList {a : Array α} {n : Nat} {unit : α} :
+ a.rightpad n unit = mk (a.toList.rightpad n unit) := by
+ induction... | {
"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_4727ed4bcbbb_1 | 55dea16525b5eecb | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Data/Array/Lemmas.lean | Lemmas | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 1 | [
{
"theorem_name": "findIdxRev?_empty_none",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [h]\n apply findIdxRev?_eq_none\n simp",
"n_chars": 47,
"n_subproofs": 0,
"n_tactics": 4,
"cycl... | [
{
"name": "findIdxRev?_eq_none",
"text": "/-- if the condition is false on all elements, then findIdxRev? finds nothing -/\nlemma findIdxRev?_eq_none {cond} {as : Array α} (h : ∀ i, (hi : i < as.size) → ¬ cond as[i]) :\n findIdxRev? cond as = none := by\n apply aux\nwhere\n aux i : findIdxRev?.find con... | [
{
"name": "findIdxRev?_empty_none",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 7,
"n_chars": 151,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false,
"max_... | 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
-/
import CompPoly.Data.List.Lemmas
import Mathlib.Algebra.Order.Ring.Nat
import Mathlib.Algebra.Order.Star.Basic
import Mathlib.Data.Nat.Log
/-!
# Auxiliary... | /-
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
-/
import CompPoly.Data.List.Lemmas
import Mathlib.Algebra.Order.Ring.Nat
import Mathlib.Algebra.Order.Star.Basic
import Mathlib.Data.Nat.Log
/-!
# Auxiliary... | @@ -60,8 +60,29 @@
else
find ⟨ i, Nat.lt_of_succ_lt h ⟩
+/-- if the condition is false on all elements, then findIdxRev? finds nothing -/
+lemma findIdxRev?_eq_none {cond} {as : Array α} (h : ∀ i, (hi : i < as.size) → ¬ cond as[i]) :
+ findIdxRev? cond as = none := by
+ apply aux
+where
+ aux 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_1bec5d2bdacd_5 | cd7bf80fcad371b5 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Data/Polynomial/Frobenius.lean | Frobenius | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 9 | 1 | [
{
"theorem_name": "aeval_pow_card_pow_eq_aeval_pow_card_pow",
"depth": 1,
"n_commands": 0,
"n_lines": 16,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n let q := Fintype.card Fq\n induction n with\n | zero =>\n simp only [pow_zero, pow_one]\n |... | [
{
"name": "aeval_pow_card_eq_aeval_pow_card",
"text": "/--\nFrobenius endomorphism interaction with polynomial evaluation.\n(aeval x f)^|Fq| = aeval (x^|Fq|) f\n-/\ntheorem aeval_pow_card_eq_aeval_pow_card {Fq K : Type*} [Field Fq] [Fintype Fq]\n [CommRing K] [Algebra Fq K] [Fact (Nat.Prime (ringChar Fq)... | [
{
"name": "irreducible_dvd_X_pow_sub_X_iff_natDegree_dvd",
"fan_in": 0,
"n_deps_direct": 3,
"n_deps_transitive": 7,
"n_lines": 18,
"n_chars": 725,
"n_subproofs": 1,
"n_tactics": 8,
"cyclomatic": 2,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 6,
"automation... | 7 | /-
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.Data.Nat.Bitwise
import Mathlib.Algebra.Lie.OfAssociative
import Mathlib.FieldTheory.Finite.Basic
import Mathlib.RingTheory.H... | /-
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.Data.Nat.Bitwise
import Mathlib.Algebra.Lie.OfAssociative
import Mathlib.FieldTheory.Finite.Basic
import Mathlib.RingTheory.H... | @@ -75,6 +75,36 @@
variable {L : Type*} [CommRing L] [Algebra Fq L] [Nontrivial L]
/--
+Frobenius endomorphism interaction with polynomial evaluation.
+(aeval x f)^|Fq| = aeval (x^|Fq|) f
+-/
+theorem aeval_pow_card_eq_aeval_pow_card {Fq K : Type*} [Field Fq] [Fintype Fq]
+ [CommRing K] [Algebra Fq K] [Fact (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_d9307c5ec788_0 | 31eec9794f65c79d | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/ToMathlib/Polynomial/BivariateDegree.lean | BivariateDegree | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 11 | 1 | [
{
"theorem_name": "leadingCoeffY_ne_zero",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n exact not_congr (leadingCoeffY_eq_zero (f := f))",
"n_chars": 54,
"n_subproofs": 0,
"n_tactics": 2,
"... | [
{
"name": "leadingCoeffY_eq_zero",
"text": "/-- The polynomial coefficient of the highest power of `Y` is `0` if and only if the bivariate\npolynomial is the zero polynomial. -/\n@[simp, grind =]\ntheorem leadingCoeffY_eq_zero (f : F[X][Y]) : leadingCoeffY f = 0 ↔ f = 0 := by\n simp [leadingCoeffY]\n\n",
... | [
{
"name": "leadingCoeffY_ne_zero",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 7,
"n_chars": 279,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": false,
"max_n... | 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.Bivariate.ToPoly
import Aesop
import Mathlib.Algebra.BigOperators.Group.Finset.Basic
import Mathlib.Algebra.Polynomial.BigOperators
import Mathlib.Algebra.Polyn... | /-
Copyright (c) 2026 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import CompPoly.Bivariate.ToPoly
import Aesop
import Mathlib.Algebra.BigOperators.Group.Finset.Basic
import Mathlib.Algebra.Polynomial.BigOperators
import Mathlib.Algebra.Polyn... | @@ -46,10 +46,17 @@
def leadingCoeffY (f : F[X][Y]) : F[X] :=
f.coeff (natDegree f)
+/-- The polynomial coefficient of the highest power of `Y` is `0` if and only if the bivariate
+polynomial is the zero polynomial. -/
+@[simp, grind =]
+theorem leadingCoeffY_eq_zero (f : F[X][Y]) : leadingCoeffY f = 0 ↔ f = 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_d9307c5ec788_1 | 68613bb7cf2467a3 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/ToMathlib/Polynomial/BivariateDegree.lean | BivariateDegree | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 11 | 1 | [
{
"theorem_name": "weightedDegree_eq_natWeightedDegree",
"depth": 1,
"n_commands": 0,
"n_lines": 20,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n by_cases hf : f = 0\n · simp [hf, weightedDegree, natWeightedDegree]\n · let w : ℕ → ℕ := fun n => u... | [
{
"name": "natWeightedDegree_mem_weight_list",
"text": "theorem natWeightedDegree_mem_weight_list {u v : ℕ} :\n natWeightedDegree f u v ∈\n List.map (fun n => u * (f.coeff n).natDegree + v * n)\n (List.range f.natDegree.succ) := by\n classical\n by_cases hf : f = 0\n · simp [hf, natWeighte... | [
{
"name": "weightedDegree_eq_natWeightedDegree",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 24,
"n_chars": 1051,
"n_subproofs": 4,
"n_tactics": 20,
"cyclomatic": 2,
"n_automation": 4,
"n_rewrites": 0,
"n_structural": 7,
"automation_only": ... | 2 | /-
Copyright (c) 2026 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import CompPoly.Bivariate.ToPoly
import Aesop
import Mathlib.Algebra.BigOperators.Group.Finset.Basic
import Mathlib.Algebra.Polynomial.BigOperators
import Mathlib.Algebra.Polyn... | /-
Copyright (c) 2026 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import CompPoly.Bivariate.ToPoly
import Aesop
import Mathlib.Algebra.BigOperators.Group.Finset.Basic
import Mathlib.Algebra.Polynomial.BigOperators
import Mathlib.Algebra.Polyn... | @@ -83,6 +83,30 @@
variable {f : F[X][Y]}
+theorem natWeightedDegree_mem_weight_list {u v : ℕ} :
+ natWeightedDegree f u v ∈
+ List.map (fun n => u * (f.coeff n).natDegree + v * n)
+ (List.range f.natDegree.succ) := by
+ classical
+ by_cases hf : f = 0
+ · simp [hf, natWeightedDegree]
+ · have h... | {
"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_d9307c5ec788_2 | d4387abba5e635b3 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/ToMathlib/Polynomial/BivariateDegree.lean | BivariateDegree | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 11 | 4 | [
{
"theorem_name": "degreeX_mul_le",
"depth": 1,
"n_commands": 0,
"n_lines": 15,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n classical\n unfold degreeX\n refine Finset.sup_le ?_\n intro k hk\n rw [Polynomial.coeff_mul]\n refine Polynomial.natD... | [
{
"name": "coeff_natDegree_le_degreeX",
"text": "theorem coeff_natDegree_le_degreeX (f : F[X][Y]) (n : ℕ) : (f.coeff n).natDegree ≤ degreeX f := by\n classical\n unfold degreeX\n by_cases hn : n ∈ f.support\n · exact Finset.le_sup (s := f.support) (f := fun m => (f.coeff m).natDegree) hn\n · have hcoef... | [
{
"name": "degreeX_mul_le",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 17,
"n_chars": 661,
"n_subproofs": 2,
"n_tactics": 15,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 2,
"n_structural": 5,
"automation_only": false,
"max_nestin... | 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.Bivariate.ToPoly
import Aesop
import Mathlib.Algebra.BigOperators.Group.Finset.Basic
import Mathlib.Algebra.Polynomial.BigOperators
import Mathlib.Algebra.Polyn... | /-
Copyright (c) 2026 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import CompPoly.Bivariate.ToPoly
import Aesop
import Mathlib.Algebra.BigOperators.Group.Finset.Basic
import Mathlib.Algebra.Polynomial.BigOperators
import Mathlib.Algebra.Polyn... | @@ -194,6 +194,15 @@
natDegreeY (f * g) = natDegreeY f + natDegreeY g := by
simpa [natDegreeY] using (Polynomial.natDegree_mul hf hg)
+theorem coeff_natDegree_le_degreeX (f : F[X][Y]) (n : ℕ) : (f.coeff n).natDegree ≤ degreeX f := by
+ classical
+ unfold degreeX
+ by_cases hn : n ∈ f.support
+ · exact Fin... | {
"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_d9307c5ec788_3 | d51e57894a9cbbd6 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/ToMathlib/Polynomial/BivariateDegree.lean | BivariateDegree | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 11 | 4 | [
{
"theorem_name": "degreeX_mul_le",
"depth": 1,
"n_commands": 0,
"n_lines": 15,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n classical\n unfold degreeX\n refine Finset.sup_le ?_\n intro k hk\n rw [Polynomial.coeff_mul]\n refine Polynomial.natD... | [
{
"name": "coeff_natDegree_le_degreeX",
"text": "theorem coeff_natDegree_le_degreeX (f : F[X][Y]) (n : ℕ) : (f.coeff n).natDegree ≤ degreeX f := by\n classical\n unfold degreeX\n by_cases hn : n ∈ f.support\n · exact Finset.le_sup (s := f.support) (f := fun m => (f.coeff m).natDegree) hn\n · have hcoef... | [
{
"name": "exists_max_index_degreeX",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 51,
"n_chars": 2206,
"n_subproofs": 16,
"n_tactics": 44,
"cyclomatic": 1,
"n_automation": 10,
"n_rewrites": 0,
"n_structural": 12,
"automation_only": false,
... | 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.Bivariate.ToPoly
import Aesop
import Mathlib.Algebra.BigOperators.Group.Finset.Basic
import Mathlib.Algebra.Polynomial.BigOperators
import Mathlib.Algebra.Polyn... | /-
Copyright (c) 2026 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import CompPoly.Bivariate.ToPoly
import Aesop
import Mathlib.Algebra.BigOperators.Group.Finset.Basic
import Mathlib.Algebra.Polynomial.BigOperators
import Mathlib.Algebra.Polyn... | @@ -194,6 +194,15 @@
natDegreeY (f * g) = natDegreeY f + natDegreeY g := by
simpa [natDegreeY] using (Polynomial.natDegree_mul hf hg)
+theorem coeff_natDegree_le_degreeX (f : F[X][Y]) (n : ℕ) : (f.coeff n).natDegree ≤ degreeX f := by
+ classical
+ unfold degreeX
+ by_cases hn : n ∈ f.support
+ · exact Fin... | {
"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_d9307c5ec788_4 | 4dcb937be3554b3a | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/ToMathlib/Polynomial/BivariateDegree.lean | BivariateDegree | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 11 | 4 | [
{
"theorem_name": "degreeX_mul_le",
"depth": 1,
"n_commands": 0,
"n_lines": 15,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n classical\n unfold degreeX\n refine Finset.sup_le ?_\n intro k hk\n rw [Polynomial.coeff_mul]\n refine Polynomial.natD... | [
{
"name": "coeff_natDegree_le_degreeX",
"text": "theorem coeff_natDegree_le_degreeX (f : F[X][Y]) (n : ℕ) : (f.coeff n).natDegree ≤ degreeX f := by\n classical\n unfold degreeX\n by_cases hn : n ∈ f.support\n · exact Finset.le_sup (s := f.support) (f := fun m => (f.coeff m).natDegree) hn\n · have hcoef... | [
{
"name": "degreeX_mul_ge",
"fan_in": 1,
"n_deps_direct": 3,
"n_deps_transitive": 3,
"n_lines": 104,
"n_chars": 4620,
"n_subproofs": 33,
"n_tactics": 101,
"cyclomatic": 9,
"n_automation": 19,
"n_rewrites": 0,
"n_structural": 15,
"automation_only": false,
"max_... | 3 | /-
Copyright (c) 2026 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import CompPoly.Bivariate.ToPoly
import Aesop
import Mathlib.Algebra.BigOperators.Group.Finset.Basic
import Mathlib.Algebra.Polynomial.BigOperators
import Mathlib.Algebra.Polyn... | /-
Copyright (c) 2026 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import CompPoly.Bivariate.ToPoly
import Aesop
import Mathlib.Algebra.BigOperators.Group.Finset.Basic
import Mathlib.Algebra.Polynomial.BigOperators
import Mathlib.Algebra.Polyn... | @@ -194,6 +194,15 @@
natDegreeY (f * g) = natDegreeY f + natDegreeY g := by
simpa [natDegreeY] using (Polynomial.natDegree_mul hf hg)
+theorem coeff_natDegree_le_degreeX (f : F[X][Y]) (n : ℕ) : (f.coeff n).natDegree ≤ degreeX f := by
+ classical
+ unfold degreeX
+ by_cases hn : n ∈ f.support
+ · exact Fin... | {
"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_d9307c5ec788_5 | 0717e4d690a7bc90 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/ToMathlib/Polynomial/BivariateDegree.lean | BivariateDegree | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 11 | 4 | [
{
"theorem_name": "degreeX_mul_le",
"depth": 1,
"n_commands": 0,
"n_lines": 15,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n classical\n unfold degreeX\n refine Finset.sup_le ?_\n intro k hk\n rw [Polynomial.coeff_mul]\n refine Polynomial.natD... | [
{
"name": "coeff_natDegree_le_degreeX",
"text": "theorem coeff_natDegree_le_degreeX (f : F[X][Y]) (n : ℕ) : (f.coeff n).natDegree ≤ degreeX f := by\n classical\n unfold degreeX\n by_cases hn : n ∈ f.support\n · exact Finset.le_sup (s := f.support) (f := fun m => (f.coeff m).natDegree) hn\n · have hcoef... | [
{
"name": "degreeX_mul",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 5,
"n_lines": 5,
"n_chars": 200,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": false,
"max_nesting": 2... | 5 | /-
Copyright (c) 2026 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import CompPoly.Bivariate.ToPoly
import Aesop
import Mathlib.Algebra.BigOperators.Group.Finset.Basic
import Mathlib.Algebra.Polynomial.BigOperators
import Mathlib.Algebra.Polyn... | /-
Copyright (c) 2026 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import CompPoly.Bivariate.ToPoly
import Aesop
import Mathlib.Algebra.BigOperators.Group.Finset.Basic
import Mathlib.Algebra.Polynomial.BigOperators
import Mathlib.Algebra.Polyn... | @@ -194,6 +194,15 @@
natDegreeY (f * g) = natDegreeY f + natDegreeY g := by
simpa [natDegreeY] using (Polynomial.natDegree_mul hf hg)
+theorem coeff_natDegree_le_degreeX (f : F[X][Y]) (n : ℕ) : (f.coeff n).natDegree ≤ degreeX f := by
+ classical
+ unfold degreeX
+ by_cases hn : n ∈ f.support
+ · exact Fin... | {
"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_d9307c5ec788_6 | 3a79a8e3d6ee59bd | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/ToMathlib/Polynomial/BivariateDegree.lean | BivariateDegree | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 11 | 4 | [
{
"theorem_name": "evalY_eq_evalX_swap",
"depth": 1,
"n_commands": 0,
"n_lines": 21,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n classical\n letI : Algebra F[X] F[X] := Polynomial.algebra (R := F) (A := F)\n have eval_eq_aeval : Polynomial.eval ... | [
{
"name": "evalX_eq_map",
"text": "lemma evalX_eq_map (x : F) (f : F[X][Y]) :\n Polynomial.Bivariate.evalX x f = f.map (Polynomial.evalRingHom x) := by\n classical\n ext n\n simp [Polynomial.Bivariate.evalX, Polynomial.toFinsupp_apply]\n\n",
"fan_in": 4,
"n_lines": 7,
"n_chars": 204,
"... | [
{
"name": "evalY_eq_evalX_swap",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 25,
"n_chars": 1107,
"n_subproofs": 2,
"n_tactics": 21,
"cyclomatic": 1,
"n_automation": 3,
"n_rewrites": 0,
"n_structural": 6,
"automation_only": false,
"max_... | 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.Bivariate.ToPoly
import Aesop
import Mathlib.Algebra.BigOperators.Group.Finset.Basic
import Mathlib.Algebra.Polynomial.BigOperators
import Mathlib.Algebra.Polyn... | /-
Copyright (c) 2026 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import CompPoly.Bivariate.ToPoly
import Aesop
import Mathlib.Algebra.BigOperators.Group.Finset.Basic
import Mathlib.Algebra.Polynomial.BigOperators
import Mathlib.Algebra.Polyn... | @@ -208,6 +208,12 @@
variable [CommSemiring F]
+lemma evalX_eq_map (x : F) (f : F[X][Y]) :
+ Polynomial.Bivariate.evalX x f = f.map (Polynomial.evalRingHom x) := by
+ classical
+ ext n
+ simp [Polynomial.Bivariate.evalX, Polynomial.toFinsupp_apply]
+
end CommSemiring
section CommRing
@@ -216,7 +222,27 @@... | {
"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_d9307c5ec788_7 | 298de728afeb390e | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/ToMathlib/Polynomial/BivariateDegree.lean | BivariateDegree | 7 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 11 | 1 | [
{
"theorem_name": "natDegreeY_swap",
"depth": 1,
"n_commands": 0,
"n_lines": 14,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n classical\n have h := degreeX_swap (F := F) (f := Polynomial.Bivariate.swap f)\n have hs : Polynomial.Bivariate.swap (R ... | [
{
"name": "degreeX_swap",
"text": "lemma degreeX_swap (f : F[X][Y]) :\n Polynomial.Bivariate.degreeX (Polynomial.Bivariate.swap f) =\n Polynomial.Bivariate.natDegreeY f := by\n classical\n have hcoeff :\n ∀ (g : F[X][Y]) (i j : ℕ),\n Polynomial.Bivariate.coeff (Polynomial.Bivariate.swa... | [
{
"name": "natDegreeY_swap",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 18,
"n_chars": 821,
"n_subproofs": 4,
"n_tactics": 14,
"cyclomatic": 1,
"n_automation": 3,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": false,
"max_nesti... | 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.Bivariate.ToPoly
import Aesop
import Mathlib.Algebra.BigOperators.Group.Finset.Basic
import Mathlib.Algebra.Polynomial.BigOperators
import Mathlib.Algebra.Polyn... | /-
Copyright (c) 2026 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import CompPoly.Bivariate.ToPoly
import Aesop
import Mathlib.Algebra.BigOperators.Group.Finset.Basic
import Mathlib.Algebra.Polynomial.BigOperators
import Mathlib.Algebra.Polyn... | @@ -214,9 +214,105 @@
variable [CommRing F]
+lemma degreeX_swap (f : F[X][Y]) :
+ Polynomial.Bivariate.degreeX (Polynomial.Bivariate.swap f) =
+ Polynomial.Bivariate.natDegreeY f := by
+ classical
+ have hcoeff :
+ ∀ (g : F[X][Y]) (i j : ℕ),
+ Polynomial.Bivariate.coeff (Polynomial.Bivariate.... | {
"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.