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_a18f874f7d49_1 | 5f84698d4eb94480 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/LinearAlgebra/Dense/KernelInPlaceCorrectness.lean | KernelInPlaceCorrectness | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 13 | 1 | [
{
"theorem_name": "scaleRowData_eq",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h := foldl_scale_self_eq_const M.cols r factor M.data (List.range' 0 M.cols)\n (List.nodup_range' (s := 0) (n := M.... | [
{
"name": "foldl_scale_self_eq_const",
"text": "/-- A self-reading scale fold equals the constant-reading scale fold, as long as\nthe accumulator still agrees with the original array on the entries it reads. -/\nprivate theorem foldl_scale_self_eq_const [Field F]\n (cols r : Nat) (factor : F) (data₀ : Ar... | [
{
"name": "scaleRowData_eq",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 8,
"n_chars": 493,
"n_subproofs": 1,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 0,
"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.LinearAlgebra.Dense.KernelInPlace
import CompPoly.LinearAlgebra.Dense.RowOpsCorrectness
import CompPoly.LinearAlgebra.Dense.RrefSemantics
/-!... | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.LinearAlgebra.Dense.KernelInPlace
import CompPoly.LinearAlgebra.Dense.RowOpsCorrectness
import CompPoly.LinearAlgebra.Dense.RrefSemantics
/-!... | @@ -31,9 +31,35 @@
rw [Array.getD_eq_getD_getElem?, Array.getD_eq_getD_getElem?,
Array.getElem?_setIfInBounds_ne h]
+/-- A self-reading scale fold equals the constant-reading scale fold, as long as
+the accumulator still agrees with the original array on the entries it reads. -/
+private theorem foldl_scale_s... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_a18f874f7d49_2 | 5f076dd1d3c6fe14 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/LinearAlgebra/Dense/KernelInPlaceCorrectness.lean | KernelInPlaceCorrectness | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 13 | 2 | [
{
"theorem_name": "foldl_addScaled_self_eq_const",
"depth": 1,
"n_commands": 0,
"n_lines": 18,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro xs\n induction xs with\n | nil => intro _ _ d _ _; rfl\n | cons c xs ih =>\n intro hnodup hbou... | [
{
"name": "row_col_index_ne",
"text": "/-- Row-major indices in distinct rows are distinct (within the column range). -/\nprivate theorem row_col_index_ne {a b cols c c' : Nat} (hrow : a ≠ b)\n (hc : c < cols) (hc' : c' < cols) : a * cols + c ≠ b * cols + c' := by\n intro h\n have hcols : 0 < cols := N... | [
{
"name": "foldl_addScaled_self_eq_const",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 32,
"n_chars": 1726,
"n_subproofs": 3,
"n_tactics": 19,
"cyclomatic": 2,
"n_automation": 3,
"n_rewrites": 3,
"n_structural": 9,
"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.LinearAlgebra.Dense.KernelInPlace
import CompPoly.LinearAlgebra.Dense.RowOpsCorrectness
import CompPoly.LinearAlgebra.Dense.RrefSemantics
/-!... | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.LinearAlgebra.Dense.KernelInPlace
import CompPoly.LinearAlgebra.Dense.RowOpsCorrectness
import CompPoly.LinearAlgebra.Dense.RrefSemantics
/-!... | @@ -31,6 +31,16 @@
rw [Array.getD_eq_getD_getElem?, Array.getD_eq_getD_getElem?,
Array.getElem?_setIfInBounds_ne h]
+/-- Row-major indices in distinct rows are distinct (within the column range). -/
+private theorem row_col_index_ne {a b cols c c' : Nat} (hrow : a ≠ b)
+ (hc : c < cols) (hc' : c' < cols) :... | {
"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_a18f874f7d49_3 | 44e4a096863430d1 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/LinearAlgebra/Dense/KernelInPlaceCorrectness.lean | KernelInPlaceCorrectness | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 13 | 2 | [
{
"theorem_name": "foldl_addScaled_self_eq_const",
"depth": 1,
"n_commands": 0,
"n_lines": 18,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro xs\n induction xs with\n | nil => intro _ _ d _ _; rfl\n | cons c xs ih =>\n intro hnodup hbou... | [
{
"name": "row_col_index_ne",
"text": "/-- Row-major indices in distinct rows are distinct (within the column range). -/\nprivate theorem row_col_index_ne {a b cols c c' : Nat} (hrow : a ≠ b)\n (hc : c < cols) (hc' : c' < cols) : a * cols + c ≠ b * cols + c' := by\n intro h\n have hcols : 0 < cols := N... | [
{
"name": "addScaledRowData_eq",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 14,
"n_chars": 741,
"n_subproofs": 1,
"n_tactics": 7,
"cyclomatic": 1,
"n_automation": 4,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,
"max_ne... | 3 | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.LinearAlgebra.Dense.KernelInPlace
import CompPoly.LinearAlgebra.Dense.RowOpsCorrectness
import CompPoly.LinearAlgebra.Dense.RrefSemantics
/-!... | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.LinearAlgebra.Dense.KernelInPlace
import CompPoly.LinearAlgebra.Dense.RowOpsCorrectness
import CompPoly.LinearAlgebra.Dense.RrefSemantics
/-!... | @@ -31,6 +31,16 @@
rw [Array.getD_eq_getD_getElem?, Array.getD_eq_getD_getElem?,
Array.getElem?_setIfInBounds_ne h]
+/-- Row-major indices in distinct rows are distinct (within the column range). -/
+private theorem row_col_index_ne {a b cols c c' : Nat} (hrow : a ≠ b)
+ (hc : c < cols) (hc' : c' < cols) :... | {
"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_a18f874f7d49_4 | 33066d34a9536124 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/LinearAlgebra/Dense/KernelInPlaceCorrectness.lean | KernelInPlaceCorrectness | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 13 | 2 | [
{
"theorem_name": "foldl_addScaled_self_eq_const",
"depth": 1,
"n_commands": 0,
"n_lines": 18,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro xs\n induction xs with\n | nil => intro _ _ d _ _; rfl\n | cons c xs ih =>\n intro hnodup hbou... | [
{
"name": "row_col_index_ne",
"text": "/-- Row-major indices in distinct rows are distinct (within the column range). -/\nprivate theorem row_col_index_ne {a b cols c c' : Nat} (hrow : a ≠ b)\n (hc : c < cols) (hc' : c' < cols) : a * cols + c ≠ b * cols + c' := by\n intro h\n have hcols : 0 < cols := N... | [
{
"name": "foldl_swap_self_eq_const",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 33,
"n_chars": 1918,
"n_subproofs": 5,
"n_tactics": 21,
"cyclomatic": 2,
"n_automation": 4,
"n_rewrites": 3,
"n_structural": 9,
"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.LinearAlgebra.Dense.KernelInPlace
import CompPoly.LinearAlgebra.Dense.RowOpsCorrectness
import CompPoly.LinearAlgebra.Dense.RrefSemantics
/-!... | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.LinearAlgebra.Dense.KernelInPlace
import CompPoly.LinearAlgebra.Dense.RowOpsCorrectness
import CompPoly.LinearAlgebra.Dense.RrefSemantics
/-!... | @@ -31,6 +31,16 @@
rw [Array.getD_eq_getD_getElem?, Array.getD_eq_getD_getElem?,
Array.getElem?_setIfInBounds_ne h]
+/-- Row-major indices in distinct rows are distinct (within the column range). -/
+private theorem row_col_index_ne {a b cols c c' : Nat} (hrow : a ≠ b)
+ (hc : c < cols) (hc' : c' < cols) :... | {
"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_a18f874f7d49_5 | a8b2a90e498b58cf | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/LinearAlgebra/Dense/KernelInPlaceCorrectness.lean | KernelInPlaceCorrectness | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 13 | 2 | [
{
"theorem_name": "foldl_addScaled_self_eq_const",
"depth": 1,
"n_commands": 0,
"n_lines": 18,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro xs\n induction xs with\n | nil => intro _ _ d _ _; rfl\n | cons c xs ih =>\n intro hnodup hbou... | [
{
"name": "row_col_index_ne",
"text": "/-- Row-major indices in distinct rows are distinct (within the column range). -/\nprivate theorem row_col_index_ne {a b cols c c' : Nat} (hrow : a ≠ b)\n (hc : c < cols) (hc' : c' < cols) : a * cols + c ≠ b * cols + c' := by\n intro h\n have hcols : 0 < cols := N... | [
{
"name": "swapRowsData_eq",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 13,
"n_chars": 661,
"n_subproofs": 1,
"n_tactics": 9,
"cyclomatic": 1,
"n_automation": 5,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,
"max_nestin... | 3 | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.LinearAlgebra.Dense.KernelInPlace
import CompPoly.LinearAlgebra.Dense.RowOpsCorrectness
import CompPoly.LinearAlgebra.Dense.RrefSemantics
/-!... | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.LinearAlgebra.Dense.KernelInPlace
import CompPoly.LinearAlgebra.Dense.RowOpsCorrectness
import CompPoly.LinearAlgebra.Dense.RrefSemantics
/-!... | @@ -31,6 +31,16 @@
rw [Array.getD_eq_getD_getElem?, Array.getD_eq_getD_getElem?,
Array.getElem?_setIfInBounds_ne h]
+/-- Row-major indices in distinct rows are distinct (within the column range). -/
+private theorem row_col_index_ne {a b cols c c' : Nat} (hrow : a ≠ b)
+ (hc : c < cols) (hc' : c' < cols) :... | {
"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_a18f874f7d49_6 | d60c2d2f386312df | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/LinearAlgebra/Dense/KernelInPlaceCorrectness.lean | KernelInPlaceCorrectness | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 13 | 1 | [
{
"theorem_name": "addScaledRowData_eq",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h := foldl_addScaled_self_eq_const M.cols target source factor M.data hts\n (List.range' 0 M.cols) (List.nodup_... | [
{
"name": "foldl_addScaled_self_eq_const",
"text": "/-- A self-reading add-scaled fold equals the constant-reading version, as long as the\naccumulator still agrees with the original array on the target and source entries. -/\nprivate theorem foldl_addScaled_self_eq_const [Field F]\n (cols target source ... | [
{
"name": "forIn_eliminate_eq",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 4,
"n_lines": 29,
"n_chars": 1454,
"n_subproofs": 4,
"n_tactics": 19,
"cyclomatic": 2,
"n_automation": 5,
"n_rewrites": 3,
"n_structural": 4,
"automation_only": false,
"max_n... | 4 | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.LinearAlgebra.Dense.KernelInPlace
import CompPoly.LinearAlgebra.Dense.RowOpsCorrectness
import CompPoly.LinearAlgebra.Dense.RrefSemantics
/-!... | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.LinearAlgebra.Dense.KernelInPlace
import CompPoly.LinearAlgebra.Dense.RowOpsCorrectness
import CompPoly.LinearAlgebra.Dense.RrefSemantics
/-!... | @@ -41,12 +41,49 @@
simpa [Nat.mul_comm a cols, Nat.mul_comm b cols, Nat.mul_add_div hcols,
Nat.div_eq_of_lt hc, Nat.div_eq_of_lt hc'] using hdiv
+/-- A self-reading add-scaled fold equals the constant-reading version, as long as the
+accumulator still agrees with the original array on the target and source e... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_a18f874f7d49_7 | ddc16cdbef5aa1b4 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/LinearAlgebra/Dense/KernelInPlaceCorrectness.lean | KernelInPlaceCorrectness | 7 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 13 | 1 | [
{
"theorem_name": "addScaledRowData_eq",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h := foldl_addScaled_self_eq_const M.cols target source factor M.data hts\n (List.range' 0 M.cols) (List.nodup_... | [
{
"name": "foldl_addScaled_self_eq_const",
"text": "/-- A self-reading add-scaled fold equals the constant-reading version, as long as the\naccumulator still agrees with the original array on the target and source entries. -/\nprivate theorem foldl_addScaled_self_eq_const [Field F]\n (cols target source ... | [
{
"name": "normalizeAndEliminateData_eq",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 7,
"n_lines": 26,
"n_chars": 1292,
"n_subproofs": 5,
"n_tactics": 20,
"cyclomatic": 1,
"n_automation": 4,
"n_rewrites": 5,
"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.LinearAlgebra.Dense.KernelInPlace
import CompPoly.LinearAlgebra.Dense.RowOpsCorrectness
import CompPoly.LinearAlgebra.Dense.RrefSemantics
/-!... | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.LinearAlgebra.Dense.KernelInPlace
import CompPoly.LinearAlgebra.Dense.RowOpsCorrectness
import CompPoly.LinearAlgebra.Dense.RrefSemantics
/-!... | @@ -71,12 +71,49 @@
simpa [Nat.mul_comm a cols, Nat.mul_comm b cols, Nat.mul_add_div hcols,
Nat.div_eq_of_lt hc, Nat.div_eq_of_lt hc'] using hdiv
+/-- A self-reading add-scaled fold equals the constant-reading version, as long as the
+accumulator still agrees with the original array on the target and source e... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_a18f874f7d49_8 | acbefe6e11e7e759 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/LinearAlgebra/Dense/KernelInPlaceCorrectness.lean | KernelInPlaceCorrectness | 8 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 13 | 1 | [
{
"theorem_name": "rrefLoopData_eq",
"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 => intro col row M pivots; rfl\n | succ fuel ih =>\n intro col row M piv... | [
{
"name": "findPivotRowData_eq",
"text": "/-- The in-place pivot search agrees with the copying one. -/\ntheorem findPivotRowData_eq [Zero F] [BEq F] (M : DenseMatrix F) (startRow col : Nat) :\n findPivotRowData M.rows M.cols startRow col M.data = findPivotRow M startRow col := by\n simp only [findPivot... | [
{
"name": "rrefLoopData_eq",
"fan_in": 1,
"n_deps_direct": 3,
"n_deps_transitive": 11,
"n_lines": 34,
"n_chars": 1707,
"n_subproofs": 0,
"n_tactics": 27,
"cyclomatic": 3,
"n_automation": 5,
"n_rewrites": 8,
"n_structural": 6,
"automation_only": false,
"max_nes... | 11 | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.LinearAlgebra.Dense.KernelInPlace
import CompPoly.LinearAlgebra.Dense.RowOpsCorrectness
import CompPoly.LinearAlgebra.Dense.RrefSemantics
/-!... | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.LinearAlgebra.Dense.KernelInPlace
import CompPoly.LinearAlgebra.Dense.RowOpsCorrectness
import CompPoly.LinearAlgebra.Dense.RrefSemantics
/-!... | @@ -159,6 +159,11 @@
simpa [swapRowsData, swapRows, hAB, get, index,
Std.Legacy.Range.forIn_eq_forIn_range'] using h
+/-- The in-place pivot search agrees with the copying one. -/
+theorem findPivotRowData_eq [Zero F] [BEq F] (M : DenseMatrix F) (startRow col : Nat) :
+ findPivotRowData M.rows M.cols s... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_a18f874f7d49_9 | 61aff5e3c2feb17e | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/LinearAlgebra/Dense/KernelInPlaceCorrectness.lean | KernelInPlaceCorrectness | 9 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 13 | 1 | [
{
"theorem_name": "rrefLoopData_eq",
"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 => intro col row M pivots; rfl\n | succ fuel ih =>\n intro col row M piv... | [
{
"name": "findPivotRowData_eq",
"text": "/-- The in-place pivot search agrees with the copying one. -/\ntheorem findPivotRowData_eq [Zero F] [BEq F] (M : DenseMatrix F) (startRow col : Nat) :\n findPivotRowData M.rows M.cols startRow col M.data = findPivotRow M startRow col := by\n simp only [findPivot... | [
{
"name": "rrefInPlace_eq",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 12,
"n_lines": 13,
"n_chars": 562,
"n_subproofs": 4,
"n_tactics": 10,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 2,
"n_structural": 1,
"automation_only": false,
"max_nesti... | 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.LinearAlgebra.Dense.KernelInPlace
import CompPoly.LinearAlgebra.Dense.RowOpsCorrectness
import CompPoly.LinearAlgebra.Dense.RrefSemantics
/-!... | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.LinearAlgebra.Dense.KernelInPlace
import CompPoly.LinearAlgebra.Dense.RowOpsCorrectness
import CompPoly.LinearAlgebra.Dense.RrefSemantics
/-!... | @@ -159,6 +159,11 @@
simpa [swapRowsData, swapRows, hAB, get, index,
Std.Legacy.Range.forIn_eq_forIn_range'] using h
+/-- The in-place pivot search agrees with the copying one. -/
+theorem findPivotRowData_eq [Zero F] [BEq F] (M : DenseMatrix F) (startRow col : Nat) :
+ findPivotRowData M.rows M.cols s... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_a18f874f7d49_10 | b8374f0e3ddc75e2 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/LinearAlgebra/Dense/KernelInPlaceCorrectness.lean | KernelInPlaceCorrectness | 10 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 13 | 1 | [
{
"theorem_name": "normalizeAndEliminateData_eq",
"depth": 1,
"n_commands": 0,
"n_lines": 20,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hpiv : M.data.getD (pivotRow * M.cols + pivotCol) 0 = M.get pivotRow pivotCol := by\n simp [get, inde... | [
{
"name": "forIn_eliminate_eq",
"text": "/-- The in-place elimination loop tracks the copying one entry-for-entry. -/\nprivate theorem forIn_eliminate_eq [Field F] (cols pivotRow pivotCol : Nat) :\n ∀ (xs : List Nat) (out : DenseMatrix F), out.cols = cols →\n (Id.run (forIn xs out.data fun row r ↦\n... | [
{
"name": "homogeneousWitnessInPlace_eq",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 13,
"n_lines": 7,
"n_chars": 360,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true,
... | 13 | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.LinearAlgebra.Dense.KernelInPlace
import CompPoly.LinearAlgebra.Dense.RowOpsCorrectness
import CompPoly.LinearAlgebra.Dense.RrefSemantics
/-!... | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.LinearAlgebra.Dense.KernelInPlace
import CompPoly.LinearAlgebra.Dense.RowOpsCorrectness
import CompPoly.LinearAlgebra.Dense.RrefSemantics
/-!... | @@ -164,11 +164,58 @@
findPivotRowData M.rows M.cols startRow col M.data = findPivotRow M startRow col := by
simp only [findPivotRowData, findPivotRow, get, index]
+/-- The in-place elimination loop tracks the copying one entry-for-entry. -/
+private theorem forIn_eliminate_eq [Field F] (cols pivotRow pivotCo... | {
"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_9bf3fca8f6f6_0 | e6c949023ac1e96f | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Data/Vector/Basic.lean | Basic | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 2 | [
{
"theorem_name": "foldl_succ",
"depth": 1,
"n_commands": 0,
"n_lines": 9,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [foldl_eq_toList_foldl, foldl_eq_toList_foldl]\n rw [toList_tail]\n have h_ne : v.toList ≠ [] := by\n simp only [ne_eq, ... | [
{
"name": "foldl_eq_toList_foldl",
"text": "theorem foldl_eq_toList_foldl {α β} {n : ℕ} (f : β → α → β) (init : β) (v : Vector α n) :\n v.foldl (f:=f) (b:=init) = v.toList.foldl (f:=f) (init:=init) := by\n rw [Vector.foldl]\n rw [←Array.foldl_toList]\n rfl\n\n",
"fan_in": 2,
"n_lines": 7,
... | [
{
"name": "foldl_succ",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 15,
"n_chars": 520,
"n_subproofs": 1,
"n_tactics": 9,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 4,
"n_structural": 1,
"automation_only": false,
"max_nesting": 4... | 1 | /-
Copyright (c) 2025 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao, Chung Thai Nguyen
-/
import Batteries.Data.Vector.Lemmas
import CompPoly.Data.List.Lemmas
import Mathlib.Algebra.BigOperators.Fin
import Mathlib.Algebra.Order.Star.Basic
import Ma... | /-
Copyright (c) 2025 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao, Chung Thai Nguyen
-/
import Batteries.Data.Vector.Lemmas
import CompPoly.Data.List.Lemmas
import Mathlib.Algebra.BigOperators.Fin
import Mathlib.Algebra.Order.Star.Basic
import Ma... | @@ -102,9 +102,23 @@
rw [Array.toList_insertIdx]
simp only [List.insertIdx_zero]
+theorem foldl_eq_toList_foldl {α β} {n : ℕ} (f : β → α → β) (init : β) (v : Vector α n) :
+ v.foldl (f:=f) (b:=init) = v.toList.foldl (f:=f) (init:=init) := by
+ rw [Vector.foldl]
+ rw [←Array.foldl_toList]
+ rfl
+
theorem ... | {
"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_9bf3fca8f6f6_1 | ec106e4f21fead58 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Data/Vector/Basic.lean | Basic | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 2 | [
{
"theorem_name": "foldl_succ",
"depth": 1,
"n_commands": 0,
"n_lines": 9,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [foldl_eq_toList_foldl, foldl_eq_toList_foldl]\n rw [toList_tail]\n have h_ne : v.toList ≠ [] := by\n simp only [ne_eq, ... | [
{
"name": "foldl_eq_toList_foldl",
"text": "theorem foldl_eq_toList_foldl {α β} {n : ℕ} (f : β → α → β) (init : β) (v : Vector α n) :\n v.foldl (f:=f) (b:=init) = v.toList.foldl (f:=f) (init:=init) := by\n rw [Vector.foldl]\n rw [←Array.foldl_toList]\n rfl\n\n",
"fan_in": 2,
"n_lines": 7,
... | [
{
"name": "dotProduct_cons",
"fan_in": 1,
"n_deps_direct": 3,
"n_deps_transitive": 3,
"n_lines": 20,
"n_chars": 749,
"n_subproofs": 1,
"n_tactics": 16,
"cyclomatic": 2,
"n_automation": 1,
"n_rewrites": 8,
"n_structural": 2,
"automation_only": false,
"max_nesti... | 2 | /-
Copyright (c) 2025 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao, Chung Thai Nguyen
-/
import Batteries.Data.Vector.Lemmas
import CompPoly.Data.List.Lemmas
import Mathlib.Algebra.BigOperators.Fin
import Mathlib.Algebra.Order.Star.Basic
import Ma... | /-
Copyright (c) 2025 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao, Chung Thai Nguyen
-/
import Batteries.Data.Vector.Lemmas
import CompPoly.Data.List.Lemmas
import Mathlib.Algebra.BigOperators.Fin
import Mathlib.Algebra.Order.Star.Basic
import Ma... | @@ -102,6 +102,12 @@
rw [Array.toList_insertIdx]
simp only [List.insertIdx_zero]
+theorem foldl_eq_toList_foldl {α β} {n : ℕ} (f : β → α → β) (init : β) (v : Vector α n) :
+ v.foldl (f:=f) (b:=init) = v.toList.foldl (f:=f) (init:=init) := by
+ rw [Vector.foldl]
+ rw [←Array.foldl_toList]
+ rfl
+
theorem ... | {
"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_9bf3fca8f6f6_2 | d7f95d30ae226f0d | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Data/Vector/Basic.lean | Basic | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 1 | [
{
"theorem_name": "dotProduct_cons",
"depth": 1,
"n_commands": 0,
"n_lines": 19,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold _root_.dotProduct\n if h_n: n = 0 then\n subst h_n\n simp only [cons_empty_tail_eq_nil]\n simp_all only [... | [
{
"name": "cons_get_eq",
"text": "lemma cons_get_eq {α} {n : ℕ} (hd : α) (tl : Vector α n) (i : Fin (n + 1)) :\n (cons hd tl).get i =\n if hi: i.val == 0 then hd else tl.get (⟨i.val - 1, by\n simp only [beq_iff_eq, Fin.val_eq_zero_iff] at hi\n apply Nat.sub_lt_left_of_lt_add\n ·... | [
{
"name": "dotProduct_cons",
"fan_in": 1,
"n_deps_direct": 5,
"n_deps_transitive": 6,
"n_lines": 23,
"n_chars": 895,
"n_subproofs": 0,
"n_tactics": 18,
"cyclomatic": 1,
"n_automation": 5,
"n_rewrites": 5,
"n_structural": 1,
"automation_only": false,
"max_nesti... | 3 | /-
Copyright (c) 2025 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao, Chung Thai Nguyen
-/
import Batteries.Data.Vector.Lemmas
import CompPoly.Data.List.Lemmas
import Mathlib.Algebra.BigOperators.Fin
import Mathlib.Algebra.Order.Star.Basic
import Ma... | /-
Copyright (c) 2025 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao, Chung Thai Nguyen
-/
import Batteries.Data.Vector.Lemmas
import CompPoly.Data.List.Lemmas
import Mathlib.Algebra.BigOperators.Fin
import Mathlib.Algebra.Order.Star.Basic
import Ma... | @@ -47,6 +47,33 @@
simp only [head, cons, insertIdx_zero, getElem_cast, zero_lt_one, getElem_append_left, getElem_mk,
List.getElem_toArray, List.getElem_cons_zero]
+lemma cons_get_eq {α} {n : ℕ} (hd : α) (tl : Vector α n) (i : Fin (n + 1)) :
+ (cons hd tl).get i =
+ if hi: i.val == 0 then hd else tl.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_9bf3fca8f6f6_3 | 1d6068dd15cefc03 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Data/Vector/Basic.lean | Basic | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 2 | [
{
"theorem_name": "foldl_succ",
"depth": 1,
"n_commands": 0,
"n_lines": 9,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [foldl_eq_toList_foldl, foldl_eq_toList_foldl]\n rw [toList_tail]\n have h_ne : v.toList ≠ [] := by\n simp only [ne_eq, ... | [
{
"name": "foldl_eq_toList_foldl",
"text": "theorem foldl_eq_toList_foldl {α β} {n : ℕ} (f : β → α → β) (init : β) (v : Vector α n) :\n v.foldl (f:=f) (b:=init) = v.toList.foldl (f:=f) (init:=init) := by\n rw [Vector.foldl]\n rw [←Array.foldl_toList]\n rfl\n\n",
"fan_in": 2,
"n_lines": 7,
... | [
{
"name": "dotProduct_eq_root_dotProduct",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 4,
"n_lines": 21,
"n_chars": 1016,
"n_subproofs": 0,
"n_tactics": 18,
"cyclomatic": 1,
"n_automation": 10,
"n_rewrites": 0,
"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: Quang Dao, Chung Thai Nguyen
-/
import Batteries.Data.Vector.Lemmas
import CompPoly.Data.List.Lemmas
import Mathlib.Algebra.BigOperators.Fin
import Mathlib.Algebra.Order.Star.Basic
import Ma... | /-
Copyright (c) 2025 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao, Chung Thai Nguyen
-/
import Batteries.Data.Vector.Lemmas
import CompPoly.Data.List.Lemmas
import Mathlib.Algebra.BigOperators.Fin
import Mathlib.Algebra.Order.Star.Basic
import Ma... | @@ -102,6 +102,12 @@
rw [Array.toList_insertIdx]
simp only [List.insertIdx_zero]
+theorem foldl_eq_toList_foldl {α β} {n : ℕ} (f : β → α → β) (init : β) (v : Vector α n) :
+ v.foldl (f:=f) (b:=init) = v.toList.foldl (f:=f) (init:=init) := by
+ rw [Vector.foldl]
+ rw [←Array.foldl_toList]
+ rfl
+
theorem ... | {
"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_e8debc7a4632_0 | d5829a5c7cc714d9 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Multivariate/MvPolyEquiv/Instances.lean | Instances | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 4 | 1 | [
{
"theorem_name": "foldl_eq_sum",
"depth": 1,
"n_commands": 0,
"n_lines": 15,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold Finsupp.sum Finset.sum\n simp only [Function.comp_apply, add_comm]\n rw [ExtTreeMap.foldl_eq_foldl_toList]\n rw [←L... | [
{
"name": "toList_pairs_monomial_coeff",
"text": "lemma toList_pairs_monomial_coeff {β : Type*} [AddCommMonoid β]\n {t : Unlawful n R}\n {f : CMvMonomial n → R → β} :\n t.toList.map (fun term => f term.1 term.2) =\n t.monomials.map (fun m => f m (t.coeff m)) := by\n unfold Unlawful.monomials Unlawf... | [
{
"name": "foldl_eq_sum",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 21,
"n_chars": 858,
"n_subproofs": 1,
"n_tactics": 20,
"cyclomatic": 1,
"n_automation": 4,
"n_rewrites": 10,
"n_structural": 1,
"automation_only": false,
"max_nesting... | 1 | /-
Copyright (c) 2025 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Frantisek Silvasi, Julian Sutherland, Andrei Burdușa, Dimitris Mitsios
-/
import CompPoly.Multivariate.MvPolyEquiv.Core
/-!
# `CMvPolynomial`/`MvPolynomial` Instances
Compatibility lemmas ... | /-
Copyright (c) 2025 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Frantisek Silvasi, Julian Sutherland, Andrei Burdușa, Dimitris Mitsios
-/
import CompPoly.Multivariate.MvPolyEquiv.Core
/-!
# `CMvPolynomial`/`MvPolynomial` Instances
Compatibility lemmas ... | @@ -176,11 +176,36 @@
simp [add_comm]
omit [BEq R] [LawfulBEq R] in
+lemma toList_pairs_monomial_coeff {β : Type*} [AddCommMonoid β]
+ {t : Unlawful n R}
+ {f : CMvMonomial n → R → β} :
+ t.toList.map (fun term => f term.1 term.2) =
+ t.monomials.map (fun m => f m (t.coeff m)) := by
+ unfold Unlawful.m... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_e8debc7a4632_1 | 4f632c84b6971f32 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Multivariate/MvPolyEquiv/Instances.lean | Instances | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 4 | 1 | [
{
"theorem_name": "fromCMvPolynomial_sum_eq_sum_fromCMvPolynomial",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold Finsupp.sum; ext\n simp [MvPolynomial.coeff_sum, coeff_eq, coeff_sum]",
"n_chars... | [
{
"name": "coeff_sum",
"text": "lemma coeff_sum [AddCommMonoid α]\n (s : Finset α)\n (f : α → CMvPolynomial n R)\n (m : CMvMonomial n) :\n coeff m (∑ x ∈ s, f x) = ∑ x ∈ s, coeff m (f x) := by\n rw [←Finset.sum_map_toList s, ←Finset.sum_map_toList s]\n induction' s.toList with h t ih\n · grin... | [
{
"name": "fromCMvPolynomial_sum_eq_sum_fromCMvPolynomial",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 9,
"n_chars": 362,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 1,
"automation... | 1 | /-
Copyright (c) 2025 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Frantisek Silvasi, Julian Sutherland, Andrei Burdușa, Dimitris Mitsios
-/
import CompPoly.Multivariate.MvPolyEquiv.Core
/-!
# `CMvPolynomial`/`MvPolynomial` Instances
Compatibility lemmas ... | /-
Copyright (c) 2025 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Frantisek Silvasi, Julian Sutherland, Andrei Burdușa, Dimitris Mitsios
-/
import CompPoly.Multivariate.MvPolyEquiv.Core
/-!
# `CMvPolynomial`/`MvPolynomial` Instances
Compatibility lemmas ... | @@ -207,11 +207,24 @@
rw [monomials_dedup_self]
aesop
+lemma coeff_sum [AddCommMonoid α]
+ (s : Finset α)
+ (f : α → CMvPolynomial n R)
+ (m : CMvMonomial n) :
+ coeff m (∑ x ∈ s, f x) = ∑ x ∈ s, coeff m (f x) := by
+ rw [←Finset.sum_map_toList s, ←Finset.sum_map_toList s]
+ induction' s.toList wi... | {
"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_acba80411905_0 | 0f628ea16d9616ab | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Fields/KoalaBear/Basic.lean | Basic | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 9 | 3 | [
{
"theorem_name": "coprime_three_fieldSize_sub_one",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n -- Using the explicit factorization and concrete numerals\n simpa [fieldSize_sub_one_factorization, twoAdi... | [
{
"name": "fieldSize_sub_one_factorization",
"text": "/-- The factorization `fieldSize - 1 = 2^twoAdicity * 127`. -/\nlemma fieldSize_sub_one_factorization : fieldSize - 1 = 2 ^ twoAdicity * 127 := by\n unfold fieldSize twoAdicity\n decide\n\n",
"fan_in": 3,
"n_lines": 6,
"n_chars": 186,
"... | [
{
"name": "coprime_three_fieldSize_sub_one",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 12,
"n_chars": 466,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true,
... | 1 | /-
Copyright (c) 2024 ArkLib Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao, Valerii Huhnin
-/
import CompPoly.Fields.Basic
import CompPoly.Fields.PrattCertificate
import Mathlib.Algebra.Order.Ring.Star
import Mathlib.RingTheory.RootsOfUnity.Pr... | /-
Copyright (c) 2024 ArkLib Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao, Valerii Huhnin
-/
import CompPoly.Fields.Basic
import CompPoly.Fields.PrattCertificate
import Mathlib.Algebra.Order.Ring.Star
import Mathlib.RingTheory.RootsOfUnity.Pr... | @@ -71,6 +71,11 @@
of `2^n`-th roots of unity for `0 ≤ n ≤ twoAdicity`.
-/
+/-- The factorization `fieldSize - 1 = 2^twoAdicity * 127`. -/
+lemma fieldSize_sub_one_factorization : fieldSize - 1 = 2 ^ twoAdicity * 127 := by
+ unfold fieldSize twoAdicity
+ decide
+
/-!
A table of `2^n`-th roots of unity. The ... | {
"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_acba80411905_1 | 24bad53a3144280b | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Fields/KoalaBear/Basic.lean | Basic | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 9 | 3 | [
{
"theorem_name": "twoAdicGenerators_pow_twoPow_eq_one",
"depth": 1,
"n_commands": 0,
"n_lines": 12,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [← sqChain_eq_pow_two_pow]\n rcases bits with ⟨n, hn⟩\n have hshift :\n sqChain twoAdicGener... | [
{
"name": "sqChain_eq_pow_two_pow",
"text": "private theorem sqChain_eq_pow_two_pow (g : Field) (n : Nat) :\n sqChain g n = g ^ (2 ^ n) := by\n induction n with\n | zero => simp [sqChain]\n | succ n ih => simp [sqChain, ih, pow_succ, pow_mul]\n\n",
"fan_in": 3,
"n_lines": 7,
"n_chars": 201... | [
{
"name": "twoAdicGenerators_pow_twoPow_eq_one",
"fan_in": 3,
"n_deps_direct": 2,
"n_deps_transitive": 5,
"n_lines": 16,
"n_chars": 702,
"n_subproofs": 2,
"n_tactics": 12,
"cyclomatic": 2,
"n_automation": 5,
"n_rewrites": 1,
"n_structural": 3,
"automation_only": f... | 2 | /-
Copyright (c) 2024 ArkLib Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao, Valerii Huhnin
-/
import CompPoly.Fields.Basic
import CompPoly.Fields.PrattCertificate
import Mathlib.Algebra.Order.Ring.Star
import Mathlib.RingTheory.RootsOfUnity.Pr... | /-
Copyright (c) 2024 ArkLib Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao, Valerii Huhnin
-/
import CompPoly.Fields.Basic
import CompPoly.Fields.PrattCertificate
import Mathlib.Algebra.Order.Ring.Star
import Mathlib.RingTheory.RootsOfUnity.Pr... | @@ -140,6 +140,12 @@
| 0 => g
| n + 1 => let h := sqChain g n; h * h
+private theorem sqChain_eq_pow_two_pow (g : Field) (n : Nat) :
+ sqChain g n = g ^ (2 ^ n) := by
+ induction n with
+ | zero => simp [sqChain]
+ | succ n ih => simp [sqChain, ih, pow_succ, pow_mul]
+
/-- Repeated squaring walks backwar... | {
"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_acba80411905_2 | b32553f130d7d603 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Fields/KoalaBear/Basic.lean | Basic | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 9 | 3 | [
{
"theorem_name": "twoAdicGenerators_pow_twoPow_eq_one",
"depth": 1,
"n_commands": 0,
"n_lines": 12,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [← sqChain_eq_pow_two_pow]\n rcases bits with ⟨n, hn⟩\n have hshift :\n sqChain twoAdicGener... | [
{
"name": "sqChain_eq_pow_two_pow",
"text": "private theorem sqChain_eq_pow_two_pow (g : Field) (n : Nat) :\n sqChain g n = g ^ (2 ^ n) := by\n induction n with\n | zero => simp [sqChain]\n | succ n ih => simp [sqChain, ih, pow_succ, pow_mul]\n\n",
"fan_in": 3,
"n_lines": 7,
"n_chars": 201... | [
{
"name": "twoAdicGenerators_pow_ne_one_aux",
"fan_in": 1,
"n_deps_direct": 3,
"n_deps_transitive": 6,
"n_lines": 21,
"n_chars": 951,
"n_subproofs": 3,
"n_tactics": 16,
"cyclomatic": 1,
"n_automation": 3,
"n_rewrites": 3,
"n_structural": 2,
"automation_only": fals... | 3 | /-
Copyright (c) 2024 ArkLib Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao, Valerii Huhnin
-/
import CompPoly.Fields.Basic
import CompPoly.Fields.PrattCertificate
import Mathlib.Algebra.Order.Ring.Star
import Mathlib.RingTheory.RootsOfUnity.Pr... | /-
Copyright (c) 2024 ArkLib Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao, Valerii Huhnin
-/
import CompPoly.Fields.Basic
import CompPoly.Fields.PrattCertificate
import Mathlib.Algebra.Order.Ring.Star
import Mathlib.RingTheory.RootsOfUnity.Pr... | @@ -140,6 +140,12 @@
| 0 => g
| n + 1 => let h := sqChain g n; h * h
+private theorem sqChain_eq_pow_two_pow (g : Field) (n : Nat) :
+ sqChain g n = g ^ (2 ^ n) := by
+ induction n with
+ | zero => simp [sqChain]
+ | succ n ih => simp [sqChain, ih, pow_succ, pow_mul]
+
/-- Repeated squaring walks backwar... | {
"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_acba80411905_3 | 739936489b8b3868 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Fields/KoalaBear/Basic.lean | Basic | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 9 | 3 | [
{
"theorem_name": "twoAdicGenerators_pow_twoPow_eq_one",
"depth": 1,
"n_commands": 0,
"n_lines": 12,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [← sqChain_eq_pow_two_pow]\n rcases bits with ⟨n, hn⟩\n have hshift :\n sqChain twoAdicGener... | [
{
"name": "sqChain_eq_pow_two_pow",
"text": "private theorem sqChain_eq_pow_two_pow (g : Field) (n : Nat) :\n sqChain g n = g ^ (2 ^ n) := by\n induction n with\n | zero => simp [sqChain]\n | succ n ih => simp [sqChain, ih, pow_succ, pow_mul]\n\n",
"fan_in": 3,
"n_lines": 7,
"n_chars": 201... | [
{
"name": "twoAdicGenerators_pow_twoPow_ne_one_of_lt",
"fan_in": 3,
"n_deps_direct": 1,
"n_deps_transitive": 7,
"n_lines": 8,
"n_chars": 356,
"n_subproofs": 1,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 1,
"automation_only... | 4 | /-
Copyright (c) 2024 ArkLib Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao, Valerii Huhnin
-/
import CompPoly.Fields.Basic
import CompPoly.Fields.PrattCertificate
import Mathlib.Algebra.Order.Ring.Star
import Mathlib.RingTheory.RootsOfUnity.Pr... | /-
Copyright (c) 2024 ArkLib Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao, Valerii Huhnin
-/
import CompPoly.Fields.Basic
import CompPoly.Fields.PrattCertificate
import Mathlib.Algebra.Order.Ring.Star
import Mathlib.RingTheory.RootsOfUnity.Pr... | @@ -140,6 +140,12 @@
| 0 => g
| n + 1 => let h := sqChain g n; h * h
+private theorem sqChain_eq_pow_two_pow (g : Field) (n : Nat) :
+ sqChain g n = g ^ (2 ^ n) := by
+ induction n with
+ | zero => simp [sqChain]
+ | succ n ih => simp [sqChain, ih, pow_succ, pow_mul]
+
/-- Repeated squaring walks backwar... | {
"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_acba80411905_4 | 232d48a291690ba3 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Fields/KoalaBear/Basic.lean | Basic | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 9 | 3 | [
{
"theorem_name": "twoAdicGenerators_pow_twoPow_eq_one",
"depth": 1,
"n_commands": 0,
"n_lines": 12,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [← sqChain_eq_pow_two_pow]\n rcases bits with ⟨n, hn⟩\n have hshift :\n sqChain twoAdicGener... | [
{
"name": "sqChain_eq_pow_two_pow",
"text": "private theorem sqChain_eq_pow_two_pow (g : Field) (n : Nat) :\n sqChain g n = g ^ (2 ^ n) := by\n induction n with\n | zero => simp [sqChain]\n | succ n ih => simp [sqChain, ih, pow_succ, pow_mul]\n\n",
"fan_in": 3,
"n_lines": 7,
"n_chars": 201... | [
{
"name": "isPrimitiveRoot_twoAdicGenerator",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 9,
"n_lines": 21,
"n_chars": 907,
"n_subproofs": 2,
"n_tactics": 16,
"cyclomatic": 3,
"n_automation": 2,
"n_rewrites": 2,
"n_structural": 5,
"automation_only": fals... | 6 | /-
Copyright (c) 2024 ArkLib Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao, Valerii Huhnin
-/
import CompPoly.Fields.Basic
import CompPoly.Fields.PrattCertificate
import Mathlib.Algebra.Order.Ring.Star
import Mathlib.RingTheory.RootsOfUnity.Pr... | /-
Copyright (c) 2024 ArkLib Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao, Valerii Huhnin
-/
import CompPoly.Fields.Basic
import CompPoly.Fields.PrattCertificate
import Mathlib.Algebra.Order.Ring.Star
import Mathlib.RingTheory.RootsOfUnity.Pr... | @@ -140,6 +140,12 @@
| 0 => g
| n + 1 => let h := sqChain g n; h * h
+private theorem sqChain_eq_pow_two_pow (g : Field) (n : Nat) :
+ sqChain g n = g ^ (2 ^ n) := by
+ induction n with
+ | zero => simp [sqChain]
+ | succ n ih => simp [sqChain, ih, pow_succ, pow_mul]
+
/-- Repeated squaring walks backwar... | {
"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_acba80411905_5 | f14e08a72d6f2ec6 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Fields/KoalaBear/Basic.lean | Basic | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 9 | 3 | [
{
"theorem_name": "twoAdicGenerators_pow_twoPow_eq_one",
"depth": 1,
"n_commands": 0,
"n_lines": 12,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [← sqChain_eq_pow_two_pow]\n rcases bits with ⟨n, hn⟩\n have hshift :\n sqChain twoAdicGener... | [
{
"name": "sqChain_eq_pow_two_pow",
"text": "private theorem sqChain_eq_pow_two_pow (g : Field) (n : Nat) :\n sqChain g n = g ^ (2 ^ n) := by\n induction n with\n | zero => simp [sqChain]\n | succ n ih => simp [sqChain, ih, pow_succ, pow_mul]\n\n",
"fan_in": 3,
"n_lines": 7,
"n_chars": 201... | [
{
"name": "twoAdicGenerator_unit_mem_rootsOfUnity",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 6,
"n_lines": 10,
"n_chars": 453,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 2,
"n_structural": 1,
"automation_only":... | 3 | /-
Copyright (c) 2024 ArkLib Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao, Valerii Huhnin
-/
import CompPoly.Fields.Basic
import CompPoly.Fields.PrattCertificate
import Mathlib.Algebra.Order.Ring.Star
import Mathlib.RingTheory.RootsOfUnity.Pr... | /-
Copyright (c) 2024 ArkLib Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao, Valerii Huhnin
-/
import CompPoly.Fields.Basic
import CompPoly.Fields.PrattCertificate
import Mathlib.Algebra.Order.Ring.Star
import Mathlib.RingTheory.RootsOfUnity.Pr... | @@ -140,6 +140,12 @@
| 0 => g
| n + 1 => let h := sqChain g n; h * h
+private theorem sqChain_eq_pow_two_pow (g : Field) (n : Nat) :
+ sqChain g n = g ^ (2 ^ n) := by
+ induction n with
+ | zero => simp [sqChain]
+ | succ n ih => simp [sqChain, ih, pow_succ, pow_mul]
+
/-- Repeated squaring walks backwar... | {
"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_acba80411905_6 | 4b1c74d312e7beb7 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Fields/KoalaBear/Basic.lean | Basic | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 9 | 3 | [
{
"theorem_name": "twoAdicGenerators_pow_twoPow_eq_one",
"depth": 1,
"n_commands": 0,
"n_lines": 12,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [← sqChain_eq_pow_two_pow]\n rcases bits with ⟨n, hn⟩\n have hshift :\n sqChain twoAdicGener... | [
{
"name": "sqChain_eq_pow_two_pow",
"text": "private theorem sqChain_eq_pow_two_pow (g : Field) (n : Nat) :\n sqChain g n = g ^ (2 ^ n) := by\n induction n with\n | zero => simp [sqChain]\n | succ n ih => simp [sqChain, ih, pow_succ, pow_mul]\n\n",
"fan_in": 3,
"n_lines": 7,
"n_chars": 201... | [
{
"name": "twoAdicGenerators_order",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 9,
"n_lines": 12,
"n_chars": 537,
"n_subproofs": 0,
"n_tactics": 8,
"cyclomatic": 2,
"n_automation": 2,
"n_rewrites": 0,
"n_structural": 2,
"automation_only": false,
"ma... | 6 | /-
Copyright (c) 2024 ArkLib Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao, Valerii Huhnin
-/
import CompPoly.Fields.Basic
import CompPoly.Fields.PrattCertificate
import Mathlib.Algebra.Order.Ring.Star
import Mathlib.RingTheory.RootsOfUnity.Pr... | /-
Copyright (c) 2024 ArkLib Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao, Valerii Huhnin
-/
import CompPoly.Fields.Basic
import CompPoly.Fields.PrattCertificate
import Mathlib.Algebra.Order.Ring.Star
import Mathlib.RingTheory.RootsOfUnity.Pr... | @@ -140,6 +140,12 @@
| 0 => g
| n + 1 => let h := sqChain g n; h * h
+private theorem sqChain_eq_pow_two_pow (g : Field) (n : Nat) :
+ sqChain g n = g ^ (2 ^ n) := by
+ induction n with
+ | zero => simp [sqChain]
+ | succ n ih => simp [sqChain, ih, pow_succ, pow_mul]
+
/-- Repeated squaring walks backwar... | {
"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_acba80411905_7 | 3f22e6609d2a9b9d | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Fields/KoalaBear/Basic.lean | Basic | 7 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 9 | 3 | [
{
"theorem_name": "twoAdicGenerators_pow_twoPow_eq_one",
"depth": 1,
"n_commands": 0,
"n_lines": 12,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [← sqChain_eq_pow_two_pow]\n rcases bits with ⟨n, hn⟩\n have hshift :\n sqChain twoAdicGener... | [
{
"name": "sqChain_eq_pow_two_pow",
"text": "private theorem sqChain_eq_pow_two_pow (g : Field) (n : Nat) :\n sqChain g n = g ^ (2 ^ n) := by\n induction n with\n | zero => simp [sqChain]\n | succ n ih => simp [sqChain, ih, pow_succ, pow_mul]\n\n",
"fan_in": 3,
"n_lines": 7,
"n_chars": 201... | [
{
"name": "primitiveRoot_pow_twoAdicity_ne_one",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 8,
"n_chars": 242,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 2,
"n_structural": 0,
"automation_only": fal... | 1 | /-
Copyright (c) 2024 ArkLib Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao, Valerii Huhnin
-/
import CompPoly.Fields.Basic
import CompPoly.Fields.PrattCertificate
import Mathlib.Algebra.Order.Ring.Star
import Mathlib.RingTheory.RootsOfUnity.Pr... | /-
Copyright (c) 2024 ArkLib Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao, Valerii Huhnin
-/
import CompPoly.Fields.Basic
import CompPoly.Fields.PrattCertificate
import Mathlib.Algebra.Order.Ring.Star
import Mathlib.RingTheory.RootsOfUnity.Pr... | @@ -140,6 +140,12 @@
| 0 => g
| n + 1 => let h := sqChain g n; h * h
+private theorem sqChain_eq_pow_two_pow (g : Field) (n : Nat) :
+ sqChain g n = g ^ (2 ^ n) := by
+ induction n with
+ | zero => simp [sqChain]
+ | succ n ih => simp [sqChain, ih, pow_succ, pow_mul]
+
/-- Primitive generator used by the... | {
"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_acba80411905_8 | 0c3c736bd9306857 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Fields/KoalaBear/Basic.lean | Basic | 8 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 9 | 3 | [
{
"theorem_name": "coprime_three_fieldSize_sub_one",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n -- Using the explicit factorization and concrete numerals\n simpa [fieldSize_sub_one_factorization, twoAdi... | [
{
"name": "fieldSize_sub_one_factorization",
"text": "/-- The factorization `fieldSize - 1 = 2^twoAdicity * 127`. -/\nlemma fieldSize_sub_one_factorization : fieldSize - 1 = 2 ^ twoAdicity * 127 := by\n unfold fieldSize twoAdicity\n decide\n\n",
"fan_in": 3,
"n_lines": 6,
"n_chars": 186,
"... | [
{
"name": "prime_dvd_fieldSize_sub_one_cases",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 15,
"n_chars": 550,
"n_subproofs": 1,
"n_tactics": 10,
"cyclomatic": 2,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 4,
"automation_only": fal... | 1 | /-
Copyright (c) 2024 ArkLib Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao, Valerii Huhnin
-/
import CompPoly.Fields.Basic
import CompPoly.Fields.PrattCertificate
import Mathlib.Algebra.Order.Ring.Star
import Mathlib.RingTheory.RootsOfUnity.Pr... | /-
Copyright (c) 2024 ArkLib Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao, Valerii Huhnin
-/
import CompPoly.Fields.Basic
import CompPoly.Fields.PrattCertificate
import Mathlib.Algebra.Order.Ring.Star
import Mathlib.RingTheory.RootsOfUnity.Pr... | @@ -71,6 +71,11 @@
of `2^n`-th roots of unity for `0 ≤ n ≤ twoAdicity`.
-/
+/-- The factorization `fieldSize - 1 = 2^twoAdicity * 127`. -/
+lemma fieldSize_sub_one_factorization : fieldSize - 1 = 2 ^ twoAdicity * 127 := by
+ unfold fieldSize twoAdicity
+ decide
+
/-!
A table of `2^n`-th roots of unity. The ... | {
"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_acba80411905_9 | a21f6f1b4d13dc4f | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Fields/KoalaBear/Basic.lean | Basic | 9 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 9 | 3 | [
{
"theorem_name": "twoAdicGenerators_pow_twoPow_eq_one",
"depth": 1,
"n_commands": 0,
"n_lines": 12,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [← sqChain_eq_pow_two_pow]\n rcases bits with ⟨n, hn⟩\n have hshift :\n sqChain twoAdicGener... | [
{
"name": "sqChain_eq_pow_two_pow",
"text": "private theorem sqChain_eq_pow_two_pow (g : Field) (n : Nat) :\n sqChain g n = g ^ (2 ^ n) := by\n induction n with\n | zero => simp [sqChain]\n | succ n ih => simp [sqChain, ih, pow_succ, pow_mul]\n\n",
"fan_in": 3,
"n_lines": 7,
"n_chars": 201... | [
{
"name": "primitiveRoot_order",
"fan_in": 0,
"n_deps_direct": 4,
"n_deps_transitive": 11,
"n_lines": 23,
"n_chars": 1001,
"n_subproofs": 2,
"n_tactics": 20,
"cyclomatic": 2,
"n_automation": 8,
"n_rewrites": 6,
"n_structural": 6,
"automation_only": false,
"max... | 8 | /-
Copyright (c) 2024 ArkLib Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao, Valerii Huhnin
-/
import CompPoly.Fields.Basic
import CompPoly.Fields.PrattCertificate
import Mathlib.Algebra.Order.Ring.Star
import Mathlib.RingTheory.RootsOfUnity.Pr... | /-
Copyright (c) 2024 ArkLib Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao, Valerii Huhnin
-/
import CompPoly.Fields.Basic
import CompPoly.Fields.PrattCertificate
import Mathlib.Algebra.Order.Ring.Star
import Mathlib.RingTheory.RootsOfUnity.Pr... | @@ -145,6 +145,12 @@
| 0 => g
| n + 1 => let h := sqChain g n; h * h
+private theorem sqChain_eq_pow_two_pow (g : Field) (n : Nat) :
+ sqChain g n = g ^ (2 ^ n) := by
+ induction n with
+ | zero => simp [sqChain]
+ | succ n ih => simp [sqChain, ih, pow_succ, pow_mul]
+
/-- Repeated squaring walks backwar... | {
"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_638b9bf55992_0 | 8721e7fe46c2f7f6 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/LinearAlgebra/Dense/RowOpsCorrectness.lean | RowOpsCorrectness | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 24 | 7 | [
{
"theorem_name": "get_setD_index_ne_same_row",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n get_setD_index_ne M data hcol hcol' (Or.inr hne) value",
"n_chars": 57,
"n_subproofs": 0,
"n_tactics": ... | [
{
"name": "get_setD_index_ne",
"text": "theorem get_setD_index_ne [Zero F] (M : DenseMatrix F) (data : Array F)\n {row col row' col' : Nat} (hcol : col < M.cols) (hcol' : col' < M.cols)\n (hne : row ≠ row' ∨ col ≠ col') (value : F) :\n (setD data (M.index row col) value).getD (M.index row' col') 0 ... | [
{
"name": "get_setD_index_ne_same_row",
"fan_in": 4,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 8,
"n_chars": 357,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,
"... | 1 | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.LinearAlgebra.Dense.RowOps
import Init.Data.List.Monadic
import Init.Data.Range.Lemmas
import Mathlib.Tactic.Ring
/-!
# Dense Row-Operation 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.LinearAlgebra.Dense.RowOps
import Init.Data.List.Monadic
import Init.Data.Range.Lemmas
import Mathlib.Tactic.Ring
/-!
# Dense Row-Operation C... | @@ -19,11 +19,49 @@
namespace DenseMatrix
+theorem get_setD_index_ne [Zero F] (M : DenseMatrix F) (data : Array F)
+ {row col row' col' : Nat} (hcol : col < M.cols) (hcol' : col' < M.cols)
+ (hne : row ≠ row' ∨ col ≠ col') (value : F) :
+ (setD data (M.index row col) value).getD (M.index row' col') 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_638b9bf55992_1 | 73271094e9f3cae2 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/LinearAlgebra/Dense/RowOpsCorrectness.lean | RowOpsCorrectness | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 24 | 7 | [
{
"theorem_name": "get_setD_index_ne_same_row",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n get_setD_index_ne M data hcol hcol' (Or.inr hne) value",
"n_chars": 57,
"n_subproofs": 0,
"n_tactics": ... | [
{
"name": "get_setD_index_ne",
"text": "theorem get_setD_index_ne [Zero F] (M : DenseMatrix F) (data : Array F)\n {row col row' col' : Nat} (hcol : col < M.cols) (hcol' : col' < M.cols)\n (hne : row ≠ row' ∨ col ≠ col') (value : F) :\n (setD data (M.index row col) value).getD (M.index row' col') 0 ... | [
{
"name": "get_setD_index_ne_same_col",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 8,
"n_chars": 332,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,
"... | 1 | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.LinearAlgebra.Dense.RowOps
import Init.Data.List.Monadic
import Init.Data.Range.Lemmas
import Mathlib.Tactic.Ring
/-!
# Dense Row-Operation 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.LinearAlgebra.Dense.RowOps
import Init.Data.List.Monadic
import Init.Data.Range.Lemmas
import Mathlib.Tactic.Ring
/-!
# Dense Row-Operation C... | @@ -19,11 +19,49 @@
namespace DenseMatrix
+theorem get_setD_index_ne [Zero F] (M : DenseMatrix F) (data : Array F)
+ {row col row' col' : Nat} (hcol : col < M.cols) (hcol' : col' < M.cols)
+ (hne : row ≠ row' ∨ col ≠ col') (value : F) :
+ (setD data (M.index row col) value).getD (M.index row' col') 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_638b9bf55992_2 | f34fed0f22c7c3a2 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/LinearAlgebra/Dense/RowOpsCorrectness.lean | RowOpsCorrectness | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 24 | 3 | [
{
"theorem_name": "swapRows_wf",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold swapRows\n split\n · exact hM\n · simpa [WellFormed, setD, Std.Legacy.Range.forIn_eq_forIn_range',\n list_foldl_... | [
{
"name": "list_foldl_array_size_of_eq",
"text": "theorem list_foldl_array_size_of_eq {α β : Type*}\n (f : Array α → β → Array α)\n (h : ∀ data x, (f data x).size = data.size) :\n ∀ (xs : List β) (data : Array α), (xs.foldl f data).size = data.size := by\n intro xs\n induction xs with\n | nil =>... | [
{
"name": "swapRows_wf",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 9,
"n_chars": 288,
"n_subproofs": 0,
"n_tactics": 6,
"cyclomatic": 2,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false,
"max_nesting": 6... | 1 | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.LinearAlgebra.Dense.RowOps
import Init.Data.List.Monadic
import Init.Data.Range.Lemmas
import Mathlib.Tactic.Ring
/-!
# Dense Row-Operation 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.LinearAlgebra.Dense.RowOps
import Init.Data.List.Monadic
import Init.Data.Range.Lemmas
import Mathlib.Tactic.Ring
/-!
# Dense Row-Operation C... | @@ -19,12 +19,27 @@
namespace DenseMatrix
+theorem list_foldl_array_size_of_eq {α β : Type*}
+ (f : Array α → β → Array α)
+ (h : ∀ data x, (f data x).size = data.size) :
+ ∀ (xs : List β) (data : Array α), (xs.foldl f data).size = data.size := by
+ intro xs
+ induction xs with
+ | nil =>
+ intro ... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_638b9bf55992_3 | 77b16a2c670325e2 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/LinearAlgebra/Dense/RowOpsCorrectness.lean | RowOpsCorrectness | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 24 | 7 | [
{
"theorem_name": "get_setD_index_ne_same_row",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n get_setD_index_ne M data hcol hcol' (Or.inr hne) value",
"n_chars": 57,
"n_subproofs": 0,
"n_tactics": ... | [
{
"name": "get_setD_index_ne",
"text": "theorem get_setD_index_ne [Zero F] (M : DenseMatrix F) (data : Array F)\n {row col row' col' : Nat} (hcol : col < M.cols) (hcol' : col' < M.cols)\n (hne : row ≠ row' ∨ col ≠ col') (value : F) :\n (setD data (M.index row col) value).getD (M.index row' col') 0 ... | [
{
"name": "swapRows_get_of_row_ne",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 40,
"n_chars": 1481,
"n_subproofs": 1,
"n_tactics": 35,
"cyclomatic": 2,
"n_automation": 8,
"n_rewrites": 2,
"n_structural": 10,
"automation_only": false,
"... | 1 | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.LinearAlgebra.Dense.RowOps
import Init.Data.List.Monadic
import Init.Data.Range.Lemmas
import Mathlib.Tactic.Ring
/-!
# Dense Row-Operation 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.LinearAlgebra.Dense.RowOps
import Init.Data.List.Monadic
import Init.Data.Range.Lemmas
import Mathlib.Tactic.Ring
/-!
# Dense Row-Operation C... | @@ -19,6 +19,43 @@
namespace DenseMatrix
+theorem get_setD_index_ne [Zero F] (M : DenseMatrix F) (data : Array F)
+ {row col row' col' : Nat} (hcol : col < M.cols) (hcol' : col' < M.cols)
+ (hne : row ≠ row' ∨ col ≠ col') (value : F) :
+ (setD data (M.index row col) value).getD (M.index row' col') 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_638b9bf55992_4 | cc5042ea57e303ae | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/LinearAlgebra/Dense/RowOpsCorrectness.lean | RowOpsCorrectness | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 24 | 4 | [
{
"theorem_name": "swapRows_get_left",
"depth": 1,
"n_commands": 0,
"n_lines": 94,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n by_cases hsame : rowA = rowB\n · simp [swapRows, hsame]\n · have hfold_not : ∀ (xs : List Nat) (data : Array F),\n ... | [
{
"name": "index_lt_of_lt",
"text": "theorem index_lt_of_lt [Zero F] {M : DenseMatrix F} (hM : WellFormed M)\n {row col : Nat} (hrow : row < M.rows) (hcol : col < M.cols) :\n M.index row col < M.data.size := by\n unfold WellFormed at hM\n rw [hM]\n unfold index\n calc\n row * M.cols + col < row... | [
{
"name": "swapRows_get_left",
"fan_in": 1,
"n_deps_direct": 4,
"n_deps_transitive": 4,
"n_lines": 99,
"n_chars": 3883,
"n_subproofs": 11,
"n_tactics": 97,
"cyclomatic": 3,
"n_automation": 19,
"n_rewrites": 8,
"n_structural": 32,
"automation_only": false,
"max... | 4 | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.LinearAlgebra.Dense.RowOps
import Init.Data.List.Monadic
import Init.Data.Range.Lemmas
import Mathlib.Tactic.Ring
/-!
# Dense Row-Operation 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.LinearAlgebra.Dense.RowOps
import Init.Data.List.Monadic
import Init.Data.Range.Lemmas
import Mathlib.Tactic.Ring
/-!
# Dense Row-Operation C... | @@ -19,6 +19,17 @@
namespace DenseMatrix
+theorem index_lt_of_lt [Zero F] {M : DenseMatrix F} (hM : WellFormed M)
+ {row col : Nat} (hrow : row < M.rows) (hcol : col < M.cols) :
+ M.index row col < M.data.size := by
+ unfold WellFormed at hM
+ rw [hM]
+ unfold index
+ calc
+ row * M.cols + col < row *... | {
"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_638b9bf55992_5 | 031a1c56f07c6ed8 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/LinearAlgebra/Dense/RowOpsCorrectness.lean | RowOpsCorrectness | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 24 | 4 | [
{
"theorem_name": "swapRows_get_left",
"depth": 1,
"n_commands": 0,
"n_lines": 94,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n by_cases hsame : rowA = rowB\n · simp [swapRows, hsame]\n · have hfold_not : ∀ (xs : List Nat) (data : Array F),\n ... | [
{
"name": "index_lt_of_lt",
"text": "theorem index_lt_of_lt [Zero F] {M : DenseMatrix F} (hM : WellFormed M)\n {row col : Nat} (hrow : row < M.rows) (hcol : col < M.cols) :\n M.index row col < M.data.size := by\n unfold WellFormed at hM\n rw [hM]\n unfold index\n calc\n row * M.cols + col < row... | [
{
"name": "swapRows_get_right",
"fan_in": 1,
"n_deps_direct": 4,
"n_deps_transitive": 4,
"n_lines": 96,
"n_chars": 3734,
"n_subproofs": 11,
"n_tactics": 92,
"cyclomatic": 3,
"n_automation": 20,
"n_rewrites": 6,
"n_structural": 27,
"automation_only": false,
"ma... | 4 | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.LinearAlgebra.Dense.RowOps
import Init.Data.List.Monadic
import Init.Data.Range.Lemmas
import Mathlib.Tactic.Ring
/-!
# Dense Row-Operation 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.LinearAlgebra.Dense.RowOps
import Init.Data.List.Monadic
import Init.Data.Range.Lemmas
import Mathlib.Tactic.Ring
/-!
# Dense Row-Operation C... | @@ -19,6 +19,17 @@
namespace DenseMatrix
+theorem index_lt_of_lt [Zero F] {M : DenseMatrix F} (hM : WellFormed M)
+ {row col : Nat} (hrow : row < M.rows) (hcol : col < M.cols) :
+ M.index row col < M.data.size := by
+ unfold WellFormed at hM
+ rw [hM]
+ unfold index
+ calc
+ row * M.cols + col < row *... | {
"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_638b9bf55992_6 | 8c8ad96708cb52a1 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/LinearAlgebra/Dense/RowOpsCorrectness.lean | RowOpsCorrectness | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 24 | 1 | [
{
"theorem_name": "normalizeAndEliminate_cols",
"depth": 1,
"n_commands": 0,
"n_lines": 12,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold normalizeAndEliminate\n by_cases hp : M.get pivotRow pivotCol == 0\n · simp [hp]\n · simp only [hp]\n... | [
{
"name": "list_forIn_addScaledRow_cols",
"text": "theorem list_forIn_addScaledRow_cols [Field F]\n (rows : List Nat) (pivotRow pivotCol : Nat) (out : DenseMatrix F) :\n (Id.run (forIn rows out fun row r ↦\n if row = pivotRow then\n pure (ForInStep.yield r)\n else\n pure (ForIn... | [
{
"name": "normalizeAndEliminate_cols",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 16,
"n_chars": 609,
"n_subproofs": 0,
"n_tactics": 12,
"cyclomatic": 1,
"n_automation": 3,
"n_rewrites": 2,
"n_structural": 0,
"automation_only": false,
... | 1 | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.LinearAlgebra.Dense.RowOps
import Init.Data.List.Monadic
import Init.Data.Range.Lemmas
import Mathlib.Tactic.Ring
/-!
# Dense Row-Operation 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.LinearAlgebra.Dense.RowOps
import Init.Data.List.Monadic
import Init.Data.Range.Lemmas
import Mathlib.Tactic.Ring
/-!
# Dense Row-Operation C... | @@ -19,13 +19,37 @@
namespace DenseMatrix
+theorem list_forIn_addScaledRow_cols [Field F]
+ (rows : List Nat) (pivotRow pivotCol : Nat) (out : DenseMatrix F) :
+ (Id.run (forIn rows out fun row r ↦
+ if row = pivotRow then
+ pure (ForInStep.yield r)
+ else
+ pure (ForInStep.yield
+ ... | {
"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_638b9bf55992_7 | 805883dc36e58717 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/LinearAlgebra/Dense/RowOpsCorrectness.lean | RowOpsCorrectness | 7 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 24 | 1 | [
{
"theorem_name": "normalizeAndEliminate_rows",
"depth": 1,
"n_commands": 0,
"n_lines": 12,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold normalizeAndEliminate\n by_cases hp : M.get pivotRow pivotCol == 0\n · simp [hp]\n · simp only [hp]\n... | [
{
"name": "list_forIn_addScaledRow_rows",
"text": "theorem list_forIn_addScaledRow_rows [Field F]\n (rows : List Nat) (pivotRow pivotCol : Nat) (out : DenseMatrix F) :\n (Id.run (forIn rows out fun row r ↦\n if row = pivotRow then\n pure (ForInStep.yield r)\n else\n pure (ForIn... | [
{
"name": "normalizeAndEliminate_rows",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 16,
"n_chars": 609,
"n_subproofs": 0,
"n_tactics": 12,
"cyclomatic": 1,
"n_automation": 3,
"n_rewrites": 2,
"n_structural": 0,
"automation_only": false,
... | 1 | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.LinearAlgebra.Dense.RowOps
import Init.Data.List.Monadic
import Init.Data.Range.Lemmas
import Mathlib.Tactic.Ring
/-!
# Dense Row-Operation 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.LinearAlgebra.Dense.RowOps
import Init.Data.List.Monadic
import Init.Data.Range.Lemmas
import Mathlib.Tactic.Ring
/-!
# Dense Row-Operation C... | @@ -19,13 +19,37 @@
namespace DenseMatrix
+theorem list_forIn_addScaledRow_rows [Field F]
+ (rows : List Nat) (pivotRow pivotCol : Nat) (out : DenseMatrix F) :
+ (Id.run (forIn rows out fun row r ↦
+ if row = pivotRow then
+ pure (ForInStep.yield r)
+ else
+ pure (ForInStep.yield
+ ... | {
"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_638b9bf55992_8 | 83e78739fcc71676 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/LinearAlgebra/Dense/RowOpsCorrectness.lean | RowOpsCorrectness | 8 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 24 | 7 | [
{
"theorem_name": "get_setD_index_ne_same_row",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n get_setD_index_ne M data hcol hcol' (Or.inr hne) value",
"n_chars": 57,
"n_subproofs": 0,
"n_tactics": ... | [
{
"name": "get_setD_index_ne",
"text": "theorem get_setD_index_ne [Zero F] (M : DenseMatrix F) (data : Array F)\n {row col row' col' : Nat} (hcol : col < M.cols) (hcol' : col' < M.cols)\n (hne : row ≠ row' ∨ col ≠ col') (value : F) :\n (setD data (M.index row col) value).getD (M.index row' col') 0 ... | [
{
"name": "scaleRow_get_of_row_ne",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 31,
"n_chars": 1134,
"n_subproofs": 1,
"n_tactics": 27,
"cyclomatic": 2,
"n_automation": 6,
"n_rewrites": 1,
"n_structural": 10,
"automation_only": false,
"... | 1 | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.LinearAlgebra.Dense.RowOps
import Init.Data.List.Monadic
import Init.Data.Range.Lemmas
import Mathlib.Tactic.Ring
/-!
# Dense Row-Operation 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.LinearAlgebra.Dense.RowOps
import Init.Data.List.Monadic
import Init.Data.Range.Lemmas
import Mathlib.Tactic.Ring
/-!
# Dense Row-Operation C... | @@ -19,6 +19,43 @@
namespace DenseMatrix
+theorem get_setD_index_ne [Zero F] (M : DenseMatrix F) (data : Array F)
+ {row col row' col' : Nat} (hcol : col < M.cols) (hcol' : col' < M.cols)
+ (hne : row ≠ row' ∨ col ≠ col') (value : F) :
+ (setD data (M.index row col) value).getD (M.index row' col') 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_638b9bf55992_9 | b943df33cc40cd5e | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/LinearAlgebra/Dense/RowOpsCorrectness.lean | RowOpsCorrectness | 9 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 24 | 3 | [
{
"theorem_name": "swapRows_wf",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold swapRows\n split\n · exact hM\n · simpa [WellFormed, setD, Std.Legacy.Range.forIn_eq_forIn_range',\n list_foldl_... | [
{
"name": "list_foldl_array_size_of_eq",
"text": "theorem list_foldl_array_size_of_eq {α β : Type*}\n (f : Array α → β → Array α)\n (h : ∀ data x, (f data x).size = data.size) :\n ∀ (xs : List β) (data : Array α), (xs.foldl f data).size = data.size := by\n intro xs\n induction xs with\n | nil =>... | [
{
"name": "scaleRow_wf",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 6,
"n_chars": 262,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true,
"max_nesting": 4
... | 1 | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.LinearAlgebra.Dense.RowOps
import Init.Data.List.Monadic
import Init.Data.Range.Lemmas
import Mathlib.Tactic.Ring
/-!
# Dense Row-Operation 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.LinearAlgebra.Dense.RowOps
import Init.Data.List.Monadic
import Init.Data.Range.Lemmas
import Mathlib.Tactic.Ring
/-!
# Dense Row-Operation C... | @@ -19,8 +19,24 @@
namespace DenseMatrix
+theorem list_foldl_array_size_of_eq {α β : Type*}
+ (f : Array α → β → Array α)
+ (h : ∀ data x, (f data x).size = data.size) :
+ ∀ (xs : List β) (data : Array α), (xs.foldl f data).size = data.size := by
+ intro xs
+ induction xs with
+ | nil =>
+ intro d... | {
"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_638b9bf55992_10 | 13da53477d5956df | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/LinearAlgebra/Dense/RowOpsCorrectness.lean | RowOpsCorrectness | 10 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 24 | 4 | [
{
"theorem_name": "swapRows_get_left",
"depth": 1,
"n_commands": 0,
"n_lines": 94,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n by_cases hsame : rowA = rowB\n · simp [swapRows, hsame]\n · have hfold_not : ∀ (xs : List Nat) (data : Array F),\n ... | [
{
"name": "index_lt_of_lt",
"text": "theorem index_lt_of_lt [Zero F] {M : DenseMatrix F} (hM : WellFormed M)\n {row col : Nat} (hrow : row < M.rows) (hcol : col < M.cols) :\n M.index row col < M.data.size := by\n unfold WellFormed at hM\n rw [hM]\n unfold index\n calc\n row * M.cols + col < row... | [
{
"name": "scaleRow_get_same",
"fan_in": 1,
"n_deps_direct": 3,
"n_deps_transitive": 4,
"n_lines": 83,
"n_chars": 3057,
"n_subproofs": 11,
"n_tactics": 79,
"cyclomatic": 3,
"n_automation": 17,
"n_rewrites": 6,
"n_structural": 28,
"automation_only": false,
"max... | 4 | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.LinearAlgebra.Dense.RowOps
import Init.Data.List.Monadic
import Init.Data.Range.Lemmas
import Mathlib.Tactic.Ring
/-!
# Dense Row-Operation 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.LinearAlgebra.Dense.RowOps
import Init.Data.List.Monadic
import Init.Data.Range.Lemmas
import Mathlib.Tactic.Ring
/-!
# Dense Row-Operation C... | @@ -19,6 +19,17 @@
namespace DenseMatrix
+theorem index_lt_of_lt [Zero F] {M : DenseMatrix F} (hM : WellFormed M)
+ {row col : Nat} (hrow : row < M.rows) (hcol : col < M.cols) :
+ M.index row col < M.data.size := by
+ unfold WellFormed at hM
+ rw [hM]
+ unfold index
+ calc
+ row * M.cols + col < row *... | {
"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_638b9bf55992_11 | 68f5cedaa13d4e0d | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/LinearAlgebra/Dense/RowOpsCorrectness.lean | RowOpsCorrectness | 11 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 24 | 7 | [
{
"theorem_name": "get_setD_index_ne_same_row",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n get_setD_index_ne M data hcol hcol' (Or.inr hne) value",
"n_chars": 57,
"n_subproofs": 0,
"n_tactics": ... | [
{
"name": "get_setD_index_ne",
"text": "theorem get_setD_index_ne [Zero F] (M : DenseMatrix F) (data : Array F)\n {row col row' col' : Nat} (hcol : col < M.cols) (hcol' : col' < M.cols)\n (hne : row ≠ row' ∨ col ≠ col') (value : F) :\n (setD data (M.index row col) value).getD (M.index row' col') 0 ... | [
{
"name": "addScaledRow_get_of_row_ne",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 34,
"n_chars": 1228,
"n_subproofs": 1,
"n_tactics": 29,
"cyclomatic": 2,
"n_automation": 6,
"n_rewrites": 1,
"n_structural": 10,
"automation_only": false,
... | 1 | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.LinearAlgebra.Dense.RowOps
import Init.Data.List.Monadic
import Init.Data.Range.Lemmas
import Mathlib.Tactic.Ring
/-!
# Dense Row-Operation 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.LinearAlgebra.Dense.RowOps
import Init.Data.List.Monadic
import Init.Data.Range.Lemmas
import Mathlib.Tactic.Ring
/-!
# Dense Row-Operation C... | @@ -19,6 +19,43 @@
namespace DenseMatrix
+theorem get_setD_index_ne [Zero F] (M : DenseMatrix F) (data : Array F)
+ {row col row' col' : Nat} (hcol : col < M.cols) (hcol' : col' < M.cols)
+ (hne : row ≠ row' ∨ col ≠ col') (value : F) :
+ (setD data (M.index row col) value).getD (M.index row' col') 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_638b9bf55992_12 | 4d0cfad858b15028 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/LinearAlgebra/Dense/RowOpsCorrectness.lean | RowOpsCorrectness | 12 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 24 | 3 | [
{
"theorem_name": "swapRows_wf",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold swapRows\n split\n · exact hM\n · simpa [WellFormed, setD, Std.Legacy.Range.forIn_eq_forIn_range',\n list_foldl_... | [
{
"name": "list_foldl_array_size_of_eq",
"text": "theorem list_foldl_array_size_of_eq {α β : Type*}\n (f : Array α → β → Array α)\n (h : ∀ data x, (f data x).size = data.size) :\n ∀ (xs : List β) (data : Array α), (xs.foldl f data).size = data.size := by\n intro xs\n induction xs with\n | nil =>... | [
{
"name": "addScaledRow_wf",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 6,
"n_chars": 294,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true,
"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.LinearAlgebra.Dense.RowOps
import Init.Data.List.Monadic
import Init.Data.Range.Lemmas
import Mathlib.Tactic.Ring
/-!
# Dense Row-Operation 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.LinearAlgebra.Dense.RowOps
import Init.Data.List.Monadic
import Init.Data.Range.Lemmas
import Mathlib.Tactic.Ring
/-!
# Dense Row-Operation C... | @@ -19,8 +19,24 @@
namespace DenseMatrix
+theorem list_foldl_array_size_of_eq {α β : Type*}
+ (f : Array α → β → Array α)
+ (h : ∀ data x, (f data x).size = data.size) :
+ ∀ (xs : List β) (data : Array α), (xs.foldl f data).size = data.size := by
+ intro xs
+ induction xs with
+ | nil =>
+ intro d... | {
"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_638b9bf55992_13 | 7ec14c00938f8910 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/LinearAlgebra/Dense/RowOpsCorrectness.lean | RowOpsCorrectness | 13 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 24 | 4 | [
{
"theorem_name": "swapRows_get_left",
"depth": 1,
"n_commands": 0,
"n_lines": 94,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n by_cases hsame : rowA = rowB\n · simp [swapRows, hsame]\n · have hfold_not : ∀ (xs : List Nat) (data : Array F),\n ... | [
{
"name": "index_lt_of_lt",
"text": "theorem index_lt_of_lt [Zero F] {M : DenseMatrix F} (hM : WellFormed M)\n {row col : Nat} (hrow : row < M.rows) (hcol : col < M.cols) :\n M.index row col < M.data.size := by\n unfold WellFormed at hM\n rw [hM]\n unfold index\n calc\n row * M.cols + col < row... | [
{
"name": "addScaledRow_get_same",
"fan_in": 1,
"n_deps_direct": 3,
"n_deps_transitive": 4,
"n_lines": 92,
"n_chars": 3470,
"n_subproofs": 11,
"n_tactics": 87,
"cyclomatic": 3,
"n_automation": 17,
"n_rewrites": 6,
"n_structural": 28,
"automation_only": false,
... | 4 | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.LinearAlgebra.Dense.RowOps
import Init.Data.List.Monadic
import Init.Data.Range.Lemmas
import Mathlib.Tactic.Ring
/-!
# Dense Row-Operation 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.LinearAlgebra.Dense.RowOps
import Init.Data.List.Monadic
import Init.Data.Range.Lemmas
import Mathlib.Tactic.Ring
/-!
# Dense Row-Operation C... | @@ -19,6 +19,17 @@
namespace DenseMatrix
+theorem index_lt_of_lt [Zero F] {M : DenseMatrix F} (hM : WellFormed M)
+ {row col : Nat} (hrow : row < M.rows) (hcol : col < M.cols) :
+ M.index row col < M.data.size := by
+ unfold WellFormed at hM
+ rw [hM]
+ unfold index
+ calc
+ row * M.cols + col < row *... | {
"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_638b9bf55992_14 | 3e66a9476edb1b09 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/LinearAlgebra/Dense/RowOpsCorrectness.lean | RowOpsCorrectness | 14 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 24 | 4 | [
{
"theorem_name": "swapRows_get_left",
"depth": 1,
"n_commands": 0,
"n_lines": 94,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n by_cases hsame : rowA = rowB\n · simp [swapRows, hsame]\n · have hfold_not : ∀ (xs : List Nat) (data : Array F),\n ... | [
{
"name": "index_lt_of_lt",
"text": "theorem index_lt_of_lt [Zero F] {M : DenseMatrix F} (hM : WellFormed M)\n {row col : Nat} (hrow : row < M.rows) (hcol : col < M.cols) :\n M.index row col < M.data.size := by\n unfold WellFormed at hM\n rw [hM]\n unfold index\n calc\n row * M.cols + col < row... | [
{
"name": "dotRow_scaleRow_same",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 5,
"n_lines": 40,
"n_chars": 1345,
"n_subproofs": 1,
"n_tactics": 35,
"cyclomatic": 2,
"n_automation": 6,
"n_rewrites": 4,
"n_structural": 10,
"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.LinearAlgebra.Dense.RowOps
import Init.Data.List.Monadic
import Init.Data.Range.Lemmas
import Mathlib.Tactic.Ring
/-!
# Dense Row-Operation 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.LinearAlgebra.Dense.RowOps
import Init.Data.List.Monadic
import Init.Data.Range.Lemmas
import Mathlib.Tactic.Ring
/-!
# Dense Row-Operation C... | @@ -19,6 +19,17 @@
namespace DenseMatrix
+theorem index_lt_of_lt [Zero F] {M : DenseMatrix F} (hM : WellFormed M)
+ {row col : Nat} (hrow : row < M.rows) (hcol : col < M.cols) :
+ M.index row col < M.data.size := by
+ unfold WellFormed at hM
+ rw [hM]
+ unfold index
+ calc
+ row * M.cols + col < row *... | {
"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_638b9bf55992_15 | 41610798fd0313a8 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/LinearAlgebra/Dense/RowOpsCorrectness.lean | RowOpsCorrectness | 15 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 24 | 4 | [
{
"theorem_name": "swapRows_get_left",
"depth": 1,
"n_commands": 0,
"n_lines": 94,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n by_cases hsame : rowA = rowB\n · simp [swapRows, hsame]\n · have hfold_not : ∀ (xs : List Nat) (data : Array F),\n ... | [
{
"name": "index_lt_of_lt",
"text": "theorem index_lt_of_lt [Zero F] {M : DenseMatrix F} (hM : WellFormed M)\n {row col : Nat} (hrow : row < M.rows) (hcol : col < M.cols) :\n M.index row col < M.data.size := by\n unfold WellFormed at hM\n rw [hM]\n unfold index\n calc\n row * M.cols + col < row... | [
{
"name": "dotRow_addScaledRow_same",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 5,
"n_lines": 46,
"n_chars": 1716,
"n_subproofs": 1,
"n_tactics": 40,
"cyclomatic": 2,
"n_automation": 6,
"n_rewrites": 4,
"n_structural": 10,
"automation_only": false,
... | 5 | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.LinearAlgebra.Dense.RowOps
import Init.Data.List.Monadic
import Init.Data.Range.Lemmas
import Mathlib.Tactic.Ring
/-!
# Dense Row-Operation 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.LinearAlgebra.Dense.RowOps
import Init.Data.List.Monadic
import Init.Data.Range.Lemmas
import Mathlib.Tactic.Ring
/-!
# Dense Row-Operation C... | @@ -19,6 +19,17 @@
namespace DenseMatrix
+theorem index_lt_of_lt [Zero F] {M : DenseMatrix F} (hM : WellFormed M)
+ {row col : Nat} (hrow : row < M.rows) (hcol : col < M.cols) :
+ M.index row col < M.data.size := by
+ unfold WellFormed at hM
+ rw [hM]
+ unfold index
+ calc
+ row * M.cols + col < row *... | {
"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_638b9bf55992_16 | 8cf22d3eb53f0b3c | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/LinearAlgebra/Dense/RowOpsCorrectness.lean | RowOpsCorrectness | 16 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 24 | 4 | [
{
"theorem_name": "swapRows_get_left",
"depth": 1,
"n_commands": 0,
"n_lines": 94,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n by_cases hsame : rowA = rowB\n · simp [swapRows, hsame]\n · have hfold_not : ∀ (xs : List Nat) (data : Array F),\n ... | [
{
"name": "get_setD_index_same",
"text": "theorem get_setD_index_same [Zero F] {M : DenseMatrix F} {data : Array F}\n {row col : Nat} (hidx : M.index row col < data.size) (value : F) :\n (setD data (M.index row col) value).getD (M.index row col) 0 = value := by\n unfold setD\n rw [Array.getD_eq_getD... | [
{
"name": "dotRow_swapRows_left",
"fan_in": 2,
"n_deps_direct": 3,
"n_deps_transitive": 7,
"n_lines": 9,
"n_chars": 401,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 2,
"automation_only": false,
"max_ne... | 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.LinearAlgebra.Dense.RowOps
import Init.Data.List.Monadic
import Init.Data.Range.Lemmas
import Mathlib.Tactic.Ring
/-!
# Dense Row-Operation 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.LinearAlgebra.Dense.RowOps
import Init.Data.List.Monadic
import Init.Data.Range.Lemmas
import Mathlib.Tactic.Ring
/-!
# Dense Row-Operation C... | @@ -30,6 +30,13 @@
_ = (row + 1) * M.cols := by rw [Nat.succ_mul]
_ ≤ M.rows * M.cols := Nat.mul_le_mul_right M.cols hrow
+theorem get_setD_index_same [Zero F] {M : DenseMatrix F} {data : Array F}
+ {row col : Nat} (hidx : M.index row col < data.size) (value : F) :
+ (setD data (M.index row col) value... | {
"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_638b9bf55992_17 | b7414d524a884f9a | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/LinearAlgebra/Dense/RowOpsCorrectness.lean | RowOpsCorrectness | 17 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 24 | 4 | [
{
"theorem_name": "swapRows_get_left",
"depth": 1,
"n_commands": 0,
"n_lines": 94,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n by_cases hsame : rowA = rowB\n · simp [swapRows, hsame]\n · have hfold_not : ∀ (xs : List Nat) (data : Array F),\n ... | [
{
"name": "get_setD_index_same",
"text": "theorem get_setD_index_same [Zero F] {M : DenseMatrix F} {data : Array F}\n {row col : Nat} (hidx : M.index row col < data.size) (value : F) :\n (setD data (M.index row col) value).getD (M.index row col) 0 = value := by\n unfold setD\n rw [Array.getD_eq_getD... | [
{
"name": "dotRow_swapRows_right",
"fan_in": 2,
"n_deps_direct": 3,
"n_deps_transitive": 7,
"n_lines": 9,
"n_chars": 403,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 2,
"automation_only": false,
"max_n... | 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.LinearAlgebra.Dense.RowOps
import Init.Data.List.Monadic
import Init.Data.Range.Lemmas
import Mathlib.Tactic.Ring
/-!
# Dense Row-Operation 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.LinearAlgebra.Dense.RowOps
import Init.Data.List.Monadic
import Init.Data.Range.Lemmas
import Mathlib.Tactic.Ring
/-!
# Dense Row-Operation C... | @@ -30,6 +30,13 @@
_ = (row + 1) * M.cols := by rw [Nat.succ_mul]
_ ≤ M.rows * M.cols := Nat.mul_le_mul_right M.cols hrow
+theorem get_setD_index_same [Zero F] {M : DenseMatrix F} {data : Array F}
+ {row col : Nat} (hidx : M.index row col < data.size) (value : F) :
+ (setD data (M.index row col) value... | {
"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_638b9bf55992_18 | 88d10b596dccf438 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/LinearAlgebra/Dense/RowOpsCorrectness.lean | RowOpsCorrectness | 18 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 24 | 7 | [
{
"theorem_name": "get_setD_index_ne_same_row",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n get_setD_index_ne M data hcol hcol' (Or.inr hne) value",
"n_chars": 57,
"n_subproofs": 0,
"n_tactics": ... | [
{
"name": "get_setD_index_ne",
"text": "theorem get_setD_index_ne [Zero F] (M : DenseMatrix F) (data : Array F)\n {row col row' col' : Nat} (hcol : col < M.cols) (hcol' : col' < M.cols)\n (hne : row ≠ row' ∨ col ≠ col') (value : F) :\n (setD data (M.index row col) value).getD (M.index row' col') 0 ... | [
{
"name": "dotRow_swapRows_of_ne",
"fan_in": 2,
"n_deps_direct": 3,
"n_deps_transitive": 4,
"n_lines": 10,
"n_chars": 416,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 2,
"automation_only": false,
"max_... | 4 | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.LinearAlgebra.Dense.RowOps
import Init.Data.List.Monadic
import Init.Data.Range.Lemmas
import Mathlib.Tactic.Ring
/-!
# Dense Row-Operation 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.LinearAlgebra.Dense.RowOps
import Init.Data.List.Monadic
import Init.Data.Range.Lemmas
import Mathlib.Tactic.Ring
/-!
# Dense Row-Operation C... | @@ -19,6 +19,43 @@
namespace DenseMatrix
+theorem get_setD_index_ne [Zero F] (M : DenseMatrix F) (data : Array F)
+ {row col row' col' : Nat} (hcol : col < M.cols) (hcol' : col' < M.cols)
+ (hne : row ≠ row' ∨ col ≠ col') (value : F) :
+ (setD data (M.index row col) value).getD (M.index row' col') 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_638b9bf55992_19 | fe6683efbcf20871 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/LinearAlgebra/Dense/RowOpsCorrectness.lean | RowOpsCorrectness | 19 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 24 | 7 | [
{
"theorem_name": "get_setD_index_ne_same_row",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n get_setD_index_ne M data hcol hcol' (Or.inr hne) value",
"n_chars": 57,
"n_subproofs": 0,
"n_tactics": ... | [
{
"name": "get_setD_index_ne",
"text": "theorem get_setD_index_ne [Zero F] (M : DenseMatrix F) (data : Array F)\n {row col row' col' : Nat} (hcol : col < M.cols) (hcol' : col' < M.cols)\n (hne : row ≠ row' ∨ col ≠ col') (value : F) :\n (setD data (M.index row col) value).getD (M.index row' col') 0 ... | [
{
"name": "dotRow_scaleRow_of_ne",
"fan_in": 2,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 9,
"n_chars": 385,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": false,
"max_n... | 3 | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.LinearAlgebra.Dense.RowOps
import Init.Data.List.Monadic
import Init.Data.Range.Lemmas
import Mathlib.Tactic.Ring
/-!
# Dense Row-Operation 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.LinearAlgebra.Dense.RowOps
import Init.Data.List.Monadic
import Init.Data.Range.Lemmas
import Mathlib.Tactic.Ring
/-!
# Dense Row-Operation C... | @@ -19,6 +19,43 @@
namespace DenseMatrix
+theorem get_setD_index_ne [Zero F] (M : DenseMatrix F) (data : Array F)
+ {row col row' col' : Nat} (hcol : col < M.cols) (hcol' : col' < M.cols)
+ (hne : row ≠ row' ∨ col ≠ col') (value : F) :
+ (setD data (M.index row col) value).getD (M.index row' col') 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_638b9bf55992_20 | 22c96c57a7561281 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/LinearAlgebra/Dense/RowOpsCorrectness.lean | RowOpsCorrectness | 20 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 24 | 7 | [
{
"theorem_name": "get_setD_index_ne_same_row",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n get_setD_index_ne M data hcol hcol' (Or.inr hne) value",
"n_chars": 57,
"n_subproofs": 0,
"n_tactics": ... | [
{
"name": "get_setD_index_ne",
"text": "theorem get_setD_index_ne [Zero F] (M : DenseMatrix F) (data : Array F)\n {row col row' col' : Nat} (hcol : col < M.cols) (hcol' : col' < M.cols)\n (hne : row ≠ row' ∨ col ≠ col') (value : F) :\n (setD data (M.index row col) value).getD (M.index row' col') 0 ... | [
{
"name": "dotRow_addScaledRow_of_ne",
"fan_in": 2,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 9,
"n_chars": 430,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": false,
"m... | 3 | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.LinearAlgebra.Dense.RowOps
import Init.Data.List.Monadic
import Init.Data.Range.Lemmas
import Mathlib.Tactic.Ring
/-!
# Dense Row-Operation 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.LinearAlgebra.Dense.RowOps
import Init.Data.List.Monadic
import Init.Data.Range.Lemmas
import Mathlib.Tactic.Ring
/-!
# Dense Row-Operation C... | @@ -19,6 +19,43 @@
namespace DenseMatrix
+theorem get_setD_index_ne [Zero F] (M : DenseMatrix F) (data : Array F)
+ {row col row' col' : Nat} (hcol : col < M.cols) (hcol' : col' < M.cols)
+ (hne : row ≠ row' ∨ col ≠ col') (value : F) :
+ (setD data (M.index row col) value).getD (M.index row' col') 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_638b9bf55992_21 | fbe3f9c5ce5e21e8 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/LinearAlgebra/Dense/RowOpsCorrectness.lean | RowOpsCorrectness | 21 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 24 | 4 | [
{
"theorem_name": "swapRows_get_left",
"depth": 1,
"n_commands": 0,
"n_lines": 94,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n by_cases hsame : rowA = rowB\n · simp [swapRows, hsame]\n · have hfold_not : ∀ (xs : List Nat) (data : Array F),\n ... | [
{
"name": "get_setD_index_same",
"text": "theorem get_setD_index_same [Zero F] {M : DenseMatrix F} {data : Array F}\n {row col : Nat} (hidx : M.index row col < data.size) (value : F) :\n (setD data (M.index row col) value).getD (M.index row col) 0 = value := by\n unfold setD\n rw [Array.getD_eq_getD... | [
{
"name": "isHomogeneousSolution_swapRows_of_solution",
"fan_in": 0,
"n_deps_direct": 4,
"n_deps_transitive": 13,
"n_lines": 22,
"n_chars": 875,
"n_subproofs": 1,
"n_tactics": 18,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 5,
"n_structural": 8,
"automation_... | 13 | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.LinearAlgebra.Dense.RowOps
import Init.Data.List.Monadic
import Init.Data.Range.Lemmas
import Mathlib.Tactic.Ring
/-!
# Dense Row-Operation 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.LinearAlgebra.Dense.RowOps
import Init.Data.List.Monadic
import Init.Data.Range.Lemmas
import Mathlib.Tactic.Ring
/-!
# Dense Row-Operation C... | @@ -30,6 +30,13 @@
_ = (row + 1) * M.cols := by rw [Nat.succ_mul]
_ ≤ M.rows * M.cols := Nat.mul_le_mul_right M.cols hrow
+theorem get_setD_index_same [Zero F] {M : DenseMatrix F} {data : Array F}
+ {row col : Nat} (hidx : M.index row col < data.size) (value : F) :
+ (setD data (M.index row col) value... | {
"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_638b9bf55992_22 | e71c3eee98266b06 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/LinearAlgebra/Dense/RowOpsCorrectness.lean | RowOpsCorrectness | 22 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 24 | 4 | [
{
"theorem_name": "swapRows_get_left",
"depth": 1,
"n_commands": 0,
"n_lines": 94,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n by_cases hsame : rowA = rowB\n · simp [swapRows, hsame]\n · have hfold_not : ∀ (xs : List Nat) (data : Array F),\n ... | [
{
"name": "get_setD_index_same",
"text": "theorem get_setD_index_same [Zero F] {M : DenseMatrix F} {data : Array F}\n {row col : Nat} (hidx : M.index row col < data.size) (value : F) :\n (setD data (M.index row col) value).getD (M.index row col) 0 = value := by\n unfold setD\n rw [Array.getD_eq_getD... | [
{
"name": "isHomogeneousSolution_scaleRow_of_solution",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 9,
"n_lines": 17,
"n_chars": 624,
"n_subproofs": 1,
"n_tactics": 11,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 4,
"n_structural": 2,
"automation_o... | 9 | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.LinearAlgebra.Dense.RowOps
import Init.Data.List.Monadic
import Init.Data.Range.Lemmas
import Mathlib.Tactic.Ring
/-!
# Dense Row-Operation 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.LinearAlgebra.Dense.RowOps
import Init.Data.List.Monadic
import Init.Data.Range.Lemmas
import Mathlib.Tactic.Ring
/-!
# Dense Row-Operation C... | @@ -30,6 +30,13 @@
_ = (row + 1) * M.cols := by rw [Nat.succ_mul]
_ ≤ M.rows * M.cols := Nat.mul_le_mul_right M.cols hrow
+theorem get_setD_index_same [Zero F] {M : DenseMatrix F} {data : Array F}
+ {row col : Nat} (hidx : M.index row col < data.size) (value : F) :
+ (setD data (M.index row col) value... | {
"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_638b9bf55992_23 | 6c75cf8375ebe2d0 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/LinearAlgebra/Dense/RowOpsCorrectness.lean | RowOpsCorrectness | 23 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 24 | 4 | [
{
"theorem_name": "swapRows_get_left",
"depth": 1,
"n_commands": 0,
"n_lines": 94,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n by_cases hsame : rowA = rowB\n · simp [swapRows, hsame]\n · have hfold_not : ∀ (xs : List Nat) (data : Array F),\n ... | [
{
"name": "get_setD_index_same",
"text": "theorem get_setD_index_same [Zero F] {M : DenseMatrix F} {data : Array F}\n {row col : Nat} (hidx : M.index row col < data.size) (value : F) :\n (setD data (M.index row col) value).getD (M.index row col) 0 = value := by\n unfold setD\n rw [Array.getD_eq_getD... | [
{
"name": "isHomogeneousSolution_addScaledRow_of_solution",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 9,
"n_lines": 17,
"n_chars": 727,
"n_subproofs": 1,
"n_tactics": 11,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 4,
"n_structural": 2,
"automati... | 9 | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.LinearAlgebra.Dense.RowOps
import Init.Data.List.Monadic
import Init.Data.Range.Lemmas
import Mathlib.Tactic.Ring
/-!
# Dense Row-Operation 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.LinearAlgebra.Dense.RowOps
import Init.Data.List.Monadic
import Init.Data.Range.Lemmas
import Mathlib.Tactic.Ring
/-!
# Dense Row-Operation C... | @@ -30,6 +30,13 @@
_ = (row + 1) * M.cols := by rw [Nat.succ_mul]
_ ≤ M.rows * M.cols := Nat.mul_le_mul_right M.cols hrow
+theorem get_setD_index_same [Zero F] {M : DenseMatrix F} {data : Array F}
+ {row col : Nat} (hidx : M.index row col < data.size) (value : F) :
+ (setD data (M.index row col) value... | {
"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_638b9bf55992_24 | 868800ef47a94fe4 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/LinearAlgebra/Dense/RowOpsCorrectness.lean | RowOpsCorrectness | 24 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 24 | 4 | [
{
"theorem_name": "swapRows_get_left",
"depth": 1,
"n_commands": 0,
"n_lines": 94,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n by_cases hsame : rowA = rowB\n · simp [swapRows, hsame]\n · have hfold_not : ∀ (xs : List Nat) (data : Array F),\n ... | [
{
"name": "get_setD_index_same",
"text": "theorem get_setD_index_same [Zero F] {M : DenseMatrix F} {data : Array F}\n {row col : Nat} (hidx : M.index row col < data.size) (value : F) :\n (setD data (M.index row col) value).getD (M.index row col) 0 = value := by\n unfold setD\n rw [Array.getD_eq_getD... | [
{
"name": "isHomogeneousSolution_of_swapRows_solution",
"fan_in": 0,
"n_deps_direct": 4,
"n_deps_transitive": 13,
"n_lines": 30,
"n_chars": 1206,
"n_subproofs": 6,
"n_tactics": 26,
"cyclomatic": 1,
"n_automation": 3,
"n_rewrites": 5,
"n_structural": 8,
"automation... | 13 | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.LinearAlgebra.Dense.RowOps
import Init.Data.List.Monadic
import Init.Data.Range.Lemmas
import Mathlib.Tactic.Ring
/-!
# Dense Row-Operation 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.LinearAlgebra.Dense.RowOps
import Init.Data.List.Monadic
import Init.Data.Range.Lemmas
import Mathlib.Tactic.Ring
/-!
# Dense Row-Operation C... | @@ -30,6 +30,13 @@
_ = (row + 1) * M.cols := by rw [Nat.succ_mul]
_ ≤ M.rows * M.cols := Nat.mul_le_mul_right M.cols hrow
+theorem get_setD_index_same [Zero F] {M : DenseMatrix F} {data : Array F}
+ {row col : Nat} (hidx : M.index row col < data.size) (value : F) :
+ (setD data (M.index row col) value... | {
"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_638b9bf55992_25 | e5d149474bb80d2b | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/LinearAlgebra/Dense/RowOpsCorrectness.lean | RowOpsCorrectness | 25 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 24 | 4 | [
{
"theorem_name": "swapRows_get_left",
"depth": 1,
"n_commands": 0,
"n_lines": 94,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n by_cases hsame : rowA = rowB\n · simp [swapRows, hsame]\n · have hfold_not : ∀ (xs : List Nat) (data : Array F),\n ... | [
{
"name": "get_setD_index_same",
"text": "theorem get_setD_index_same [Zero F] {M : DenseMatrix F} {data : Array F}\n {row col : Nat} (hidx : M.index row col < data.size) (value : F) :\n (setD data (M.index row col) value).getD (M.index row col) 0 = value := by\n unfold setD\n rw [Array.getD_eq_getD... | [
{
"name": "isHomogeneousSolution_of_scaleRow_solution",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 9,
"n_lines": 21,
"n_chars": 877,
"n_subproofs": 4,
"n_tactics": 15,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 3,
"n_structural": 3,
"automation_o... | 9 | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.LinearAlgebra.Dense.RowOps
import Init.Data.List.Monadic
import Init.Data.Range.Lemmas
import Mathlib.Tactic.Ring
/-!
# Dense Row-Operation 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.LinearAlgebra.Dense.RowOps
import Init.Data.List.Monadic
import Init.Data.Range.Lemmas
import Mathlib.Tactic.Ring
/-!
# Dense Row-Operation C... | @@ -30,6 +30,13 @@
_ = (row + 1) * M.cols := by rw [Nat.succ_mul]
_ ≤ M.rows * M.cols := Nat.mul_le_mul_right M.cols hrow
+theorem get_setD_index_same [Zero F] {M : DenseMatrix F} {data : Array F}
+ {row col : Nat} (hidx : M.index row col < data.size) (value : F) :
+ (setD data (M.index row col) value... | {
"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_638b9bf55992_26 | 861b216ff3f220cb | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/LinearAlgebra/Dense/RowOpsCorrectness.lean | RowOpsCorrectness | 26 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 24 | 4 | [
{
"theorem_name": "swapRows_get_left",
"depth": 1,
"n_commands": 0,
"n_lines": 94,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n by_cases hsame : rowA = rowB\n · simp [swapRows, hsame]\n · have hfold_not : ∀ (xs : List Nat) (data : Array F),\n ... | [
{
"name": "get_setD_index_same",
"text": "theorem get_setD_index_same [Zero F] {M : DenseMatrix F} {data : Array F}\n {row col : Nat} (hidx : M.index row col < data.size) (value : F) :\n (setD data (M.index row col) value).getD (M.index row col) 0 = value := by\n unfold setD\n rw [Array.getD_eq_getD... | [
{
"name": "isHomogeneousSolution_of_addScaledRow_solution",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 9,
"n_lines": 28,
"n_chars": 1318,
"n_subproofs": 6,
"n_tactics": 21,
"cyclomatic": 1,
"n_automation": 3,
"n_rewrites": 5,
"n_structural": 3,
"automat... | 9 | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.LinearAlgebra.Dense.RowOps
import Init.Data.List.Monadic
import Init.Data.Range.Lemmas
import Mathlib.Tactic.Ring
/-!
# Dense Row-Operation 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.LinearAlgebra.Dense.RowOps
import Init.Data.List.Monadic
import Init.Data.Range.Lemmas
import Mathlib.Tactic.Ring
/-!
# Dense Row-Operation C... | @@ -30,6 +30,13 @@
_ = (row + 1) * M.cols := by rw [Nat.succ_mul]
_ ≤ M.rows * M.cols := Nat.mul_le_mul_right M.cols hrow
+theorem get_setD_index_same [Zero F] {M : DenseMatrix F} {data : Array F}
+ {row col : Nat} (hidx : M.index row col < data.size) (value : F) :
+ (setD data (M.index row col) value... | {
"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_9ea0b2ff54ac_0 | 14082e8c1cad5b0d | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Bivariate/GuruswamiSudan/Interpolation/Dense/Correctness.lean | Correctness | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 34 | 3 | [
{
"theorem_name": "interpolationMatrix_wf",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n exact interpolationMatrixOnBasis_wf (interpolationMonomials params) points params",
"n_chars": 87,
"n_subpro... | [
{
"name": "interpolationMatrixOnBasis_wf",
"text": "/-- The basis-parametric interpolation matrix is built with rectangular dense storage. -/\nprivate theorem interpolationMatrixOnBasis_wf {F : Type*} [Semiring F]\n (basis : Array CBivariate.Monomial)\n (points : Array (Prod F F)) (params : GSInterpPa... | [
{
"name": "interpolationMatrix_wf",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 7,
"n_chars": 351,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": false,
"max_... | 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.Interpolation.Dense.Algorithm
import CompPoly.Bivariate.GuruswamiSudan.Interpolation.Correctness
import CompPoly.Biva... | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Bivariate.GuruswamiSudan.Interpolation.Dense.Algorithm
import CompPoly.Bivariate.GuruswamiSudan.Interpolation.Correctness
import CompPoly.Biva... | @@ -20,10 +20,19 @@
namespace GuruswamiSudan
+/-- The basis-parametric interpolation matrix is built with rectangular dense storage. -/
+private theorem interpolationMatrixOnBasis_wf {F : Type*} [Semiring F]
+ (basis : Array CBivariate.Monomial)
+ (points : Array (Prod F F)) (params : GSInterpParams) :
+ ... | {
"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_9ea0b2ff54ac_1 | 9f9e743de72f5118 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Bivariate/GuruswamiSudan/Interpolation/Dense/Correctness.lean | Correctness | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 34 | 2 | [
{
"theorem_name": "normalizeVector?_some_data",
"depth": 1,
"n_commands": 0,
"n_lines": 21,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold normalizeVector? at h\n cases hpivot : firstNonzeroIndex? v with\n | none =>\n simp [hpivot] at h... | [
{
"name": "firstNonzeroIndex?_some_lt_ne",
"text": "private theorem firstNonzeroIndex?_some_lt_ne {F : Type*} [Zero F] [BEq F] [LawfulBEq F]\n {v : Array F} {i : Nat} (h : firstNonzeroIndex? v = some i) :\n i < v.size ∧ v.getD i 0 ≠ 0 := by\n unfold firstNonzeroIndex? at h\n rcases List.find?_eq_som... | [
{
"name": "normalizeVector?_some_data",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 27,
"n_chars": 1063,
"n_subproofs": 3,
"n_tactics": 21,
"cyclomatic": 3,
"n_automation": 4,
"n_rewrites": 7,
"n_structural": 4,
"automation_only": false,
... | 2 | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Bivariate.GuruswamiSudan.Interpolation.Dense.Algorithm
import CompPoly.Bivariate.GuruswamiSudan.Interpolation.Correctness
import CompPoly.Biva... | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Bivariate.GuruswamiSudan.Interpolation.Dense.Algorithm
import CompPoly.Bivariate.GuruswamiSudan.Interpolation.Correctness
import CompPoly.Biva... | @@ -41,6 +41,20 @@
(interpolationMatrixOnBasis basis points params).cols = basis.size := by
rfl
+private theorem firstNonzeroIndex?_some_lt_ne {F : Type*} [Zero F] [BEq F] [LawfulBEq F]
+ {v : Array F} {i : Nat} (h : firstNonzeroIndex? v = some i) :
+ i < v.size ∧ v.getD i 0 ≠ 0 := by
+ unfold firstNon... | {
"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_9ea0b2ff54ac_2 | 61ba0db23c7cd4d1 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Bivariate/GuruswamiSudan/Interpolation/Dense/Correctness.lean | Correctness | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 34 | 2 | [
{
"theorem_name": "interpolationConstraints_mem",
"depth": 1,
"n_commands": 0,
"n_lines": 28,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [interpolationConstraints_eq_fold]\n unfold interpolationConstraintsFold\n apply Array.mem_toList_iff.mp... | [
{
"name": "interpolationConstraints_eq_fold",
"text": "private theorem interpolationConstraints_eq_fold {F : Type*}\n (points : Array (Prod F F)) (multiplicity : Nat) :\n interpolationConstraints points multiplicity =\n interpolationConstraintsFold points multiplicity := by\n unfold interpolatio... | [
{
"name": "interpolationConstraints_mem",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 34,
"n_chars": 1433,
"n_subproofs": 0,
"n_tactics": 28,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 2,
"n_structural": 11,
"automation_only": false,... | 2 | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Bivariate.GuruswamiSudan.Interpolation.Dense.Algorithm
import CompPoly.Bivariate.GuruswamiSudan.Interpolation.Correctness
import CompPoly.Biva... | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Bivariate.GuruswamiSudan.Interpolation.Dense.Algorithm
import CompPoly.Bivariate.GuruswamiSudan.Interpolation.Correctness
import CompPoly.Biva... | @@ -102,6 +102,13 @@
constraints)
#[]
+private theorem interpolationConstraints_eq_fold {F : Type*}
+ (points : Array (Prod F F)) (multiplicity : Nat) :
+ interpolationConstraints points multiplicity =
+ interpolationConstraintsFold points multiplicity := by
+ unfold interpolationConstraints... | {
"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_9ea0b2ff54ac_3 | 99bbe49ce6294ada | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Bivariate/GuruswamiSudan/Interpolation/Dense/Correctness.lean | Correctness | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 34 | 4 | [
{
"theorem_name": "interpolationMatrixOnBasis_get",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hrow' : row < (interpolationConstraints points params.multiplicity).size := by\n simpa [interpolatio... | [
{
"name": "interpolationMatrixOnBasis_rows",
"text": "private theorem interpolationMatrixOnBasis_rows {F : Type*} [Semiring F]\n (basis : Array CBivariate.Monomial)\n (points : Array (Prod F F)) (params : GSInterpParams) :\n (interpolationMatrixOnBasis basis points params).rows =\n (interpolat... | [
{
"name": "interpolationMatrixOnBasis_get",
"fan_in": 2,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 17,
"n_chars": 911,
"n_subproofs": 2,
"n_tactics": 7,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 2,
"n_structural": 0,
"automation_only": false,
... | 2 | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Bivariate.GuruswamiSudan.Interpolation.Dense.Algorithm
import CompPoly.Bivariate.GuruswamiSudan.Interpolation.Correctness
import CompPoly.Biva... | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Bivariate.GuruswamiSudan.Interpolation.Dense.Algorithm
import CompPoly.Bivariate.GuruswamiSudan.Interpolation.Correctness
import CompPoly.Biva... | @@ -28,6 +28,13 @@
simp [DenseMatrix.WellFormed, interpolationMatrixOnBasis,
interpolationConstraintMatrixOnBasis, DenseMatrix.ofFn]
+private theorem interpolationMatrixOnBasis_rows {F : Type*} [Semiring F]
+ (basis : Array CBivariate.Monomial)
+ (points : Array (Prod F F)) (params : GSInterpParams) :
+... | {
"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_9ea0b2ff54ac_4 | ce2dc1d8ffa6d1f4 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Bivariate/GuruswamiSudan/Interpolation/Dense/Correctness.lean | Correctness | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 34 | 4 | [
{
"theorem_name": "interpolationMatrixOnBasis_get",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hrow' : row < (interpolationConstraints points params.multiplicity).size := by\n simpa [interpolatio... | [
{
"name": "interpolationMatrixOnBasis_rows",
"text": "private theorem interpolationMatrixOnBasis_rows {F : Type*} [Semiring F]\n (basis : Array CBivariate.Monomial)\n (points : Array (Prod F F)) (params : GSInterpParams) :\n (interpolationMatrixOnBasis basis points params).rows =\n (interpolat... | [
{
"name": "interpolationMatrix_get",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 11,
"n_chars": 593,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": false,
"ma... | 3 | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Bivariate.GuruswamiSudan.Interpolation.Dense.Algorithm
import CompPoly.Bivariate.GuruswamiSudan.Interpolation.Correctness
import CompPoly.Biva... | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Bivariate.GuruswamiSudan.Interpolation.Dense.Algorithm
import CompPoly.Bivariate.GuruswamiSudan.Interpolation.Correctness
import CompPoly.Biva... | @@ -28,6 +28,13 @@
simp [DenseMatrix.WellFormed, interpolationMatrixOnBasis,
interpolationConstraintMatrixOnBasis, DenseMatrix.ofFn]
+private theorem interpolationMatrixOnBasis_rows {F : Type*} [Semiring F]
+ (basis : Array CBivariate.Monomial)
+ (points : Array (Prod F F)) (params : GSInterpParams) :
+... | {
"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_9ea0b2ff54ac_5 | 6579112e5db6e0bd | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Bivariate/GuruswamiSudan/Interpolation/Dense/Correctness.lean | Correctness | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 34 | 4 | [
{
"theorem_name": "interpolationMatrixOnBasis_get",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hrow' : row < (interpolationConstraints points params.multiplicity).size := by\n simpa [interpolatio... | [
{
"name": "interpolationMatrixOnBasis_rows",
"text": "private theorem interpolationMatrixOnBasis_rows {F : Type*} [Semiring F]\n (basis : Array CBivariate.Monomial)\n (points : Array (Prod F F)) (params : GSInterpParams) :\n (interpolationMatrixOnBasis basis points params).rows =\n (interpolat... | [
{
"name": "interpolationMatrix_dotRow",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 4,
"n_lines": 16,
"n_chars": 735,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"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.Bivariate.GuruswamiSudan.Interpolation.Dense.Algorithm
import CompPoly.Bivariate.GuruswamiSudan.Interpolation.Correctness
import CompPoly.Biva... | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Bivariate.GuruswamiSudan.Interpolation.Dense.Algorithm
import CompPoly.Bivariate.GuruswamiSudan.Interpolation.Correctness
import CompPoly.Biva... | @@ -28,6 +28,13 @@
simp [DenseMatrix.WellFormed, interpolationMatrixOnBasis,
interpolationConstraintMatrixOnBasis, DenseMatrix.ofFn]
+private theorem interpolationMatrixOnBasis_rows {F : Type*} [Semiring F]
+ (basis : Array CBivariate.Monomial)
+ (points : Array (Prod F F)) (params : GSInterpParams) :
+... | {
"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_9ea0b2ff54ac_6 | 287ff885de695903 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Bivariate/GuruswamiSudan/Interpolation/Dense/Correctness.lean | Correctness | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 34 | 1 | [
{
"theorem_name": "hasseDerivativeEval_ofMonomialCoeffs",
"depth": 1,
"n_commands": 0,
"n_lines": 32,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold CBivariate.ofMonomialCoeffs\n have hfold : ∀ (xs : List Nat) (out : CBivariate F) (acc : F),\... | [
{
"name": "hasseDerivativeEval_monomialXY_eq_hasseMonomialEval",
"text": "private theorem hasseDerivativeEval_monomialXY_eq_hasseMonomialEval {F : Type*}\n [Field F] [BEq F] [LawfulBEq F] [DecidableEq F]\n (monomial : CBivariate.Monomial) (constraint : InterpolationConstraint F) (c : F) :\n CBivari... | [
{
"name": "hasseDerivativeEval_ofMonomialCoeffs",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 44,
"n_chars": 1803,
"n_subproofs": 1,
"n_tactics": 32,
"cyclomatic": 2,
"n_automation": 1,
"n_rewrites": 2,
"n_structural": 7,
"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.Interpolation.Dense.Algorithm
import CompPoly.Bivariate.GuruswamiSudan.Interpolation.Correctness
import CompPoly.Biva... | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Bivariate.GuruswamiSudan.Interpolation.Dense.Algorithm
import CompPoly.Bivariate.GuruswamiSudan.Interpolation.Correctness
import CompPoly.Biva... | @@ -368,6 +368,34 @@
intro col hcol
simpa using (List.mem_range'_1.mp hcol).2
+private theorem hasseDerivativeEval_monomialXY_eq_hasseMonomialEval {F : Type*}
+ [Field F] [BEq F] [LawfulBEq F] [DecidableEq F]
+ (monomial : CBivariate.Monomial) (constraint : InterpolationConstraint F) (c : F) :
+ CBivar... | {
"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_9ea0b2ff54ac_7 | a1977f301c97f938 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Bivariate/GuruswamiSudan/Interpolation/Dense/Correctness.lean | Correctness | 7 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 34 | 2 | [
{
"theorem_name": "interpolationPolynomial_weightedDegree_le",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n apply interpolationPolynomialOnBasis_weightedDegree_le\n intro monomial hmonomial\n simpa [inte... | [
{
"name": "interpolationPolynomialOnBasis_weightedDegree_le",
"text": "theorem interpolationPolynomialOnBasis_weightedDegree_le {F : Type*}\n [Field F] [BEq F] [LawfulBEq F] [DecidableEq F]\n (basis : Array CBivariate.Monomial) (params : GSInterpParams) (coeffs : Array F)\n (hbound : ∀ monomial, mo... | [
{
"name": "interpolationPolynomial_weightedDegree_le",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 12,
"n_chars": 566,
"n_subproofs": 0,
"n_tactics": 6,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 2,
"automation_onl... | 1 | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Bivariate.GuruswamiSudan.Interpolation.Dense.Algorithm
import CompPoly.Bivariate.GuruswamiSudan.Interpolation.Correctness
import CompPoly.Biva... | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Bivariate.GuruswamiSudan.Interpolation.Dense.Algorithm
import CompPoly.Bivariate.GuruswamiSudan.Interpolation.Correctness
import CompPoly.Biva... | @@ -439,11 +439,28 @@
(CBivariate.hasseDerivativeEval_zero constraint.xOrder constraint.yOrder constraint.x
constraint.y)
+theorem interpolationPolynomialOnBasis_weightedDegree_le {F : Type*}
+ [Field F] [BEq F] [LawfulBEq F] [DecidableEq F]
+ (basis : Array CBivariate.Monomial) (params : GSInterpPa... | {
"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_9ea0b2ff54ac_8 | d3ee4c7349d5101d | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Bivariate/GuruswamiSudan/Interpolation/Dense/Correctness.lean | Correctness | 8 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 34 | 1 | [
{
"theorem_name": "isHomogeneousSolution_map_div",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro row hrow\n rw [dotRow_map_div]\n rw [hsol row hrow]\n simp",
"n_chars": 70,
"n_subproofs": 0... | [
{
"name": "dotRow_map_div",
"text": "private theorem dotRow_map_div {F : Type*} [Field F]\n (M : DenseMatrix F) (row : Nat) (v : Array F) (a : F) :\n DenseMatrix.dotRow M row (v.map fun x ↦ x / a) =\n DenseMatrix.dotRow M row v / a := by\n unfold DenseMatrix.dotRow\n have hfold : ∀ (xs : List N... | [
{
"name": "isHomogeneousSolution_map_div",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 10,
"n_chars": 297,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 2,
"n_structural": 1,
"automation_only": false,
... | 1 | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Bivariate.GuruswamiSudan.Interpolation.Dense.Algorithm
import CompPoly.Bivariate.GuruswamiSudan.Interpolation.Correctness
import CompPoly.Biva... | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Bivariate.GuruswamiSudan.Interpolation.Dense.Algorithm
import CompPoly.Bivariate.GuruswamiSudan.Interpolation.Correctness
import CompPoly.Biva... | @@ -451,10 +451,42 @@
apply CBivariate.ofMonomialCoeffs_natWeightedDegree_le
exact hbound
+private theorem dotRow_map_div {F : Type*} [Field F]
+ (M : DenseMatrix F) (row : Nat) (v : Array F) (a : F) :
+ DenseMatrix.dotRow M row (v.map fun x ↦ x / a) =
+ DenseMatrix.dotRow M row v / a := by
+ unfold... | {
"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_9ea0b2ff54ac_9 | 055dbeb3dbd89e7e | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Bivariate/GuruswamiSudan/Interpolation/Dense/Correctness.lean | Correctness | 9 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 34 | 4 | [
{
"theorem_name": "interpolationMatrixOnBasis_get",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hrow' : row < (interpolationConstraints points params.multiplicity).size := by\n simpa [interpolatio... | [
{
"name": "interpolationMatrixOnBasis_cols",
"text": "private theorem interpolationMatrixOnBasis_cols {F : Type*} [Semiring F]\n (basis : Array CBivariate.Monomial)\n (points : Array (Prod F F)) (params : GSInterpParams) :\n (interpolationMatrixOnBasis basis points params).cols = basis.size := by\n... | [
{
"name": "interpolationPolynomialOnBasis_satisfies_of_solution",
"fan_in": 2,
"n_deps_direct": 5,
"n_deps_transitive": 10,
"n_lines": 26,
"n_chars": 1458,
"n_subproofs": 3,
"n_tactics": 17,
"cyclomatic": 2,
"n_automation": 2,
"n_rewrites": 4,
"n_structural": 2,
"... | 10 | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Bivariate.GuruswamiSudan.Interpolation.Dense.Algorithm
import CompPoly.Bivariate.GuruswamiSudan.Interpolation.Correctness
import CompPoly.Biva... | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Bivariate.GuruswamiSudan.Interpolation.Dense.Algorithm
import CompPoly.Bivariate.GuruswamiSudan.Interpolation.Correctness
import CompPoly.Biva... | @@ -35,6 +35,12 @@
(interpolationConstraints points params.multiplicity).size := by
rfl
+private theorem interpolationMatrixOnBasis_cols {F : Type*} [Semiring F]
+ (basis : Array CBivariate.Monomial)
+ (points : Array (Prod F F)) (params : GSInterpParams) :
+ (interpolationMatrixOnBasis basis point... | {
"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_9ea0b2ff54ac_10 | a4f58ca943d13dbe | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Bivariate/GuruswamiSudan/Interpolation/Dense/Correctness.lean | Correctness | 10 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 34 | 4 | [
{
"theorem_name": "interpolationMatrixOnBasis_get",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hrow' : row < (interpolationConstraints points params.multiplicity).size := by\n simpa [interpolatio... | [
{
"name": "interpolationMatrixOnBasis_cols",
"text": "private theorem interpolationMatrixOnBasis_cols {F : Type*} [Semiring F]\n (basis : Array CBivariate.Monomial)\n (points : Array (Prod F F)) (params : GSInterpParams) :\n (interpolationMatrixOnBasis basis points params).cols = basis.size := by\n... | [
{
"name": "interpolationPolynomial_satisfies_of_solution",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 11,
"n_lines": 10,
"n_chars": 524,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 1,
"automatio... | 11 | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Bivariate.GuruswamiSudan.Interpolation.Dense.Algorithm
import CompPoly.Bivariate.GuruswamiSudan.Interpolation.Correctness
import CompPoly.Biva... | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Bivariate.GuruswamiSudan.Interpolation.Dense.Algorithm
import CompPoly.Bivariate.GuruswamiSudan.Interpolation.Correctness
import CompPoly.Biva... | @@ -35,6 +35,12 @@
(interpolationConstraints points params.multiplicity).size := by
rfl
+private theorem interpolationMatrixOnBasis_cols {F : Type*} [Semiring F]
+ (basis : Array CBivariate.Monomial)
+ (points : Array (Prod F F)) (params : GSInterpParams) :
+ (interpolationMatrixOnBasis basis point... | {
"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_9ea0b2ff54ac_11 | b1b219fa96b9820d | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Bivariate/GuruswamiSudan/Interpolation/Dense/Correctness.lean | Correctness | 11 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 34 | 3 | [
{
"theorem_name": "interpolationPolynomialOnBasis_satisfies_of_solution",
"depth": 1,
"n_commands": 0,
"n_lines": 17,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro point hpoint a b hab\n let constraint : InterpolationConstraint F :=\n { x ... | [
{
"name": "array_mem_getD",
"text": "private theorem array_mem_getD {α : Type*} {xs : Array α} {x default : α}\n (h : x ∈ xs.toList) : ∃ i, i < xs.size ∧ xs.getD i default = x := by\n rcases List.getElem_of_mem h with ⟨i, hi, hget⟩\n refine ⟨i, ?_, ?_⟩\n · simpa using hi\n · rw [Array.getD_eq_getD_ge... | [
{
"name": "interpolationCoefficientVectorOnBasis_nonzero_of_complete",
"fan_in": 1,
"n_deps_direct": 4,
"n_deps_transitive": 4,
"n_lines": 19,
"n_chars": 879,
"n_subproofs": 0,
"n_tactics": 11,
"cyclomatic": 3,
"n_automation": 0,
"n_rewrites": 2,
"n_structural": 5,
... | 4 | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Bivariate.GuruswamiSudan.Interpolation.Dense.Algorithm
import CompPoly.Bivariate.GuruswamiSudan.Interpolation.Correctness
import CompPoly.Biva... | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Bivariate.GuruswamiSudan.Interpolation.Dense.Algorithm
import CompPoly.Bivariate.GuruswamiSudan.Interpolation.Correctness
import CompPoly.Biva... | @@ -311,6 +311,14 @@
unfold interpolationMatrixOnBasis interpolationConstraintMatrixOnBasis
rw [DenseMatrix.get_ofFn _ _ _ hrow' hcol']
+private theorem array_mem_getD {α : Type*} {xs : Array α} {x default : α}
+ (h : x ∈ xs.toList) : ∃ i, i < xs.size ∧ xs.getD i default = x := by
+ rcases List.getElem_of_m... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_9ea0b2ff54ac_12 | d69d4941d8855fc1 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Bivariate/GuruswamiSudan/Interpolation/Dense/Correctness.lean | Correctness | 12 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 34 | 3 | [
{
"theorem_name": "interpolationMatrix_wf",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n exact interpolationMatrixOnBasis_wf (interpolationMonomials params) points params",
"n_chars": 87,
"n_subpro... | [
{
"name": "interpolationMatrixOnBasis_wf",
"text": "/-- The basis-parametric interpolation matrix is built with rectangular dense storage. -/\nprivate theorem interpolationMatrixOnBasis_wf {F : Type*} [Semiring F]\n (basis : Array CBivariate.Monomial)\n (points : Array (Prod F F)) (params : GSInterpPa... | [
{
"name": "denseInterpolateWithBasis_complete",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 36,
"n_chars": 1779,
"n_subproofs": 1,
"n_tactics": 23,
"cyclomatic": 4,
"n_automation": 3,
"n_rewrites": 6,
"n_structural": 5,
"automation_only": f... | 3 | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Bivariate.GuruswamiSudan.Interpolation.Dense.Algorithm
import CompPoly.Bivariate.GuruswamiSudan.Interpolation.Correctness
import CompPoly.Biva... | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Bivariate.GuruswamiSudan.Interpolation.Dense.Algorithm
import CompPoly.Bivariate.GuruswamiSudan.Interpolation.Correctness
import CompPoly.Biva... | @@ -20,6 +20,14 @@
namespace GuruswamiSudan
+/-- The basis-parametric interpolation matrix is built with rectangular dense storage. -/
+private theorem interpolationMatrixOnBasis_wf {F : Type*} [Semiring F]
+ (basis : Array CBivariate.Monomial)
+ (points : Array (Prod F F)) (params : GSInterpParams) :
+ D... | {
"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_9ea0b2ff54ac_13 | 7fbe3b3d2deb8946 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Bivariate/GuruswamiSudan/Interpolation/Dense/Correctness.lean | Correctness | 13 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 34 | 4 | [
{
"theorem_name": "interpolationMatrixOnBasis_get",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hrow' : row < (interpolationConstraints points params.multiplicity).size := by\n simpa [interpolatio... | [
{
"name": "interpolationMatrixOnBasis_rows",
"text": "private theorem interpolationMatrixOnBasis_rows {F : Type*} [Semiring F]\n (basis : Array CBivariate.Monomial)\n (points : Array (Prod F F)) (params : GSInterpParams) :\n (interpolationMatrixOnBasis basis points params).rows =\n (interpolat... | [
{
"name": "denseInterpolateWithBasis_exists_of_dimension_slack",
"fan_in": 1,
"n_deps_direct": 3,
"n_deps_transitive": 4,
"n_lines": 26,
"n_chars": 1333,
"n_subproofs": 1,
"n_tactics": 16,
"cyclomatic": 3,
"n_automation": 2,
"n_rewrites": 4,
"n_structural": 3,
"au... | 4 | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Bivariate.GuruswamiSudan.Interpolation.Dense.Algorithm
import CompPoly.Bivariate.GuruswamiSudan.Interpolation.Correctness
import CompPoly.Biva... | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Bivariate.GuruswamiSudan.Interpolation.Dense.Algorithm
import CompPoly.Bivariate.GuruswamiSudan.Interpolation.Correctness
import CompPoly.Biva... | @@ -28,6 +28,13 @@
simp [DenseMatrix.WellFormed, interpolationMatrixOnBasis,
interpolationConstraintMatrixOnBasis, DenseMatrix.ofFn]
+private theorem interpolationMatrixOnBasis_rows {F : Type*} [Semiring F]
+ (basis : Array CBivariate.Monomial)
+ (points : Array (Prod F F)) (params : GSInterpParams) :
+... | {
"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_9ea0b2ff54ac_14 | 31fe42fa27463d05 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Bivariate/GuruswamiSudan/Interpolation/Dense/Correctness.lean | Correctness | 14 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 34 | 4 | [
{
"theorem_name": "interpolationMatrixOnBasis_get",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hrow' : row < (interpolationConstraints points params.multiplicity).size := by\n simpa [interpolatio... | [
{
"name": "interpolationMatrixOnBasis_rows",
"text": "private theorem interpolationMatrixOnBasis_rows {F : Type*} [Semiring F]\n (basis : Array CBivariate.Monomial)\n (points : Array (Prod F F)) (params : GSInterpParams) :\n (interpolationMatrixOnBasis basis points params).rows =\n (interpolat... | [
{
"name": "denseInterpolate_exists_of_dimension_slack",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 5,
"n_lines": 17,
"n_chars": 812,
"n_subproofs": 0,
"n_tactics": 8,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 1,
"n_structural": 2,
"automation_on... | 5 | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Bivariate.GuruswamiSudan.Interpolation.Dense.Algorithm
import CompPoly.Bivariate.GuruswamiSudan.Interpolation.Correctness
import CompPoly.Biva... | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Bivariate.GuruswamiSudan.Interpolation.Dense.Algorithm
import CompPoly.Bivariate.GuruswamiSudan.Interpolation.Correctness
import CompPoly.Biva... | @@ -28,6 +28,13 @@
simp [DenseMatrix.WellFormed, interpolationMatrixOnBasis,
interpolationConstraintMatrixOnBasis, DenseMatrix.ofFn]
+private theorem interpolationMatrixOnBasis_rows {F : Type*} [Semiring F]
+ (basis : Array CBivariate.Monomial)
+ (points : Array (Prod F F)) (params : GSInterpParams) :
+... | {
"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_9ea0b2ff54ac_15 | 4a5ec59a5b788ecf | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Bivariate/GuruswamiSudan/Interpolation/Dense/Correctness.lean | Correctness | 15 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 34 | 1 | [
{
"theorem_name": "weightedDegreeBasis_complete_of_messageDegree_gt_one",
"depth": 1,
"n_commands": 0,
"n_lines": 33,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro i j hcoeff\n have hypos : 0 < yWeight params := by\n unfold yWeight\n om... | [
{
"name": "cpoly_index_le_natDegree_of_coeff_ne_zero",
"text": "private theorem cpoly_index_le_natDegree_of_coeff_ne_zero {F : Type*}\n [Zero F] [BEq F] [LawfulBEq F]\n {p : CPolynomial F} {i : Nat} (hcoeff : p.coeff i ≠ 0) :\n i ≤ p.natDegree := by\n have hmem : i ∈ p.support := (CPolynomial.mem_... | [
{
"name": "weightedDegreeBasis_complete_of_messageDegree_gt_one",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 46,
"n_chars": 2057,
"n_subproofs": 9,
"n_tactics": 33,
"cyclomatic": 1,
"n_automation": 7,
"n_rewrites": 5,
"n_structural": 5,
"a... | 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.Interpolation.Dense.Algorithm
import CompPoly.Bivariate.GuruswamiSudan.Interpolation.Correctness
import CompPoly.Biva... | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Bivariate.GuruswamiSudan.Interpolation.Dense.Algorithm
import CompPoly.Bivariate.GuruswamiSudan.Interpolation.Correctness
import CompPoly.Biva... | @@ -821,6 +821,14 @@
exact denseInterpolateWithWeightedDegreeBasis_sound
(kernelContext := kernelContext) h
+private theorem cpoly_index_le_natDegree_of_coeff_ne_zero {F : Type*}
+ [Zero F] [BEq F] [LawfulBEq F]
+ {p : CPolynomial F} {i : Nat} (hcoeff : p.coeff i ≠ 0) :
+ i ≤ p.natDegree := by
+ ... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_917143237eb9_0 | a0ea5ff20b42057b | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Fields/Binary/Tower/Concrete/Basis.lean | Basis | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 1 | [
{
"theorem_name": "multilinearBasis_apply",
"depth": 1,
"n_commands": 0,
"n_lines": 139,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction r with\n | zero => -- Fin (2 ^ 0) = Fin 1, so j = 0\n intro l h_l_le_0 j\n simp only [zero_tsub, ... | [
{
"name": "Basis_cast_index_apply",
"text": "/-!\nThe following two theorems are used to cast the basis of `ConcreteBTField α`\nto `ConcreteBTField β` via changing in index type : `Fin (i)` to `Fin (j)` when `α ≤ β`.\n-/\n@[simp]\ntheorem Basis_cast_index_apply {α β i j : ℕ} {k : Fin j}\n (h_le : α ≤ β) ... | [
{
"name": "multilinearBasis_apply",
"fan_in": 0,
"n_deps_direct": 5,
"n_deps_transitive": 9,
"n_lines": 149,
"n_chars": 6740,
"n_subproofs": 16,
"n_tactics": 130,
"cyclomatic": 2,
"n_automation": 55,
"n_rewrites": 32,
"n_structural": 12,
"automation_only": false,
... | 3 | /-
Copyright (c) 2024 - 2025 ArkLib Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Chung Thai Nguyen, Quang Dao
-/
import CompPoly.Fields.Binary.Tower.Concrete.Algebra
import Mathlib.Algebra.Ring.Ext
/-!
# Concrete Binary Tower Basis
Basis construction... | /-
Copyright (c) 2024 - 2025 ArkLib Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Chung Thai Nguyen, Quang Dao
-/
import CompPoly.Fields.Binary.Tower.Concrete.Algebra
import Mathlib.Algebra.Ring.Ext
/-!
# Concrete Binary Tower Basis
Basis construction... | @@ -42,7 +42,23 @@
subst h_eq
rfl
+/-!
+The following two theorems are used to cast the basis of `ConcreteBTField α`
+to `ConcreteBTField β` via changing in index type : `Fin (i)` to `Fin (j)` when `α ≤ β`.
+-/
@[simp]
+theorem Basis_cast_index_apply {α β i j : ℕ} {k : Fin j}
+ (h_le : α ≤ β) (h_eq : i = j)... | {
"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_62161f7b898f_0 | 6eff3c4b7dadac55 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Univariate/NTTFast/Correctness/Pair.lean | Pair | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 1 | [
{
"theorem_name": "runStagesDIFRadix4PairWithTwiddles_eq_pair",
"depth": 1,
"n_commands": 0,
"n_lines": 127,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hfoldFst :\n ∀ xs (accA accB : Array R),\n (List.foldl\n (fun (acc... | [
{
"name": "butterflyRadix4StageDIFPairWithTwiddles_eq_pair",
"text": "private theorem butterflyRadix4StageDIFPairWithTwiddles_eq_pair\n (D : NTT.Domain R) (lowStage : Nat) (twiddlesHigh twiddlesLow : Array R)\n (a b : Array R) :\n butterflyRadix4StageDIFPairWithTwiddles D lowStage twiddlesHigh twid... | [
{
"name": "runStagesDIFRadix4PairWithTwiddles_eq_pair",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 135,
"n_chars": 7043,
"n_subproofs": 2,
"n_tactics": 127,
"cyclomatic": 5,
"n_automation": 12,
"n_rewrites": 6,
"n_structural": 12,
"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.NTTFast.Correctness.Radix4DIF
/-!
# Paired forward NTTFast correctness
Correctness proof for running the paired radix-4 DIF stage ... | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Univariate.NTTFast.Correctness.Radix4DIF
/-!
# Paired forward NTTFast correctness
Correctness proof for running the paired radix-4 DIF stage ... | @@ -174,6 +174,17 @@
rw [hinner]
exact ih
+private theorem butterflyRadix4StageDIFPairWithTwiddles_eq_pair
+ (D : NTT.Domain R) (lowStage : Nat) (twiddlesHigh twiddlesLow : Array R)
+ (a b : Array R) :
+ butterflyRadix4StageDIFPairWithTwiddles D lowStage twiddlesHigh twiddlesLow a b =
+ (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_73e540286d93_0 | 713ec909499d6c65 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Bivariate/GuruswamiSudan/Root/RothRuckenstein/Lemmas.lean | Lemmas | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 24 | 1 | [
{
"theorem_name": "cpoly_coeff_eq_zero_of_natDegree_lt",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n by_cases hp : p = 0\n · rw [hp]\n exact CPolynomial.coeff_zero i\n · have hsize := cpoly_size_eq_n... | [
{
"name": "cpoly_size_eq_natDegree_succ_of_ne_zero",
"text": "theorem cpoly_size_eq_natDegree_succ_of_ne_zero {R : Type*} [Zero R]\n {p : CPolynomial R} (hp : p ≠ 0) :\n p.val.size = p.natDegree + 1 := by\n unfold CPolynomial.natDegree\n cases hs : p.val.size with\n | zero =>\n have hval : p.v... | [
{
"name": "cpoly_coeff_eq_zero_of_natDegree_lt",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 10,
"n_chars": 335,
"n_subproofs": 1,
"n_tactics": 6,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 2,
"automation_only": fa... | 2 | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Bivariate.GuruswamiSudan.Root.RothRuckenstein.Algorithm
import CompPoly.Bivariate.GuruswamiSudan.Root.Common.Lemmas
import CompPoly.Bivariate.... | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Bivariate.GuruswamiSudan.Root.RothRuckenstein.Algorithm
import CompPoly.Bivariate.GuruswamiSudan.Root.Common.Lemmas
import CompPoly.Bivariate.... | @@ -26,13 +26,28 @@
rw [Array.getD_eq_getD_getElem?]
simp [Array.getElem?_eq_none h]
+theorem cpoly_size_eq_natDegree_succ_of_ne_zero {R : Type*} [Zero R]
+ {p : CPolynomial R} (hp : p ≠ 0) :
+ p.val.size = p.natDegree + 1 := by
+ unfold CPolynomial.natDegree
+ cases hs : p.val.size with
+ | zero =>
+ ... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_73e540286d93_1 | 543b43c2293a08f5 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Bivariate/GuruswamiSudan/Root/RothRuckenstein/Lemmas.lean | Lemmas | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 24 | 4 | [
{
"theorem_name": "cpoly_toPoly_eq_X_pow_mul_dropXPower_of_coeff_eq_zero_lt",
"depth": 1,
"n_commands": 0,
"n_lines": 12,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n ext i\n rw [← CPolynomial.coeff_toPoly (p := p) (i := i)]\n rw [Polynomial.coef... | [
{
"name": "cpoly_coeff_dropXPower",
"text": "theorem cpoly_coeff_dropXPower {R : Type*} [Zero R]\n (p : CPolynomial R) (n i : Nat) :\n (CPolynomial.dropXPower p n).coeff i = p.coeff (i + n) := by\n induction n generalizing p i with\n | zero =>\n simp [CPolynomial.dropXPower]\n | succ n ih =>\n... | [
{
"name": "cpoly_toPoly_eq_X_pow_mul_dropXPower_of_coeff_eq_zero_lt",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 17,
"n_chars": 610,
"n_subproofs": 0,
"n_tactics": 12,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 7,
"n_structural": 2,
... | 1 | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Bivariate.GuruswamiSudan.Root.RothRuckenstein.Algorithm
import CompPoly.Bivariate.GuruswamiSudan.Root.Common.Lemmas
import CompPoly.Bivariate.... | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Bivariate.GuruswamiSudan.Root.RothRuckenstein.Algorithm
import CompPoly.Bivariate.GuruswamiSudan.Root.Common.Lemmas
import CompPoly.Bivariate.... | @@ -20,6 +20,17 @@
namespace GuruswamiSudan
+theorem cpoly_coeff_dropXPower {R : Type*} [Zero R]
+ (p : CPolynomial R) (n i : Nat) :
+ (CPolynomial.dropXPower p n).coeff i = p.coeff (i + n) := by
+ induction n generalizing p i with
+ | zero =>
+ simp [CPolynomial.dropXPower]
+ | succ n ih =>
+ 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_73e540286d93_2 | 29a4ecaa73452f81 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Bivariate/GuruswamiSudan/Root/RothRuckenstein/Lemmas.lean | Lemmas | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 24 | 4 | [
{
"theorem_name": "cpoly_toPoly_eq_X_pow_mul_dropXPower_of_coeff_eq_zero_lt",
"depth": 1,
"n_commands": 0,
"n_lines": 12,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n ext i\n rw [← CPolynomial.coeff_toPoly (p := p) (i := i)]\n rw [Polynomial.coef... | [
{
"name": "cpoly_coeff_dropXPower",
"text": "theorem cpoly_coeff_dropXPower {R : Type*} [Zero R]\n (p : CPolynomial R) (n i : Nat) :\n (CPolynomial.dropXPower p n).coeff i = p.coeff (i + n) := by\n induction n generalizing p i with\n | zero =>\n simp [CPolynomial.dropXPower]\n | succ n ih =>\n... | [
{
"name": "cbivar_coeff_divXPower",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 24,
"n_chars": 1200,
"n_subproofs": 4,
"n_tactics": 20,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 11,
"n_structural": 1,
"automation_only": false,
"... | 2 | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Bivariate.GuruswamiSudan.Root.RothRuckenstein.Algorithm
import CompPoly.Bivariate.GuruswamiSudan.Root.Common.Lemmas
import CompPoly.Bivariate.... | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Bivariate.GuruswamiSudan.Root.RothRuckenstein.Algorithm
import CompPoly.Bivariate.GuruswamiSudan.Root.Common.Lemmas
import CompPoly.Bivariate.... | @@ -26,13 +26,28 @@
unfold CPolynomial.ofArray
exact CPolynomial.Raw.Trim.coeff_eq_coeff coeffs i
+theorem cpoly_coeff_dropXPower {R : Type*} [Zero R]
+ (p : CPolynomial R) (n i : Nat) :
+ (CPolynomial.dropXPower p n).coeff i = p.coeff (i + n) := by
+ induction n generalizing p i with
+ | zero =>
+ ... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_73e540286d93_3 | 2fbc8522e365ac6e | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Bivariate/GuruswamiSudan/Root/RothRuckenstein/Lemmas.lean | Lemmas | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 24 | 1 | [
{
"theorem_name": "cbivar_coeffY_divXPower",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [CPolynomial.eq_iff_coeff]\n intro i\n change CBivariate.coeff (CBivariate.divXPower Q n) i j =\n (CPolynom... | [
{
"name": "cbivar_coeff_divXPower",
"text": "theorem cbivar_coeff_divXPower {R : Type*} [Zero R] [BEq R] [LawfulBEq R]\n (Q : CBivariate R) (n i j : Nat) :\n CBivariate.coeff (CBivariate.divXPower Q n) i j = CBivariate.coeff Q (i + n) j := by\n unfold CBivariate.coeff CBivariate.divXPower\n rw [cpol... | [
{
"name": "cbivar_coeffY_divXPower",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 11,
"n_chars": 421,
"n_subproofs": 0,
"n_tactics": 7,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 3,
"n_structural": 1,
"automation_only": false,
"ma... | 3 | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Bivariate.GuruswamiSudan.Root.RothRuckenstein.Algorithm
import CompPoly.Bivariate.GuruswamiSudan.Root.Common.Lemmas
import CompPoly.Bivariate.... | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Bivariate.GuruswamiSudan.Root.RothRuckenstein.Algorithm
import CompPoly.Bivariate.GuruswamiSudan.Root.Common.Lemmas
import CompPoly.Bivariate.... | @@ -37,9 +37,38 @@
have h : i + n + 1 = i + (n + 1) := by omega
rw [h]
+theorem cbivar_coeff_divXPower {R : Type*} [Zero R] [BEq R] [LawfulBEq R]
+ (Q : CBivariate R) (n i j : Nat) :
+ CBivariate.coeff (CBivariate.divXPower Q n) i j = CBivariate.coeff Q (i + n) j := by
+ unfold CBivariate.coeff 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_73e540286d93_4 | ea5ced32c09fdbe5 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Bivariate/GuruswamiSudan/Root/RothRuckenstein/Lemmas.lean | Lemmas | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 24 | 1 | [
{
"theorem_name": "initialCoefficientPolynomial_coeff_of_lt",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold initialCoefficientPolynomial\n rw [initialCoefficientPolynomial_coeff_fold Q j (List.range... | [
{
"name": "initialCoefficientPolynomial_coeff_fold",
"text": "theorem initialCoefficientPolynomial_coeff_fold {F : Type*}\n [Field F] [BEq F] [LawfulBEq F] [DecidableEq F]\n (Q : CBivariate F) (j : Nat) :\n ∀ (ys : List Nat) (out : CPolynomial F),\n ys.Nodup →\n (List.foldl\n (... | [
{
"name": "initialCoefficientPolynomial_coeff_of_lt",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 11,
"n_chars": 463,
"n_subproofs": 0,
"n_tactics": 6,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 3,
"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.Bivariate.GuruswamiSudan.Root.RothRuckenstein.Algorithm
import CompPoly.Bivariate.GuruswamiSudan.Root.Common.Lemmas
import CompPoly.Bivariate.... | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Bivariate.GuruswamiSudan.Root.RothRuckenstein.Algorithm
import CompPoly.Bivariate.GuruswamiSudan.Root.Common.Lemmas
import CompPoly.Bivariate.... | @@ -20,10 +20,45 @@
namespace GuruswamiSudan
+theorem initialCoefficientPolynomial_coeff_fold {F : Type*}
+ [Field F] [BEq F] [LawfulBEq F] [DecidableEq F]
+ (Q : CBivariate F) (j : Nat) :
+ ∀ (ys : List Nat) (out : CPolynomial F),
+ ys.Nodup →
+ (List.foldl
+ (fun out y ↦ out + CPoly... | {
"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_73e540286d93_5 | 8e2a699213f31d46 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Bivariate/GuruswamiSudan/Root/RothRuckenstein/Lemmas.lean | Lemmas | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 24 | 2 | [
{
"theorem_name": "cpoly_coeff_eq_zero_of_natDegree_lt",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n by_cases hp : p = 0\n · rw [hp]\n exact CPolynomial.coeff_zero i\n · have hsize := cpoly_size_eq_n... | [
{
"name": "cpoly_coeff_eq_zero_of_size_le",
"text": "theorem cpoly_coeff_eq_zero_of_size_le {R : Type*} [Zero R]\n (p : CPolynomial R) {i : Nat} (h : p.val.size ≤ i) : p.coeff i = 0 := by\n unfold CPolynomial.coeff CPolynomial.Raw.coeff\n rw [Array.getD_eq_getD_getElem?]\n simp [Array.getElem?_eq_none... | [
{
"name": "cpoly_xAdicOrder?_none_eq_zero",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 23,
"n_chars": 854,
"n_subproofs": 5,
"n_tactics": 20,
"cyclomatic": 1,
"n_automation": 3,
"n_rewrites": 3,
"n_structural": 7,
"automation_only": false,... | 1 | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Bivariate.GuruswamiSudan.Root.RothRuckenstein.Algorithm
import CompPoly.Bivariate.GuruswamiSudan.Root.Common.Lemmas
import CompPoly.Bivariate.... | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Bivariate.GuruswamiSudan.Root.RothRuckenstein.Algorithm
import CompPoly.Bivariate.GuruswamiSudan.Root.Common.Lemmas
import CompPoly.Bivariate.... | @@ -20,6 +20,12 @@
namespace GuruswamiSudan
+theorem cpoly_coeff_eq_zero_of_size_le {R : Type*} [Zero R]
+ (p : CPolynomial R) {i : Nat} (h : p.val.size ≤ i) : p.coeff i = 0 := by
+ unfold CPolynomial.coeff CPolynomial.Raw.coeff
+ rw [Array.getD_eq_getD_getElem?]
+ simp [Array.getElem?_eq_none h]
+
theorem ... | {
"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_73e540286d93_6 | 748f29d1c95f8a87 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Bivariate/GuruswamiSudan/Root/RothRuckenstein/Lemmas.lean | Lemmas | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 24 | 1 | [
{
"theorem_name": "cbivar_xAdicOrder?_step_witness",
"depth": 1,
"n_commands": 0,
"n_lines": 38,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro result hresult\n unfold xAdicStep at hresult\n cases best with\n | none =>\n cases horder : ... | [
{
"name": "cpoly_xAdicOrder?_some_coeff_ne",
"text": "theorem cpoly_xAdicOrder?_some_coeff_ne {R : Type*} [Zero R] [BEq R] [LawfulBEq R]\n {p : CPolynomial R} {i : Nat} (h : CPolynomial.xAdicOrder? p = some i) :\n p.coeff i ≠ 0 := by\n unfold CPolynomial.xAdicOrder? at h\n have hp := List.find?_some... | [
{
"name": "cbivar_xAdicOrder?_step_witness",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 44,
"n_chars": 1789,
"n_subproofs": 7,
"n_tactics": 38,
"cyclomatic": 5,
"n_automation": 8,
"n_rewrites": 10,
"n_structural": 11,
"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.Bivariate.GuruswamiSudan.Root.RothRuckenstein.Algorithm
import CompPoly.Bivariate.GuruswamiSudan.Root.Common.Lemmas
import CompPoly.Bivariate.... | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Bivariate.GuruswamiSudan.Root.RothRuckenstein.Algorithm
import CompPoly.Bivariate.GuruswamiSudan.Root.Common.Lemmas
import CompPoly.Bivariate.... | @@ -20,6 +20,13 @@
namespace GuruswamiSudan
+theorem cpoly_xAdicOrder?_some_coeff_ne {R : Type*} [Zero R] [BEq R] [LawfulBEq R]
+ {p : CPolynomial R} {i : Nat} (h : CPolynomial.xAdicOrder? p = some i) :
+ p.coeff i ≠ 0 := by
+ unfold CPolynomial.xAdicOrder? at h
+ have hp := List.find?_some h
+ simpa usin... | {
"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_73e540286d93_7 | a29a6af07fcd52cc | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Bivariate/GuruswamiSudan/Root/RothRuckenstein/Lemmas.lean | Lemmas | 7 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 24 | 1 | [
{
"theorem_name": "cbivar_xAdicOrder?_fold_witness",
"depth": 1,
"n_commands": 0,
"n_lines": 13,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro ys\n induction ys with\n | nil =>\n intro best hw _hys\n exact hw\n | cons y ys ih =>\n... | [
{
"name": "cbivar_xAdicOrder?_step_witness",
"text": "theorem cbivar_xAdicOrder?_step_witness {R : Type*}\n [Zero R] [BEq R] [LawfulBEq R]\n (Q : CBivariate R) (best : Option Nat) {y : Nat}\n (hw : xAdicWitness Q best) (hy : y < Q.val.size) :\n xAdicWitness Q (xAdicStep Q best y) := by\n intro ... | [
{
"name": "cbivar_xAdicOrder?_fold_witness",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 21,
"n_chars": 608,
"n_subproofs": 0,
"n_tactics": 13,
"cyclomatic": 2,
"n_automation": 3,
"n_rewrites": 0,
"n_structural": 9,
"automation_only": false... | 2 | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Bivariate.GuruswamiSudan.Root.RothRuckenstein.Algorithm
import CompPoly.Bivariate.GuruswamiSudan.Root.Common.Lemmas
import CompPoly.Bivariate.... | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Bivariate.GuruswamiSudan.Root.RothRuckenstein.Algorithm
import CompPoly.Bivariate.GuruswamiSudan.Root.Common.Lemmas
import CompPoly.Bivariate.... | @@ -40,6 +40,49 @@
(best : Option Nat) : Prop :=
∀ order, best = some order → ∃ y, y < Q.val.size ∧ CBivariate.coeff Q order y ≠ 0
+theorem cbivar_xAdicOrder?_step_witness {R : Type*}
+ [Zero R] [BEq R] [LawfulBEq R]
+ (Q : CBivariate R) (best : Option Nat) {y : Nat}
+ (hw : xAdicWitness Q best) (hy ... | {
"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_73e540286d93_8 | 0d9ce379bc7f62fc | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Bivariate/GuruswamiSudan/Root/RothRuckenstein/Lemmas.lean | Lemmas | 8 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 24 | 1 | [
{
"theorem_name": "cbivar_xAdicOrder?_some_exists",
"depth": 1,
"n_commands": 0,
"n_lines": 11,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold CBivariate.xAdicOrder? at h\n change List.foldl (xAdicStep Q) none (List.range' 0 Q.val.size) = som... | [
{
"name": "cbivar_xAdicOrder?_fold_witness",
"text": "theorem cbivar_xAdicOrder?_fold_witness {R : Type*}\n [Zero R] [BEq R] [LawfulBEq R]\n (Q : CBivariate R) :\n ∀ (ys : List Nat) (best : Option Nat),\n xAdicWitness Q best →\n (∀ y, y ∈ ys → y < Q.val.size) →\n xAdicWitness Q... | [
{
"name": "cbivar_xAdicOrder?_some_exists",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 16,
"n_chars": 583,
"n_subproofs": 1,
"n_tactics": 11,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 2,
"n_structural": 3,
"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.Bivariate.GuruswamiSudan.Root.RothRuckenstein.Algorithm
import CompPoly.Bivariate.GuruswamiSudan.Root.Common.Lemmas
import CompPoly.Bivariate.... | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Bivariate.GuruswamiSudan.Root.RothRuckenstein.Algorithm
import CompPoly.Bivariate.GuruswamiSudan.Root.Common.Lemmas
import CompPoly.Bivariate.... | @@ -83,10 +83,40 @@
Nat.min_eq_right (Nat.le_of_not_ge hle)
exact ⟨y, hy, by simpa [hmin] using hcoeff⟩
+theorem cbivar_xAdicOrder?_fold_witness {R : Type*}
+ [Zero R] [BEq R] [LawfulBEq R]
+ (Q : CBivariate R) :
+ ∀ (ys : List Nat) (best : Option Nat),
+ xAdicWitness Q best ... | {
"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_73e540286d93_9 | ced20f9a6f2d72ae | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Bivariate/GuruswamiSudan/Root/RothRuckenstein/Lemmas.lean | Lemmas | 9 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 24 | 1 | [
{
"theorem_name": "cbivar_xAdicOrder?_fold_some_le_best",
"depth": 1,
"n_commands": 0,
"n_lines": 25,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro ys\n induction ys with\n | nil =>\n intro best current result hbest hfold\n rw [hbe... | [
{
"name": "cbivar_xAdicOrder?_step_some_le_best",
"text": "theorem cbivar_xAdicOrder?_step_some_le_best {R : Type*}\n [Zero R] [BEq R] (Q : CBivariate R) {best : Option Nat} {current result y : Nat}\n (hbest : best = some current) (hstep : xAdicStep Q best y = some result) :\n result ≤ current := b... | [
{
"name": "cbivar_xAdicOrder?_fold_some_le_best",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 32,
"n_chars": 1175,
"n_subproofs": 4,
"n_tactics": 27,
"cyclomatic": 6,
"n_automation": 5,
"n_rewrites": 5,
"n_structural": 8,
"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.Root.RothRuckenstein.Algorithm
import CompPoly.Bivariate.GuruswamiSudan.Root.Common.Lemmas
import CompPoly.Bivariate.... | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Bivariate.GuruswamiSudan.Root.RothRuckenstein.Algorithm
import CompPoly.Bivariate.GuruswamiSudan.Root.Common.Lemmas
import CompPoly.Bivariate.... | @@ -33,12 +33,53 @@
(best : Option Nat) : Prop :=
∀ order, best = some order → ∃ y, y < Q.val.size ∧ CBivariate.coeff Q order y ≠ 0
+theorem cbivar_xAdicOrder?_step_some_le_best {R : Type*}
+ [Zero R] [BEq R] (Q : CBivariate R) {best : Option Nat} {current result y : Nat}
+ (hbest : best = some current)... | {
"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_73e540286d93_10 | b9619c883b101efe | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Bivariate/GuruswamiSudan/Root/RothRuckenstein/Lemmas.lean | Lemmas | 10 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 24 | 1 | [
{
"theorem_name": "cbivar_xAdicOrder?_fold_some_le_row",
"depth": 1,
"n_commands": 0,
"n_lines": 33,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro ys\n induction ys with\n | nil =>\n intro best result y rowOrder _hfold hmem _hrow\n ... | [
{
"name": "cbivar_xAdicOrder?_fold_some_le_best",
"text": "theorem cbivar_xAdicOrder?_fold_some_le_best {R : Type*}\n [Zero R] [BEq R] (Q : CBivariate R) :\n ∀ (ys : List Nat) (best : Option Nat) (current result : Nat),\n best = some current →\n List.foldl (xAdicStep Q) best ys = some resu... | [
{
"name": "cbivar_xAdicOrder?_fold_some_le_row",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 41,
"n_chars": 1473,
"n_subproofs": 2,
"n_tactics": 34,
"cyclomatic": 7,
"n_automation": 5,
"n_rewrites": 6,
"n_structural": 11,
"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.Bivariate.GuruswamiSudan.Root.RothRuckenstein.Algorithm
import CompPoly.Bivariate.GuruswamiSudan.Root.Common.Lemmas
import CompPoly.Bivariate.... | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Bivariate.GuruswamiSudan.Root.RothRuckenstein.Algorithm
import CompPoly.Bivariate.GuruswamiSudan.Root.Common.Lemmas
import CompPoly.Bivariate.... | @@ -66,13 +66,76 @@
subst result
exact Nat.min_le_right current rowOrder
+theorem cbivar_xAdicOrder?_fold_some_le_best {R : Type*}
+ [Zero R] [BEq R] (Q : CBivariate R) :
+ ∀ (ys : List Nat) (best : Option Nat) (current result : Nat),
+ best = some current →
+ List.foldl (xAdicStep Q) ... | {
"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_73e540286d93_11 | 5a2d36eb02bbb62f | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Bivariate/GuruswamiSudan/Root/RothRuckenstein/Lemmas.lean | Lemmas | 11 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 24 | 1 | [
{
"theorem_name": "cbivar_xAdicOrder?_some_coeff_eq_zero_of_lt",
"depth": 1,
"n_commands": 0,
"n_lines": 18,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n by_cases hy : y < Q.val.size\n · cases hrow : CPolynomial.xAdicOrder? (Q.val.coeff y) with\n ... | [
{
"name": "cbivar_xAdicOrder?_fold_some_le_row",
"text": "theorem cbivar_xAdicOrder?_fold_some_le_row {R : Type*}\n [Zero R] [BEq R] (Q : CBivariate R) :\n ∀ (ys : List Nat) (best : Option Nat) (result y rowOrder : Nat),\n List.foldl (xAdicStep Q) best ys = some result →\n y ∈ ys →\n ... | [
{
"name": "cbivar_xAdicOrder?_some_coeff_eq_zero_of_lt",
"fan_in": 1,
"n_deps_direct": 4,
"n_deps_transitive": 8,
"n_lines": 24,
"n_chars": 1117,
"n_subproofs": 2,
"n_tactics": 18,
"cyclomatic": 2,
"n_automation": 1,
"n_rewrites": 5,
"n_structural": 5,
"automation... | 8 | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Bivariate.GuruswamiSudan.Root.RothRuckenstein.Algorithm
import CompPoly.Bivariate.GuruswamiSudan.Root.Common.Lemmas
import CompPoly.Bivariate.... | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Bivariate.GuruswamiSudan.Root.RothRuckenstein.Algorithm
import CompPoly.Bivariate.GuruswamiSudan.Root.Common.Lemmas
import CompPoly.Bivariate.... | @@ -151,6 +151,46 @@
cbivar_xAdicOrder?_step_some_le_best Q hbest hstep
exact Nat.le_trans hresult_le_next hnext_le_current
+theorem cbivar_xAdicOrder?_fold_some_le_row {R : Type*}
+ [Zero R] [BEq R] (Q : CBivariate R) :
+ ∀ (ys : List Nat) (best : Option Nat) (result y rowOrder : 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_73e540286d93_12 | 4a5124b4c96586c4 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Bivariate/GuruswamiSudan/Root/RothRuckenstein/Lemmas.lean | Lemmas | 12 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 24 | 1 | [
{
"theorem_name": "cbivar_xAdicOrder?_some_coeff_eq_zero_of_lt",
"depth": 1,
"n_commands": 0,
"n_lines": 18,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n by_cases hy : y < Q.val.size\n · cases hrow : CPolynomial.xAdicOrder? (Q.val.coeff y) with\n ... | [
{
"name": "cbivar_xAdicOrder?_fold_some_le_row",
"text": "theorem cbivar_xAdicOrder?_fold_some_le_row {R : Type*}\n [Zero R] [BEq R] (Q : CBivariate R) :\n ∀ (ys : List Nat) (best : Option Nat) (result y rowOrder : Nat),\n List.foldl (xAdicStep Q) best ys = some result →\n y ∈ ys →\n ... | [
{
"name": "cbivar_toPoly_eq_C_X_pow_mul_divXPower_of_xAdicOrder",
"fan_in": 0,
"n_deps_direct": 3,
"n_deps_transitive": 14,
"n_lines": 17,
"n_chars": 739,
"n_subproofs": 0,
"n_tactics": 10,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 4,
"n_structural": 2,
"a... | 14 | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Bivariate.GuruswamiSudan.Root.RothRuckenstein.Algorithm
import CompPoly.Bivariate.GuruswamiSudan.Root.Common.Lemmas
import CompPoly.Bivariate.... | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Bivariate.GuruswamiSudan.Root.RothRuckenstein.Algorithm
import CompPoly.Bivariate.GuruswamiSudan.Root.Common.Lemmas
import CompPoly.Bivariate.... | @@ -217,6 +217,46 @@
cbivar_xAdicOrder?_step_some_le_best Q hbest hstep
exact Nat.le_trans hresult_le_next hnext_le_current
+theorem cbivar_xAdicOrder?_fold_some_le_row {R : Type*}
+ [Zero R] [BEq R] (Q : CBivariate R) :
+ ∀ (ys : List Nat) (best : Option Nat) (result y rowOrder : 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_73e540286d93_13 | f87154744978070d | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Bivariate/GuruswamiSudan/Root/RothRuckenstein/Lemmas.lean | Lemmas | 13 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 24 | 1 | [
{
"theorem_name": "cbivar_xAdicOrder?_none_eq_zero",
"depth": 1,
"n_commands": 0,
"n_lines": 14,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n apply (CPolynomial.eq_zero_iff_coeff_zero (p := (Q : CPolynomial (CPolynomial F)))).mpr\n intro y\n by_c... | [
{
"name": "cbivar_xAdicOrder?_fold_none",
"text": "theorem cbivar_xAdicOrder?_fold_none {R : Type*}\n [Zero R] [BEq R] (Q : CBivariate R) :\n ∀ (ys : List Nat) (best : Option Nat),\n List.foldl (xAdicStep Q) best ys = none →\n best = none ∧ ∀ y, y ∈ ys → CPolynomial.xAdicOrder? (Q.val.coef... | [
{
"name": "cbivar_xAdicOrder?_none_eq_zero",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 18,
"n_chars": 848,
"n_subproofs": 3,
"n_tactics": 14,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 4,
"n_structural": 3,
"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.Bivariate.GuruswamiSudan.Root.RothRuckenstein.Algorithm
import CompPoly.Bivariate.GuruswamiSudan.Root.Common.Lemmas
import CompPoly.Bivariate.... | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Bivariate.GuruswamiSudan.Root.RothRuckenstein.Algorithm
import CompPoly.Bivariate.GuruswamiSudan.Root.Common.Lemmas
import CompPoly.Bivariate.... | @@ -61,9 +61,56 @@
(best : Option Nat) : Prop :=
∀ order, best = some order → ∃ y, y < Q.val.size ∧ CBivariate.coeff Q order y ≠ 0
+theorem cbivar_xAdicOrder?_fold_none {R : Type*}
+ [Zero R] [BEq R] (Q : CBivariate R) :
+ ∀ (ys : List Nat) (best : Option Nat),
+ List.foldl (xAdicStep Q) best ys = ... | {
"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_73e540286d93_14 | 56f9aa4f78a53b21 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Bivariate/GuruswamiSudan/Root/RothRuckenstein/Lemmas.lean | Lemmas | 14 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 24 | 1 | [
{
"theorem_name": "dropXPower_eq_C_add_X_mul_dropXPower_succ",
"depth": 1,
"n_commands": 0,
"n_lines": 18,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n let suffix := CPolynomial.dropXPower p depth\n have hcoeff : suffix.coeff 0 = p.coeff depth := ... | [
{
"name": "cpoly_dropXPower_add",
"text": "theorem cpoly_dropXPower_add {R : Type*} [Zero R]\n (p : CPolynomial R) (m n : Nat) :\n CPolynomial.dropXPower (CPolynomial.dropXPower p m) n =\n CPolynomial.dropXPower p (m + n) := by\n induction m generalizing p with\n | zero =>\n simp [CPolynom... | [
{
"name": "dropXPower_eq_C_add_X_mul_dropXPower_succ",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 25,
"n_chars": 956,
"n_subproofs": 2,
"n_tactics": 18,
"cyclomatic": 1,
"n_automation": 4,
"n_rewrites": 6,
"n_structural": 1,
"automation_on... | 2 | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Bivariate.GuruswamiSudan.Root.RothRuckenstein.Algorithm
import CompPoly.Bivariate.GuruswamiSudan.Root.Common.Lemmas
import CompPoly.Bivariate.... | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Bivariate.GuruswamiSudan.Root.RothRuckenstein.Algorithm
import CompPoly.Bivariate.GuruswamiSudan.Root.Common.Lemmas
import CompPoly.Bivariate.... | @@ -44,6 +44,19 @@
(best : Option Nat) : Prop :=
∀ order, best = some order → ∃ y, y < Q.val.size ∧ CBivariate.coeff Q order y ≠ 0
+theorem cpoly_dropXPower_add {R : Type*} [Zero R]
+ (p : CPolynomial R) (m n : Nat) :
+ CPolynomial.dropXPower (CPolynomial.dropXPower p m) n =
+ CPolynomial.dropXPowe... | {
"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_73e540286d93_15 | ef38f42af5b91853 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Bivariate/GuruswamiSudan/Root/RothRuckenstein/Lemmas.lean | Lemmas | 15 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 24 | 1 | [
{
"theorem_name": "polynomial_monomial_substitution_sum",
"depth": 1,
"n_commands": 0,
"n_lines": 9,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [show Polynomial.C a + Polynomial.X * p = Polynomial.X * p + Polynomial.C a by ring]\n rw [add_pow... | [
{
"name": "polynomial_monomial_substitution_term",
"text": "theorem polynomial_monomial_substitution_term {F : Type*} [Field F]\n (a coeff : F) (p : Polynomial F) (x y t : Nat) :\n Polynomial.monomial x coeff *\n ((Polynomial.X * p) ^ t * Polynomial.C a ^ (y - t) *\n Polynomial.C (Nat.... | [
{
"name": "polynomial_monomial_substitution_sum",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 16,
"n_chars": 689,
"n_subproofs": 0,
"n_tactics": 9,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 6,
"n_structural": 2,
"automation_only": f... | 1 | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Bivariate.GuruswamiSudan.Root.RothRuckenstein.Algorithm
import CompPoly.Bivariate.GuruswamiSudan.Root.Common.Lemmas
import CompPoly.Bivariate.... | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Bivariate.GuruswamiSudan.Root.RothRuckenstein.Algorithm
import CompPoly.Bivariate.GuruswamiSudan.Root.Common.Lemmas
import CompPoly.Bivariate.... | @@ -33,12 +33,34 @@
(best : Option Nat) : Prop :=
∀ order, best = some order → ∃ y, y < Q.val.size ∧ CBivariate.coeff Q order y ≠ 0
+theorem polynomial_monomial_substitution_term {F : Type*} [Field F]
+ (a coeff : F) (p : Polynomial F) (x y t : Nat) :
+ Polynomial.monomial x coeff *
+ ((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_73e540286d93_16 | 7f426909ae52beb3 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Bivariate/GuruswamiSudan/Root/RothRuckenstein/Lemmas.lean | Lemmas | 16 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 24 | 1 | [
{
"theorem_name": "cpoly_monomial_substitution_sum",
"depth": 1,
"n_commands": 0,
"n_lines": 39,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n apply (CPolynomial.ringEquiv (R := F)).injective\n change\n ((List.range' 0 (y + 1)).foldl\n (f... | [
{
"name": "foldl_cpoly_toPoly_add",
"text": "theorem foldl_cpoly_toPoly_add {F : Type*}\n [Field F] [BEq F] [LawfulBEq F]\n (f : Nat → CPolynomial F) :\n ∀ (xs : List Nat) (acc : CPolynomial F) (accPoly : Polynomial F),\n acc.toPoly = accPoly →\n (xs.foldl (fun acc x ↦ acc + f x) acc).t... | [
{
"name": "cpoly_monomial_substitution_sum",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 49,
"n_chars": 2268,
"n_subproofs": 0,
"n_tactics": 39,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 8,
"n_structural": 5,
"automation_only": fals... | 3 | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Bivariate.GuruswamiSudan.Root.RothRuckenstein.Algorithm
import CompPoly.Bivariate.GuruswamiSudan.Root.Common.Lemmas
import CompPoly.Bivariate.... | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Bivariate.GuruswamiSudan.Root.RothRuckenstein.Algorithm
import CompPoly.Bivariate.GuruswamiSudan.Root.Common.Lemmas
import CompPoly.Bivariate.... | @@ -62,6 +62,24 @@
(p := p) (x := x) (y := y) (t := t)]
rw [← Polynomial.C_eq_natCast (R := F) (Nat.choose y t)]
+theorem foldl_cpoly_toPoly_add {F : Type*}
+ [Field F] [BEq F] [LawfulBEq F]
+ (f : Nat → CPolynomial F) :
+ ∀ (xs : List Nat) (acc : CPolynomial F) (accPoly : Polynomial F),
+ acc.t... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_bd1961c94fc9_0 | e44d0375f81034cd | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Univariate/NTT/Inverse.lean | Inverse | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 1 | [
{
"theorem_name": "inverseImpl_correct",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [inverseImpl]\n change normalize D (Forward.forwardImpl D.inverse v) = inverseSpec D v\n rw [Forward.forwardImpl_c... | [
{
"name": "normalize_forwardSpec_inverse_eq_inverseSpec",
"text": "theorem normalize_forwardSpec_inverse_eq_inverseSpec (D : Domain R) (v : Array R) :\n normalize D (Forward.forwardSpec D.inverse v) = inverseSpec D v := by\n apply Array.ext\n · simp [normalize, inverseSpec, Forward.forwardSpec]\n · in... | [
{
"name": "inverseImpl_correct",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 8,
"n_chars": 288,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 3,
"n_structural": 1,
"automation_only": false,
"max_nes... | 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.Forward
import CompPoly.Univariate.NTT.Transform
/-!
# Inverse NTT
This file provides inverse NTT APIs and correctness st... | /-
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.Forward
import CompPoly.Univariate.NTT.Transform
/-!
# Inverse NTT
This file provides inverse NTT APIs and correctness st... | @@ -41,12 +41,26 @@
(normalize D a).size = D.n := by
simp [normalize]
+theorem normalize_forwardSpec_inverse_eq_inverseSpec (D : Domain R) (v : Array R) :
+ normalize D (Forward.forwardSpec D.inverse v) = inverseSpec D v := by
+ apply Array.ext
+ · simp [normalize, inverseSpec, Forward.forwardSpec]
+ · ... | {
"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_f34241427335_0 | 90d906f3ae587d46 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Univariate/ToPoly/Impl.lean | Impl | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 15 | 6 | [
{
"theorem_name": "monomial_toPoly",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n ext i\n simp only [CPolynomial.toPoly, monomial]\n rw [Polynomial.coeff_monomial, coeff_toPoly, CPolynomial.Raw.coeff_mon... | [
{
"name": "coeff_toPoly",
"text": "/-- CPolynomial.coeff is correct wrt the Mathlib spec. -/\ntheorem coeff_toPoly [BEq R] [LawfulBEq R] (p : CPolynomial R) (i : ℕ) :\n p.coeff i = p.toPoly.coeff i := by\n unfold toPoly coeff\n simp [Raw.coeff_toPoly]\n\n",
"fan_in": 6,
"n_lines": 7,
"n_cha... | [
{
"name": "monomial_toPoly",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 8,
"n_chars": 324,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false,
"max_nesting... | 1 | /-
Copyright (c) 2025 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao, Gregor Mitscha-Baude, Derek Sorensen
-/
import CompPoly.Univariate.ToPoly.Equiv
import Mathlib.Algebra.Polynomial.Roots
/-!
# Proofs of Correctness for CPolynomial Operations, wr... | /-
Copyright (c) 2025 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao, Gregor Mitscha-Baude, Derek Sorensen
-/
import CompPoly.Univariate.ToPoly.Equiv
import Mathlib.Algebra.Polynomial.Roots
/-!
# Proofs of Correctness for CPolynomial Operations, wr... | @@ -27,8 +27,17 @@
/-- CPolynomial.monomial is correct wrt the Mathlib spec. -/
theorem monomial_toPoly [DecidableEq R] [LawfulBEq R] (n : ℕ) (c : R) :
- (monomial n c).toPoly = Polynomial.monomial n c := sorry
+ (monomial n c).toPoly = Polynomial.monomial n c := by
+ ext i
+ simp only [CPolynomial.toPoly, ... | {
"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_f34241427335_1 | 873acac1f92c58d0 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Univariate/ToPoly/Impl.lean | Impl | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 15 | 7 | [
{
"theorem_name": "eval_C",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [CPolynomial.eval_toPoly, CPolynomial.C_toPoly, Polynomial.eval_C]",
"n_chars": 75,
"n_subproofs": 0,
"n_tactics": 2,... | [
{
"name": "eval_toPoly",
"text": "/-- CPolynomial.eval is correct wrt the Mathlib spec. -/\ntheorem eval_toPoly [BEq R] [LawfulBEq R] (x : R) (p : CPolynomial R) :\n eval x p = p.toPoly.eval x := by\n change Raw.eval x p.val = p.val.toPoly.eval x\n exact (Raw.eval_toPoly_eq_eval x p.val).symm\n\n",
... | [
{
"name": "eval_C",
"fan_in": 2,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 6,
"n_chars": 228,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
"max_nesting": 2
}
... | 2 | /-
Copyright (c) 2025 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao, Gregor Mitscha-Baude, Derek Sorensen
-/
import CompPoly.Univariate.ToPoly.Equiv
import Mathlib.Algebra.Polynomial.Roots
/-!
# Proofs of Correctness for CPolynomial Operations, wr... | /-
Copyright (c) 2025 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao, Gregor Mitscha-Baude, Derek Sorensen
-/
import CompPoly.Univariate.ToPoly.Equiv
import Mathlib.Algebra.Polynomial.Roots
/-!
# Proofs of Correctness for CPolynomial Operations, wr... | @@ -31,9 +31,16 @@
rw [Raw.toPoly_trim]
exact Raw.toPoly_C r
+/-- CPolynomial.eval is correct wrt the Mathlib spec. -/
+theorem eval_toPoly [BEq R] [LawfulBEq R] (x : R) (p : CPolynomial R) :
+ eval x p = p.toPoly.eval x := by
+ change Raw.eval x p.val = p.val.toPoly.eval x
+ exact (Raw.eval_toPoly_eq_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_f34241427335_2 | 2da894a93404076f | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Univariate/ToPoly/Impl.lean | Impl | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 15 | 6 | [
{
"theorem_name": "monomial_toPoly",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n ext i\n simp only [CPolynomial.toPoly, monomial]\n rw [Polynomial.coeff_monomial, coeff_toPoly, CPolynomial.Raw.coeff_mon... | [
{
"name": "coeff_toPoly",
"text": "/-- CPolynomial.coeff is correct wrt the Mathlib spec. -/\ntheorem coeff_toPoly [BEq R] [LawfulBEq R] (p : CPolynomial R) (i : ℕ) :\n p.coeff i = p.toPoly.coeff i := by\n unfold toPoly coeff\n simp [Raw.coeff_toPoly]\n\n",
"fan_in": 6,
"n_lines": 7,
"n_cha... | [
{
"name": "eval_zero_eq_coeff_zero",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 8,
"n_chars": 310,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 2,
"n_structural": 1,
"automation_only": false,
"max... | 2 | /-
Copyright (c) 2025 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao, Gregor Mitscha-Baude, Derek Sorensen
-/
import CompPoly.Univariate.ToPoly.Equiv
import Mathlib.Algebra.Polynomial.Roots
/-!
# Proofs of Correctness for CPolynomial Operations, wr... | /-
Copyright (c) 2025 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao, Gregor Mitscha-Baude, Derek Sorensen
-/
import CompPoly.Univariate.ToPoly.Equiv
import Mathlib.Algebra.Polynomial.Roots
/-!
# Proofs of Correctness for CPolynomial Operations, wr... | @@ -31,9 +31,18 @@
change Raw.eval x p.val = p.val.toPoly.eval x
exact (Raw.eval_toPoly_eq_eval x p.val).symm
+/-- CPolynomial.coeff is correct wrt the Mathlib spec. -/
+theorem coeff_toPoly [BEq R] [LawfulBEq R] (p : CPolynomial R) (i : ℕ) :
+ p.coeff i = p.toPoly.coeff i := by
+ unfold toPoly coeff
+ sim... | {
"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_f34241427335_3 | f7ef6d43190939f6 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Univariate/ToPoly/Impl.lean | Impl | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 15 | 6 | [
{
"theorem_name": "monomial_toPoly",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n ext i\n simp only [CPolynomial.toPoly, monomial]\n rw [Polynomial.coeff_monomial, coeff_toPoly, CPolynomial.Raw.coeff_mon... | [
{
"name": "coeff_toPoly",
"text": "/-- CPolynomial.coeff is correct wrt the Mathlib spec. -/\ntheorem coeff_toPoly [BEq R] [LawfulBEq R] (p : CPolynomial R) (i : ℕ) :\n p.coeff i = p.toPoly.coeff i := by\n unfold toPoly coeff\n simp [Raw.coeff_toPoly]\n\n",
"fan_in": 6,
"n_lines": 7,
"n_cha... | [
{
"name": "divX_toPoly",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 8,
"n_chars": 323,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": false,
"max_nesting": 4... | 1 | /-
Copyright (c) 2025 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao, Gregor Mitscha-Baude, Derek Sorensen
-/
import CompPoly.Univariate.ToPoly.Equiv
import Mathlib.Algebra.Polynomial.Roots
/-!
# Proofs of Correctness for CPolynomial Operations, wr... | /-
Copyright (c) 2025 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao, Gregor Mitscha-Baude, Derek Sorensen
-/
import CompPoly.Univariate.ToPoly.Equiv
import Mathlib.Algebra.Polynomial.Roots
/-!
# Proofs of Correctness for CPolynomial Operations, wr... | @@ -25,9 +25,18 @@
variable {R : Type*} [Semiring R]
+/-- CPolynomial.coeff is correct wrt the Mathlib spec. -/
+theorem coeff_toPoly [BEq R] [LawfulBEq R] (p : CPolynomial R) (i : ℕ) :
+ p.coeff i = p.toPoly.coeff i := by
+ unfold toPoly coeff
+ simp [Raw.coeff_toPoly]
+
/-- CPolynomial.divX is correct wrt ... | {
"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_f34241427335_4 | 8e97cb542ae6db36 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Univariate/ToPoly/Impl.lean | Impl | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 15 | 6 | [
{
"theorem_name": "monomial_toPoly",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n ext i\n simp only [CPolynomial.toPoly, monomial]\n rw [Polynomial.coeff_monomial, coeff_toPoly, CPolynomial.Raw.coeff_mon... | [
{
"name": "coeff_toPoly",
"text": "/-- CPolynomial.coeff is correct wrt the Mathlib spec. -/\ntheorem coeff_toPoly [BEq R] [LawfulBEq R] (p : CPolynomial R) (i : ℕ) :\n p.coeff i = p.toPoly.coeff i := by\n unfold toPoly coeff\n simp [Raw.coeff_toPoly]\n\n",
"fan_in": 6,
"n_lines": 7,
"n_cha... | [
{
"name": "support_toPoly",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 7,
"n_chars": 252,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false,
"max_nesting"... | 1 | /-
Copyright (c) 2025 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao, Gregor Mitscha-Baude, Derek Sorensen
-/
import CompPoly.Univariate.ToPoly.Equiv
import Mathlib.Algebra.Polynomial.Roots
/-!
# Proofs of Correctness for CPolynomial Operations, wr... | /-
Copyright (c) 2025 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao, Gregor Mitscha-Baude, Derek Sorensen
-/
import CompPoly.Univariate.ToPoly.Equiv
import Mathlib.Algebra.Polynomial.Roots
/-!
# Proofs of Correctness for CPolynomial Operations, wr... | @@ -25,9 +25,17 @@
variable {R : Type*} [Semiring R]
+/-- CPolynomial.coeff is correct wrt the Mathlib spec. -/
+theorem coeff_toPoly [BEq R] [LawfulBEq R] (p : CPolynomial R) (i : ℕ) :
+ p.coeff i = p.toPoly.coeff i := by
+ unfold toPoly coeff
+ simp [Raw.coeff_toPoly]
+
/-- CPolynomial.support is correct w... | {
"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_f34241427335_5 | d30315de794bcb20 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Univariate/ToPoly/Impl.lean | Impl | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 15 | 1 | [
{
"theorem_name": "size_eq_toPoly_natDegree_succ",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have htoPoly : p.toPoly ≠ 0 := (toPoly_eq_zero_iff p).not.mpr hp\n have hsize : p.toPoly.toImpl.size = p.val... | [
{
"name": "size_toImpl_eq_natDegree_succ",
"text": "/-- lemma: toImpl is natDegree's succ -/\nprivate lemma size_toImpl_eq_natDegree_succ {q : R[X]} (hq : q ≠ 0) :\n q.toImpl.size = q.natDegree + 1 := by\n rcases Raw.toImpl_elim q with ⟨hzero, _⟩ | ⟨_, himpl⟩\n · exact (hq hzero).elim\n · simp [himpl]... | [
{
"name": "size_eq_toPoly_natDegree_succ",
"fan_in": 3,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 11,
"n_chars": 446,
"n_subproofs": 2,
"n_tactics": 6,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"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: Quang Dao, Gregor Mitscha-Baude, Derek Sorensen
-/
import CompPoly.Univariate.ToPoly.Equiv
import Mathlib.Algebra.Polynomial.Roots
/-!
# Proofs of Correctness for CPolynomial Operations, wr... | /-
Copyright (c) 2025 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao, Gregor Mitscha-Baude, Derek Sorensen
-/
import CompPoly.Univariate.ToPoly.Equiv
import Mathlib.Algebra.Polynomial.Roots
/-!
# Proofs of Correctness for CPolynomial Operations, wr... | @@ -25,10 +25,22 @@
variable {R : Type*} [Semiring R]
+/-- lemma: toImpl is natDegree's succ -/
+private lemma size_toImpl_eq_natDegree_succ {q : R[X]} (hq : q ≠ 0) :
+ q.toImpl.size = q.natDegree + 1 := by
+ rcases Raw.toImpl_elim q with ⟨hzero, _⟩ | ⟨_, himpl⟩
+ · exact (hq hzero).elim
+ · simp [himpl]
+
... | {
"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_f34241427335_6 | 0168c66a0231c48c | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Univariate/ToPoly/Impl.lean | Impl | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 15 | 3 | [
{
"theorem_name": "degree_toPoly",
"depth": 1,
"n_commands": 0,
"n_lines": 14,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n by_cases hp : p = 0\n · subst hp\n rw [toPoly_zero, CPolynomial.degree]\n rfl\n · have hsize := size_eq_toPoly_natDe... | [
{
"name": "size_eq_toPoly_natDegree_succ",
"text": "/-- lemma: size = natDegree's succ -/\nprivate lemma size_eq_toPoly_natDegree_succ [BEq R] [LawfulBEq R]\n (p : CPolynomial R) (hp : p ≠ 0) :\n p.val.size = p.toPoly.natDegree + 1 := by\n have htoPoly : p.toPoly ≠ 0 := (toPoly_eq_zero_iff p).not.mpr... | [
{
"name": "degree_toPoly",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 18,
"n_chars": 610,
"n_subproofs": 3,
"n_tactics": 14,
"cyclomatic": 2,
"n_automation": 4,
"n_rewrites": 2,
"n_structural": 1,
"automation_only": false,
"max_nesting... | 2 | /-
Copyright (c) 2025 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao, Gregor Mitscha-Baude, Derek Sorensen
-/
import CompPoly.Univariate.ToPoly.Equiv
import Mathlib.Algebra.Polynomial.Roots
/-!
# Proofs of Correctness for CPolynomial Operations, wr... | /-
Copyright (c) 2025 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao, Gregor Mitscha-Baude, Derek Sorensen
-/
import CompPoly.Univariate.ToPoly.Equiv
import Mathlib.Algebra.Polynomial.Roots
/-!
# Proofs of Correctness for CPolynomial Operations, wr... | @@ -32,6 +32,16 @@
· exact (hq hzero).elim
· simp [himpl]
+/-- lemma: size = natDegree's succ -/
+private lemma size_eq_toPoly_natDegree_succ [BEq R] [LawfulBEq R]
+ (p : CPolynomial R) (hp : p ≠ 0) :
+ p.val.size = p.toPoly.natDegree + 1 := by
+ have htoPoly : p.toPoly ≠ 0 := (toPoly_eq_zero_iff p).not.... | {
"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_f34241427335_7 | 7ca3401e1ff22523 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Univariate/ToPoly/Impl.lean | Impl | 7 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 15 | 3 | [
{
"theorem_name": "degree_toPoly",
"depth": 1,
"n_commands": 0,
"n_lines": 14,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n by_cases hp : p = 0\n · subst hp\n rw [toPoly_zero, CPolynomial.degree]\n rfl\n · have hsize := size_eq_toPoly_natDe... | [
{
"name": "size_eq_toPoly_natDegree_succ",
"text": "/-- lemma: size = natDegree's succ -/\nprivate lemma size_eq_toPoly_natDegree_succ [BEq R] [LawfulBEq R]\n (p : CPolynomial R) (hp : p ≠ 0) :\n p.val.size = p.toPoly.natDegree + 1 := by\n have htoPoly : p.toPoly ≠ 0 := (toPoly_eq_zero_iff p).not.mpr... | [
{
"name": "natDegree_toPoly",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 23,
"n_chars": 563,
"n_subproofs": 2,
"n_tactics": 19,
"cyclomatic": 2,
"n_automation": 3,
"n_rewrites": 3,
"n_structural": 1,
"automation_only": false,
"max_nest... | 2 | /-
Copyright (c) 2025 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao, Gregor Mitscha-Baude, Derek Sorensen
-/
import CompPoly.Univariate.ToPoly.Equiv
import Mathlib.Algebra.Polynomial.Roots
/-!
# Proofs of Correctness for CPolynomial Operations, wr... | /-
Copyright (c) 2025 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao, Gregor Mitscha-Baude, Derek Sorensen
-/
import CompPoly.Univariate.ToPoly.Equiv
import Mathlib.Algebra.Polynomial.Roots
/-!
# Proofs of Correctness for CPolynomial Operations, wr... | @@ -32,6 +32,16 @@
· exact (hq hzero).elim
· simp [himpl]
+/-- lemma: size = natDegree's succ -/
+private lemma size_eq_toPoly_natDegree_succ [BEq R] [LawfulBEq R]
+ (p : CPolynomial R) (hp : p ≠ 0) :
+ p.val.size = p.toPoly.natDegree + 1 := by
+ have htoPoly : p.toPoly ≠ 0 := (toPoly_eq_zero_iff p).not.... | {
"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_f34241427335_8 | ff07abc4004bc050 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Univariate/ToPoly/Impl.lean | Impl | 8 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 15 | 3 | [
{
"theorem_name": "degree_toPoly",
"depth": 1,
"n_commands": 0,
"n_lines": 14,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n by_cases hp : p = 0\n · subst hp\n rw [toPoly_zero, CPolynomial.degree]\n rfl\n · have hsize := size_eq_toPoly_natDe... | [
{
"name": "size_eq_toPoly_natDegree_succ",
"text": "/-- lemma: size = natDegree's succ -/\nprivate lemma size_eq_toPoly_natDegree_succ [BEq R] [LawfulBEq R]\n (p : CPolynomial R) (hp : p ≠ 0) :\n p.val.size = p.toPoly.natDegree + 1 := by\n have htoPoly : p.toPoly ≠ 0 := (toPoly_eq_zero_iff p).not.mpr... | [
{
"name": "leadingCoeff_toPoly",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 21,
"n_chars": 944,
"n_subproofs": 6,
"n_tactics": 17,
"cyclomatic": 1,
"n_automation": 6,
"n_rewrites": 2,
"n_structural": 0,
"automation_only": false,
"max_n... | 2 | /-
Copyright (c) 2025 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao, Gregor Mitscha-Baude, Derek Sorensen
-/
import CompPoly.Univariate.ToPoly.Equiv
import Mathlib.Algebra.Polynomial.Roots
/-!
# Proofs of Correctness for CPolynomial Operations, wr... | /-
Copyright (c) 2025 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao, Gregor Mitscha-Baude, Derek Sorensen
-/
import CompPoly.Univariate.ToPoly.Equiv
import Mathlib.Algebra.Polynomial.Roots
/-!
# Proofs of Correctness for CPolynomial Operations, wr... | @@ -32,9 +32,35 @@
· exact (hq hzero).elim
· simp [himpl]
+/-- lemma: size = natDegree's succ -/
+private lemma size_eq_toPoly_natDegree_succ [BEq R] [LawfulBEq R]
+ (p : CPolynomial R) (hp : p ≠ 0) :
+ p.val.size = p.toPoly.natDegree + 1 := by
+ have htoPoly : p.toPoly ≠ 0 := (toPoly_eq_zero_iff p).not.... | {
"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_f34241427335_9 | 83593ac6fb8858e4 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Univariate/ToPoly/Impl.lean | Impl | 9 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 15 | 3 | [
{
"theorem_name": "degree_toPoly",
"depth": 1,
"n_commands": 0,
"n_lines": 14,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n by_cases hp : p = 0\n · subst hp\n rw [toPoly_zero, CPolynomial.degree]\n rfl\n · have hsize := size_eq_toPoly_natDe... | [
{
"name": "size_eq_toPoly_natDegree_succ",
"text": "/-- lemma: size = natDegree's succ -/\nprivate lemma size_eq_toPoly_natDegree_succ [BEq R] [LawfulBEq R]\n (p : CPolynomial R) (hp : p ≠ 0) :\n p.val.size = p.toPoly.natDegree + 1 := by\n have htoPoly : p.toPoly ≠ 0 := (toPoly_eq_zero_iff p).not.mpr... | [
{
"name": "monic_toPoly_iff",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 6,
"n_chars": 232,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
"max_nestin... | 3 | /-
Copyright (c) 2025 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao, Gregor Mitscha-Baude, Derek Sorensen
-/
import CompPoly.Univariate.ToPoly.Equiv
import Mathlib.Algebra.Polynomial.Roots
/-!
# Proofs of Correctness for CPolynomial Operations, wr... | /-
Copyright (c) 2025 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao, Gregor Mitscha-Baude, Derek Sorensen
-/
import CompPoly.Univariate.ToPoly.Equiv
import Mathlib.Algebra.Polynomial.Roots
/-!
# Proofs of Correctness for CPolynomial Operations, wr... | @@ -32,9 +32,35 @@
· exact (hq hzero).elim
· simp [himpl]
+/-- lemma: size = natDegree's succ -/
+private lemma size_eq_toPoly_natDegree_succ [BEq R] [LawfulBEq R]
+ (p : CPolynomial R) (hp : p ≠ 0) :
+ p.val.size = p.toPoly.natDegree + 1 := by
+ have htoPoly : p.toPoly ≠ 0 := (toPoly_eq_zero_iff p).not.... | {
"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_f34241427335_10 | a74d8922f6a762f8 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Univariate/ToPoly/Impl.lean | Impl | 10 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 15 | 6 | [
{
"theorem_name": "monomial_toPoly",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n ext i\n simp only [CPolynomial.toPoly, monomial]\n rw [Polynomial.coeff_monomial, coeff_toPoly, CPolynomial.Raw.coeff_mon... | [
{
"name": "coeff_toPoly",
"text": "/-- CPolynomial.coeff is correct wrt the Mathlib spec. -/\ntheorem coeff_toPoly [BEq R] [LawfulBEq R] (p : CPolynomial R) (i : ℕ) :\n p.coeff i = p.toPoly.coeff i := by\n unfold toPoly coeff\n simp [Raw.coeff_toPoly]\n\n",
"fan_in": 6,
"n_lines": 7,
"n_cha... | [
{
"name": "erase_toPoly",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 8,
"n_chars": 310,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false,
"max_nesting": ... | 1 | /-
Copyright (c) 2025 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao, Gregor Mitscha-Baude, Derek Sorensen
-/
import CompPoly.Univariate.ToPoly.Equiv
import Mathlib.Algebra.Polynomial.Roots
/-!
# Proofs of Correctness for CPolynomial Operations, wr... | /-
Copyright (c) 2025 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao, Gregor Mitscha-Baude, Derek Sorensen
-/
import CompPoly.Univariate.ToPoly.Equiv
import Mathlib.Algebra.Polynomial.Roots
/-!
# Proofs of Correctness for CPolynomial Operations, wr... | @@ -25,10 +25,18 @@
variable {R : Type*} [Semiring R]
+/-- CPolynomial.coeff is correct wrt the Mathlib spec. -/
+theorem coeff_toPoly [BEq R] [LawfulBEq R] (p : CPolynomial R) (i : ℕ) :
+ p.coeff i = p.toPoly.coeff i := by
+ unfold toPoly coeff
+ simp [Raw.coeff_toPoly]
+
/-- CPolynomial.erase is correct wr... | {
"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.