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_241420177c61_9
cd526b639b6886a0
lean
lean
github.com/Verified-zkEVM/CompPoly
e95ba1b1cac21ac3e980725abcfb2a0c707d1062
CompPoly/Fields/Binary/Tower/Concrete/Core.lean
Core
9
lemma_delete
null
null
false
0.5
1
1
false
0
inf
0
inf
42
36
1
[ { "theorem_name": "join_eq_iff_dcast_extractLsb", "depth": 1, "n_commands": 0, "n_lines": 154, "is_leaf": true, "centrality": 0, "method": "deleted-dep", "proof_text": " by\n classical\n have hpos_eq : h_pos = (by omega : k > 0) := Subsingleton.elim _ _\n cases hpos_eq\n -- unfol...
[ { "name": "BitVec.extractLsb_dcast_eq", "text": "theorem BitVec.extractLsb_dcast_eq {w w2 hi lo : ℕ} (x : BitVec w) (h : w = w2) :\n BitVec.extractLsb (hi:=hi) (lo:=lo) (dcast h x) =\n BitVec.extractLsb (hi:=hi) (lo:=lo) x := by\n unfold BitVec.extractLsb BitVec.extractLsb'\n have h_toNat : BitVec...
[ { "name": "join_eq_iff_dcast_extractLsb", "fan_in": 2, "n_deps_direct": 13, "n_deps_transitive": 18, "n_lines": 162, "n_chars": 7050, "n_subproofs": 17, "n_tactics": 132, "cyclomatic": 4, "n_automation": 29, "n_rewrites": 2, "n_structural": 16, "automation_only": ...
12
/- Copyright (c) 2024 - 2025 ArkLib Contributors. All rights reserved. Released under Apache 2.0 license as described in the file LICENSE. Authors: Chung Thai Nguyen, Quang Dao -/ import CompPoly.Data.Classes.DCast import CompPoly.Fields.Binary.Tower.Abstract.Basis /-! # Concrete Binary Tower Core Core definitions f...
/- Copyright (c) 2024 - 2025 ArkLib Contributors. All rights reserved. Released under Apache 2.0 license as described in the file LICENSE. Authors: Chung Thai Nguyen, Quang Dao -/ import CompPoly.Data.Classes.DCast import CompPoly.Fields.Binary.Tower.Abstract.Basis /-! # Concrete Binary Tower Core Core definitions f...
@@ -585,6 +585,14 @@ simp only [hi_extract_eq, Nat.sub_zero, lo_extract_eq, Nat.and_two_pow_sub_one_eq_mod, h_hi, h_lo] +theorem BitVec.extractLsb_dcast_eq {w w2 hi lo : ℕ} (x : BitVec w) (h : w = w2) : + BitVec.extractLsb (hi:=hi) (lo:=lo) (dcast h x) = + BitVec.extractLsb (hi:=hi) (lo:=lo) x := ...
{ "repo": "CompPoly", "git_repo": "github.com/Verified-zkEVM/CompPoly", "revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062", "lean_toolchain": "leanprover/lean4:v4.31.0", "proof_assistant": "lean", "ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)", "ablator_flags": [ "--corollary-dele...
ablate_241420177c61_10
af606797b87a800c
lean
lean
github.com/Verified-zkEVM/CompPoly
e95ba1b1cac21ac3e980725abcfb2a0c707d1062
CompPoly/Fields/Binary/Tower/Concrete/Core.lean
Core
10
lemma_delete
null
null
false
0.5
1
1
false
0
inf
0
inf
42
36
1
[ { "theorem_name": "join_eq_iff_dcast_extractLsb", "depth": 1, "n_commands": 0, "n_lines": 154, "is_leaf": true, "centrality": 0, "method": "deleted-dep", "proof_text": " by\n classical\n have hpos_eq : h_pos = (by omega : k > 0) := Subsingleton.elim _ _\n cases hpos_eq\n -- unfol...
[ { "name": "eq_join_iff_dcast_eq_append", "text": "theorem eq_join_iff_dcast_eq_append {k : ℕ} (h_pos : k > 0) (x : ConcreteBTField k)\n (hi lo : ConcreteBTField (k - 1)) :\n x = join (k:=k) h_pos hi lo ↔\n dcast (h_sum_two_same_pow2 (k:=k) (h_pos:=h_pos)).symm x =\n BitVec.append (msbs:=hi...
[ { "name": "join_eq_join_iff", "fan_in": 1, "n_deps_direct": 1, "n_deps_transitive": 19, "n_lines": 20, "n_chars": 859, "n_subproofs": 7, "n_tactics": 17, "cyclomatic": 2, "n_automation": 4, "n_rewrites": 4, "n_structural": 4, "automation_only": false, "max_nes...
13
/- Copyright (c) 2024 - 2025 ArkLib Contributors. All rights reserved. Released under Apache 2.0 license as described in the file LICENSE. Authors: Chung Thai Nguyen, Quang Dao -/ import CompPoly.Data.Classes.DCast import CompPoly.Fields.Binary.Tower.Abstract.Basis /-! # Concrete Binary Tower Core Core definitions f...
/- Copyright (c) 2024 - 2025 ArkLib Contributors. All rights reserved. Released under Apache 2.0 license as described in the file LICENSE. Authors: Chung Thai Nguyen, Quang Dao -/ import CompPoly.Data.Classes.DCast import CompPoly.Fields.Binary.Tower.Abstract.Basis /-! # Concrete Binary Tower Core Core definitions f...
@@ -600,6 +600,33 @@ unfold join simp [dcast_eq_root_cast] +theorem eq_join_iff_dcast_eq_append {k : ℕ} (h_pos : k > 0) (x : ConcreteBTField k) + (hi lo : ConcreteBTField (k - 1)) : + x = join (k:=k) h_pos hi lo ↔ + dcast (h_sum_two_same_pow2 (k:=k) (h_pos:=h_pos)).symm x = + BitVec.append (ms...
{ "repo": "CompPoly", "git_repo": "github.com/Verified-zkEVM/CompPoly", "revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062", "lean_toolchain": "leanprover/lean4:v4.31.0", "proof_assistant": "lean", "ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)", "ablator_flags": [ "--corollary-dele...
ablate_241420177c61_11
9941f87782cb0c63
lean
lean
github.com/Verified-zkEVM/CompPoly
e95ba1b1cac21ac3e980725abcfb2a0c707d1062
CompPoly/Fields/Binary/Tower/Concrete/Core.lean
Core
11
lemma_delete
null
null
false
0.5
1
1
false
0
inf
0
inf
42
36
1
[ { "theorem_name": "eq_join_iff_dcast_eq_append", "depth": 1, "n_commands": 0, "n_lines": 22, "is_leaf": true, "centrality": 0, "method": "deleted-dep", "proof_text": " by\n classical\n constructor\n · intro hx\n have hx' := hx\n rw [join_eq_dcast_append (k:=k) (h_pos:=h_pos)...
[ { "name": "join_eq_dcast_append", "text": "theorem join_eq_dcast_append {k : ℕ} (h_pos : k > 0) (hi lo : ConcreteBTField (k - 1)) :\n join (k:=k) h_pos hi lo =\n dcast (h_sum_two_same_pow2 (k:=k) (h_pos:=h_pos))\n (BitVec.append (msbs:=hi) (lsbs:=lo)) := by\n unfold join\n simp [dcast_eq_ro...
[ { "name": "split_join_eq_split", "fan_in": 0, "n_deps_direct": 1, "n_deps_transitive": 26, "n_lines": 6, "n_chars": 245, "n_subproofs": 0, "n_tactics": 2, "cyclomatic": 1, "n_automation": 1, "n_rewrites": 0, "n_structural": 1, "automation_only": false, "max_ne...
19
/- Copyright (c) 2024 - 2025 ArkLib Contributors. All rights reserved. Released under Apache 2.0 license as described in the file LICENSE. Authors: Chung Thai Nguyen, Quang Dao -/ import CompPoly.Data.Classes.DCast import CompPoly.Fields.Binary.Tower.Abstract.Basis /-! # Concrete Binary Tower Core Core definitions f...
/- Copyright (c) 2024 - 2025 ArkLib Contributors. All rights reserved. Released under Apache 2.0 license as described in the file LICENSE. Authors: Chung Thai Nguyen, Quang Dao -/ import CompPoly.Data.Classes.DCast import CompPoly.Fields.Binary.Tower.Abstract.Basis /-! # Concrete Binary Tower Core Core definitions f...
@@ -593,6 +593,13 @@ simpa using (BitVec.dcast_bitvec_toNat_eq (x:=x) (h_width_eq:=h)).symm rw [h_toNat] +theorem join_eq_dcast_append {k : ℕ} (h_pos : k > 0) (hi lo : ConcreteBTField (k - 1)) : + join (k:=k) h_pos hi lo = + dcast (h_sum_two_same_pow2 (k:=k) (h_pos:=h_pos)) + (BitVec.append (ms...
{ "repo": "CompPoly", "git_repo": "github.com/Verified-zkEVM/CompPoly", "revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062", "lean_toolchain": "leanprover/lean4:v4.31.0", "proof_assistant": "lean", "ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)", "ablator_flags": [ "--corollary-dele...
ablate_241420177c61_12
f41ba096ebc09e38
lean
lean
github.com/Verified-zkEVM/CompPoly
e95ba1b1cac21ac3e980725abcfb2a0c707d1062
CompPoly/Fields/Binary/Tower/Concrete/Core.lean
Core
12
lemma_delete
null
null
false
0.5
1
1
false
0
inf
0
inf
42
36
1
[ { "theorem_name": "eq_join_iff_dcast_eq_append", "depth": 1, "n_commands": 0, "n_lines": 22, "is_leaf": true, "centrality": 0, "method": "deleted-dep", "proof_text": " by\n classical\n constructor\n · intro hx\n have hx' := hx\n rw [join_eq_dcast_append (k:=k) (h_pos:=h_pos)...
[ { "name": "join_eq_dcast_append", "text": "theorem join_eq_dcast_append {k : ℕ} (h_pos : k > 0) (hi lo : ConcreteBTField (k - 1)) :\n join (k:=k) h_pos hi lo =\n dcast (h_sum_two_same_pow2 (k:=k) (h_pos:=h_pos))\n (BitVec.append (msbs:=hi) (lsbs:=lo)) := by\n unfold join\n simp [dcast_eq_ro...
[ { "name": "join_split_eq_join", "fan_in": 0, "n_deps_direct": 1, "n_deps_transitive": 26, "n_lines": 5, "n_chars": 222, "n_subproofs": 0, "n_tactics": 2, "cyclomatic": 3, "n_automation": 1, "n_rewrites": 0, "n_structural": 1, "automation_only": false, "max_nes...
19
/- Copyright (c) 2024 - 2025 ArkLib Contributors. All rights reserved. Released under Apache 2.0 license as described in the file LICENSE. Authors: Chung Thai Nguyen, Quang Dao -/ import CompPoly.Data.Classes.DCast import CompPoly.Fields.Binary.Tower.Abstract.Basis /-! # Concrete Binary Tower Core Core definitions f...
/- Copyright (c) 2024 - 2025 ArkLib Contributors. All rights reserved. Released under Apache 2.0 license as described in the file LICENSE. Authors: Chung Thai Nguyen, Quang Dao -/ import CompPoly.Data.Classes.DCast import CompPoly.Fields.Binary.Tower.Abstract.Basis /-! # Concrete Binary Tower Core Core definitions f...
@@ -593,6 +593,13 @@ simpa using (BitVec.dcast_bitvec_toNat_eq (x:=x) (h_width_eq:=h)).symm rw [h_toNat] +theorem join_eq_dcast_append {k : ℕ} (h_pos : k > 0) (hi lo : ConcreteBTField (k - 1)) : + join (k:=k) h_pos hi lo = + dcast (h_sum_two_same_pow2 (k:=k) (h_pos:=h_pos)) + (BitVec.append (ms...
{ "repo": "CompPoly", "git_repo": "github.com/Verified-zkEVM/CompPoly", "revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062", "lean_toolchain": "leanprover/lean4:v4.31.0", "proof_assistant": "lean", "ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)", "ablator_flags": [ "--corollary-dele...
ablate_241420177c61_13
54675fe8c49c08f4
lean
lean
github.com/Verified-zkEVM/CompPoly
e95ba1b1cac21ac3e980725abcfb2a0c707d1062
CompPoly/Fields/Binary/Tower/Concrete/Core.lean
Core
13
lemma_delete
null
null
false
0.5
1
1
false
0
inf
0
inf
42
36
1
[ { "theorem_name": "eq_join_iff_dcast_eq_append", "depth": 1, "n_commands": 0, "n_lines": 22, "is_leaf": true, "centrality": 0, "method": "deleted-dep", "proof_text": " by\n classical\n constructor\n · intro hx\n have hx' := hx\n rw [join_eq_dcast_append (k:=k) (h_pos:=h_pos)...
[ { "name": "join_eq_dcast_append", "text": "theorem join_eq_dcast_append {k : ℕ} (h_pos : k > 0) (hi lo : ConcreteBTField (k - 1)) :\n join (k:=k) h_pos hi lo =\n dcast (h_sum_two_same_pow2 (k:=k) (h_pos:=h_pos))\n (BitVec.append (msbs:=hi) (lsbs:=lo)) := by\n unfold join\n simp [dcast_eq_ro...
[ { "name": "eq_iff_split_eq", "fan_in": 1, "n_deps_direct": 2, "n_deps_transitive": 26, "n_lines": 20, "n_chars": 916, "n_subproofs": 6, "n_tactics": 16, "cyclomatic": 5, "n_automation": 1, "n_rewrites": 3, "n_structural": 3, "automation_only": false, "max_nest...
19
/- Copyright (c) 2024 - 2025 ArkLib Contributors. All rights reserved. Released under Apache 2.0 license as described in the file LICENSE. Authors: Chung Thai Nguyen, Quang Dao -/ import CompPoly.Data.Classes.DCast import CompPoly.Fields.Binary.Tower.Abstract.Basis /-! # Concrete Binary Tower Core Core definitions f...
/- Copyright (c) 2024 - 2025 ArkLib Contributors. All rights reserved. Released under Apache 2.0 license as described in the file LICENSE. Authors: Chung Thai Nguyen, Quang Dao -/ import CompPoly.Data.Classes.DCast import CompPoly.Fields.Binary.Tower.Abstract.Basis /-! # Concrete Binary Tower Core Core definitions f...
@@ -593,6 +593,13 @@ simpa using (BitVec.dcast_bitvec_toNat_eq (x:=x) (h_width_eq:=h)).symm rw [h_toNat] +theorem join_eq_dcast_append {k : ℕ} (h_pos : k > 0) (hi lo : ConcreteBTField (k - 1)) : + join (k:=k) h_pos hi lo = + dcast (h_sum_two_same_pow2 (k:=k) (h_pos:=h_pos)) + (BitVec.append (ms...
{ "repo": "CompPoly", "git_repo": "github.com/Verified-zkEVM/CompPoly", "revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062", "lean_toolchain": "leanprover/lean4:v4.31.0", "proof_assistant": "lean", "ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)", "ablator_flags": [ "--corollary-dele...
ablate_241420177c61_14
1d536bdb1a345a06
lean
lean
github.com/Verified-zkEVM/CompPoly
e95ba1b1cac21ac3e980725abcfb2a0c707d1062
CompPoly/Fields/Binary/Tower/Concrete/Core.lean
Core
14
lemma_delete
null
null
false
0.5
1
1
false
0
inf
0
inf
42
36
1
[ { "theorem_name": "eq_join_iff_dcast_eq_append", "depth": 1, "n_commands": 0, "n_lines": 22, "is_leaf": true, "centrality": 0, "method": "deleted-dep", "proof_text": " by\n classical\n constructor\n · intro hx\n have hx' := hx\n rw [join_eq_dcast_append (k:=k) (h_pos:=h_pos)...
[ { "name": "join_eq_dcast_append", "text": "theorem join_eq_dcast_append {k : ℕ} (h_pos : k > 0) (hi lo : ConcreteBTField (k - 1)) :\n join (k:=k) h_pos hi lo =\n dcast (h_sum_two_same_pow2 (k:=k) (h_pos:=h_pos))\n (BitVec.append (msbs:=hi) (lsbs:=lo)) := by\n unfold join\n simp [dcast_eq_ro...
[ { "name": "split_sum_eq_sum_split", "fan_in": 1, "n_deps_direct": 3, "n_deps_transitive": 27, "n_lines": 33, "n_chars": 1852, "n_subproofs": 9, "n_tactics": 25, "cyclomatic": 2, "n_automation": 0, "n_rewrites": 11, "n_structural": 1, "automation_only": false, ...
20
/- Copyright (c) 2024 - 2025 ArkLib Contributors. All rights reserved. Released under Apache 2.0 license as described in the file LICENSE. Authors: Chung Thai Nguyen, Quang Dao -/ import CompPoly.Data.Classes.DCast import CompPoly.Fields.Binary.Tower.Abstract.Basis /-! # Concrete Binary Tower Core Core definitions f...
/- Copyright (c) 2024 - 2025 ArkLib Contributors. All rights reserved. Released under Apache 2.0 license as described in the file LICENSE. Authors: Chung Thai Nguyen, Quang Dao -/ import CompPoly.Data.Classes.DCast import CompPoly.Fields.Binary.Tower.Abstract.Basis /-! # Concrete Binary Tower Core Core definitions f...
@@ -600,6 +600,13 @@ simpa using (BitVec.dcast_bitvec_toNat_eq (x:=x) (h_width_eq:=h)).symm rw [h_toNat] +theorem join_eq_dcast_append {k : ℕ} (h_pos : k > 0) (hi lo : ConcreteBTField (k - 1)) : + join (k:=k) h_pos hi lo = + dcast (h_sum_two_same_pow2 (k:=k) (h_pos:=h_pos)) + (BitVec.append (ms...
{ "repo": "CompPoly", "git_repo": "github.com/Verified-zkEVM/CompPoly", "revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062", "lean_toolchain": "leanprover/lean4:v4.31.0", "proof_assistant": "lean", "ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)", "ablator_flags": [ "--corollary-dele...
ablate_241420177c61_15
7aa30c55e43e422f
lean
lean
github.com/Verified-zkEVM/CompPoly
e95ba1b1cac21ac3e980725abcfb2a0c707d1062
CompPoly/Fields/Binary/Tower/Concrete/Core.lean
Core
15
lemma_delete
null
null
false
0.5
1
1
false
0
inf
0
inf
42
36
2
[ { "theorem_name": "join_eq_join_iff", "depth": 1, "n_commands": 0, "n_lines": 17, "is_leaf": true, "centrality": 0, "method": "deleted-dep", "proof_text": " by\n constructor\n · intro h_join\n let x₀ := 《 hi₀, lo₀ 》\n let x₁ := 《 hi₁, lo₁ 》\n have h_x₀ : x₀ = 《 hi₀, lo₀ 》 ...
[ { "name": "join_eq_iff_dcast_extractLsb", "text": "theorem join_eq_iff_dcast_extractLsb {k : ℕ} (h_pos : k > 0) (x : ConcreteBTField k)\n (hi_btf lo_btf : ConcreteBTField (k - 1)) :\n x = 《 hi_btf, lo_btf 》 ↔\n (hi_btf = dcast (h_sub_middle h_pos)\n (BitVec.extractLsb (hi := 2 ^ k - 1) (lo := 2 ^ ...
[ { "name": "join_add_join", "fan_in": 0, "n_deps_direct": 3, "n_deps_transitive": 30, "n_lines": 19, "n_chars": 1071, "n_subproofs": 8, "n_tactics": 15, "cyclomatic": 1, "n_automation": 3, "n_rewrites": 1, "n_structural": 1, "automation_only": false, "max_nesti...
22
/- Copyright (c) 2024 - 2025 ArkLib Contributors. All rights reserved. Released under Apache 2.0 license as described in the file LICENSE. Authors: Chung Thai Nguyen, Quang Dao -/ import CompPoly.Data.Classes.DCast import CompPoly.Fields.Binary.Tower.Abstract.Basis /-! # Concrete Binary Tower Core Core definitions f...
/- Copyright (c) 2024 - 2025 ArkLib Contributors. All rights reserved. Released under Apache 2.0 license as described in the file LICENSE. Authors: Chung Thai Nguyen, Quang Dao -/ import CompPoly.Data.Classes.DCast import CompPoly.Fields.Binary.Tower.Abstract.Basis /-! # Concrete Binary Tower Core Core definitions f...
@@ -634,14 +634,231 @@ rw [← join_eq_dcast_append (k:=k) (h_pos:=h_pos) (hi:=hi) (lo:=lo)] at hx'' exact hx'' +theorem join_eq_iff_dcast_extractLsb {k : ℕ} (h_pos : k > 0) (x : ConcreteBTField k) + (hi_btf lo_btf : ConcreteBTField (k - 1)) : + x = 《 hi_btf, lo_btf 》 ↔ + (hi_btf = dcast (h_sub_middle h_...
{ "repo": "CompPoly", "git_repo": "github.com/Verified-zkEVM/CompPoly", "revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062", "lean_toolchain": "leanprover/lean4:v4.31.0", "proof_assistant": "lean", "ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)", "ablator_flags": [ "--corollary-dele...
ablate_241420177c61_16
aabeec5d94fdc064
lean
lean
github.com/Verified-zkEVM/CompPoly
e95ba1b1cac21ac3e980725abcfb2a0c707d1062
CompPoly/Fields/Binary/Tower/Concrete/Core.lean
Core
16
lemma_delete
null
null
false
0.5
1
1
false
0
inf
0
inf
42
36
2
[ { "theorem_name": "split_zero", "depth": 1, "n_commands": 0, "n_lines": 4, "is_leaf": true, "centrality": 0, "method": "deleted-dep", "proof_text": " by\n rw [split]\n simp only [zero, BitVec.zero_eq, BitVec.extractLsb_ofNat, Nat.zero_mod, Nat.zero_shiftRight,\n Nat.sub_zero, Na...
[ { "name": "BitVec.dcast_bitvec_eq_zero", "text": "theorem BitVec.dcast_bitvec_eq_zero {l r : ℕ} (h_width_eq : l = r) :\n dcast (h_width_eq) 0#(l) = 0#(r) := by\n exact BitVec.dcast_bitvec_eq (l:=l) (r:=r) (val:=0) (h_width_eq:=h_width_eq)\n\n", "fan_in": 2, "n_lines": 5, "n_chars": 194, ...
[ { "name": "split_zero", "fan_in": 1, "n_deps_direct": 1, "n_deps_transitive": 2, "n_lines": 7, "n_chars": 302, "n_subproofs": 0, "n_tactics": 4, "cyclomatic": 2, "n_automation": 1, "n_rewrites": 1, "n_structural": 0, "automation_only": false, "max_nesting": 4 ...
2
/- Copyright (c) 2024 - 2025 ArkLib Contributors. All rights reserved. Released under Apache 2.0 license as described in the file LICENSE. Authors: Chung Thai Nguyen, Quang Dao -/ import CompPoly.Data.Classes.DCast import CompPoly.Fields.Binary.Tower.Abstract.Basis /-! # Concrete Binary Tower Core Core definitions f...
/- Copyright (c) 2024 - 2025 ArkLib Contributors. All rights reserved. Released under Apache 2.0 license as described in the file LICENSE. Authors: Chung Thai Nguyen, Quang Dao -/ import CompPoly.Data.Classes.DCast import CompPoly.Fields.Binary.Tower.Abstract.Basis /-! # Concrete Binary Tower Core Core definitions f...
@@ -53,6 +53,10 @@ subst h_width_eq rw [dcast_eq] +theorem BitVec.dcast_bitvec_eq_zero {l r : ℕ} (h_width_eq : l = r) : + dcast (h_width_eq) 0#(l) = 0#(r) := by + exact BitVec.dcast_bitvec_eq (l:=l) (r:=r) (val:=0) (h_width_eq:=h_width_eq) + theorem BitVec.dcast_bitvec_extractLsb_eq {w hi1 lo1 hi2 lo2 : ℕ}...
{ "repo": "CompPoly", "git_repo": "github.com/Verified-zkEVM/CompPoly", "revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062", "lean_toolchain": "leanprover/lean4:v4.31.0", "proof_assistant": "lean", "ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)", "ablator_flags": [ "--corollary-dele...
ablate_241420177c61_17
c5e1bb473c822d48
lean
lean
github.com/Verified-zkEVM/CompPoly
e95ba1b1cac21ac3e980725abcfb2a0c707d1062
CompPoly/Fields/Binary/Tower/Concrete/Core.lean
Core
17
lemma_delete
null
null
false
0.5
1
1
false
0
inf
0
inf
42
36
1
[ { "theorem_name": "eq_join_iff_dcast_eq_append", "depth": 1, "n_commands": 0, "n_lines": 22, "is_leaf": true, "centrality": 0, "method": "deleted-dep", "proof_text": " by\n classical\n constructor\n · intro hx\n have hx' := hx\n rw [join_eq_dcast_append (k:=k) (h_pos:=h_pos)...
[ { "name": "join_eq_dcast_append", "text": "theorem join_eq_dcast_append {k : ℕ} (h_pos : k > 0) (hi lo : ConcreteBTField (k - 1)) :\n join (k:=k) h_pos hi lo =\n dcast (h_sum_two_same_pow2 (k:=k) (h_pos:=h_pos))\n (BitVec.append (msbs:=hi) (lsbs:=lo)) := by\n unfold join\n simp [dcast_eq_ro...
[ { "name": "split_Z", "fan_in": 0, "n_deps_direct": 1, "n_deps_transitive": 26, "n_lines": 9, "n_chars": 234, "n_subproofs": 1, "n_tactics": 6, "cyclomatic": 1, "n_automation": 2, "n_rewrites": 1, "n_structural": 2, "automation_only": false, "max_nesting": 2 ...
19
/- Copyright (c) 2024 - 2025 ArkLib Contributors. All rights reserved. Released under Apache 2.0 license as described in the file LICENSE. Authors: Chung Thai Nguyen, Quang Dao -/ import CompPoly.Data.Classes.DCast import CompPoly.Fields.Binary.Tower.Abstract.Basis /-! # Concrete Binary Tower Core Core definitions f...
/- Copyright (c) 2024 - 2025 ArkLib Contributors. All rights reserved. Released under Apache 2.0 license as described in the file LICENSE. Authors: Chung Thai Nguyen, Quang Dao -/ import CompPoly.Data.Classes.DCast import CompPoly.Fields.Binary.Tower.Abstract.Basis /-! # Concrete Binary Tower Core Core definitions f...
@@ -593,6 +593,13 @@ simpa using (BitVec.dcast_bitvec_toNat_eq (x:=x) (h_width_eq:=h)).symm rw [h_toNat] +theorem join_eq_dcast_append {k : ℕ} (h_pos : k > 0) (hi lo : ConcreteBTField (k - 1)) : + join (k:=k) h_pos hi lo = + dcast (h_sum_two_same_pow2 (k:=k) (h_pos:=h_pos)) + (BitVec.append (ms...
{ "repo": "CompPoly", "git_repo": "github.com/Verified-zkEVM/CompPoly", "revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062", "lean_toolchain": "leanprover/lean4:v4.31.0", "proof_assistant": "lean", "ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)", "ablator_flags": [ "--corollary-dele...
ablate_241420177c61_18
495b1d0342fba48c
lean
lean
github.com/Verified-zkEVM/CompPoly
e95ba1b1cac21ac3e980725abcfb2a0c707d1062
CompPoly/Fields/Binary/Tower/Concrete/Core.lean
Core
18
lemma_delete
null
null
false
0.5
1
1
false
0
inf
0
inf
42
36
1
[ { "theorem_name": "split_one", "depth": 1, "n_commands": 0, "n_lines": 22, "is_leaf": true, "centrality": 0, "method": "deleted-dep", "proof_text": " by\n rw [split]\n let lo_bits := BitVec.extractLsb (hi := 2 ^ (k - 1) - 1) (lo := 0) (one (k:=k))\n let hi_bits := BitVec.extractLs...
[ { "name": "one_bitvec_toNat", "text": "lemma one_bitvec_toNat {width : ℕ} (h_width : width > 0) : (1#width).toNat = 1 := by\n simp only [BitVec.toNat_ofNat, Nat.one_mod_two_pow_eq_one, h_width]\n\n", "fan_in": 1, "n_lines": 4, "n_chars": 158, "n_subproofs": 0, "n_tactics": 2, "cyclo...
[ { "name": "split_one", "fan_in": 1, "n_deps_direct": 6, "n_deps_transitive": 7, "n_lines": 25, "n_chars": 1135, "n_subproofs": 3, "n_tactics": 22, "cyclomatic": 2, "n_automation": 5, "n_rewrites": 7, "n_structural": 2, "automation_only": false, "max_nesting": ...
5
/- Copyright (c) 2024 - 2025 ArkLib Contributors. All rights reserved. Released under Apache 2.0 license as described in the file LICENSE. Authors: Chung Thai Nguyen, Quang Dao -/ import CompPoly.Data.Classes.DCast import CompPoly.Fields.Binary.Tower.Abstract.Basis /-! # Concrete Binary Tower Core Core definitions f...
/- Copyright (c) 2024 - 2025 ArkLib Contributors. All rights reserved. Released under Apache 2.0 license as described in the file LICENSE. Authors: Chung Thai Nguyen, Quang Dao -/ import CompPoly.Data.Classes.DCast import CompPoly.Fields.Binary.Tower.Abstract.Basis /-! # Concrete Binary Tower Core Core definitions f...
@@ -879,13 +879,37 @@ else 《 one (k:=k-1), zero (k:=k-1) 》 +lemma one_bitvec_toNat {width : ℕ} (h_width : width > 0) : (1#width).toNat = 1 := by + simp only [BitVec.toNat_ofNat, Nat.one_mod_two_pow_eq_one, h_width] + lemma one_bitvec_shiftRight {d : ℕ} (h_d : d > 0) : 1 >>> d = 0 := by apply Nat.shiftRig...
{ "repo": "CompPoly", "git_repo": "github.com/Verified-zkEVM/CompPoly", "revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062", "lean_toolchain": "leanprover/lean4:v4.31.0", "proof_assistant": "lean", "ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)", "ablator_flags": [ "--corollary-dele...
ablate_241420177c61_19
58c97ac8c8d0e696
lean
lean
github.com/Verified-zkEVM/CompPoly
e95ba1b1cac21ac3e980725abcfb2a0c707d1062
CompPoly/Fields/Binary/Tower/Concrete/Core.lean
Core
19
lemma_delete
null
null
false
0.5
1
1
false
0
inf
0
inf
42
36
2
[ { "theorem_name": "join_eq_join_iff", "depth": 1, "n_commands": 0, "n_lines": 17, "is_leaf": true, "centrality": 0, "method": "deleted-dep", "proof_text": " by\n constructor\n · intro h_join\n let x₀ := 《 hi₀, lo₀ 》\n let x₁ := 《 hi₁, lo₁ 》\n have h_x₀ : x₀ = 《 hi₀, lo₀ 》 ...
[ { "name": "join_eq_iff_dcast_extractLsb", "text": "theorem join_eq_iff_dcast_extractLsb {k : ℕ} (h_pos : k > 0) (x : ConcreteBTField k)\n (hi_btf lo_btf : ConcreteBTField (k - 1)) :\n x = 《 hi_btf, lo_btf 》 ↔\n (hi_btf = dcast (h_sub_middle h_pos)\n (BitVec.extractLsb (hi := 2 ^ k - 1) (lo := 2 ^ ...
[ { "name": "join_zero_one", "fan_in": 0, "n_deps_direct": 2, "n_deps_transitive": 30, "n_lines": 7, "n_chars": 242, "n_subproofs": 2, "n_tactics": 4, "cyclomatic": 1, "n_automation": 0, "n_rewrites": 0, "n_structural": 1, "automation_only": false, "max_nesting"...
23
/- Copyright (c) 2024 - 2025 ArkLib Contributors. All rights reserved. Released under Apache 2.0 license as described in the file LICENSE. Authors: Chung Thai Nguyen, Quang Dao -/ import CompPoly.Data.Classes.DCast import CompPoly.Fields.Binary.Tower.Abstract.Basis /-! # Concrete Binary Tower Core Core definitions f...
/- Copyright (c) 2024 - 2025 ArkLib Contributors. All rights reserved. Released under Apache 2.0 license as described in the file LICENSE. Authors: Chung Thai Nguyen, Quang Dao -/ import CompPoly.Data.Classes.DCast import CompPoly.Fields.Binary.Tower.Abstract.Basis /-! # Concrete Binary Tower Core Core definitions f...
@@ -627,14 +627,231 @@ rw [← join_eq_dcast_append (k:=k) (h_pos:=h_pos) (hi:=hi) (lo:=lo)] at hx'' exact hx'' +theorem join_eq_iff_dcast_extractLsb {k : ℕ} (h_pos : k > 0) (x : ConcreteBTField k) + (hi_btf lo_btf : ConcreteBTField (k - 1)) : + x = 《 hi_btf, lo_btf 》 ↔ + (hi_btf = dcast (h_sub_middle h_...
{ "repo": "CompPoly", "git_repo": "github.com/Verified-zkEVM/CompPoly", "revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062", "lean_toolchain": "leanprover/lean4:v4.31.0", "proof_assistant": "lean", "ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)", "ablator_flags": [ "--corollary-dele...
ablate_241420177c61_20
387598fe8816caef
lean
lean
github.com/Verified-zkEVM/CompPoly
e95ba1b1cac21ac3e980725abcfb2a0c707d1062
CompPoly/Fields/Binary/Tower/Concrete/Core.lean
Core
20
lemma_delete
null
null
false
0.5
1
1
false
0
inf
0
inf
42
36
2
[ { "theorem_name": "join_eq_join_iff", "depth": 1, "n_commands": 0, "n_lines": 17, "is_leaf": true, "centrality": 0, "method": "deleted-dep", "proof_text": " by\n constructor\n · intro h_join\n let x₀ := 《 hi₀, lo₀ 》\n let x₁ := 《 hi₁, lo₁ 》\n have h_x₀ : x₀ = 《 hi₀, lo₀ 》 ...
[ { "name": "join_eq_iff_dcast_extractLsb", "text": "theorem join_eq_iff_dcast_extractLsb {k : ℕ} (h_pos : k > 0) (x : ConcreteBTField k)\n (hi_btf lo_btf : ConcreteBTField (k - 1)) :\n x = 《 hi_btf, lo_btf 》 ↔\n (hi_btf = dcast (h_sub_middle h_pos)\n (BitVec.extractLsb (hi := 2 ^ k - 1) (lo := 2 ^ ...
[ { "name": "Z_ne_zero", "fan_in": 0, "n_deps_direct": 3, "n_deps_transitive": 31, "n_lines": 17, "n_chars": 519, "n_subproofs": 3, "n_tactics": 16, "cyclomatic": 1, "n_automation": 5, "n_rewrites": 3, "n_structural": 2, "automation_only": false, "max_nesting": ...
23
/- Copyright (c) 2024 - 2025 ArkLib Contributors. All rights reserved. Released under Apache 2.0 license as described in the file LICENSE. Authors: Chung Thai Nguyen, Quang Dao -/ import CompPoly.Data.Classes.DCast import CompPoly.Fields.Binary.Tower.Abstract.Basis /-! # Concrete Binary Tower Core Core definitions f...
/- Copyright (c) 2024 - 2025 ArkLib Contributors. All rights reserved. Released under Apache 2.0 license as described in the file LICENSE. Authors: Chung Thai Nguyen, Quang Dao -/ import CompPoly.Data.Classes.DCast import CompPoly.Fields.Binary.Tower.Abstract.Basis /-! # Concrete Binary Tower Core Core definitions f...
@@ -627,14 +627,231 @@ rw [← join_eq_dcast_append (k:=k) (h_pos:=h_pos) (hi:=hi) (lo:=lo)] at hx'' exact hx'' +theorem join_eq_iff_dcast_extractLsb {k : ℕ} (h_pos : k > 0) (x : ConcreteBTField k) + (hi_btf lo_btf : ConcreteBTField (k - 1)) : + x = 《 hi_btf, lo_btf 》 ↔ + (hi_btf = dcast (h_sub_middle h_...
{ "repo": "CompPoly", "git_repo": "github.com/Verified-zkEVM/CompPoly", "revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062", "lean_toolchain": "leanprover/lean4:v4.31.0", "proof_assistant": "lean", "ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)", "ablator_flags": [ "--corollary-dele...
ablate_241420177c61_21
707e3fec85cfe028
lean
lean
github.com/Verified-zkEVM/CompPoly
e95ba1b1cac21ac3e980725abcfb2a0c707d1062
CompPoly/Fields/Binary/Tower/Concrete/Core.lean
Core
21
lemma_delete
null
null
false
0.5
1
1
false
0
inf
0
inf
42
36
6
[ { "theorem_name": "concrete_eq_zero_or_eq_one", "depth": 1, "n_commands": 0, "n_lines": 35, "is_leaf": true, "centrality": 0, "method": "deleted-dep", "proof_text": " by\n if h_k_zero : k = 0 then\n have h_2_pow_k_eq_1 : 2 ^ k = 1 := by rw [h_k_zero]; norm_num\n let a0 : Concr...
[ { "name": "eq_zero_or_eq_one", "text": "theorem eq_zero_or_eq_one {a : ConcreteBTField 0} : a = zero ∨ a = one := by\n unfold ConcreteBTField at a -- Now a is a BitVec (2 ^ 0) = BitVec 1\n have h := BitVec.eq_zero_or_eq_one a\n cases h with\n | inl h_zero =>\n left\n unfold zero\n exact h_zero\...
[ { "name": "concrete_eq_zero_or_eq_one", "fan_in": 0, "n_deps_direct": 3, "n_deps_transitive": 5, "n_lines": 38, "n_chars": 1669, "n_subproofs": 6, "n_tactics": 33, "cyclomatic": 2, "n_automation": 8, "n_rewrites": 9, "n_structural": 3, "automation_only": false, ...
2
/- Copyright (c) 2024 - 2025 ArkLib Contributors. All rights reserved. Released under Apache 2.0 license as described in the file LICENSE. Authors: Chung Thai Nguyen, Quang Dao -/ import CompPoly.Data.Classes.DCast import CompPoly.Fields.Binary.Tower.Abstract.Basis /-! # Concrete Binary Tower Core Core definitions f...
/- Copyright (c) 2024 - 2025 ArkLib Contributors. All rights reserved. Released under Apache 2.0 license as described in the file LICENSE. Authors: Chung Thai Nguyen, Quang Dao -/ import CompPoly.Data.Classes.DCast import CompPoly.Fields.Binary.Tower.Abstract.Basis /-! # Concrete Binary Tower Core Core definitions f...
@@ -1008,8 +1008,55 @@ push Not at x_lt_y exact x_lt_y +theorem eq_zero_or_eq_one {a : ConcreteBTField 0} : a = zero ∨ a = one := by + unfold ConcreteBTField at a -- Now a is a BitVec (2 ^ 0) = BitVec 1 + have h := BitVec.eq_zero_or_eq_one a + cases h with + | inl h_zero => + left + unfold zer...
{ "repo": "CompPoly", "git_repo": "github.com/Verified-zkEVM/CompPoly", "revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062", "lean_toolchain": "leanprover/lean4:v4.31.0", "proof_assistant": "lean", "ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)", "ablator_flags": [ "--corollary-dele...
ablate_241420177c61_22
eef33a4ea890e6bb
lean
lean
github.com/Verified-zkEVM/CompPoly
e95ba1b1cac21ac3e980725abcfb2a0c707d1062
CompPoly/Fields/Binary/Tower/Concrete/Core.lean
Core
22
lemma_delete
null
null
false
0.5
1
1
false
0
inf
0
inf
42
36
6
[ { "theorem_name": "concrete_eq_zero_or_eq_one", "depth": 1, "n_commands": 0, "n_lines": 35, "is_leaf": true, "centrality": 0, "method": "deleted-dep", "proof_text": " by\n if h_k_zero : k = 0 then\n have h_2_pow_k_eq_1 : 2 ^ k = 1 := by rw [h_k_zero]; norm_num\n let a0 : Concr...
[ { "name": "eq_zero_or_eq_one", "text": "theorem eq_zero_or_eq_one {a : ConcreteBTField 0} : a = zero ∨ a = one := by\n unfold ConcreteBTField at a -- Now a is a BitVec (2 ^ 0) = BitVec 1\n have h := BitVec.eq_zero_or_eq_one a\n cases h with\n | inl h_zero =>\n left\n unfold zero\n exact h_zero\...
[ { "name": "add_eq_one_iff", "fan_in": 1, "n_deps_direct": 4, "n_deps_transitive": 4, "n_lines": 7, "n_chars": 278, "n_subproofs": 0, "n_tactics": 6, "cyclomatic": 5, "n_automation": 1, "n_rewrites": 0, "n_structural": 2, "automation_only": false, "max_nesting"...
1
/- Copyright (c) 2024 - 2025 ArkLib Contributors. All rights reserved. Released under Apache 2.0 license as described in the file LICENSE. Authors: Chung Thai Nguyen, Quang Dao -/ import CompPoly.Data.Classes.DCast import CompPoly.Fields.Binary.Tower.Abstract.Basis /-! # Concrete Binary Tower Core Core definitions f...
/- Copyright (c) 2024 - 2025 ArkLib Contributors. All rights reserved. Released under Apache 2.0 license as described in the file LICENSE. Authors: Chung Thai Nguyen, Quang Dao -/ import CompPoly.Data.Classes.DCast import CompPoly.Fields.Binary.Tower.Abstract.Basis /-! # Concrete Binary Tower Core Core definitions f...
@@ -1008,8 +1008,24 @@ push Not at x_lt_y exact x_lt_y +theorem eq_zero_or_eq_one {a : ConcreteBTField 0} : a = zero ∨ a = one := by + unfold ConcreteBTField at a -- Now a is a BitVec (2 ^ 0) = BitVec 1 + have h := BitVec.eq_zero_or_eq_one a + cases h with + | inl h_zero => + left + unfold zer...
{ "repo": "CompPoly", "git_repo": "github.com/Verified-zkEVM/CompPoly", "revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062", "lean_toolchain": "leanprover/lean4:v4.31.0", "proof_assistant": "lean", "ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)", "ablator_flags": [ "--corollary-dele...
ablate_241420177c61_23
e18a61be19d2209e
lean
lean
github.com/Verified-zkEVM/CompPoly
e95ba1b1cac21ac3e980725abcfb2a0c707d1062
CompPoly/Fields/Binary/Tower/Concrete/Core.lean
Core
23
lemma_delete
null
null
false
0.5
1
1
false
0
inf
0
inf
42
36
6
[ { "theorem_name": "concrete_eq_zero_or_eq_one", "depth": 1, "n_commands": 0, "n_lines": 35, "is_leaf": true, "centrality": 0, "method": "deleted-dep", "proof_text": " by\n if h_k_zero : k = 0 then\n have h_2_pow_k_eq_1 : 2 ^ k = 1 := by rw [h_k_zero]; norm_num\n let a0 : Concr...
[ { "name": "eq_zero_or_eq_one", "text": "theorem eq_zero_or_eq_one {a : ConcreteBTField 0} : a = zero ∨ a = one := by\n unfold ConcreteBTField at a -- Now a is a BitVec (2 ^ 0) = BitVec 1\n have h := BitVec.eq_zero_or_eq_one a\n cases h with\n | inl h_zero =>\n left\n unfold zero\n exact h_zero\...
[ { "name": "concrete_mul_assoc0", "fan_in": 0, "n_deps_direct": 2, "n_deps_transitive": 2, "n_lines": 11, "n_chars": 567, "n_subproofs": 0, "n_tactics": 8, "cyclomatic": 4, "n_automation": 4, "n_rewrites": 0, "n_structural": 3, "automation_only": false, "max_ne...
1
/- Copyright (c) 2024 - 2025 ArkLib Contributors. All rights reserved. Released under Apache 2.0 license as described in the file LICENSE. Authors: Chung Thai Nguyen, Quang Dao -/ import CompPoly.Data.Classes.DCast import CompPoly.Fields.Binary.Tower.Abstract.Basis /-! # Concrete Binary Tower Core Core definitions f...
/- Copyright (c) 2024 - 2025 ArkLib Contributors. All rights reserved. Released under Apache 2.0 license as described in the file LICENSE. Authors: Chung Thai Nguyen, Quang Dao -/ import CompPoly.Data.Classes.DCast import CompPoly.Fields.Binary.Tower.Abstract.Basis /-! # Concrete Binary Tower Core Core definitions f...
@@ -1008,6 +1008,19 @@ push Not at x_lt_y exact x_lt_y +theorem eq_zero_or_eq_one {a : ConcreteBTField 0} : a = zero ∨ a = one := by + unfold ConcreteBTField at a -- Now a is a BitVec (2 ^ 0) = BitVec 1 + have h := BitVec.eq_zero_or_eq_one a + cases h with + | inl h_zero => + left + unfold zer...
{ "repo": "CompPoly", "git_repo": "github.com/Verified-zkEVM/CompPoly", "revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062", "lean_toolchain": "leanprover/lean4:v4.31.0", "proof_assistant": "lean", "ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)", "ablator_flags": [ "--corollary-dele...
ablate_241420177c61_24
0929cfb06ddb30eb
lean
lean
github.com/Verified-zkEVM/CompPoly
e95ba1b1cac21ac3e980725abcfb2a0c707d1062
CompPoly/Fields/Binary/Tower/Concrete/Core.lean
Core
24
lemma_delete
null
null
false
0.5
1
1
false
0
inf
0
inf
42
36
6
[ { "theorem_name": "concrete_eq_zero_or_eq_one", "depth": 1, "n_commands": 0, "n_lines": 35, "is_leaf": true, "centrality": 0, "method": "deleted-dep", "proof_text": " by\n if h_k_zero : k = 0 then\n have h_2_pow_k_eq_1 : 2 ^ k = 1 := by rw [h_k_zero]; norm_num\n let a0 : Concr...
[ { "name": "eq_zero_or_eq_one", "text": "theorem eq_zero_or_eq_one {a : ConcreteBTField 0} : a = zero ∨ a = one := by\n unfold ConcreteBTField at a -- Now a is a BitVec (2 ^ 0) = BitVec 1\n have h := BitVec.eq_zero_or_eq_one a\n cases h with\n | inl h_zero =>\n left\n unfold zero\n exact h_zero\...
[ { "name": "concrete_mul_comm0", "fan_in": 1, "n_deps_direct": 1, "n_deps_transitive": 1, "n_lines": 10, "n_chars": 427, "n_subproofs": 0, "n_tactics": 6, "cyclomatic": 3, "n_automation": 3, "n_rewrites": 0, "n_structural": 2, "automation_only": false, "max_nes...
1
/- Copyright (c) 2024 - 2025 ArkLib Contributors. All rights reserved. Released under Apache 2.0 license as described in the file LICENSE. Authors: Chung Thai Nguyen, Quang Dao -/ import CompPoly.Data.Classes.DCast import CompPoly.Fields.Binary.Tower.Abstract.Basis /-! # Concrete Binary Tower Core Core definitions f...
/- Copyright (c) 2024 - 2025 ArkLib Contributors. All rights reserved. Released under Apache 2.0 license as described in the file LICENSE. Authors: Chung Thai Nguyen, Quang Dao -/ import CompPoly.Data.Classes.DCast import CompPoly.Fields.Binary.Tower.Abstract.Basis /-! # Concrete Binary Tower Core Core definitions f...
@@ -1008,6 +1008,19 @@ push Not at x_lt_y exact x_lt_y +theorem eq_zero_or_eq_one {a : ConcreteBTField 0} : a = zero ∨ a = one := by + unfold ConcreteBTField at a -- Now a is a BitVec (2 ^ 0) = BitVec 1 + have h := BitVec.eq_zero_or_eq_one a + cases h with + | inl h_zero => + left + unfold zer...
{ "repo": "CompPoly", "git_repo": "github.com/Verified-zkEVM/CompPoly", "revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062", "lean_toolchain": "leanprover/lean4:v4.31.0", "proof_assistant": "lean", "ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)", "ablator_flags": [ "--corollary-dele...
ablate_241420177c61_25
741df383cfa92842
lean
lean
github.com/Verified-zkEVM/CompPoly
e95ba1b1cac21ac3e980725abcfb2a0c707d1062
CompPoly/Fields/Binary/Tower/Concrete/Core.lean
Core
25
lemma_delete
null
null
false
0.5
1
1
false
0
inf
0
inf
42
36
6
[ { "theorem_name": "concrete_eq_zero_or_eq_one", "depth": 1, "n_commands": 0, "n_lines": 35, "is_leaf": true, "centrality": 0, "method": "deleted-dep", "proof_text": " by\n if h_k_zero : k = 0 then\n have h_2_pow_k_eq_1 : 2 ^ k = 1 := by rw [h_k_zero]; norm_num\n let a0 : Concr...
[ { "name": "eq_zero_or_eq_one", "text": "theorem eq_zero_or_eq_one {a : ConcreteBTField 0} : a = zero ∨ a = one := by\n unfold ConcreteBTField at a -- Now a is a BitVec (2 ^ 0) = BitVec 1\n have h := BitVec.eq_zero_or_eq_one a\n cases h with\n | inl h_zero =>\n left\n unfold zero\n exact h_zero\...
[ { "name": "if_zero_then_zero_else_self", "fan_in": 0, "n_deps_direct": 2, "n_deps_transitive": 2, "n_lines": 7, "n_chars": 265, "n_subproofs": 0, "n_tactics": 4, "cyclomatic": 2, "n_automation": 2, "n_rewrites": 0, "n_structural": 1, "automation_only": false, ...
1
/- Copyright (c) 2024 - 2025 ArkLib Contributors. All rights reserved. Released under Apache 2.0 license as described in the file LICENSE. Authors: Chung Thai Nguyen, Quang Dao -/ import CompPoly.Data.Classes.DCast import CompPoly.Fields.Binary.Tower.Abstract.Basis /-! # Concrete Binary Tower Core Core definitions f...
/- Copyright (c) 2024 - 2025 ArkLib Contributors. All rights reserved. Released under Apache 2.0 license as described in the file LICENSE. Authors: Chung Thai Nguyen, Quang Dao -/ import CompPoly.Data.Classes.DCast import CompPoly.Fields.Binary.Tower.Abstract.Basis /-! # Concrete Binary Tower Core Core definitions f...
@@ -1008,6 +1008,19 @@ push Not at x_lt_y exact x_lt_y +theorem eq_zero_or_eq_one {a : ConcreteBTField 0} : a = zero ∨ a = one := by + unfold ConcreteBTField at a -- Now a is a BitVec (2 ^ 0) = BitVec 1 + have h := BitVec.eq_zero_or_eq_one a + cases h with + | inl h_zero => + left + unfold zer...
{ "repo": "CompPoly", "git_repo": "github.com/Verified-zkEVM/CompPoly", "revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062", "lean_toolchain": "leanprover/lean4:v4.31.0", "proof_assistant": "lean", "ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)", "ablator_flags": [ "--corollary-dele...
ablate_241420177c61_26
a715a2ba44d62d38
lean
lean
github.com/Verified-zkEVM/CompPoly
e95ba1b1cac21ac3e980725abcfb2a0c707d1062
CompPoly/Fields/Binary/Tower/Concrete/Core.lean
Core
26
lemma_delete
null
null
false
0.5
1
1
false
0
inf
0
inf
42
36
6
[ { "theorem_name": "concrete_eq_zero_or_eq_one", "depth": 1, "n_commands": 0, "n_lines": 35, "is_leaf": true, "centrality": 0, "method": "deleted-dep", "proof_text": " by\n if h_k_zero : k = 0 then\n have h_2_pow_k_eq_1 : 2 ^ k = 1 := by rw [h_k_zero]; norm_num\n let a0 : Concr...
[ { "name": "eq_zero_or_eq_one", "text": "theorem eq_zero_or_eq_one {a : ConcreteBTField 0} : a = zero ∨ a = one := by\n unfold ConcreteBTField at a -- Now a is a BitVec (2 ^ 0) = BitVec 1\n have h := BitVec.eq_zero_or_eq_one a\n cases h with\n | inl h_zero =>\n left\n unfold zero\n exact h_zero\...
[ { "name": "concrete_mul_left_distrib0", "fan_in": 1, "n_deps_direct": 6, "n_deps_transitive": 6, "n_lines": 24, "n_chars": 1032, "n_subproofs": 3, "n_tactics": 27, "cyclomatic": 4, "n_automation": 10, "n_rewrites": 5, "n_structural": 4, "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.Data.Classes.DCast import CompPoly.Fields.Binary.Tower.Abstract.Basis /-! # Concrete Binary Tower Core Core definitions f...
/- Copyright (c) 2024 - 2025 ArkLib Contributors. All rights reserved. Released under Apache 2.0 license as described in the file LICENSE. Authors: Chung Thai Nguyen, Quang Dao -/ import CompPoly.Data.Classes.DCast import CompPoly.Fields.Binary.Tower.Abstract.Basis /-! # Concrete Binary Tower Core Core definitions f...
@@ -1011,8 +1011,24 @@ push Not at x_lt_y exact x_lt_y +theorem eq_zero_or_eq_one {a : ConcreteBTField 0} : a = zero ∨ a = one := by + unfold ConcreteBTField at a -- Now a is a BitVec (2 ^ 0) = BitVec 1 + have h := BitVec.eq_zero_or_eq_one a + cases h with + | inl h_zero => + left + unfold zer...
{ "repo": "CompPoly", "git_repo": "github.com/Verified-zkEVM/CompPoly", "revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062", "lean_toolchain": "leanprover/lean4:v4.31.0", "proof_assistant": "lean", "ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)", "ablator_flags": [ "--corollary-dele...
ablate_241420177c61_27
4297676144e15f44
lean
lean
github.com/Verified-zkEVM/CompPoly
e95ba1b1cac21ac3e980725abcfb2a0c707d1062
CompPoly/Fields/Binary/Tower/Concrete/Core.lean
Core
27
lemma_delete
null
null
false
0.5
1
1
false
0
inf
0
inf
42
36
1
[ { "theorem_name": "concrete_mul_right_distrib0", "depth": 1, "n_commands": 0, "n_lines": 5, "is_leaf": true, "centrality": 0, "method": "deleted-dep", "proof_text": " by\n rw [concrete_mul_comm0 (a:=(a + b)) (b:=c)]\n rw [concrete_mul_comm0 (a:=a) (b:=c)]\n rw [concrete_mul_comm0 ...
[ { "name": "concrete_mul_comm0", "text": "lemma concrete_mul_comm0 (a b : ConcreteBTField 0) :\n concrete_mul a b = concrete_mul b a := by\n rcases eq_zero_or_eq_one (a := a) with (ha | ha)\n · simp [ha, concrete_mul] -- a = zero\n · rcases eq_zero_or_eq_one (a := b) with (hb | hb)\n · simp [ha, hb...
[ { "name": "concrete_mul_right_distrib0", "fan_in": 0, "n_deps_direct": 2, "n_deps_transitive": 8, "n_lines": 8, "n_chars": 318, "n_subproofs": 0, "n_tactics": 5, "cyclomatic": 1, "n_automation": 0, "n_rewrites": 3, "n_structural": 1, "automation_only": false, ...
5
/- Copyright (c) 2024 - 2025 ArkLib Contributors. All rights reserved. Released under Apache 2.0 license as described in the file LICENSE. Authors: Chung Thai Nguyen, Quang Dao -/ import CompPoly.Data.Classes.DCast import CompPoly.Fields.Binary.Tower.Abstract.Basis /-! # Concrete Binary Tower Core Core definitions f...
/- Copyright (c) 2024 - 2025 ArkLib Contributors. All rights reserved. Released under Apache 2.0 license as described in the file LICENSE. Authors: Chung Thai Nguyen, Quang Dao -/ import CompPoly.Data.Classes.DCast import CompPoly.Fields.Binary.Tower.Abstract.Basis /-! # Concrete Binary Tower Core Core definitions f...
@@ -1044,6 +1044,15 @@ section FieldLemmasOfLevel0 +lemma concrete_mul_comm0 (a b : ConcreteBTField 0) : + concrete_mul a b = concrete_mul b a := by + rcases eq_zero_or_eq_one (a := a) with (ha | ha) + · simp [ha, concrete_mul] -- a = zero + · rcases eq_zero_or_eq_one (a := b) with (hb | hb) + · simp [ha...
{ "repo": "CompPoly", "git_repo": "github.com/Verified-zkEVM/CompPoly", "revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062", "lean_toolchain": "leanprover/lean4:v4.31.0", "proof_assistant": "lean", "ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)", "ablator_flags": [ "--corollary-dele...
ablate_985f4a941772_0
4a3b6784869902ab
lean
lean
github.com/Verified-zkEVM/CompPoly
e95ba1b1cac21ac3e980725abcfb2a0c707d1062
CompPoly/Multilinear/TransformEquiv.lean
TransformEquiv
0
lemma_delete
null
null
false
0.5
1
1
false
0
inf
0
inf
42
34
2
[ { "theorem_name": "popCount_sub_two_pow", "depth": 1, "n_commands": 0, "n_lines": 46, "is_leaf": true, "centrality": 0, "method": "deleted-dep", "proof_text": " by\n induction k generalizing m with\n | zero =>\n have hm_pos : 0 < m := by\n by_contra h; push Not at h\n ...
[ { "name": "popCount_pos'", "text": "/-- Recursion for `Nat.popCount` on positive arguments: split off the least-significant bit. -/\nprivate lemma popCount_pos' {m : ℕ} (hm : 0 < m) :\n Nat.popCount m =\n m % 2 + Nat.popCount (m / 2) := by\n unfold Nat.popCount\n rw [Nat.digits_def' (by norm_num :...
[ { "name": "popCount_sub_two_pow", "fan_in": 1, "n_deps_direct": 3, "n_deps_transitive": 3, "n_lines": 52, "n_chars": 1865, "n_subproofs": 15, "n_tactics": 56, "cyclomatic": 2, "n_automation": 20, "n_rewrites": 11, "n_structural": 1, "automation_only": false, "...
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, Natalie Klaus -/ import CompPoly.Multilinear.Basic /-! # Fast ↔ Spec equivalence for the multilinear zeta / Möbius transforms This file proves that the $O...
/- 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, Natalie Klaus -/ import CompPoly.Multilinear.Basic /-! # Fast ↔ Spec equivalence for the multilinear zeta / Möbius transforms This file proves that the $O...
@@ -62,6 +62,14 @@ Nat.popCount 0 = 0 := by unfold Nat.popCount; simp [Nat.digits] +/-- Recursion for `Nat.popCount` on positive arguments: split off the least-significant bit. -/ +private lemma popCount_pos' {m : ℕ} (hm : 0 < m) : + Nat.popCount m = + m % 2 + Nat.popCount (m / 2) := by + unfold 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_985f4a941772_1
d0512caf1bb1388e
lean
lean
github.com/Verified-zkEVM/CompPoly
e95ba1b1cac21ac3e980725abcfb2a0c707d1062
CompPoly/Multilinear/TransformEquiv.lean
TransformEquiv
1
lemma_delete
null
null
false
0.5
1
1
false
0
inf
0
inf
42
34
1
[ { "theorem_name": "testBit_sub_ne", "depth": 1, "n_commands": 0, "n_lines": 8, "is_leaf": true, "centrality": 0, "method": "deleted-dep", "proof_text": " by\n apply testBit_eq_of_getBit_eq\n have hgb : Nat.getBit k m = 1 := by\n rw [Nat.testBit_true_eq_getBit_eq_1] at hbit\n ...
[ { "name": "testBit_eq_of_getBit_eq", "text": "/-- Transfer `getBit` equality to `testBit` equality. -/\nprivate lemma testBit_eq_of_getBit_eq {m n k : ℕ}\n (h : Nat.getBit k m = Nat.getBit k n) :\n m.testBit k = n.testBit k := by\n rw [Nat.getBit_eq_testBit,\n Nat.getBit_eq_testBit] at h\n cases ...
[ { "name": "testBit_sub_ne", "fan_in": 3, "n_deps_direct": 1, "n_deps_transitive": 1, "n_lines": 13, "n_chars": 477, "n_subproofs": 2, "n_tactics": 9, "cyclomatic": 1, "n_automation": 1, "n_rewrites": 1, "n_structural": 3, "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, Chung Thai Nguyen, Natalie Klaus -/ import CompPoly.Multilinear.Basic /-! # Fast ↔ Spec equivalence for the multilinear zeta / Möbius transforms This file proves that the $O...
/- 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, Natalie Klaus -/ import CompPoly.Multilinear.Basic /-! # Fast ↔ Spec equivalence for the multilinear zeta / Möbius transforms This file proves that the $O...
@@ -57,10 +57,26 @@ if (i.val.popCount - j.val.popCount) % 2 = 0 then p.get j else -p.get j else 0 +/-- Transfer `getBit` equality to `testBit` equality. -/ +private lemma testBit_eq_of_getBit_eq {m n k : ℕ} + (h : Nat.getBit k m = Nat.getBit k n) : + m.testBit k = n.testBit k := by + rw [Nat.getBi...
{ "repo": "CompPoly", "git_repo": "github.com/Verified-zkEVM/CompPoly", "revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062", "lean_toolchain": "leanprover/lean4:v4.31.0", "proof_assistant": "lean", "ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)", "ablator_flags": [ "--corollary-dele...
ablate_985f4a941772_2
e346b4c60b4fed41
lean
lean
github.com/Verified-zkEVM/CompPoly
e95ba1b1cac21ac3e980725abcfb2a0c707d1062
CompPoly/Multilinear/TransformEquiv.lean
TransformEquiv
2
lemma_delete
null
null
false
0.5
1
1
false
0
inf
0
inf
42
34
1
[ { "theorem_name": "mod_double_of_odd_div", "depth": 1, "n_commands": 0, "n_lines": 4, "is_leaf": true, "centrality": 0, "method": "deleted-dep", "proof_text": " by\n have := Nat.mod_lt m hd\n conv_lhs => rw [rewrite_odd m d hodd]\n rw [Nat.mul_add_mod, Nat.mod_eq_of_lt (by omega)]...
[ { "name": "rewrite_odd", "text": "/-- Decomposition for the case `(m / d) % 2 = 1`: express `m` via\n`(d * 2) * q + r` with `r = d + m % d`. Useful to read `m % (d * 2)`. -/\nprivate lemma rewrite_odd (m d : ℕ)\n (hodd : (m / d) % 2 = 1) :\n m = d * 2 * (m / d / 2) + (d + m % d) := by\n have hd := Na...
[ { "name": "mod_double_of_odd_div", "fan_in": 3, "n_deps_direct": 1, "n_deps_transitive": 1, "n_lines": 9, "n_chars": 319, "n_subproofs": 1, "n_tactics": 4, "cyclomatic": 1, "n_automation": 1, "n_rewrites": 2, "n_structural": 0, "automation_only": false, "max_n...
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, Natalie Klaus -/ import CompPoly.Multilinear.Basic /-! # Fast ↔ Spec equivalence for the multilinear zeta / Möbius transforms This file proves that the $O...
/- 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, Natalie Klaus -/ import CompPoly.Multilinear.Basic /-! # Fast ↔ Spec equivalence for the multilinear zeta / Möbius transforms This file proves that the $O...
@@ -57,10 +57,29 @@ if (i.val.popCount - j.val.popCount) % 2 = 0 then p.get j else -p.get j else 0 +/-- Decomposition for the case `(m / d) % 2 = 1`: express `m` via +`(d * 2) * q + r` with `r = d + m % d`. Useful to read `m % (d * 2)`. -/ +private lemma rewrite_odd (m d : ℕ) + (hodd : (m / d) % 2 = 1)...
{ "repo": "CompPoly", "git_repo": "github.com/Verified-zkEVM/CompPoly", "revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062", "lean_toolchain": "leanprover/lean4:v4.31.0", "proof_assistant": "lean", "ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)", "ablator_flags": [ "--corollary-dele...
ablate_985f4a941772_3
e560482b90181c89
lean
lean
github.com/Verified-zkEVM/CompPoly
e95ba1b1cac21ac3e980725abcfb2a0c707d1062
CompPoly/Multilinear/TransformEquiv.lean
TransformEquiv
3
lemma_delete
null
null
false
0.5
1
1
false
0
inf
0
inf
42
34
1
[ { "theorem_name": "mod_double_of_even_div", "depth": 1, "n_commands": 0, "n_lines": 4, "is_leaf": true, "centrality": 0, "method": "deleted-dep", "proof_text": " by\n have := Nat.mod_lt m hd\n conv_lhs => rw [rewrite_even m d heven]\n rw [Nat.mul_add_mod, Nat.mod_eq_of_lt (by omeg...
[ { "name": "rewrite_even", "text": "/-- Decomposition for the case `(m / d) % 2 = 0`: express `m` via\n`(d * 2) * q + r` with `r = m % d`. Useful to read `m % (d * 2)`. -/\nprivate lemma rewrite_even (m d : ℕ)\n (heven : (m / d) % 2 = 0) :\n m = d * 2 * (m / d / 2) + m % d := by\n have hd := Nat.div_a...
[ { "name": "mod_double_of_even_div", "fan_in": 3, "n_deps_direct": 1, "n_deps_transitive": 1, "n_lines": 9, "n_chars": 315, "n_subproofs": 1, "n_tactics": 4, "cyclomatic": 1, "n_automation": 1, "n_rewrites": 2, "n_structural": 0, "automation_only": false, "max_...
1
/- Copyright (c) 2025 CompPoly. All rights reserved. Released under Apache 2.0 license as described in the file LICENSE. Authors: Quang Dao, Chung Thai Nguyen, Natalie Klaus -/ import CompPoly.Multilinear.Basic /-! # Fast ↔ Spec equivalence for the multilinear zeta / Möbius transforms This file proves that the $O...
/- 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, Natalie Klaus -/ import CompPoly.Multilinear.Basic /-! # Fast ↔ Spec equivalence for the multilinear zeta / Möbius transforms This file proves that the $O...
@@ -57,10 +57,27 @@ if (i.val.popCount - j.val.popCount) % 2 = 0 then p.get j else -p.get j else 0 +/-- Decomposition for the case `(m / d) % 2 = 0`: express `m` via +`(d * 2) * q + r` with `r = m % d`. Useful to read `m % (d * 2)`. -/ +private lemma rewrite_even (m d : ℕ) + (heven : (m / d) % 2 = 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_985f4a941772_4
696854449500534c
lean
lean
github.com/Verified-zkEVM/CompPoly
e95ba1b1cac21ac3e980725abcfb2a0c707d1062
CompPoly/Multilinear/TransformEquiv.lean
TransformEquiv
4
lemma_delete
null
null
false
0.5
1
1
false
0
inf
0
inf
42
34
1
[ { "theorem_name": "mod_double_of_even_div", "depth": 1, "n_commands": 0, "n_lines": 4, "is_leaf": true, "centrality": 0, "method": "deleted-dep", "proof_text": " by\n have := Nat.mod_lt m hd\n conv_lhs => rw [rewrite_even m d heven]\n rw [Nat.mul_add_mod, Nat.mod_eq_of_lt (by omeg...
[ { "name": "rewrite_even", "text": "/-- Decomposition for the case `(m / d) % 2 = 0`: express `m` via\n`(d * 2) * q + r` with `r = m % d`. Useful to read `m % (d * 2)`. -/\nprivate lemma rewrite_even (m d : ℕ)\n (heven : (m / d) % 2 = 0) :\n m = d * 2 * (m / d / 2) + m % d := by\n have hd := Nat.div_a...
[ { "name": "mod_pow_succ_of_testBit_false", "fan_in": 1, "n_deps_direct": 2, "n_deps_transitive": 3, "n_lines": 9, "n_chars": 311, "n_subproofs": 0, "n_tactics": 5, "cyclomatic": 1, "n_automation": 0, "n_rewrites": 1, "n_structural": 1, "automation_only": false, ...
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, Natalie Klaus -/ import CompPoly.Multilinear.Basic /-! # Fast ↔ Spec equivalence for the multilinear zeta / Möbius transforms This file proves that the $O...
/- 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, Natalie Klaus -/ import CompPoly.Multilinear.Basic /-! # Fast ↔ Spec equivalence for the multilinear zeta / Möbius transforms This file proves that the $O...
@@ -67,10 +67,27 @@ Nat.mod_two_bne_zero, beq_eq_false_iff_ne, ne_eq] at h; omega +/-- Decomposition for the case `(m / d) % 2 = 0`: express `m` via +`(d * 2) * q + r` with `r = m % d`. Useful to read `m % (d * 2)`. -/ +private lemma rewrite_even (m d : ℕ) + (heven : (m / d) % 2 = 0) : + m = d * 2 * (...
{ "repo": "CompPoly", "git_repo": "github.com/Verified-zkEVM/CompPoly", "revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062", "lean_toolchain": "leanprover/lean4:v4.31.0", "proof_assistant": "lean", "ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)", "ablator_flags": [ "--corollary-dele...
ablate_985f4a941772_5
15b44c772cdbf742
lean
lean
github.com/Verified-zkEVM/CompPoly
e95ba1b1cac21ac3e980725abcfb2a0c707d1062
CompPoly/Multilinear/TransformEquiv.lean
TransformEquiv
5
lemma_delete
null
null
false
0.5
1
1
false
0
inf
0
inf
42
34
5
[ { "theorem_name": "mod_pow_succ_of_testBit_false", "depth": 1, "n_commands": 0, "n_lines": 4, "is_leaf": true, "centrality": 0, "method": "deleted-dep", "proof_text": " by\n rw [pow_succ]; exact mod_double_of_even_div m _\n (Nat.two_pow_pos k)\n (div_mod2_of_testBit_false hbit...
[ { "name": "div_mod2_of_testBit_false", "text": "/-- `(m / 2 ^ k) % 2 = 0` when bit `k` of `m` is clear. -/\nprivate lemma div_mod2_of_testBit_false {m k : ℕ}\n (h : m.testBit k = false) :\n (m / 2 ^ k) % 2 = 0 := by\n rw [Nat.testBit] at h\n simp only [Nat.shiftRight_eq_div_pow] at h\n simp only [N...
[ { "name": "mod_pow_succ_sub_of_testBit_true", "fan_in": 2, "n_deps_direct": 3, "n_deps_transitive": 4, "n_lines": 13, "n_chars": 496, "n_subproofs": 3, "n_tactics": 10, "cyclomatic": 1, "n_automation": 2, "n_rewrites": 1, "n_structural": 1, "automation_only": fals...
4
/- 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, Natalie Klaus -/ import CompPoly.Multilinear.Basic /-! # Fast ↔ Spec equivalence for the multilinear zeta / Möbius transforms This file proves that the $O...
/- 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, Natalie Klaus -/ import CompPoly.Multilinear.Basic /-! # Fast ↔ Spec equivalence for the multilinear zeta / Möbius transforms This file proves that the $O...
@@ -69,6 +69,16 @@ Nat.getBit_of_sub_two_pow_of_bit_1 hgb (j := k) simp at h; exact h +/-- `(m / 2 ^ k) % 2 = 0` when bit `k` of `m` is clear. -/ +private lemma div_mod2_of_testBit_false {m k : ℕ} + (h : m.testBit k = false) : + (m / 2 ^ k) % 2 = 0 := by + rw [Nat.testBit] at h + simp only [Nat.shiftR...
{ "repo": "CompPoly", "git_repo": "github.com/Verified-zkEVM/CompPoly", "revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062", "lean_toolchain": "leanprover/lean4:v4.31.0", "proof_assistant": "lean", "ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)", "ablator_flags": [ "--corollary-dele...
ablate_985f4a941772_6
3ef48bbfc0f27625
lean
lean
github.com/Verified-zkEVM/CompPoly
e95ba1b1cac21ac3e980725abcfb2a0c707d1062
CompPoly/Multilinear/TransformEquiv.lean
TransformEquiv
6
lemma_delete
null
null
false
0.5
1
1
false
0
inf
0
inf
42
34
1
[ { "theorem_name": "mod_double_of_odd_div", "depth": 1, "n_commands": 0, "n_lines": 4, "is_leaf": true, "centrality": 0, "method": "deleted-dep", "proof_text": " by\n have := Nat.mod_lt m hd\n conv_lhs => rw [rewrite_odd m d hodd]\n rw [Nat.mul_add_mod, Nat.mod_eq_of_lt (by omega)]...
[ { "name": "rewrite_odd", "text": "/-- Decomposition for the case `(m / d) % 2 = 1`: express `m` via\n`(d * 2) * q + r` with `r = d + m % d`. Useful to read `m % (d * 2)`. -/\nprivate lemma rewrite_odd (m d : ℕ)\n (hodd : (m / d) % 2 = 1) :\n m = d * 2 * (m / d / 2) + (d + m % d) := by\n have hd := Na...
[ { "name": "mod_succ_of_both_true", "fan_in": 1, "n_deps_direct": 2, "n_deps_transitive": 3, "n_lines": 14, "n_chars": 503, "n_subproofs": 0, "n_tactics": 6, "cyclomatic": 1, "n_automation": 0, "n_rewrites": 1, "n_structural": 0, "automation_only": false, "max_...
3
/- Copyright (c) 2025 CompPoly. All rights reserved. Released under Apache 2.0 license as described in the file LICENSE. Authors: Quang Dao, Chung Thai Nguyen, Natalie Klaus -/ import CompPoly.Multilinear.Basic /-! # Fast ↔ Spec equivalence for the multilinear zeta / Möbius transforms This file proves that the $O...
/- 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, Natalie Klaus -/ import CompPoly.Multilinear.Basic /-! # Fast ↔ Spec equivalence for the multilinear zeta / Möbius transforms This file proves that the $O...
@@ -66,10 +66,29 @@ simp only [Nat.one_and_eq_mod_two, Nat.mod_two_bne_zero, beq_iff_eq] at h; omega +/-- Decomposition for the case `(m / d) % 2 = 1`: express `m` via +`(d * 2) * q + r` with `r = d + m % d`. Useful to read `m % (d * 2)`. -/ +private lemma rewrite_odd (m d : ℕ) + (hodd : (m / d) % 2 = 1) :...
{ "repo": "CompPoly", "git_repo": "github.com/Verified-zkEVM/CompPoly", "revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062", "lean_toolchain": "leanprover/lean4:v4.31.0", "proof_assistant": "lean", "ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)", "ablator_flags": [ "--corollary-dele...
ablate_985f4a941772_7
931aa6f0085cf789
lean
lean
github.com/Verified-zkEVM/CompPoly
e95ba1b1cac21ac3e980725abcfb2a0c707d1062
CompPoly/Multilinear/TransformEquiv.lean
TransformEquiv
7
lemma_delete
null
null
false
0.5
1
1
false
0
inf
0
inf
42
34
1
[ { "theorem_name": "mod_double_of_odd_div", "depth": 1, "n_commands": 0, "n_lines": 4, "is_leaf": true, "centrality": 0, "method": "deleted-dep", "proof_text": " by\n have := Nat.mod_lt m hd\n conv_lhs => rw [rewrite_odd m d hodd]\n rw [Nat.mul_add_mod, Nat.mod_eq_of_lt (by omega)]...
[ { "name": "rewrite_odd", "text": "/-- Decomposition for the case `(m / d) % 2 = 1`: express `m` via\n`(d * 2) * q + r` with `r = d + m % d`. Useful to read `m % (d * 2)`. -/\nprivate lemma rewrite_odd (m d : ℕ)\n (hodd : (m / d) % 2 = 1) :\n m = d * 2 * (m / d / 2) + (d + m % d) := by\n have hd := Na...
[ { "name": "mod_succ_ne_of_diff", "fan_in": 1, "n_deps_direct": 4, "n_deps_transitive": 6, "n_lines": 14, "n_chars": 510, "n_subproofs": 1, "n_tactics": 8, "cyclomatic": 1, "n_automation": 1, "n_rewrites": 1, "n_structural": 0, "automation_only": false, "max_ne...
6
/- 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, Natalie Klaus -/ import CompPoly.Multilinear.Basic /-! # Fast ↔ Spec equivalence for the multilinear zeta / Möbius transforms This file proves that the $O...
/- 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, Natalie Klaus -/ import CompPoly.Multilinear.Basic /-! # Fast ↔ Spec equivalence for the multilinear zeta / Möbius transforms This file proves that the $O...
@@ -76,6 +76,22 @@ Nat.mod_two_bne_zero, beq_eq_false_iff_ne, ne_eq] at h; omega +/-- Decomposition for the case `(m / d) % 2 = 1`: express `m` via +`(d * 2) * q + r` with `r = d + m % d`. Useful to read `m % (d * 2)`. -/ +private lemma rewrite_odd (m d : ℕ) + (hodd : (m / d) % 2 = 1) : + m = d * 2 * ...
{ "repo": "CompPoly", "git_repo": "github.com/Verified-zkEVM/CompPoly", "revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062", "lean_toolchain": "leanprover/lean4:v4.31.0", "proof_assistant": "lean", "ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)", "ablator_flags": [ "--corollary-dele...
ablate_985f4a941772_8
750001ca1c7e4a9d
lean
lean
github.com/Verified-zkEVM/CompPoly
e95ba1b1cac21ac3e980725abcfb2a0c707d1062
CompPoly/Multilinear/TransformEquiv.lean
TransformEquiv
8
lemma_delete
null
null
false
0.5
1
1
false
0
inf
0
inf
42
34
3
[ { "theorem_name": "submask_sub_two_pow", "depth": 1, "n_commands": 0, "n_lines": 10, "is_leaf": true, "centrality": 0, "method": "deleted-dep", "proof_text": " by\n apply Nat.eq_of_testBit_eq; intro l\n rw [Nat.testBit_and]\n have hsub_tb : (m.testBit l && n.testBit l) =\n n....
[ { "name": "testBit_sub_ne", "text": "/-- Bits other than `k` are unchanged when subtracting `2 ^ k` from a number with bit `k` set. -/\nprivate lemma testBit_sub_ne {m k l : ℕ}\n (hbit : m.testBit k = true) (hl : l ≠ k) :\n (m - 2 ^ k).testBit l = m.testBit l := by\n apply testBit_eq_of_getBit_eq\n ...
[ { "name": "submask_sub_two_pow", "fan_in": 2, "n_deps_direct": 1, "n_deps_transitive": 2, "n_lines": 18, "n_chars": 610, "n_subproofs": 2, "n_tactics": 13, "cyclomatic": 1, "n_automation": 1, "n_rewrites": 4, "n_structural": 3, "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, Chung Thai Nguyen, Natalie Klaus -/ import CompPoly.Multilinear.Basic /-! # Fast ↔ Spec equivalence for the multilinear zeta / Möbius transforms This file proves that the $O...
/- 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, Natalie Klaus -/ import CompPoly.Multilinear.Basic /-! # Fast ↔ Spec equivalence for the multilinear zeta / Möbius transforms This file proves that the $O...
@@ -66,13 +66,34 @@ cases hm : m.testBit k <;> cases hn : n.testBit k <;> simp_all +/-- Bits other than `k` are unchanged when subtracting `2 ^ k` from a number with bit `k` set. -/ +private lemma testBit_sub_ne {m k l : ℕ} + (hbit : m.testBit k = true) (hl : l ≠ k) : + (m - 2 ^ k).testBit l = m.testBit...
{ "repo": "CompPoly", "git_repo": "github.com/Verified-zkEVM/CompPoly", "revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062", "lean_toolchain": "leanprover/lean4:v4.31.0", "proof_assistant": "lean", "ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)", "ablator_flags": [ "--corollary-dele...
ablate_985f4a941772_9
bfbdad787ea6b9c6
lean
lean
github.com/Verified-zkEVM/CompPoly
e95ba1b1cac21ac3e980725abcfb2a0c707d1062
CompPoly/Multilinear/TransformEquiv.lean
TransformEquiv
9
lemma_delete
null
null
false
0.5
1
1
false
0
inf
0
inf
42
34
2
[ { "theorem_name": "popCount_sub_two_pow", "depth": 1, "n_commands": 0, "n_lines": 46, "is_leaf": true, "centrality": 0, "method": "deleted-dep", "proof_text": " by\n induction k generalizing m with\n | zero =>\n have hm_pos : 0 < m := by\n by_contra h; push Not at h\n ...
[ { "name": "popCount_pos'", "text": "/-- Recursion for `Nat.popCount` on positive arguments: split off the least-significant bit. -/\nprivate lemma popCount_pos' {m : ℕ} (hm : 0 < m) :\n Nat.popCount m =\n m % 2 + Nat.popCount (m / 2) := by\n unfold Nat.popCount\n rw [Nat.digits_def' (by norm_num :...
[ { "name": "popCount_le_of_and_eq", "fan_in": 1, "n_deps_direct": 2, "n_deps_transitive": 2, "n_lines": 31, "n_chars": 1001, "n_subproofs": 6, "n_tactics": 33, "cyclomatic": 2, "n_automation": 9, "n_rewrites": 6, "n_structural": 6, "automation_only": false, "ma...
2
/- Copyright (c) 2025 CompPoly. All rights reserved. Released under Apache 2.0 license as described in the file LICENSE. Authors: Quang Dao, Chung Thai Nguyen, Natalie Klaus -/ import CompPoly.Multilinear.Basic /-! # Fast ↔ Spec equivalence for the multilinear zeta / Möbius transforms This file proves that the $O...
/- 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, Natalie Klaus -/ import CompPoly.Multilinear.Basic /-! # Fast ↔ Spec equivalence for the multilinear zeta / Möbius transforms This file proves that the $O...
@@ -62,6 +62,14 @@ Nat.popCount 0 = 0 := by unfold Nat.popCount; simp [Nat.digits] +/-- Recursion for `Nat.popCount` on positive arguments: split off the least-significant bit. -/ +private lemma popCount_pos' {m : ℕ} (hm : 0 < m) : + Nat.popCount m = + m % 2 + Nat.popCount (m / 2) := by + unfold 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_985f4a941772_10
1f738c4cb8e92d5b
lean
lean
github.com/Verified-zkEVM/CompPoly
e95ba1b1cac21ac3e980725abcfb2a0c707d1062
CompPoly/Multilinear/TransformEquiv.lean
TransformEquiv
10
lemma_delete
null
null
false
0.5
1
1
false
0
inf
0
inf
42
34
1
[ { "theorem_name": "mod_double_of_odd_div", "depth": 1, "n_commands": 0, "n_lines": 4, "is_leaf": true, "centrality": 0, "method": "deleted-dep", "proof_text": " by\n have := Nat.mod_lt m hd\n conv_lhs => rw [rewrite_odd m d hodd]\n rw [Nat.mul_add_mod, Nat.mod_eq_of_lt (by omega)]...
[ { "name": "rewrite_odd", "text": "/-- Decomposition for the case `(m / d) % 2 = 1`: express `m` via\n`(d * 2) * q + r` with `r = d + m % d`. Useful to read `m % (d * 2)`. -/\nprivate lemma rewrite_odd (m d : ℕ)\n (hodd : (m / d) % 2 = 1) :\n m = d * 2 * (m / d / 2) + (d + m % d) := by\n have hd := Na...
[ { "name": "mobiusPartial_step", "fan_in": 1, "n_deps_direct": 11, "n_deps_transitive": 21, "n_lines": 109, "n_chars": 4211, "n_subproofs": 19, "n_tactics": 104, "cyclomatic": 1, "n_automation": 29, "n_rewrites": 8, "n_structural": 10, "automation_only": false, ...
21
/- 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, Natalie Klaus -/ import CompPoly.Multilinear.Basic /-! # Fast ↔ Spec equivalence for the multilinear zeta / Möbius transforms This file proves that the $O...
/- 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, Natalie Klaus -/ import CompPoly.Multilinear.Basic /-! # Fast ↔ Spec equivalence for the multilinear zeta / Möbius transforms This file proves that the $O...
@@ -191,6 +191,22 @@ Nat.mod_two_bne_zero, beq_eq_false_iff_ne, ne_eq] at h; omega +/-- Decomposition for the case `(m / d) % 2 = 1`: express `m` via +`(d * 2) * q + r` with `r = d + m % d`. Useful to read `m % (d * 2)`. -/ +private lemma rewrite_odd (m d : ℕ) + (hodd : (m / d) % 2 = 1) : + m = d * 2 ...
{ "repo": "CompPoly", "git_repo": "github.com/Verified-zkEVM/CompPoly", "revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062", "lean_toolchain": "leanprover/lean4:v4.31.0", "proof_assistant": "lean", "ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)", "ablator_flags": [ "--corollary-dele...
ablate_985f4a941772_11
31b7f4cb5c247d04
lean
lean
github.com/Verified-zkEVM/CompPoly
e95ba1b1cac21ac3e980725abcfb2a0c707d1062
CompPoly/Multilinear/TransformEquiv.lean
TransformEquiv
11
lemma_delete
null
null
false
0.5
1
1
false
0
inf
0
inf
42
34
1
[ { "theorem_name": "mod_double_of_odd_div", "depth": 1, "n_commands": 0, "n_lines": 4, "is_leaf": true, "centrality": 0, "method": "deleted-dep", "proof_text": " by\n have := Nat.mod_lt m hd\n conv_lhs => rw [rewrite_odd m d hodd]\n rw [Nat.mul_add_mod, Nat.mod_eq_of_lt (by omega)]...
[ { "name": "rewrite_odd", "text": "/-- Decomposition for the case `(m / d) % 2 = 1`: express `m` via\n`(d * 2) * q + r` with `r = d + m % d`. Useful to read `m % (d * 2)`. -/\nprivate lemma rewrite_odd (m d : ℕ)\n (hodd : (m / d) % 2 = 1) :\n m = d * 2 * (m / d / 2) + (d + m % d) := by\n have hd := Na...
[ { "name": "lagrangeToMono_eq_mobiusPartial_zero", "fan_in": 1, "n_deps_direct": 2, "n_deps_transitive": 23, "n_lines": 53, "n_chars": 1898, "n_subproofs": 10, "n_tactics": 47, "cyclomatic": 2, "n_automation": 18, "n_rewrites": 4, "n_structural": 8, "automation_onl...
23
/- 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, Natalie Klaus -/ import CompPoly.Multilinear.Basic /-! # Fast ↔ Spec equivalence for the multilinear zeta / Möbius transforms This file proves that the $O...
/- 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, Natalie Klaus -/ import CompPoly.Multilinear.Basic /-! # Fast ↔ Spec equivalence for the multilinear zeta / Möbius transforms This file proves that the $O...
@@ -209,6 +209,22 @@ Nat.mod_two_bne_zero, beq_eq_false_iff_ne, ne_eq] at h; omega +/-- Decomposition for the case `(m / d) % 2 = 1`: express `m` via +`(d * 2) * q + r` with `r = d + m % d`. Useful to read `m % (d * 2)`. -/ +private lemma rewrite_odd (m d : ℕ) + (hodd : (m / d) % 2 = 1) : + m = d * 2 ...
{ "repo": "CompPoly", "git_repo": "github.com/Verified-zkEVM/CompPoly", "revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062", "lean_toolchain": "leanprover/lean4:v4.31.0", "proof_assistant": "lean", "ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)", "ablator_flags": [ "--corollary-dele...
ablate_985f4a941772_12
f6ffd58013442ee0
lean
lean
github.com/Verified-zkEVM/CompPoly
e95ba1b1cac21ac3e980725abcfb2a0c707d1062
CompPoly/Multilinear/TransformEquiv.lean
TransformEquiv
12
lemma_delete
null
null
false
0.5
1
1
false
0
inf
0
inf
42
34
1
[ { "theorem_name": "mod_double_of_even_div", "depth": 1, "n_commands": 0, "n_lines": 4, "is_leaf": true, "centrality": 0, "method": "deleted-dep", "proof_text": " by\n have := Nat.mod_lt m hd\n conv_lhs => rw [rewrite_even m d heven]\n rw [Nat.mul_add_mod, Nat.mod_eq_of_lt (by omeg...
[ { "name": "rewrite_even", "text": "/-- Decomposition for the case `(m / d) % 2 = 0`: express `m` via\n`(d * 2) * q + r` with `r = m % d`. Useful to read `m % (d * 2)`. -/\nprivate lemma rewrite_even (m d : ℕ)\n (heven : (m / d) % 2 = 0) :\n m = d * 2 * (m / d / 2) + m % d := by\n have hd := Nat.div_a...
[ { "name": "lagrangeToMono_eq_lagrangeToMonoSpec", "fan_in": 0, "n_deps_direct": 2, "n_deps_transitive": 25, "n_lines": 11, "n_chars": 450, "n_subproofs": 0, "n_tactics": 5, "cyclomatic": 1, "n_automation": 1, "n_rewrites": 1, "n_structural": 2, "automation_only": ...
25
/- 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, Natalie Klaus -/ import CompPoly.Multilinear.Basic /-! # Fast ↔ Spec equivalence for the multilinear zeta / Möbius transforms This file proves that the $O...
/- 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, Natalie Klaus -/ import CompPoly.Multilinear.Basic /-! # Fast ↔ Spec equivalence for the multilinear zeta / Möbius transforms This file proves that the $O...
@@ -231,6 +231,20 @@ congr 1; ring linarith +/-- Decomposition for the case `(m / d) % 2 = 0`: express `m` via +`(d * 2) * q + r` with `r = m % d`. Useful to read `m % (d * 2)`. -/ +private lemma rewrite_even (m d : ℕ) + (heven : (m / d) % 2 = 0) : + m = d * 2 * (m / d / 2) + m % d := by + have hd := N...
{ "repo": "CompPoly", "git_repo": "github.com/Verified-zkEVM/CompPoly", "revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062", "lean_toolchain": "leanprover/lean4:v4.31.0", "proof_assistant": "lean", "ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)", "ablator_flags": [ "--corollary-dele...
ablate_985f4a941772_13
2e5075022d75eea2
lean
lean
github.com/Verified-zkEVM/CompPoly
e95ba1b1cac21ac3e980725abcfb2a0c707d1062
CompPoly/Multilinear/TransformEquiv.lean
TransformEquiv
13
lemma_delete
null
null
false
0.5
1
1
false
0
inf
0
inf
42
34
5
[ { "theorem_name": "mod_pow_succ_of_testBit_false", "depth": 1, "n_commands": 0, "n_lines": 4, "is_leaf": true, "centrality": 0, "method": "deleted-dep", "proof_text": " by\n rw [pow_succ]; exact mod_double_of_even_div m _\n (Nat.two_pow_pos k)\n (div_mod2_of_testBit_false hbit...
[ { "name": "div_mod2_of_testBit_false", "text": "/-- `(m / 2 ^ k) % 2 = 0` when bit `k` of `m` is clear. -/\nprivate lemma div_mod2_of_testBit_false {m k : ℕ}\n (h : m.testBit k = false) :\n (m / 2 ^ k) % 2 = 0 := by\n rw [Nat.testBit] at h\n simp only [Nat.shiftRight_eq_div_pow] at h\n simp only [N...
[ { "name": "div_pow_succ_eq_of_both_false", "fan_in": 1, "n_deps_direct": 2, "n_deps_transitive": 2, "n_lines": 14, "n_chars": 747, "n_subproofs": 6, "n_tactics": 8, "cyclomatic": 1, "n_automation": 1, "n_rewrites": 0, "n_structural": 0, "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, Natalie Klaus -/ import CompPoly.Multilinear.Basic /-! # Fast ↔ Spec equivalence for the multilinear zeta / Möbius transforms This file proves that the $O...
/- 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, Natalie Klaus -/ import CompPoly.Multilinear.Basic /-! # Fast ↔ Spec equivalence for the multilinear zeta / Möbius transforms This file proves that the $O...
@@ -57,6 +57,16 @@ if (i.val.popCount - j.val.popCount) % 2 = 0 then p.get j else -p.get j else 0 +/-- `(m / 2 ^ k) % 2 = 0` when bit `k` of `m` is clear. -/ +private lemma div_mod2_of_testBit_false {m k : ℕ} + (h : m.testBit k = false) : + (m / 2 ^ k) % 2 = 0 := by + rw [Nat.testBit] at h + simp ...
{ "repo": "CompPoly", "git_repo": "github.com/Verified-zkEVM/CompPoly", "revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062", "lean_toolchain": "leanprover/lean4:v4.31.0", "proof_assistant": "lean", "ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)", "ablator_flags": [ "--corollary-dele...
ablate_985f4a941772_14
3593c1fe3c59336d
lean
lean
github.com/Verified-zkEVM/CompPoly
e95ba1b1cac21ac3e980725abcfb2a0c707d1062
CompPoly/Multilinear/TransformEquiv.lean
TransformEquiv
14
lemma_delete
null
null
false
0.5
1
1
false
0
inf
0
inf
42
34
5
[ { "theorem_name": "mod_succ_of_both_true", "depth": 1, "n_commands": 0, "n_lines": 6, "is_leaf": true, "centrality": 0, "method": "deleted-dep", "proof_text": " by\n rw [pow_succ,\n mod_double_of_odd_div m _ (Nat.two_pow_pos k)\n (div_mod2_of_testBit_true hm),\n mod_doubl...
[ { "name": "div_mod2_of_testBit_true", "text": "/-- `(m / 2 ^ k) % 2 = 1` when bit `k` of `m` is set. -/\nprivate lemma div_mod2_of_testBit_true {m k : ℕ}\n (h : m.testBit k = true) :\n (m / 2 ^ k) % 2 = 1 := by\n rw [Nat.testBit] at h\n simp only [Nat.shiftRight_eq_div_pow] at h\n simp only [Nat.on...
[ { "name": "div_pow_succ_eq_of_both_true", "fan_in": 1, "n_deps_direct": 2, "n_deps_transitive": 2, "n_lines": 14, "n_chars": 707, "n_subproofs": 6, "n_tactics": 8, "cyclomatic": 1, "n_automation": 1, "n_rewrites": 0, "n_structural": 0, "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, Natalie Klaus -/ import CompPoly.Multilinear.Basic /-! # Fast ↔ Spec equivalence for the multilinear zeta / Möbius transforms This file proves that the $O...
/- 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, Natalie Klaus -/ import CompPoly.Multilinear.Basic /-! # Fast ↔ Spec equivalence for the multilinear zeta / Möbius transforms This file proves that the $O...
@@ -57,6 +57,15 @@ if (i.val.popCount - j.val.popCount) % 2 = 0 then p.get j else -p.get j else 0 +/-- `(m / 2 ^ k) % 2 = 1` when bit `k` of `m` is set. -/ +private lemma div_mod2_of_testBit_true {m k : ℕ} + (h : m.testBit k = true) : + (m / 2 ^ k) % 2 = 1 := by + rw [Nat.testBit] at h + simp only...
{ "repo": "CompPoly", "git_repo": "github.com/Verified-zkEVM/CompPoly", "revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062", "lean_toolchain": "leanprover/lean4:v4.31.0", "proof_assistant": "lean", "ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)", "ablator_flags": [ "--corollary-dele...
ablate_985f4a941772_15
6ca4b081535b478e
lean
lean
github.com/Verified-zkEVM/CompPoly
e95ba1b1cac21ac3e980725abcfb2a0c707d1062
CompPoly/Multilinear/TransformEquiv.lean
TransformEquiv
15
lemma_delete
null
null
false
0.5
1
1
false
0
inf
0
inf
42
34
5
[ { "theorem_name": "mod_pow_succ_of_testBit_false", "depth": 1, "n_commands": 0, "n_lines": 4, "is_leaf": true, "centrality": 0, "method": "deleted-dep", "proof_text": " by\n rw [pow_succ]; exact mod_double_of_even_div m _\n (Nat.two_pow_pos k)\n (div_mod2_of_testBit_false hbit...
[ { "name": "div_mod2_of_testBit_false", "text": "/-- `(m / 2 ^ k) % 2 = 0` when bit `k` of `m` is clear. -/\nprivate lemma div_mod2_of_testBit_false {m k : ℕ}\n (h : m.testBit k = false) :\n (m / 2 ^ k) % 2 = 0 := by\n rw [Nat.testBit] at h\n simp only [Nat.shiftRight_eq_div_pow] at h\n simp only [N...
[ { "name": "div_pow_ne_of_diff", "fan_in": 1, "n_deps_direct": 2, "n_deps_transitive": 2, "n_lines": 10, "n_chars": 471, "n_subproofs": 2, "n_tactics": 6, "cyclomatic": 1, "n_automation": 1, "n_rewrites": 1, "n_structural": 1, "automation_only": false, "max_nes...
2
/- Copyright (c) 2025 CompPoly. All rights reserved. Released under Apache 2.0 license as described in the file LICENSE. Authors: Quang Dao, Chung Thai Nguyen, Natalie Klaus -/ import CompPoly.Multilinear.Basic /-! # Fast ↔ Spec equivalence for the multilinear zeta / Möbius transforms This file proves that the $O...
/- 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, Natalie Klaus -/ import CompPoly.Multilinear.Basic /-! # Fast ↔ Spec equivalence for the multilinear zeta / Möbius transforms This file proves that the $O...
@@ -66,6 +66,16 @@ simp only [Nat.one_and_eq_mod_two, Nat.mod_two_bne_zero, beq_iff_eq] at h; omega +/-- `(m / 2 ^ k) % 2 = 0` when bit `k` of `m` is clear. -/ +private lemma div_mod2_of_testBit_false {m k : ℕ} + (h : m.testBit k = false) : + (m / 2 ^ k) % 2 = 0 := by + rw [Nat.testBit] at h + simp on...
{ "repo": "CompPoly", "git_repo": "github.com/Verified-zkEVM/CompPoly", "revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062", "lean_toolchain": "leanprover/lean4:v4.31.0", "proof_assistant": "lean", "ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)", "ablator_flags": [ "--corollary-dele...
ablate_985f4a941772_16
108001f060bb3b56
lean
lean
github.com/Verified-zkEVM/CompPoly
e95ba1b1cac21ac3e980725abcfb2a0c707d1062
CompPoly/Multilinear/TransformEquiv.lean
TransformEquiv
16
lemma_delete
null
null
false
0.5
1
1
false
0
inf
0
inf
42
34
1
[ { "theorem_name": "mod_double_of_even_div", "depth": 1, "n_commands": 0, "n_lines": 4, "is_leaf": true, "centrality": 0, "method": "deleted-dep", "proof_text": " by\n have := Nat.mod_lt m hd\n conv_lhs => rw [rewrite_even m d heven]\n rw [Nat.mul_add_mod, Nat.mod_eq_of_lt (by omeg...
[ { "name": "rewrite_even", "text": "/-- Decomposition for the case `(m / d) % 2 = 0`: express `m` via\n`(d * 2) * q + r` with `r = m % d`. Useful to read `m % (d * 2)`. -/\nprivate lemma rewrite_even (m d : ℕ)\n (heven : (m / d) % 2 = 0) :\n m = d * 2 * (m / d / 2) + m % d := by\n have hd := Nat.div_a...
[ { "name": "div_pow_succ_sub_of_testBit_true", "fan_in": 1, "n_deps_direct": 3, "n_deps_transitive": 8, "n_lines": 21, "n_chars": 953, "n_subproofs": 8, "n_tactics": 15, "cyclomatic": 1, "n_automation": 1, "n_rewrites": 0, "n_structural": 1, "automation_only": fals...
8
/- 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, Natalie Klaus -/ import CompPoly.Multilinear.Basic /-! # Fast ↔ Spec equivalence for the multilinear zeta / Möbius transforms This file proves that the $O...
/- 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, Natalie Klaus -/ import CompPoly.Multilinear.Basic /-! # Fast ↔ Spec equivalence for the multilinear zeta / Möbius transforms This file proves that the $O...
@@ -104,6 +104,20 @@ congr 1; ring linarith +/-- Decomposition for the case `(m / d) % 2 = 0`: express `m` via +`(d * 2) * q + r` with `r = m % d`. Useful to read `m % (d * 2)`. -/ +private lemma rewrite_even (m d : ℕ) + (heven : (m / d) % 2 = 0) : + m = d * 2 * (m / d / 2) + m % d := by + have hd := N...
{ "repo": "CompPoly", "git_repo": "github.com/Verified-zkEVM/CompPoly", "revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062", "lean_toolchain": "leanprover/lean4:v4.31.0", "proof_assistant": "lean", "ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)", "ablator_flags": [ "--corollary-dele...
ablate_985f4a941772_17
1e961f5ed7f712ac
lean
lean
github.com/Verified-zkEVM/CompPoly
e95ba1b1cac21ac3e980725abcfb2a0c707d1062
CompPoly/Multilinear/TransformEquiv.lean
TransformEquiv
17
lemma_delete
null
null
false
0.5
1
1
false
0
inf
0
inf
42
34
3
[ { "theorem_name": "mod_succ_of_both_true", "depth": 1, "n_commands": 0, "n_lines": 6, "is_leaf": true, "centrality": 0, "method": "deleted-dep", "proof_text": " by\n rw [pow_succ,\n mod_double_of_odd_div m _ (Nat.two_pow_pos k)\n (div_mod2_of_testBit_true hm),\n mod_doubl...
[ { "name": "mod_double_of_odd_div", "text": "/-- When `(m / d) % 2 = 1`, the value of `m % (d * 2)` is `d + m % d`. -/\nprivate lemma mod_double_of_odd_div (m d : ℕ)\n (hd : 0 < d) (hodd : (m / d) % 2 = 1) :\n m % (d * 2) = d + m % d := by\n have := Nat.mod_lt m hd\n conv_lhs => rw [rewrite_odd m d h...
[ { "name": "zetaPartial_step", "fan_in": 1, "n_deps_direct": 8, "n_deps_transitive": 17, "n_lines": 79, "n_chars": 3569, "n_subproofs": 18, "n_tactics": 78, "cyclomatic": 1, "n_automation": 22, "n_rewrites": 8, "n_structural": 14, "automation_only": false, "max...
17
/- 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, Natalie Klaus -/ import CompPoly.Multilinear.Basic /-! # Fast ↔ Spec equivalence for the multilinear zeta / Möbius transforms This file proves that the $O...
/- 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, Natalie Klaus -/ import CompPoly.Multilinear.Basic /-! # Fast ↔ Spec equivalence for the multilinear zeta / Möbius transforms This file proves that the $O...
@@ -151,6 +151,14 @@ ring linarith +/-- When `(m / d) % 2 = 1`, the value of `m % (d * 2)` is `d + m % d`. -/ +private lemma mod_double_of_odd_div (m d : ℕ) + (hd : 0 < d) (hodd : (m / d) % 2 = 1) : + m % (d * 2) = d + m % d := by + have := Nat.mod_lt m hd + conv_lhs => rw [rewrite_odd m d hodd] + rw...
{ "repo": "CompPoly", "git_repo": "github.com/Verified-zkEVM/CompPoly", "revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062", "lean_toolchain": "leanprover/lean4:v4.31.0", "proof_assistant": "lean", "ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)", "ablator_flags": [ "--corollary-dele...
ablate_985f4a941772_18
c933578887527a11
lean
lean
github.com/Verified-zkEVM/CompPoly
e95ba1b1cac21ac3e980725abcfb2a0c707d1062
CompPoly/Multilinear/TransformEquiv.lean
TransformEquiv
18
lemma_delete
null
null
false
0.5
1
1
false
0
inf
0
inf
42
34
3
[ { "theorem_name": "mod_succ_of_both_true", "depth": 1, "n_commands": 0, "n_lines": 6, "is_leaf": true, "centrality": 0, "method": "deleted-dep", "proof_text": " by\n rw [pow_succ,\n mod_double_of_odd_div m _ (Nat.two_pow_pos k)\n (div_mod2_of_testBit_true hm),\n mod_doubl...
[ { "name": "mod_double_of_odd_div", "text": "/-- When `(m / d) % 2 = 1`, the value of `m % (d * 2)` is `d + m % d`. -/\nprivate lemma mod_double_of_odd_div (m d : ℕ)\n (hd : 0 < d) (hodd : (m / d) % 2 = 1) :\n m % (d * 2) = d + m % d := by\n have := Nat.mod_lt m hd\n conv_lhs => rw [rewrite_odd m d h...
[ { "name": "monoToLagrange_eq_zetaPartial_n", "fan_in": 1, "n_deps_direct": 2, "n_deps_transitive": 19, "n_lines": 42, "n_chars": 1612, "n_subproofs": 9, "n_tactics": 36, "cyclomatic": 2, "n_automation": 8, "n_rewrites": 5, "n_structural": 8, "automation_only": fal...
19
/- 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, Natalie Klaus -/ import CompPoly.Multilinear.Basic /-! # Fast ↔ Spec equivalence for the multilinear zeta / Möbius transforms This file proves that the $O...
/- 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, Natalie Klaus -/ import CompPoly.Multilinear.Basic /-! # Fast ↔ Spec equivalence for the multilinear zeta / Möbius transforms This file proves that the $O...
@@ -151,6 +151,14 @@ ring linarith +/-- When `(m / d) % 2 = 1`, the value of `m % (d * 2)` is `d + m % d`. -/ +private lemma mod_double_of_odd_div (m d : ℕ) + (hd : 0 < d) (hodd : (m / d) % 2 = 1) : + m % (d * 2) = d + m % d := by + have := Nat.mod_lt m hd + conv_lhs => rw [rewrite_odd m d hodd] + rw...
{ "repo": "CompPoly", "git_repo": "github.com/Verified-zkEVM/CompPoly", "revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062", "lean_toolchain": "leanprover/lean4:v4.31.0", "proof_assistant": "lean", "ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)", "ablator_flags": [ "--corollary-dele...
ablate_985f4a941772_19
889b76d567acb62a
lean
lean
github.com/Verified-zkEVM/CompPoly
e95ba1b1cac21ac3e980725abcfb2a0c707d1062
CompPoly/Multilinear/TransformEquiv.lean
TransformEquiv
19
lemma_delete
null
null
false
0.5
1
1
false
0
inf
0
inf
42
34
3
[ { "theorem_name": "mod_pow_succ_of_testBit_false", "depth": 1, "n_commands": 0, "n_lines": 4, "is_leaf": true, "centrality": 0, "method": "deleted-dep", "proof_text": " by\n rw [pow_succ]; exact mod_double_of_even_div m _\n (Nat.two_pow_pos k)\n (div_mod2_of_testBit_false hbit...
[ { "name": "mod_double_of_even_div", "text": "/-- When `(m / d) % 2 = 0`, the value of `m % (d * 2)` is `m % d`. -/\nprivate lemma mod_double_of_even_div (m d : ℕ)\n (hd : 0 < d) (heven : (m / d) % 2 = 0) :\n m % (d * 2) = m % d := by\n have := Nat.mod_lt m hd\n conv_lhs => rw [rewrite_even m d heven...
[ { "name": "monoToLagrange_eq_monoToLagrangeSpec", "fan_in": 0, "n_deps_direct": 2, "n_deps_transitive": 21, "n_lines": 11, "n_chars": 407, "n_subproofs": 0, "n_tactics": 5, "cyclomatic": 1, "n_automation": 1, "n_rewrites": 1, "n_structural": 2, "automation_only": ...
21
/- 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, Natalie Klaus -/ import CompPoly.Multilinear.Basic /-! # Fast ↔ Spec equivalence for the multilinear zeta / Möbius transforms This file proves that the $O...
/- 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, Natalie Klaus -/ import CompPoly.Multilinear.Basic /-! # Fast ↔ Spec equivalence for the multilinear zeta / Möbius transforms This file proves that the $O...
@@ -159,10 +159,25 @@ conv_lhs => rw [rewrite_odd m d hodd] rw [Nat.mul_add_mod, Nat.mod_eq_of_lt (by omega)] +/-- When `(m / d) % 2 = 0`, the value of `m % (d * 2)` is `m % d`. -/ +private lemma mod_double_of_even_div (m d : ℕ) + (hd : 0 < d) (heven : (m / d) % 2 = 0) : + m % (d * 2) = m % d := by + hav...
{ "repo": "CompPoly", "git_repo": "github.com/Verified-zkEVM/CompPoly", "revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062", "lean_toolchain": "leanprover/lean4:v4.31.0", "proof_assistant": "lean", "ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)", "ablator_flags": [ "--corollary-dele...
ablate_a42256f017f7_0
081fb79b8dd7953c
lean
lean
github.com/Verified-zkEVM/CompPoly
e95ba1b1cac21ac3e980725abcfb2a0c707d1062
CompPoly/Univariate/Deriv.lean
Deriv
0
lemma_delete
null
null
false
0.5
1
1
false
0
inf
0
inf
42
3
5
[ { "theorem_name": "derivative_zero", "depth": 1, "n_commands": 0, "n_lines": 5, "is_leaf": true, "centrality": 0, "method": "deleted-dep", "proof_text": " by\n rw [eq_zero_iff_coeff_zero]\n intro i\n rw [coeff_derivative, CPolynomial.coeff_zero]\n simp", "n_chars": 98, "n...
[ { "name": "coeff_derivative", "text": "/-- Coefficient formula for the derivative. -/\ntheorem coeff_derivative [Semiring R] [BEq R] [LawfulBEq R]\n (p : CPolynomial R) (n : ℕ) :\n coeff (derivative p) n = coeff p (n + 1) * (↑(n + 1) : R) := by\n simp only [derivative, coeff, Raw.Trim.coeff_eq_coeff,...
[ { "name": "derivative_zero", "fan_in": 0, "n_deps_direct": 1, "n_deps_transitive": 1, "n_lines": 9, "n_chars": 256, "n_subproofs": 0, "n_tactics": 5, "cyclomatic": 1, "n_automation": 1, "n_rewrites": 2, "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: Dimitris Mitsios -/ import CompPoly.Univariate.Basic import CompPoly.Univariate.ToPoly.Impl import Mathlib.Algebra.Polynomial.Taylor /-! # Formal Derivative and Taylor Shift of Computable ...
/- Copyright (c) 2025 CompPoly. All rights reserved. Released under Apache 2.0 license as described in the file LICENSE. Authors: Dimitris Mitsios -/ import CompPoly.Univariate.Basic import CompPoly.Univariate.ToPoly.Impl import Mathlib.Algebra.Polynomial.Taylor /-! # Formal Derivative and Taylor Shift of Computable ...
@@ -28,9 +28,32 @@ fun i c => c * (Nat.cast (i + 1) : R) ⟨(Raw.mk arr).trim, Raw.Trim.isCanonical_trim _⟩ +/-- Coefficient formula for the derivative. -/ +theorem coeff_derivative [Semiring R] [BEq R] [LawfulBEq R] + (p : CPolynomial R) (n : ℕ) : + coeff (derivative p) n = coeff p (n + 1) * (↑(n + 1) ...
{ "repo": "CompPoly", "git_repo": "github.com/Verified-zkEVM/CompPoly", "revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062", "lean_toolchain": "leanprover/lean4:v4.31.0", "proof_assistant": "lean", "ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)", "ablator_flags": [ "--corollary-dele...
ablate_a42256f017f7_1
0a765467a494340e
lean
lean
github.com/Verified-zkEVM/CompPoly
e95ba1b1cac21ac3e980725abcfb2a0c707d1062
CompPoly/Univariate/Deriv.lean
Deriv
1
lemma_delete
null
null
false
0.5
1
1
false
0
inf
0
inf
42
3
5
[ { "theorem_name": "derivative_zero", "depth": 1, "n_commands": 0, "n_lines": 5, "is_leaf": true, "centrality": 0, "method": "deleted-dep", "proof_text": " by\n rw [eq_zero_iff_coeff_zero]\n intro i\n rw [coeff_derivative, CPolynomial.coeff_zero]\n simp", "n_chars": 98, "n...
[ { "name": "coeff_derivative", "text": "/-- Coefficient formula for the derivative. -/\ntheorem coeff_derivative [Semiring R] [BEq R] [LawfulBEq R]\n (p : CPolynomial R) (n : ℕ) :\n coeff (derivative p) n = coeff p (n + 1) * (↑(n + 1) : R) := by\n simp only [derivative, coeff, Raw.Trim.coeff_eq_coeff,...
[ { "name": "derivative_C", "fan_in": 0, "n_deps_direct": 1, "n_deps_transitive": 1, "n_lines": 9, "n_chars": 235, "n_subproofs": 0, "n_tactics": 5, "cyclomatic": 1, "n_automation": 1, "n_rewrites": 2, "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: Dimitris Mitsios -/ import CompPoly.Univariate.Basic import CompPoly.Univariate.ToPoly.Impl import Mathlib.Algebra.Polynomial.Taylor /-! # Formal Derivative and Taylor Shift of Computable ...
/- Copyright (c) 2025 CompPoly. All rights reserved. Released under Apache 2.0 license as described in the file LICENSE. Authors: Dimitris Mitsios -/ import CompPoly.Univariate.Basic import CompPoly.Univariate.ToPoly.Impl import Mathlib.Algebra.Polynomial.Taylor /-! # Formal Derivative and Taylor Shift of Computable ...
@@ -28,9 +28,32 @@ fun i c => c * (Nat.cast (i + 1) : R) ⟨(Raw.mk arr).trim, Raw.Trim.isCanonical_trim _⟩ +/-- Coefficient formula for the derivative. -/ +theorem coeff_derivative [Semiring R] [BEq R] [LawfulBEq R] + (p : CPolynomial R) (n : ℕ) : + coeff (derivative p) n = coeff p (n + 1) * (↑(n + 1) ...
{ "repo": "CompPoly", "git_repo": "github.com/Verified-zkEVM/CompPoly", "revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062", "lean_toolchain": "leanprover/lean4:v4.31.0", "proof_assistant": "lean", "ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)", "ablator_flags": [ "--corollary-dele...
ablate_a42256f017f7_2
b1faeecbcd3491cd
lean
lean
github.com/Verified-zkEVM/CompPoly
e95ba1b1cac21ac3e980725abcfb2a0c707d1062
CompPoly/Univariate/Deriv.lean
Deriv
2
lemma_delete
null
null
false
0.5
1
1
false
0
inf
0
inf
42
3
5
[ { "theorem_name": "derivative_zero", "depth": 1, "n_commands": 0, "n_lines": 5, "is_leaf": true, "centrality": 0, "method": "deleted-dep", "proof_text": " by\n rw [eq_zero_iff_coeff_zero]\n intro i\n rw [coeff_derivative, CPolynomial.coeff_zero]\n simp", "n_chars": 98, "n...
[ { "name": "coeff_derivative", "text": "/-- Coefficient formula for the derivative. -/\ntheorem coeff_derivative [Semiring R] [BEq R] [LawfulBEq R]\n (p : CPolynomial R) (n : ℕ) :\n coeff (derivative p) n = coeff p (n + 1) * (↑(n + 1) : R) := by\n simp only [derivative, coeff, Raw.Trim.coeff_eq_coeff,...
[ { "name": "derivative_monomial", "fan_in": 0, "n_deps_direct": 1, "n_deps_transitive": 1, "n_lines": 14, "n_chars": 387, "n_subproofs": 1, "n_tactics": 9, "cyclomatic": 2, "n_automation": 4, "n_rewrites": 2, "n_structural": 1, "automation_only": false, "max_ne...
1
/- Copyright (c) 2025 CompPoly. All rights reserved. Released under Apache 2.0 license as described in the file LICENSE. Authors: Dimitris Mitsios -/ import CompPoly.Univariate.Basic import CompPoly.Univariate.ToPoly.Impl import Mathlib.Algebra.Polynomial.Taylor /-! # Formal Derivative and Taylor Shift of Computable ...
/- Copyright (c) 2025 CompPoly. All rights reserved. Released under Apache 2.0 license as described in the file LICENSE. Authors: Dimitris Mitsios -/ import CompPoly.Univariate.Basic import CompPoly.Univariate.ToPoly.Impl import Mathlib.Algebra.Polynomial.Taylor /-! # Formal Derivative and Taylor Shift of Computable ...
@@ -28,11 +28,37 @@ fun i c => c * (Nat.cast (i + 1) : R) ⟨(Raw.mk arr).trim, Raw.Trim.isCanonical_trim _⟩ +/-- Coefficient formula for the derivative. -/ +theorem coeff_derivative [Semiring R] [BEq R] [LawfulBEq R] + (p : CPolynomial R) (n : ℕ) : + coeff (derivative p) n = coeff p (n + 1) * (↑(n + 1)...
{ "repo": "CompPoly", "git_repo": "github.com/Verified-zkEVM/CompPoly", "revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062", "lean_toolchain": "leanprover/lean4:v4.31.0", "proof_assistant": "lean", "ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)", "ablator_flags": [ "--corollary-dele...
ablate_a42256f017f7_3
2c5a09c7a0da134e
lean
lean
github.com/Verified-zkEVM/CompPoly
e95ba1b1cac21ac3e980725abcfb2a0c707d1062
CompPoly/Univariate/Deriv.lean
Deriv
3
lemma_delete
null
null
false
0.5
1
1
false
0
inf
0
inf
42
3
5
[ { "theorem_name": "derivative_zero", "depth": 1, "n_commands": 0, "n_lines": 5, "is_leaf": true, "centrality": 0, "method": "deleted-dep", "proof_text": " by\n rw [eq_zero_iff_coeff_zero]\n intro i\n rw [coeff_derivative, CPolynomial.coeff_zero]\n simp", "n_chars": 98, "n...
[ { "name": "coeff_derivative", "text": "/-- Coefficient formula for the derivative. -/\ntheorem coeff_derivative [Semiring R] [BEq R] [LawfulBEq R]\n (p : CPolynomial R) (n : ℕ) :\n coeff (derivative p) n = coeff p (n + 1) * (↑(n + 1) : R) := by\n simp only [derivative, coeff, Raw.Trim.coeff_eq_coeff,...
[ { "name": "derivative_add", "fan_in": 0, "n_deps_direct": 1, "n_deps_transitive": 1, "n_lines": 10, "n_chars": 311, "n_subproofs": 0, "n_tactics": 5, "cyclomatic": 1, "n_automation": 1, "n_rewrites": 1, "n_structural": 2, "automation_only": false, "max_nesting...
1
/- Copyright (c) 2025 CompPoly. All rights reserved. Released under Apache 2.0 license as described in the file LICENSE. Authors: Dimitris Mitsios -/ import CompPoly.Univariate.Basic import CompPoly.Univariate.ToPoly.Impl import Mathlib.Algebra.Polynomial.Taylor /-! # Formal Derivative and Taylor Shift of Computable ...
/- Copyright (c) 2025 CompPoly. All rights reserved. Released under Apache 2.0 license as described in the file LICENSE. Authors: Dimitris Mitsios -/ import CompPoly.Univariate.Basic import CompPoly.Univariate.ToPoly.Impl import Mathlib.Algebra.Polynomial.Taylor /-! # Formal Derivative and Taylor Shift of Computable ...
@@ -28,10 +28,33 @@ fun i c => c * (Nat.cast (i + 1) : R) ⟨(Raw.mk arr).trim, Raw.Trim.isCanonical_trim _⟩ +/-- Coefficient formula for the derivative. -/ +theorem coeff_derivative [Semiring R] [BEq R] [LawfulBEq R] + (p : CPolynomial R) (n : ℕ) : + coeff (derivative p) n = coeff p (n + 1) * (↑(n + 1)...
{ "repo": "CompPoly", "git_repo": "github.com/Verified-zkEVM/CompPoly", "revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062", "lean_toolchain": "leanprover/lean4:v4.31.0", "proof_assistant": "lean", "ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)", "ablator_flags": [ "--corollary-dele...
ablate_a42256f017f7_4
8e5796c639d76305
lean
lean
github.com/Verified-zkEVM/CompPoly
e95ba1b1cac21ac3e980725abcfb2a0c707d1062
CompPoly/Univariate/Deriv.lean
Deriv
4
lemma_delete
null
null
false
0.5
1
1
false
0
inf
0
inf
42
3
5
[ { "theorem_name": "derivative_zero", "depth": 1, "n_commands": 0, "n_lines": 5, "is_leaf": true, "centrality": 0, "method": "deleted-dep", "proof_text": " by\n rw [eq_zero_iff_coeff_zero]\n intro i\n rw [coeff_derivative, CPolynomial.coeff_zero]\n simp", "n_chars": 98, "n...
[ { "name": "coeff_derivative", "text": "/-- Coefficient formula for the derivative. -/\ntheorem coeff_derivative [Semiring R] [BEq R] [LawfulBEq R]\n (p : CPolynomial R) (n : ℕ) :\n coeff (derivative p) n = coeff p (n + 1) * (↑(n + 1) : R) := by\n simp only [derivative, coeff, Raw.Trim.coeff_eq_coeff,...
[ { "name": "derivative_toPoly", "fan_in": 1, "n_deps_direct": 1, "n_deps_transitive": 1, "n_lines": 10, "n_chars": 417, "n_subproofs": 0, "n_tactics": 7, "cyclomatic": 1, "n_automation": 2, "n_rewrites": 1, "n_structural": 2, "automation_only": false, "max_nest...
1
/- Copyright (c) 2025 CompPoly. All rights reserved. Released under Apache 2.0 license as described in the file LICENSE. Authors: Dimitris Mitsios -/ import CompPoly.Univariate.Basic import CompPoly.Univariate.ToPoly.Impl import Mathlib.Algebra.Polynomial.Taylor /-! # Formal Derivative and Taylor Shift of Computable ...
/- Copyright (c) 2025 CompPoly. All rights reserved. Released under Apache 2.0 license as described in the file LICENSE. Authors: Dimitris Mitsios -/ import CompPoly.Univariate.Basic import CompPoly.Univariate.ToPoly.Impl import Mathlib.Algebra.Polynomial.Taylor /-! # Formal Derivative and Taylor Shift of Computable ...
@@ -28,9 +28,33 @@ fun i c => c * (Nat.cast (i + 1) : R) ⟨(Raw.mk arr).trim, Raw.Trim.isCanonical_trim _⟩ +/-- Coefficient formula for the derivative. -/ +theorem coeff_derivative [Semiring R] [BEq R] [LawfulBEq R] + (p : CPolynomial R) (n : ℕ) : + coeff (derivative p) n = coeff p (n + 1) * (↑(n + 1) ...
{ "repo": "CompPoly", "git_repo": "github.com/Verified-zkEVM/CompPoly", "revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062", "lean_toolchain": "leanprover/lean4:v4.31.0", "proof_assistant": "lean", "ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)", "ablator_flags": [ "--corollary-dele...
ablate_a42256f017f7_5
3ca095e00e6def52
lean
lean
github.com/Verified-zkEVM/CompPoly
e95ba1b1cac21ac3e980725abcfb2a0c707d1062
CompPoly/Univariate/Deriv.lean
Deriv
5
lemma_delete
null
null
false
0.5
1
1
false
0
inf
0
inf
42
3
5
[ { "theorem_name": "derivative_zero", "depth": 1, "n_commands": 0, "n_lines": 5, "is_leaf": true, "centrality": 0, "method": "deleted-dep", "proof_text": " by\n rw [eq_zero_iff_coeff_zero]\n intro i\n rw [coeff_derivative, CPolynomial.coeff_zero]\n simp", "n_chars": 98, "n...
[ { "name": "coeff_derivative", "text": "/-- Coefficient formula for the derivative. -/\ntheorem coeff_derivative [Semiring R] [BEq R] [LawfulBEq R]\n (p : CPolynomial R) (n : ℕ) :\n coeff (derivative p) n = coeff p (n + 1) * (↑(n + 1) : R) := by\n simp only [derivative, coeff, Raw.Trim.coeff_eq_coeff,...
[ { "name": "derivative_mul", "fan_in": 0, "n_deps_direct": 1, "n_deps_transitive": 2, "n_lines": 9, "n_chars": 477, "n_subproofs": 0, "n_tactics": 5, "cyclomatic": 1, "n_automation": 0, "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: Dimitris Mitsios -/ import CompPoly.Univariate.Basic import CompPoly.Univariate.ToPoly.Impl import Mathlib.Algebra.Polynomial.Taylor /-! # Formal Derivative and Taylor Shift of Computable ...
/- Copyright (c) 2025 CompPoly. All rights reserved. Released under Apache 2.0 license as described in the file LICENSE. Authors: Dimitris Mitsios -/ import CompPoly.Univariate.Basic import CompPoly.Univariate.ToPoly.Impl import Mathlib.Algebra.Polynomial.Taylor /-! # Formal Derivative and Taylor Shift of Computable ...
@@ -28,9 +28,33 @@ fun i c => c * (Nat.cast (i + 1) : R) ⟨(Raw.mk arr).trim, Raw.Trim.isCanonical_trim _⟩ +/-- Coefficient formula for the derivative. -/ +theorem coeff_derivative [Semiring R] [BEq R] [LawfulBEq R] + (p : CPolynomial R) (n : ℕ) : + coeff (derivative p) n = coeff p (n + 1) * (↑(n + 1) ...
{ "repo": "CompPoly", "git_repo": "github.com/Verified-zkEVM/CompPoly", "revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062", "lean_toolchain": "leanprover/lean4:v4.31.0", "proof_assistant": "lean", "ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)", "ablator_flags": [ "--corollary-dele...
ablate_a42256f017f7_6
dfd9770c02d5082f
lean
lean
github.com/Verified-zkEVM/CompPoly
e95ba1b1cac21ac3e980725abcfb2a0c707d1062
CompPoly/Univariate/Deriv.lean
Deriv
6
lemma_delete
null
null
false
0.5
1
1
false
0
inf
0
inf
42
3
1
[ { "theorem_name": "taylor_coeff_zero", "depth": 1, "n_commands": 0, "n_lines": 2, "is_leaf": true, "centrality": 0, "method": "deleted-dep", "proof_text": " by\n rw [coeff_toPoly, taylor_toPoly, Polynomial.taylor_coeff_zero, eval_toPoly]", "n_chars": 81, "n_subproofs": 0, ...
[ { "name": "taylor_toPoly", "text": "/-- The computable Taylor shift matches `Polynomial.taylor` under `toPoly`. -/\ntheorem taylor_toPoly [Semiring R] [BEq R] [LawfulBEq R] [Nontrivial R] [DecidableEq R]\n (a : R) (p : CPolynomial R) :\n (taylor a p).toPoly = Polynomial.taylor a p.toPoly := by\n unfo...
[ { "name": "taylor_coeff_zero", "fan_in": 0, "n_deps_direct": 1, "n_deps_transitive": 1, "n_lines": 6, "n_chars": 329, "n_subproofs": 0, "n_tactics": 2, "cyclomatic": 1, "n_automation": 0, "n_rewrites": 1, "n_structural": 0, "automation_only": false, "max_nesti...
1
/- Copyright (c) 2025 CompPoly. All rights reserved. Released under Apache 2.0 license as described in the file LICENSE. Authors: Dimitris Mitsios -/ import CompPoly.Univariate.Basic import CompPoly.Univariate.ToPoly.Impl import Mathlib.Algebra.Polynomial.Taylor /-! # Formal Derivative and Taylor Shift of Computable ...
/- Copyright (c) 2025 CompPoly. All rights reserved. Released under Apache 2.0 license as described in the file LICENSE. Authors: Dimitris Mitsios -/ import CompPoly.Univariate.Basic import CompPoly.Univariate.ToPoly.Impl import Mathlib.Algebra.Polynomial.Taylor /-! # Formal Derivative and Taylor Shift of Computable ...
@@ -33,9 +33,21 @@ (a : R) (p : CPolynomial R) : CPolynomial R := (support p).sum fun m => C (p.coeff m) * (X + C a) ^ m +/-- The computable Taylor shift matches `Polynomial.taylor` under `toPoly`. -/ +theorem taylor_toPoly [Semiring R] [BEq R] [LawfulBEq R] [Nontrivial R] [DecidableEq R] + (a : R) (p : CP...
{ "repo": "CompPoly", "git_repo": "github.com/Verified-zkEVM/CompPoly", "revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062", "lean_toolchain": "leanprover/lean4:v4.31.0", "proof_assistant": "lean", "ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)", "ablator_flags": [ "--corollary-dele...
ablate_3a17ee438d83_0
baa72fca050b5e4a
lean
lean
github.com/Verified-zkEVM/CompPoly
e95ba1b1cac21ac3e980725abcfb2a0c707d1062
CompPoly/Bivariate/GuruswamiSudan/Interpolation/Correctness.lean
Correctness
0
lemma_delete
null
null
false
0.5
1
1
false
0
inf
0
inf
42
15
1
[ { "theorem_name": "lowMessageYPolynomial_toPoly", "depth": 1, "n_commands": 0, "n_lines": 31, "is_leaf": true, "centrality": 0, "method": "deleted-dep", "proof_text": " by\n unfold lowMessageDegreeInterpolation lowMessageYPolynomial\n have hfold : ∀ (xs : List (F × F)) (Q : CBivari...
[ { "name": "cbivariate_toPoly_pow", "text": "private theorem cbivariate_toPoly_pow {F : Type*}\n [Field F] [BEq F] [LawfulBEq F] [DecidableEq F]\n (Q : CBivariate F) (n : Nat) :\n CBivariate.toPoly (Q ^ n) = CBivariate.toPoly Q ^ n := by\n induction n with\n | zero =>\n simp [CBivariate.toPol...
[ { "name": "lowMessageYPolynomial_toPoly", "fan_in": 3, "n_deps_direct": 2, "n_deps_transitive": 2, "n_lines": 38, "n_chars": 1587, "n_subproofs": 1, "n_tactics": 31, "cyclomatic": 2, "n_automation": 2, "n_rewrites": 7, "n_structural": 7, "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.FactorMonic import CompPoly.Bivariate.GuruswamiSudan.Interpolation.Basic import CompPoly.Bivariate.GuruswamiSudan.PolynomialCorrectn...
/- Copyright (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.FactorMonic import CompPoly.Bivariate.GuruswamiSudan.Interpolation.Basic import CompPoly.Bivariate.GuruswamiSudan.PolynomialCorrectn...
@@ -24,6 +24,16 @@ points.toList.foldl (fun P point ↦ P * ((Polynomial.X - Polynomial.C point.2) ^ multiplicity)) 1 +private theorem cbivariate_toPoly_pow {F : Type*} + [Field F] [BEq F] [LawfulBEq F] [DecidableEq F] + (Q : CBivariate F) (n : Nat) : + CBivariate.toPoly (Q ^ n) = CBivariate.toPoly 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_3a17ee438d83_1
76d6dce62e916570
lean
lean
github.com/Verified-zkEVM/CompPoly
e95ba1b1cac21ac3e980725abcfb2a0c707d1062
CompPoly/Bivariate/GuruswamiSudan/Interpolation/Correctness.lean
Correctness
1
lemma_delete
null
null
false
0.5
1
1
false
0
inf
0
inf
42
15
1
[ { "theorem_name": "eval_hasseDeriv_eq_zero_of_X_sub_C_pow_dvd", "depth": 1, "n_commands": 0, "n_lines": 11, "is_leaf": true, "centrality": 0, "method": "deleted-dep", "proof_text": " by\n rcases hdiv with ⟨R, rfl⟩\n rw [Polynomial.hasseDeriv_mul, Polynomial.eval_finsetSum]\n apply...
[ { "name": "eval_hasseDeriv_X_sub_C_pow_eq_zero_of_lt", "text": "private theorem eval_hasseDeriv_X_sub_C_pow_eq_zero_of_lt {F : Type*} [Field F]\n (y : F) {b m : Nat} (hb : b < m) :\n (Polynomial.hasseDeriv b ((Polynomial.X - Polynomial.C y : Polynomial F) ^ m)).eval y =\n 0 := by\n have htaylor ...
[ { "name": "eval_hasseDeriv_eq_zero_of_X_sub_C_pow_dvd", "fan_in": 1, "n_deps_direct": 1, "n_deps_transitive": 1, "n_lines": 17, "n_chars": 608, "n_subproofs": 2, "n_tactics": 11, "cyclomatic": 2, "n_automation": 4, "n_rewrites": 3, "n_structural": 3, "automation_o...
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.FactorMonic import CompPoly.Bivariate.GuruswamiSudan.Interpolation.Basic import CompPoly.Bivariate.GuruswamiSudan.PolynomialCorrectn...
/- Copyright (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.FactorMonic import CompPoly.Bivariate.GuruswamiSudan.Interpolation.Basic import CompPoly.Bivariate.GuruswamiSudan.PolynomialCorrectn...
@@ -33,11 +33,37 @@ rw [List.foldl_cons, list_foldl_mul_eq_mul_prod f xs (init * f x)] simp [mul_assoc] +private theorem eval_hasseDeriv_X_sub_C_pow_eq_zero_of_lt {F : Type*} [Field F] + (y : F) {b m : Nat} (hb : b < m) : + (Polynomial.hasseDeriv b ((Polynomial.X - Polynomial.C y : Polynomial F) ^...
{ "repo": "CompPoly", "git_repo": "github.com/Verified-zkEVM/CompPoly", "revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062", "lean_toolchain": "leanprover/lean4:v4.31.0", "proof_assistant": "lean", "ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)", "ablator_flags": [ "--corollary-dele...
ablate_3a17ee438d83_2
9e509145acd15174
lean
lean
github.com/Verified-zkEVM/CompPoly
e95ba1b1cac21ac3e980725abcfb2a0c707d1062
CompPoly/Bivariate/GuruswamiSudan/Interpolation/Correctness.lean
Correctness
2
lemma_delete
null
null
false
0.5
1
1
false
0
inf
0
inf
42
15
3
[ { "theorem_name": "hasseDerivative_pos_xOrder_eq_zero_of_toPoly_map_C", "depth": 1, "n_commands": 0, "n_lines": 8, "is_leaf": true, "centrality": 0, "method": "deleted-dep", "proof_text": " by\n apply (CBivariate.eq_iff_coeff).mpr\n intro i j\n rw [CBivariate.hasseDerivative_coeff...
[ { "name": "cbivariate_coeff_of_toPoly_map_C", "text": "private theorem cbivariate_coeff_of_toPoly_map_C {F : Type*}\n [Field F] [BEq F] [LawfulBEq F] [DecidableEq F]\n {Q : CBivariate F} {P : Polynomial F}\n (hQ : CBivariate.toPoly Q = P.map (Polynomial.C : F →+* Polynomial F))\n (i j : Nat) :\n...
[ { "name": "hasseDerivative_pos_xOrder_eq_zero_of_toPoly_map_C", "fan_in": 1, "n_deps_direct": 1, "n_deps_transitive": 1, "n_lines": 15, "n_chars": 556, "n_subproofs": 1, "n_tactics": 8, "cyclomatic": 1, "n_automation": 2, "n_rewrites": 3, "n_structural": 2, "autom...
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.FactorMonic import CompPoly.Bivariate.GuruswamiSudan.Interpolation.Basic import CompPoly.Bivariate.GuruswamiSudan.PolynomialCorrectn...
/- Copyright (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.FactorMonic import CompPoly.Bivariate.GuruswamiSudan.Interpolation.Basic import CompPoly.Bivariate.GuruswamiSudan.PolynomialCorrectn...
@@ -33,12 +33,35 @@ rw [List.foldl_cons, list_foldl_mul_eq_mul_prod f xs (init * f x)] simp [mul_assoc] +private theorem cbivariate_coeff_of_toPoly_map_C {F : Type*} + [Field F] [BEq F] [LawfulBEq F] [DecidableEq F] + {Q : CBivariate F} {P : Polynomial F} + (hQ : CBivariate.toPoly Q = P.map (Po...
{ "repo": "CompPoly", "git_repo": "github.com/Verified-zkEVM/CompPoly", "revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062", "lean_toolchain": "leanprover/lean4:v4.31.0", "proof_assistant": "lean", "ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)", "ablator_flags": [ "--corollary-dele...
ablate_3a17ee438d83_3
29968a84cde8dabd
lean
lean
github.com/Verified-zkEVM/CompPoly
e95ba1b1cac21ac3e980725abcfb2a0c707d1062
CompPoly/Bivariate/GuruswamiSudan/Interpolation/Correctness.lean
Correctness
3
lemma_delete
null
null
false
0.5
1
1
false
0
inf
0
inf
42
15
3
[ { "theorem_name": "hasseDerivative_pos_xOrder_eq_zero_of_toPoly_map_C", "depth": 1, "n_commands": 0, "n_lines": 8, "is_leaf": true, "centrality": 0, "method": "deleted-dep", "proof_text": " by\n apply (CBivariate.eq_iff_coeff).mpr\n intro i j\n rw [CBivariate.hasseDerivative_coeff...
[ { "name": "cbivariate_coeff_of_toPoly_map_C", "text": "private theorem cbivariate_coeff_of_toPoly_map_C {F : Type*}\n [Field F] [BEq F] [LawfulBEq F] [DecidableEq F]\n {Q : CBivariate F} {P : Polynomial F}\n (hQ : CBivariate.toPoly Q = P.map (Polynomial.C : F →+* Polynomial F))\n (i j : Nat) :\n...
[ { "name": "hasseDerivativeEval_pos_xOrder_of_toPoly_map_C", "fan_in": 1, "n_deps_direct": 1, "n_deps_transitive": 2, "n_lines": 11, "n_chars": 500, "n_subproofs": 0, "n_tactics": 4, "cyclomatic": 1, "n_automation": 0, "n_rewrites": 3, "n_structural": 0, "automatio...
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.FactorMonic import CompPoly.Bivariate.GuruswamiSudan.Interpolation.Basic import CompPoly.Bivariate.GuruswamiSudan.PolynomialCorrectn...
/- Copyright (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.FactorMonic import CompPoly.Bivariate.GuruswamiSudan.Interpolation.Basic import CompPoly.Bivariate.GuruswamiSudan.PolynomialCorrectn...
@@ -33,12 +33,35 @@ rw [List.foldl_cons, list_foldl_mul_eq_mul_prod f xs (init * f x)] simp [mul_assoc] +private theorem cbivariate_coeff_of_toPoly_map_C {F : Type*} + [Field F] [BEq F] [LawfulBEq F] [DecidableEq F] + {Q : CBivariate F} {P : Polynomial F} + (hQ : CBivariate.toPoly Q = P.map (Po...
{ "repo": "CompPoly", "git_repo": "github.com/Verified-zkEVM/CompPoly", "revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062", "lean_toolchain": "leanprover/lean4:v4.31.0", "proof_assistant": "lean", "ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)", "ablator_flags": [ "--corollary-dele...
ablate_3a17ee438d83_4
30d8ab7e879a854e
lean
lean
github.com/Verified-zkEVM/CompPoly
e95ba1b1cac21ac3e980725abcfb2a0c707d1062
CompPoly/Bivariate/GuruswamiSudan/Interpolation/Correctness.lean
Correctness
4
lemma_delete
null
null
false
0.5
1
1
false
0
inf
0
inf
42
15
3
[ { "theorem_name": "hasseDerivative_pos_xOrder_eq_zero_of_toPoly_map_C", "depth": 1, "n_commands": 0, "n_lines": 8, "is_leaf": true, "centrality": 0, "method": "deleted-dep", "proof_text": " by\n apply (CBivariate.eq_iff_coeff).mpr\n intro i j\n rw [CBivariate.hasseDerivative_coeff...
[ { "name": "cbivariate_coeff_of_toPoly_map_C", "text": "private theorem cbivariate_coeff_of_toPoly_map_C {F : Type*}\n [Field F] [BEq F] [LawfulBEq F] [DecidableEq F]\n {Q : CBivariate F} {P : Polynomial F}\n (hQ : CBivariate.toPoly Q = P.map (Polynomial.C : F →+* Polynomial F))\n (i j : Nat) :\n...
[ { "name": "hasseDerivative_zero_xOrder_toPoly_of_map_C", "fan_in": 1, "n_deps_direct": 1, "n_deps_transitive": 1, "n_lines": 20, "n_chars": 691, "n_subproofs": 0, "n_tactics": 12, "cyclomatic": 1, "n_automation": 2, "n_rewrites": 4, "n_structural": 4, "automation_...
1
/- Copyright (c) 2026 CompPoly Contributors. All rights reserved. Released under Apache 2.0 license as described in the file LICENSE. Authors: Valerii Huhnin -/ import CompPoly.Bivariate.FactorMonic import CompPoly.Bivariate.GuruswamiSudan.Interpolation.Basic import CompPoly.Bivariate.GuruswamiSudan.PolynomialCorrectn...
/- Copyright (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.FactorMonic import CompPoly.Bivariate.GuruswamiSudan.Interpolation.Basic import CompPoly.Bivariate.GuruswamiSudan.PolynomialCorrectn...
@@ -33,13 +33,40 @@ rw [List.foldl_cons, list_foldl_mul_eq_mul_prod f xs (init * f x)] simp [mul_assoc] +private theorem cbivariate_coeff_of_toPoly_map_C {F : Type*} + [Field F] [BEq F] [LawfulBEq F] [DecidableEq F] + {Q : CBivariate F} {P : Polynomial F} + (hQ : CBivariate.toPoly Q = P.map (Po...
{ "repo": "CompPoly", "git_repo": "github.com/Verified-zkEVM/CompPoly", "revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062", "lean_toolchain": "leanprover/lean4:v4.31.0", "proof_assistant": "lean", "ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)", "ablator_flags": [ "--corollary-dele...
ablate_3a17ee438d83_5
c5a7bb07e2c67cb5
lean
lean
github.com/Verified-zkEVM/CompPoly
e95ba1b1cac21ac3e980725abcfb2a0c707d1062
CompPoly/Bivariate/GuruswamiSudan/Interpolation/Correctness.lean
Correctness
5
lemma_delete
null
null
false
0.5
1
1
false
0
inf
0
inf
42
15
3
[ { "theorem_name": "hasseDerivative_pos_xOrder_eq_zero_of_toPoly_map_C", "depth": 1, "n_commands": 0, "n_lines": 8, "is_leaf": true, "centrality": 0, "method": "deleted-dep", "proof_text": " by\n apply (CBivariate.eq_iff_coeff).mpr\n intro i j\n rw [CBivariate.hasseDerivative_coeff...
[ { "name": "cbivariate_coeff_of_toPoly_map_C", "text": "private theorem cbivariate_coeff_of_toPoly_map_C {F : Type*}\n [Field F] [BEq F] [LawfulBEq F] [DecidableEq F]\n {Q : CBivariate F} {P : Polynomial F}\n (hQ : CBivariate.toPoly Q = P.map (Polynomial.C : F →+* Polynomial F))\n (i j : Nat) :\n...
[ { "name": "hasseDerivativeEval_zero_xOrder_of_toPoly_map_C", "fan_in": 1, "n_deps_direct": 1, "n_deps_transitive": 2, "n_lines": 13, "n_chars": 536, "n_subproofs": 0, "n_tactics": 5, "cyclomatic": 1, "n_automation": 1, "n_rewrites": 3, "n_structural": 0, "automati...
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.FactorMonic import CompPoly.Bivariate.GuruswamiSudan.Interpolation.Basic import CompPoly.Bivariate.GuruswamiSudan.PolynomialCorrectn...
/- Copyright (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.FactorMonic import CompPoly.Bivariate.GuruswamiSudan.Interpolation.Basic import CompPoly.Bivariate.GuruswamiSudan.PolynomialCorrectn...
@@ -33,13 +33,40 @@ rw [List.foldl_cons, list_foldl_mul_eq_mul_prod f xs (init * f x)] simp [mul_assoc] +private theorem cbivariate_coeff_of_toPoly_map_C {F : Type*} + [Field F] [BEq F] [LawfulBEq F] [DecidableEq F] + {Q : CBivariate F} {P : Polynomial F} + (hQ : CBivariate.toPoly Q = P.map (Po...
{ "repo": "CompPoly", "git_repo": "github.com/Verified-zkEVM/CompPoly", "revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062", "lean_toolchain": "leanprover/lean4:v4.31.0", "proof_assistant": "lean", "ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)", "ablator_flags": [ "--corollary-dele...
ablate_3a17ee438d83_6
be742162f6ac9868
lean
lean
github.com/Verified-zkEVM/CompPoly
e95ba1b1cac21ac3e980725abcfb2a0c707d1062
CompPoly/Bivariate/GuruswamiSudan/Interpolation/Correctness.lean
Correctness
6
lemma_delete
null
null
false
0.5
1
1
false
0
inf
0
inf
42
15
1
[ { "theorem_name": "lowMessageYPolynomial_toPoly", "depth": 1, "n_commands": 0, "n_lines": 31, "is_leaf": true, "centrality": 0, "method": "deleted-dep", "proof_text": " by\n unfold lowMessageDegreeInterpolation lowMessageYPolynomial\n have hfold : ∀ (xs : List (F × F)) (Q : CBivari...
[ { "name": "cbivariate_toPoly_pow", "text": "private theorem cbivariate_toPoly_pow {F : Type*}\n [Field F] [BEq F] [LawfulBEq F] [DecidableEq F]\n (Q : CBivariate F) (n : Nat) :\n CBivariate.toPoly (Q ^ n) = CBivariate.toPoly Q ^ n := by\n induction n with\n | zero =>\n simp [CBivariate.toPol...
[ { "name": "lowMessageDegreeInterpolation_ne_zero", "fan_in": 1, "n_deps_direct": 2, "n_deps_transitive": 4, "n_lines": 14, "n_chars": 617, "n_subproofs": 1, "n_tactics": 9, "cyclomatic": 1, "n_automation": 0, "n_rewrites": 2, "n_structural": 2, "automation_only": ...
4
/- Copyright (c) 2026 CompPoly Contributors. All rights reserved. Released under Apache 2.0 license as described in the file LICENSE. Authors: Valerii Huhnin -/ import CompPoly.Bivariate.FactorMonic import CompPoly.Bivariate.GuruswamiSudan.Interpolation.Basic import CompPoly.Bivariate.GuruswamiSudan.PolynomialCorrectn...
/- Copyright (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.FactorMonic import CompPoly.Bivariate.GuruswamiSudan.Interpolation.Basic import CompPoly.Bivariate.GuruswamiSudan.PolynomialCorrectn...
@@ -24,6 +24,16 @@ points.toList.foldl (fun P point ↦ P * ((Polynomial.X - Polynomial.C point.2) ^ multiplicity)) 1 +private theorem cbivariate_toPoly_pow {F : Type*} + [Field F] [BEq F] [LawfulBEq F] [DecidableEq F] + (Q : CBivariate F) (n : Nat) : + CBivariate.toPoly (Q ^ n) = CBivariate.toPoly 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_3a17ee438d83_7
25bf35d95f30c5be
lean
lean
github.com/Verified-zkEVM/CompPoly
e95ba1b1cac21ac3e980725abcfb2a0c707d1062
CompPoly/Bivariate/GuruswamiSudan/Interpolation/Correctness.lean
Correctness
7
lemma_delete
null
null
false
0.5
1
1
false
0
inf
0
inf
42
15
1
[ { "theorem_name": "lowMessageYPolynomial_toPoly", "depth": 1, "n_commands": 0, "n_lines": 31, "is_leaf": true, "centrality": 0, "method": "deleted-dep", "proof_text": " by\n unfold lowMessageDegreeInterpolation lowMessageYPolynomial\n have hfold : ∀ (xs : List (F × F)) (Q : CBivari...
[ { "name": "cbivariate_toPoly_pow", "text": "private theorem cbivariate_toPoly_pow {F : Type*}\n [Field F] [BEq F] [LawfulBEq F] [DecidableEq F]\n (Q : CBivariate F) (n : Nat) :\n CBivariate.toPoly (Q ^ n) = CBivariate.toPoly Q ^ n := by\n induction n with\n | zero =>\n simp [CBivariate.toPol...
[ { "name": "lowMessageDegreeInterpolation_weightedDegree_zero", "fan_in": 1, "n_deps_direct": 2, "n_deps_transitive": 4, "n_lines": 12, "n_chars": 506, "n_subproofs": 2, "n_tactics": 7, "cyclomatic": 1, "n_automation": 2, "n_rewrites": 1, "n_structural": 2, "automa...
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.FactorMonic import CompPoly.Bivariate.GuruswamiSudan.Interpolation.Basic import CompPoly.Bivariate.GuruswamiSudan.PolynomialCorrectn...
/- Copyright (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.FactorMonic import CompPoly.Bivariate.GuruswamiSudan.Interpolation.Basic import CompPoly.Bivariate.GuruswamiSudan.PolynomialCorrectn...
@@ -24,6 +24,16 @@ points.toList.foldl (fun P point ↦ P * ((Polynomial.X - Polynomial.C point.2) ^ multiplicity)) 1 +private theorem cbivariate_toPoly_pow {F : Type*} + [Field F] [BEq F] [LawfulBEq F] [DecidableEq F] + (Q : CBivariate F) (n : Nat) : + CBivariate.toPoly (Q ^ n) = CBivariate.toPoly 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_3a17ee438d83_8
7300e0a67b12817f
lean
lean
github.com/Verified-zkEVM/CompPoly
e95ba1b1cac21ac3e980725abcfb2a0c707d1062
CompPoly/Bivariate/GuruswamiSudan/Interpolation/Correctness.lean
Correctness
8
lemma_delete
null
null
false
0.5
1
1
false
0
inf
0
inf
42
15
1
[ { "theorem_name": "lowMessageYPolynomial_toPoly", "depth": 1, "n_commands": 0, "n_lines": 31, "is_leaf": true, "centrality": 0, "method": "deleted-dep", "proof_text": " by\n unfold lowMessageDegreeInterpolation lowMessageYPolynomial\n have hfold : ∀ (xs : List (F × F)) (Q : CBivari...
[ { "name": "cbivariate_toPoly_pow", "text": "private theorem cbivariate_toPoly_pow {F : Type*}\n [Field F] [BEq F] [LawfulBEq F] [DecidableEq F]\n (Q : CBivariate F) (n : Nat) :\n CBivariate.toPoly (Q ^ n) = CBivariate.toPoly Q ^ n := by\n induction n with\n | zero =>\n simp [CBivariate.toPol...
[ { "name": "lowMessageDegreeInterpolation_satisfies", "fan_in": 1, "n_deps_direct": 5, "n_deps_transitive": 11, "n_lines": 18, "n_chars": 793, "n_subproofs": 1, "n_tactics": 12, "cyclomatic": 1, "n_automation": 1, "n_rewrites": 2, "n_structural": 3, "automation_onl...
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.FactorMonic import CompPoly.Bivariate.GuruswamiSudan.Interpolation.Basic import CompPoly.Bivariate.GuruswamiSudan.PolynomialCorrectn...
/- Copyright (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.FactorMonic import CompPoly.Bivariate.GuruswamiSudan.Interpolation.Basic import CompPoly.Bivariate.GuruswamiSudan.PolynomialCorrectn...
@@ -24,6 +24,16 @@ points.toList.foldl (fun P point ↦ P * ((Polynomial.X - Polynomial.C point.2) ^ multiplicity)) 1 +private theorem cbivariate_toPoly_pow {F : Type*} + [Field F] [BEq F] [LawfulBEq F] [DecidableEq F] + (Q : CBivariate F) (n : Nat) : + CBivariate.toPoly (Q ^ n) = CBivariate.toPoly 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_3a17ee438d83_9
fd20d965af3b6c15
lean
lean
github.com/Verified-zkEVM/CompPoly
e95ba1b1cac21ac3e980725abcfb2a0c707d1062
CompPoly/Bivariate/GuruswamiSudan/Interpolation/Correctness.lean
Correctness
9
lemma_delete
null
null
false
0.5
1
1
false
0
inf
0
inf
42
15
1
[ { "theorem_name": "lowMessageYPolynomial_toPoly", "depth": 1, "n_commands": 0, "n_lines": 31, "is_leaf": true, "centrality": 0, "method": "deleted-dep", "proof_text": " by\n unfold lowMessageDegreeInterpolation lowMessageYPolynomial\n have hfold : ∀ (xs : List (F × F)) (Q : CBivari...
[ { "name": "cbivariate_toPoly_pow", "text": "private theorem cbivariate_toPoly_pow {F : Type*}\n [Field F] [BEq F] [LawfulBEq F] [DecidableEq F]\n (Q : CBivariate F) (n : Nat) :\n CBivariate.toPoly (Q ^ n) = CBivariate.toPoly Q ^ n := by\n induction n with\n | zero =>\n simp [CBivariate.toPol...
[ { "name": "lowMessageDegreeInterpolation_sound", "fan_in": 0, "n_deps_direct": 3, "n_deps_transitive": 15, "n_lines": 22, "n_chars": 1006, "n_subproofs": 1, "n_tactics": 14, "cyclomatic": 1, "n_automation": 1, "n_rewrites": 2, "n_structural": 3, "automation_only":...
15
/- Copyright (c) 2026 CompPoly Contributors. All rights reserved. Released under Apache 2.0 license as described in the file LICENSE. Authors: Valerii Huhnin -/ import CompPoly.Bivariate.FactorMonic import CompPoly.Bivariate.GuruswamiSudan.Interpolation.Basic import CompPoly.Bivariate.GuruswamiSudan.PolynomialCorrectn...
/- Copyright (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.FactorMonic import CompPoly.Bivariate.GuruswamiSudan.Interpolation.Basic import CompPoly.Bivariate.GuruswamiSudan.PolynomialCorrectn...
@@ -24,6 +24,16 @@ points.toList.foldl (fun P point ↦ P * ((Polynomial.X - Polynomial.C point.2) ^ multiplicity)) 1 +private theorem cbivariate_toPoly_pow {F : Type*} + [Field F] [BEq F] [LawfulBEq F] [DecidableEq F] + (Q : CBivariate F) (n : Nat) : + CBivariate.toPoly (Q ^ n) = CBivariate.toPoly 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_49287196cb32_0
2b1838f09f1d89c1
lean
lean
github.com/Verified-zkEVM/CompPoly
e95ba1b1cac21ac3e980725abcfb2a0c707d1062
CompPoly/Multivariate/Lawful.lean
Lawful
0
lemma_delete
null
null
false
0.5
1
1
false
0
inf
0
inf
42
2
1
[ { "theorem_name": "not_mem_C_zero", "depth": 1, "n_commands": 0, "n_lines": 1, "is_leaf": true, "centrality": 0, "method": "deleted-dep", "proof_text": " by simp [zero_eq_empty]; unfold_projs; grind", "n_chars": 45, "n_subproofs": 0, "n_tactics": 3, "cyclomatic": 1, ...
[ { "name": "zero_eq_empty", "text": "lemma zero_eq_empty : (0 : Lawful n R) = ∅ := by\n unfold_projs\n simp [C, Unlawful.zero_eq_empty]\n\n", "fan_in": 1, "n_lines": 5, "n_chars": 102, "n_subproofs": 0, "n_tactics": 3, "cyclomatic": 1, "n_automation": 1, "n_rewrites": 0, ...
[ { "name": "not_mem_C_zero", "fan_in": 0, "n_deps_direct": 1, "n_deps_transitive": 1, "n_lines": 4, "n_chars": 99, "n_subproofs": 0, "n_tactics": 3, "cyclomatic": 1, "n_automation": 2, "n_rewrites": 0, "n_structural": 0, "automation_only": true, "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 -/ import CompPoly.Multivariate.Unlawful import Mathlib.Analysis.Normed.Ring.Lemmas /-! # 'Lawful' finite supports This file defines the `Lawful` subtype, which consists ...
/- Copyright (c) 2025 CompPoly. All rights reserved. Released under Apache 2.0 license as described in the file LICENSE. Authors: Frantisek Silvasi -/ import CompPoly.Multivariate.Unlawful import Mathlib.Analysis.Normed.Ring.Lemmas /-! # 'Lawful' finite supports This file defines the `Lawful` subtype, which consists ...
@@ -111,8 +111,12 @@ lemma zero_eq_zero : (0 : Lawful n R) = ⟨0, by grind⟩ := rfl +lemma zero_eq_empty : (0 : Lawful n R) = ∅ := by + unfold_projs + simp [C, Unlawful.zero_eq_empty] + @[simp, grind .] -lemma not_mem_C_zero : x ∉ C 0 := sorry +lemma not_mem_C_zero : x ∉ C 0 := by simp [zero_eq_empty]; unfold_pro...
{ "repo": "CompPoly", "git_repo": "github.com/Verified-zkEVM/CompPoly", "revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062", "lean_toolchain": "leanprover/lean4:v4.31.0", "proof_assistant": "lean", "ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)", "ablator_flags": [ "--corollary-dele...
ablate_49287196cb32_1
dcb178a15c5ee13c
lean
lean
github.com/Verified-zkEVM/CompPoly
e95ba1b1cac21ac3e980725abcfb2a0c707d1062
CompPoly/Multivariate/Lawful.lean
Lawful
1
lemma_delete
null
null
false
0.5
1
1
false
0
inf
0
inf
42
2
1
[ { "theorem_name": "not_mem_zero", "depth": 1, "n_commands": 0, "n_lines": 1, "is_leaf": true, "centrality": 0, "method": "deleted-dep", "proof_text": " by rw [zero_eq_zero]; exact Unlawful.not_mem_zero", "n_chars": 50, "n_subproofs": 0, "n_tactics": 2, "cyclomatic": 1...
[ { "name": "zero_eq_zero", "text": "lemma zero_eq_zero : (0 : Lawful n R) = ⟨0, by grind⟩ := rfl\n\n", "fan_in": 1, "n_lines": 3, "n_chars": 66, "n_subproofs": 0, "n_tactics": 1, "cyclomatic": 1, "n_automation": 1, "n_rewrites": 0, "n_structural": 0, "automation_only":...
[ { "name": "not_mem_zero", "fan_in": 0, "n_deps_direct": 1, "n_deps_transitive": 1, "n_lines": 4, "n_chars": 115, "n_subproofs": 0, "n_tactics": 2, "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: Frantisek Silvasi -/ import CompPoly.Multivariate.Unlawful import Mathlib.Analysis.Normed.Ring.Lemmas /-! # 'Lawful' finite supports This file defines the `Lawful` subtype, which consists ...
/- Copyright (c) 2025 CompPoly. All rights reserved. Released under Apache 2.0 license as described in the file LICENSE. Authors: Frantisek Silvasi -/ import CompPoly.Multivariate.Unlawful import Mathlib.Analysis.Normed.Ring.Lemmas /-! # 'Lawful' finite supports This file defines the `Lawful` subtype, which consists ...
@@ -109,6 +109,8 @@ @[simp, grind =] lemma C_zero' : C (n := n) (0 : ℕ) = 0 := rfl +lemma zero_eq_zero : (0 : Lawful n R) = ⟨0, by grind⟩ := rfl + lemma zero_eq_empty : (0 : Lawful n R) = ∅ := by unfold_projs simp [C, Unlawful.zero_eq_empty] @@ -117,7 +119,7 @@ lemma not_mem_C_zero : x ∉ C 0 := by simp [zer...
{ "repo": "CompPoly", "git_repo": "github.com/Verified-zkEVM/CompPoly", "revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062", "lean_toolchain": "leanprover/lean4:v4.31.0", "proof_assistant": "lean", "ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)", "ablator_flags": [ "--corollary-dele...
ablate_86ad2bd756d1_0
35e1e907c3581e68
lean
lean
github.com/Verified-zkEVM/CompPoly
e95ba1b1cac21ac3e980725abcfb2a0c707d1062
CompPoly/Fields/Binary/Tower/Abstract/Split.lean
Split
0
lemma_delete
null
null
false
0.5
1
1
false
0
inf
0
inf
42
4
4
[ { "theorem_name": "split_join_via_add_smul_eq_iff_split", "depth": 1, "n_commands": 0, "n_lines": 2, "is_leaf": true, "centrality": 0, "method": "deleted-dep", "proof_text": " by\n exact (eq_join_via_add_smul_eq_iff_split k h_pos (⋘ hi_btf, lo_btf ⋙) hi_btf lo_btf).mp rfl", "n_c...
[ { "name": "eq_join_via_add_smul_eq_iff_split", "text": "/-! Proofs that `split` is the inverse of `join_via_add_smul`\n-/\ntheorem eq_join_via_add_smul_eq_iff_split (k : ℕ) (h_pos : k > 0)\n (x : BTField k) (hi_btf lo_btf : BTField (k - 1)) :\n x = ⋘ hi_btf, lo_btf ⋙ ↔\n split (k:=k) (h_k:=h_pos) x =...
[ { "name": "split_join_via_add_smul_eq_iff_split", "fan_in": 1, "n_deps_direct": 1, "n_deps_transitive": 2, "n_lines": 6, "n_chars": 288, "n_subproofs": 0, "n_tactics": 2, "cyclomatic": 1, "n_automation": 1, "n_rewrites": 0, "n_structural": 1, "automation_only": fa...
1
/- Copyright (c) 2024-2025 ArkLib Contributors. All rights reserved. Released under Apache 2.0 license as described in the file LICENSE. Authors: Quang Dao, Chung Thai Nguyen -/ import CompPoly.Fields.Binary.Tower.Abstract.Algebra /-! # Abstract Binary Tower Split Splitting and recombination lemmas for abstract bina...
/- Copyright (c) 2024-2025 ArkLib Contributors. All rights reserved. Released under Apache 2.0 license as described in the file LICENSE. Authors: Quang Dao, Chung Thai Nguyen -/ import CompPoly.Fields.Binary.Tower.Abstract.Algebra /-! # Abstract Binary Tower Split Splitting and recombination lemmas for abstract bina...
@@ -127,9 +127,51 @@ have h_unique := unique_linear_decomposition_succ (k:=(k-1)) (x:=(Eq.mp (h:=h_BTField_eq) x)) exact h_unique.choose +/-! Proofs that `split` is the inverse of `join_via_add_smul` +-/ +theorem eq_join_via_add_smul_eq_iff_split (k : ℕ) (h_pos : k > 0) + (x : BTField k) (hi_btf lo_btf : BTF...
{ "repo": "CompPoly", "git_repo": "github.com/Verified-zkEVM/CompPoly", "revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062", "lean_toolchain": "leanprover/lean4:v4.31.0", "proof_assistant": "lean", "ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)", "ablator_flags": [ "--corollary-dele...
ablate_86ad2bd756d1_1
ddef9ae4fe0bd2e0
lean
lean
github.com/Verified-zkEVM/CompPoly
e95ba1b1cac21ac3e980725abcfb2a0c707d1062
CompPoly/Fields/Binary/Tower/Abstract/Split.lean
Split
1
lemma_delete
null
null
false
0.5
1
1
false
0
inf
0
inf
42
4
4
[ { "theorem_name": "split_join_via_add_smul_eq_iff_split", "depth": 1, "n_commands": 0, "n_lines": 2, "is_leaf": true, "centrality": 0, "method": "deleted-dep", "proof_text": " by\n exact (eq_join_via_add_smul_eq_iff_split k h_pos (⋘ hi_btf, lo_btf ⋙) hi_btf lo_btf).mp rfl", "n_c...
[ { "name": "eq_join_via_add_smul_eq_iff_split", "text": "/-! Proofs that `split` is the inverse of `join_via_add_smul`\n-/\ntheorem eq_join_via_add_smul_eq_iff_split (k : ℕ) (h_pos : k > 0)\n (x : BTField k) (hi_btf lo_btf : BTField (k - 1)) :\n x = ⋘ hi_btf, lo_btf ⋙ ↔\n split (k:=k) (h_k:=h_pos) x =...
[ { "name": "join_eq_join_iff", "fan_in": 0, "n_deps_direct": 2, "n_deps_transitive": 3, "n_lines": 13, "n_chars": 456, "n_subproofs": 0, "n_tactics": 9, "cyclomatic": 2, "n_automation": 2, "n_rewrites": 2, "n_structural": 4, "automation_only": false, "max_nesti...
2
/- Copyright (c) 2024-2025 ArkLib Contributors. All rights reserved. Released under Apache 2.0 license as described in the file LICENSE. Authors: Quang Dao, Chung Thai Nguyen -/ import CompPoly.Fields.Binary.Tower.Abstract.Algebra /-! # Abstract Binary Tower Split Splitting and recombination lemmas for abstract bina...
/- Copyright (c) 2024-2025 ArkLib Contributors. All rights reserved. Released under Apache 2.0 license as described in the file LICENSE. Authors: Quang Dao, Chung Thai Nguyen -/ import CompPoly.Fields.Binary.Tower.Abstract.Algebra /-! # Abstract Binary Tower Split Splitting and recombination lemmas for abstract bina...
@@ -127,15 +127,61 @@ have h_unique := unique_linear_decomposition_succ (k:=(k-1)) (x:=(Eq.mp (h:=h_BTField_eq) x)) exact h_unique.choose +/-! Proofs that `split` is the inverse of `join_via_add_smul` +-/ +theorem eq_join_via_add_smul_eq_iff_split (k : ℕ) (h_pos : k > 0) + (x : BTField k) (hi_btf lo_btf : BT...
{ "repo": "CompPoly", "git_repo": "github.com/Verified-zkEVM/CompPoly", "revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062", "lean_toolchain": "leanprover/lean4:v4.31.0", "proof_assistant": "lean", "ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)", "ablator_flags": [ "--corollary-dele...
ablate_d8c7f7336c2c_0
856b1769b32f3371
lean
lean
github.com/Verified-zkEVM/CompPoly
e95ba1b1cac21ac3e980725abcfb2a0c707d1062
CompPoly/LinearAlgebra/PolynomialMatrix/MuldersStorjohannCorrectness/Reduction.lean
Reduction
0
lemma_delete
null
null
false
0.5
1
1
false
0
inf
0
inf
42
12
3
[ { "theorem_name": "muldersStorjohannStep_rowSpan_subset", "depth": 1, "n_commands": 0, "n_lines": 34, "is_leaf": true, "centrality": 0, "method": "deleted-dep", "proof_text": " by\n apply rowSpan_subset_of_rows_mem hM\n · exact congrArg PolynomialMatrixShape.width\n (muldersSt...
[ { "name": "muldersStorjohannStep_shape_preserved", "text": "theorem muldersStorjohannStep_shape_preserved\n {M : PolynomialMatrix F} (shift : Array Nat) {i j : Nat} (hM : WellFormed M) :\n MatrixShape (muldersStorjohannStep M shift i j) = MatrixShape M := by\n simp only [muldersStorjohannStep, Array....
[ { "name": "muldersStorjohannStep_rowSpan_subset", "fan_in": 1, "n_deps_direct": 1, "n_deps_transitive": 1, "n_lines": 38, "n_chars": 1867, "n_subproofs": 6, "n_tactics": 34, "cyclomatic": 4, "n_automation": 8, "n_rewrites": 2, "n_structural": 11, "automation_only"...
1
/- Copyright (c) 2026 CompPoly Contributors. All rights reserved. Released under Apache 2.0 license as described in the file LICENSE. Authors: Valerii Huhnin -/ import CompPoly.LinearAlgebra.PolynomialMatrix.MuldersStorjohannCorrectness.Combinations /-! # Mulders-Storjohann Correctness Reduction Invariants Shape, we...
/- Copyright (c) 2026 CompPoly Contributors. All rights reserved. Released under Apache 2.0 license as described in the file LICENSE. Authors: Valerii Huhnin -/ import CompPoly.LinearAlgebra.PolynomialMatrix.MuldersStorjohannCorrectness.Combinations /-! # Mulders-Storjohann Correctness Reduction Invariants Shape, we...
@@ -18,11 +18,35 @@ variable {F : Type*} [Field F] [BEq F] [LawfulBEq F] [DecidableEq F] +theorem muldersStorjohannStep_shape_preserved + {M : PolynomialMatrix F} (shift : Array Nat) {i j : Nat} (hM : WellFormed M) : + MatrixShape (muldersStorjohannStep M shift i j) = MatrixShape M := by + simp only [mulder...
{ "repo": "CompPoly", "git_repo": "github.com/Verified-zkEVM/CompPoly", "revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062", "lean_toolchain": "leanprover/lean4:v4.31.0", "proof_assistant": "lean", "ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)", "ablator_flags": [ "--corollary-dele...
ablate_d8c7f7336c2c_1
3d16002c551d3278
lean
lean
github.com/Verified-zkEVM/CompPoly
e95ba1b1cac21ac3e980725abcfb2a0c707d1062
CompPoly/LinearAlgebra/PolynomialMatrix/MuldersStorjohannCorrectness/Reduction.lean
Reduction
1
lemma_delete
null
null
false
0.5
1
1
false
0
inf
0
inf
42
12
3
[ { "theorem_name": "muldersStorjohannStep_rowSpan_subset", "depth": 1, "n_commands": 0, "n_lines": 34, "is_leaf": true, "centrality": 0, "method": "deleted-dep", "proof_text": " by\n apply rowSpan_subset_of_rows_mem hM\n · exact congrArg PolynomialMatrixShape.width\n (muldersSt...
[ { "name": "muldersStorjohannStep_shape_preserved", "text": "theorem muldersStorjohannStep_shape_preserved\n {M : PolynomialMatrix F} (shift : Array Nat) {i j : Nat} (hM : WellFormed M) :\n MatrixShape (muldersStorjohannStep M shift i j) = MatrixShape M := by\n simp only [muldersStorjohannStep, Array....
[ { "name": "muldersStorjohannStep_rowSpan_superset", "fan_in": 1, "n_deps_direct": 1, "n_deps_transitive": 1, "n_lines": 121, "n_chars": 6252, "n_subproofs": 18, "n_tactics": 116, "cyclomatic": 7, "n_automation": 21, "n_rewrites": 5, "n_structural": 19, "automation...
1
/- Copyright (c) 2026 CompPoly Contributors. All rights reserved. Released under Apache 2.0 license as described in the file LICENSE. Authors: Valerii Huhnin -/ import CompPoly.LinearAlgebra.PolynomialMatrix.MuldersStorjohannCorrectness.Combinations /-! # Mulders-Storjohann Correctness Reduction Invariants Shape, we...
/- Copyright (c) 2026 CompPoly Contributors. All rights reserved. Released under Apache 2.0 license as described in the file LICENSE. Authors: Valerii Huhnin -/ import CompPoly.LinearAlgebra.PolynomialMatrix.MuldersStorjohannCorrectness.Combinations /-! # Mulders-Storjohann Correctness Reduction Invariants Shape, we...
@@ -18,6 +18,29 @@ variable {F : Type*} [Field F] [BEq F] [LawfulBEq F] [DecidableEq F] +theorem muldersStorjohannStep_shape_preserved + {M : PolynomialMatrix F} (shift : Array Nat) {i j : Nat} (hM : WellFormed M) : + MatrixShape (muldersStorjohannStep M shift i j) = MatrixShape M := by + simp only [mulders...
{ "repo": "CompPoly", "git_repo": "github.com/Verified-zkEVM/CompPoly", "revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062", "lean_toolchain": "leanprover/lean4:v4.31.0", "proof_assistant": "lean", "ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)", "ablator_flags": [ "--corollary-dele...
ablate_d8c7f7336c2c_2
dbda553b1e99e9c6
lean
lean
github.com/Verified-zkEVM/CompPoly
e95ba1b1cac21ac3e980725abcfb2a0c707d1062
CompPoly/LinearAlgebra/PolynomialMatrix/MuldersStorjohannCorrectness/Reduction.lean
Reduction
2
lemma_delete
null
null
false
0.5
1
1
false
0
inf
0
inf
42
12
5
[ { "theorem_name": "muldersStorjohannReduceWithFuel_shape_preserved", "depth": 1, "n_commands": 0, "n_lines": 12, "is_leaf": true, "centrality": 0, "method": "deleted-dep", "proof_text": " by\n induction fuel generalizing M with\n | zero =>\n simp [muldersStorjohannReduceWithFu...
[ { "name": "muldersStorjohannStep_wellFormed", "text": "theorem muldersStorjohannStep_wellFormed\n {M : PolynomialMatrix F} (shift : Array Nat) {i j : Nat} (hM : WellFormed M) :\n WellFormed (muldersStorjohannStep M shift i j) := by\n simp only [muldersStorjohannStep, Array.getD_eq_getD_getElem?]\n c...
[ { "name": "muldersStorjohannReduceWithFuel_shape_preserved", "fan_in": 1, "n_deps_direct": 2, "n_deps_transitive": 2, "n_lines": 16, "n_chars": 612, "n_subproofs": 0, "n_tactics": 12, "cyclomatic": 3, "n_automation": 2, "n_rewrites": 1, "n_structural": 2, "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.LinearAlgebra.PolynomialMatrix.MuldersStorjohannCorrectness.Combinations /-! # Mulders-Storjohann Correctness Reduction Invariants Shape, we...
/- Copyright (c) 2026 CompPoly Contributors. All rights reserved. Released under Apache 2.0 license as described in the file LICENSE. Authors: Valerii Huhnin -/ import CompPoly.LinearAlgebra.PolynomialMatrix.MuldersStorjohannCorrectness.Combinations /-! # Mulders-Storjohann Correctness Reduction Invariants Shape, we...
@@ -41,6 +41,29 @@ simpa [Array.getD_eq_getD_getElem?] using cancelShiftedLeadingTerm_size_of_wellFormed hM hi hj shift +theorem muldersStorjohannStep_wellFormed + {M : PolynomialMatrix F} (shift : Array Nat) {i j : Nat} (hM : WellFormed M) : + WellFormed (muldersStorjohannStep M shi...
{ "repo": "CompPoly", "git_repo": "github.com/Verified-zkEVM/CompPoly", "revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062", "lean_toolchain": "leanprover/lean4:v4.31.0", "proof_assistant": "lean", "ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)", "ablator_flags": [ "--corollary-dele...
ablate_d8c7f7336c2c_3
69c05786e75f5f95
lean
lean
github.com/Verified-zkEVM/CompPoly
e95ba1b1cac21ac3e980725abcfb2a0c707d1062
CompPoly/LinearAlgebra/PolynomialMatrix/MuldersStorjohannCorrectness/Reduction.lean
Reduction
3
lemma_delete
null
null
false
0.5
1
1
false
0
inf
0
inf
42
12
5
[ { "theorem_name": "muldersStorjohannReduceWithFuel_shape_preserved", "depth": 1, "n_commands": 0, "n_lines": 12, "is_leaf": true, "centrality": 0, "method": "deleted-dep", "proof_text": " by\n induction fuel generalizing M with\n | zero =>\n simp [muldersStorjohannReduceWithFu...
[ { "name": "muldersStorjohannStep_wellFormed", "text": "theorem muldersStorjohannStep_wellFormed\n {M : PolynomialMatrix F} (shift : Array Nat) {i j : Nat} (hM : WellFormed M) :\n WellFormed (muldersStorjohannStep M shift i j) := by\n simp only [muldersStorjohannStep, Array.getD_eq_getD_getElem?]\n c...
[ { "name": "muldersStorjohannReduceWithFuel_wellFormed", "fan_in": 1, "n_deps_direct": 1, "n_deps_transitive": 1, "n_lines": 15, "n_chars": 538, "n_subproofs": 0, "n_tactics": 11, "cyclomatic": 3, "n_automation": 1, "n_rewrites": 1, "n_structural": 3, "automation_o...
1
/- Copyright (c) 2026 CompPoly Contributors. All rights reserved. Released under Apache 2.0 license as described in the file LICENSE. Authors: Valerii Huhnin -/ import CompPoly.LinearAlgebra.PolynomialMatrix.MuldersStorjohannCorrectness.Combinations /-! # Mulders-Storjohann Correctness Reduction Invariants Shape, we...
/- Copyright (c) 2026 CompPoly Contributors. All rights reserved. Released under Apache 2.0 license as described in the file LICENSE. Authors: Valerii Huhnin -/ import CompPoly.LinearAlgebra.PolynomialMatrix.MuldersStorjohannCorrectness.Combinations /-! # Mulders-Storjohann Correctness Reduction Invariants Shape, we...
@@ -18,6 +18,29 @@ variable {F : Type*} [Field F] [BEq F] [LawfulBEq F] [DecidableEq F] +theorem muldersStorjohannStep_wellFormed + {M : PolynomialMatrix F} (shift : Array Nat) {i j : Nat} (hM : WellFormed M) : + WellFormed (muldersStorjohannStep M shift i j) := by + simp only [muldersStorjohannStep, Array....
{ "repo": "CompPoly", "git_repo": "github.com/Verified-zkEVM/CompPoly", "revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062", "lean_toolchain": "leanprover/lean4:v4.31.0", "proof_assistant": "lean", "ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)", "ablator_flags": [ "--corollary-dele...
ablate_d8c7f7336c2c_4
9ab93ff0e5e1d6ef
lean
lean
github.com/Verified-zkEVM/CompPoly
e95ba1b1cac21ac3e980725abcfb2a0c707d1062
CompPoly/LinearAlgebra/PolynomialMatrix/MuldersStorjohannCorrectness/Reduction.lean
Reduction
4
lemma_delete
null
null
false
0.5
1
1
false
0
inf
0
inf
42
12
5
[ { "theorem_name": "muldersStorjohannReduceWithFuel_shape_preserved", "depth": 1, "n_commands": 0, "n_lines": 12, "is_leaf": true, "centrality": 0, "method": "deleted-dep", "proof_text": " by\n induction fuel generalizing M with\n | zero =>\n simp [muldersStorjohannReduceWithFu...
[ { "name": "muldersStorjohannStep_wellFormed", "text": "theorem muldersStorjohannStep_wellFormed\n {M : PolynomialMatrix F} (shift : Array Nat) {i j : Nat} (hM : WellFormed M) :\n WellFormed (muldersStorjohannStep M shift i j) := by\n simp only [muldersStorjohannStep, Array.getD_eq_getD_getElem?]\n c...
[ { "name": "muldersStorjohannReduce_wellFormed", "fan_in": 0, "n_deps_direct": 1, "n_deps_transitive": 2, "n_lines": 7, "n_chars": 268, "n_subproofs": 0, "n_tactics": 3, "cyclomatic": 1, "n_automation": 0, "n_rewrites": 0, "n_structural": 1, "automation_only": fals...
2
/- Copyright (c) 2026 CompPoly Contributors. All rights reserved. Released under Apache 2.0 license as described in the file LICENSE. Authors: Valerii Huhnin -/ import CompPoly.LinearAlgebra.PolynomialMatrix.MuldersStorjohannCorrectness.Combinations /-! # Mulders-Storjohann Correctness Reduction Invariants Shape, we...
/- Copyright (c) 2026 CompPoly Contributors. All rights reserved. Released under Apache 2.0 license as described in the file LICENSE. Authors: Valerii Huhnin -/ import CompPoly.LinearAlgebra.PolynomialMatrix.MuldersStorjohannCorrectness.Combinations /-! # Mulders-Storjohann Correctness Reduction Invariants Shape, we...
@@ -18,6 +18,29 @@ variable {F : Type*} [Field F] [BEq F] [LawfulBEq F] [DecidableEq F] +theorem muldersStorjohannStep_wellFormed + {M : PolynomialMatrix F} (shift : Array Nat) {i j : Nat} (hM : WellFormed M) : + WellFormed (muldersStorjohannStep M shift i j) := by + simp only [muldersStorjohannStep, Array....
{ "repo": "CompPoly", "git_repo": "github.com/Verified-zkEVM/CompPoly", "revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062", "lean_toolchain": "leanprover/lean4:v4.31.0", "proof_assistant": "lean", "ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)", "ablator_flags": [ "--corollary-dele...
ablate_d8c7f7336c2c_5
8faefd7912d29936
lean
lean
github.com/Verified-zkEVM/CompPoly
e95ba1b1cac21ac3e980725abcfb2a0c707d1062
CompPoly/LinearAlgebra/PolynomialMatrix/MuldersStorjohannCorrectness/Reduction.lean
Reduction
5
lemma_delete
null
null
false
0.5
1
1
false
0
inf
0
inf
42
12
5
[ { "theorem_name": "muldersStorjohannReduceWithFuel_shape_preserved", "depth": 1, "n_commands": 0, "n_lines": 12, "is_leaf": true, "centrality": 0, "method": "deleted-dep", "proof_text": " by\n induction fuel generalizing M with\n | zero =>\n simp [muldersStorjohannReduceWithFu...
[ { "name": "muldersStorjohannStep_wellFormed", "text": "theorem muldersStorjohannStep_wellFormed\n {M : PolynomialMatrix F} (shift : Array Nat) {i j : Nat} (hM : WellFormed M) :\n WellFormed (muldersStorjohannStep M shift i j) := by\n simp only [muldersStorjohannStep, Array.getD_eq_getD_getElem?]\n c...
[ { "name": "muldersStorjohannReduceWithFuel_no_conflict_of_measure_lt", "fan_in": 1, "n_deps_direct": 1, "n_deps_transitive": 1, "n_lines": 24, "n_chars": 927, "n_subproofs": 2, "n_tactics": 18, "cyclomatic": 4, "n_automation": 3, "n_rewrites": 1, "n_structural": 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.PolynomialMatrix.MuldersStorjohannCorrectness.Combinations /-! # Mulders-Storjohann Correctness Reduction Invariants Shape, we...
/- Copyright (c) 2026 CompPoly Contributors. All rights reserved. Released under Apache 2.0 license as described in the file LICENSE. Authors: Valerii Huhnin -/ import CompPoly.LinearAlgebra.PolynomialMatrix.MuldersStorjohannCorrectness.Combinations /-! # Mulders-Storjohann Correctness Reduction Invariants Shape, we...
@@ -18,6 +18,29 @@ variable {F : Type*} [Field F] [BEq F] [LawfulBEq F] [DecidableEq F] +theorem muldersStorjohannStep_wellFormed + {M : PolynomialMatrix F} (shift : Array Nat) {i j : Nat} (hM : WellFormed M) : + WellFormed (muldersStorjohannStep M shift i j) := by + simp only [muldersStorjohannStep, Array....
{ "repo": "CompPoly", "git_repo": "github.com/Verified-zkEVM/CompPoly", "revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062", "lean_toolchain": "leanprover/lean4:v4.31.0", "proof_assistant": "lean", "ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)", "ablator_flags": [ "--corollary-dele...
ablate_d8c7f7336c2c_6
9600d08b1feed14b
lean
lean
github.com/Verified-zkEVM/CompPoly
e95ba1b1cac21ac3e980725abcfb2a0c707d1062
CompPoly/LinearAlgebra/PolynomialMatrix/MuldersStorjohannCorrectness/Reduction.lean
Reduction
6
lemma_delete
null
null
false
0.5
1
1
false
0
inf
0
inf
42
12
5
[ { "theorem_name": "muldersStorjohannReduceWithFuel_shape_preserved", "depth": 1, "n_commands": 0, "n_lines": 12, "is_leaf": true, "centrality": 0, "method": "deleted-dep", "proof_text": " by\n induction fuel generalizing M with\n | zero =>\n simp [muldersStorjohannReduceWithFu...
[ { "name": "muldersStorjohannStep_wellFormed", "text": "theorem muldersStorjohannStep_wellFormed\n {M : PolynomialMatrix F} (shift : Array Nat) {i j : Nat} (hM : WellFormed M) :\n WellFormed (muldersStorjohannStep M shift i j) := by\n simp only [muldersStorjohannStep, Array.getD_eq_getD_getElem?]\n c...
[ { "name": "muldersStorjohannReduce_no_conflict", "fan_in": 1, "n_deps_direct": 1, "n_deps_transitive": 2, "n_lines": 8, "n_chars": 365, "n_subproofs": 0, "n_tactics": 4, "cyclomatic": 1, "n_automation": 0, "n_rewrites": 0, "n_structural": 1, "automation_only": fal...
2
/- Copyright (c) 2026 CompPoly Contributors. All rights reserved. Released under Apache 2.0 license as described in the file LICENSE. Authors: Valerii Huhnin -/ import CompPoly.LinearAlgebra.PolynomialMatrix.MuldersStorjohannCorrectness.Combinations /-! # Mulders-Storjohann Correctness Reduction Invariants Shape, we...
/- Copyright (c) 2026 CompPoly Contributors. All rights reserved. Released under Apache 2.0 license as described in the file LICENSE. Authors: Valerii Huhnin -/ import CompPoly.LinearAlgebra.PolynomialMatrix.MuldersStorjohannCorrectness.Combinations /-! # Mulders-Storjohann Correctness Reduction Invariants Shape, we...
@@ -18,6 +18,29 @@ variable {F : Type*} [Field F] [BEq F] [LawfulBEq F] [DecidableEq F] +theorem muldersStorjohannStep_wellFormed + {M : PolynomialMatrix F} (shift : Array Nat) {i j : Nat} (hM : WellFormed M) : + WellFormed (muldersStorjohannStep M shift i j) := by + simp only [muldersStorjohannStep, Array....
{ "repo": "CompPoly", "git_repo": "github.com/Verified-zkEVM/CompPoly", "revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062", "lean_toolchain": "leanprover/lean4:v4.31.0", "proof_assistant": "lean", "ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)", "ablator_flags": [ "--corollary-dele...
ablate_d8c7f7336c2c_7
501eebcc0a3f17f1
lean
lean
github.com/Verified-zkEVM/CompPoly
e95ba1b1cac21ac3e980725abcfb2a0c707d1062
CompPoly/LinearAlgebra/PolynomialMatrix/MuldersStorjohannCorrectness/Reduction.lean
Reduction
7
lemma_delete
null
null
false
0.5
1
1
false
0
inf
0
inf
42
12
5
[ { "theorem_name": "muldersStorjohannReduceWithFuel_shape_preserved", "depth": 1, "n_commands": 0, "n_lines": 12, "is_leaf": true, "centrality": 0, "method": "deleted-dep", "proof_text": " by\n induction fuel generalizing M with\n | zero =>\n simp [muldersStorjohannReduceWithFu...
[ { "name": "muldersStorjohannStep_wellFormed", "text": "theorem muldersStorjohannStep_wellFormed\n {M : PolynomialMatrix F} (shift : Array Nat) {i j : Nat} (hM : WellFormed M) :\n WellFormed (muldersStorjohannStep M shift i j) := by\n simp only [muldersStorjohannStep, Array.getD_eq_getD_getElem?]\n c...
[ { "name": "muldersStorjohannReduceWithFuel_rowSpan_subset", "fan_in": 1, "n_deps_direct": 2, "n_deps_transitive": 3, "n_lines": 19, "n_chars": 690, "n_subproofs": 0, "n_tactics": 15, "cyclomatic": 3, "n_automation": 1, "n_rewrites": 1, "n_structural": 5, "automati...
3
/- Copyright (c) 2026 CompPoly Contributors. All rights reserved. Released under Apache 2.0 license as described in the file LICENSE. Authors: Valerii Huhnin -/ import CompPoly.LinearAlgebra.PolynomialMatrix.MuldersStorjohannCorrectness.Combinations /-! # Mulders-Storjohann Correctness Reduction Invariants Shape, we...
/- Copyright (c) 2026 CompPoly Contributors. All rights reserved. Released under Apache 2.0 license as described in the file LICENSE. Authors: Valerii Huhnin -/ import CompPoly.LinearAlgebra.PolynomialMatrix.MuldersStorjohannCorrectness.Combinations /-! # Mulders-Storjohann Correctness Reduction Invariants Shape, we...
@@ -78,6 +78,29 @@ · exact replaceRow_rows_mem_rowSpan hM (cancelShiftedLeadingTerm_mem_rowSpan hrowI hrowJ) hrow +theorem muldersStorjohannStep_wellFormed + {M : PolynomialMatrix F} (shift : Array Nat) {i j : Nat} (hM : WellFormed M) : + WellFormed (muldersStorjohannStep M shift i...
{ "repo": "CompPoly", "git_repo": "github.com/Verified-zkEVM/CompPoly", "revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062", "lean_toolchain": "leanprover/lean4:v4.31.0", "proof_assistant": "lean", "ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)", "ablator_flags": [ "--corollary-dele...
ablate_d8c7f7336c2c_8
2d848626d6775904
lean
lean
github.com/Verified-zkEVM/CompPoly
e95ba1b1cac21ac3e980725abcfb2a0c707d1062
CompPoly/LinearAlgebra/PolynomialMatrix/MuldersStorjohannCorrectness/Reduction.lean
Reduction
8
lemma_delete
null
null
false
0.5
1
1
false
0
inf
0
inf
42
12
5
[ { "theorem_name": "muldersStorjohannReduceWithFuel_shape_preserved", "depth": 1, "n_commands": 0, "n_lines": 12, "is_leaf": true, "centrality": 0, "method": "deleted-dep", "proof_text": " by\n induction fuel generalizing M with\n | zero =>\n simp [muldersStorjohannReduceWithFu...
[ { "name": "muldersStorjohannStep_wellFormed", "text": "theorem muldersStorjohannStep_wellFormed\n {M : PolynomialMatrix F} (shift : Array Nat) {i j : Nat} (hM : WellFormed M) :\n WellFormed (muldersStorjohannStep M shift i j) := by\n simp only [muldersStorjohannStep, Array.getD_eq_getD_getElem?]\n c...
[ { "name": "muldersStorjohannReduce_rowSpan_subset", "fan_in": 1, "n_deps_direct": 1, "n_deps_transitive": 4, "n_lines": 7, "n_chars": 287, "n_subproofs": 0, "n_tactics": 3, "cyclomatic": 1, "n_automation": 0, "n_rewrites": 0, "n_structural": 1, "automation_only": ...
4
/- Copyright (c) 2026 CompPoly Contributors. All rights reserved. Released under Apache 2.0 license as described in the file LICENSE. Authors: Valerii Huhnin -/ import CompPoly.LinearAlgebra.PolynomialMatrix.MuldersStorjohannCorrectness.Combinations /-! # Mulders-Storjohann Correctness Reduction Invariants Shape, we...
/- Copyright (c) 2026 CompPoly Contributors. All rights reserved. Released under Apache 2.0 license as described in the file LICENSE. Authors: Valerii Huhnin -/ import CompPoly.LinearAlgebra.PolynomialMatrix.MuldersStorjohannCorrectness.Combinations /-! # Mulders-Storjohann Correctness Reduction Invariants Shape, we...
@@ -78,6 +78,29 @@ · exact replaceRow_rows_mem_rowSpan hM (cancelShiftedLeadingTerm_mem_rowSpan hrowI hrowJ) hrow +theorem muldersStorjohannStep_wellFormed + {M : PolynomialMatrix F} (shift : Array Nat) {i j : Nat} (hM : WellFormed M) : + WellFormed (muldersStorjohannStep M shift i...
{ "repo": "CompPoly", "git_repo": "github.com/Verified-zkEVM/CompPoly", "revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062", "lean_toolchain": "leanprover/lean4:v4.31.0", "proof_assistant": "lean", "ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)", "ablator_flags": [ "--corollary-dele...
ablate_d8c7f7336c2c_9
6ddd0dfce565d1b5
lean
lean
github.com/Verified-zkEVM/CompPoly
e95ba1b1cac21ac3e980725abcfb2a0c707d1062
CompPoly/LinearAlgebra/PolynomialMatrix/MuldersStorjohannCorrectness/Reduction.lean
Reduction
9
lemma_delete
null
null
false
0.5
1
1
false
0
inf
0
inf
42
12
5
[ { "theorem_name": "muldersStorjohannReduceWithFuel_shape_preserved", "depth": 1, "n_commands": 0, "n_lines": 12, "is_leaf": true, "centrality": 0, "method": "deleted-dep", "proof_text": " by\n induction fuel generalizing M with\n | zero =>\n simp [muldersStorjohannReduceWithFu...
[ { "name": "muldersStorjohannStep_wellFormed", "text": "theorem muldersStorjohannStep_wellFormed\n {M : PolynomialMatrix F} (shift : Array Nat) {i j : Nat} (hM : WellFormed M) :\n WellFormed (muldersStorjohannStep M shift i j) := by\n simp only [muldersStorjohannStep, Array.getD_eq_getD_getElem?]\n c...
[ { "name": "muldersStorjohannReduceWithFuel_rowSpan_superset", "fan_in": 1, "n_deps_direct": 2, "n_deps_transitive": 3, "n_lines": 21, "n_chars": 823, "n_subproofs": 1, "n_tactics": 17, "cyclomatic": 4, "n_automation": 2, "n_rewrites": 1, "n_structural": 6, "automa...
3
/- Copyright (c) 2026 CompPoly Contributors. All rights reserved. Released under Apache 2.0 license as described in the file LICENSE. Authors: Valerii Huhnin -/ import CompPoly.LinearAlgebra.PolynomialMatrix.MuldersStorjohannCorrectness.Combinations /-! # Mulders-Storjohann Correctness Reduction Invariants Shape, we...
/- Copyright (c) 2026 CompPoly Contributors. All rights reserved. Released under Apache 2.0 license as described in the file LICENSE. Authors: Valerii Huhnin -/ import CompPoly.LinearAlgebra.PolynomialMatrix.MuldersStorjohannCorrectness.Combinations /-! # Mulders-Storjohann Correctness Reduction Invariants Shape, we...
@@ -161,6 +161,29 @@ · have hne' : i ≠ k := fun h ↦ hki h.symm exact matrix_row_mem_rowSpan hreplaceI_wf (replaceRow_oldRow_mem hkM hne') +theorem muldersStorjohannStep_wellFormed + {M : PolynomialMatrix F} (shift : Array Nat) {i j : Nat} (hM : WellFormed M) : + WellFormed (mulde...
{ "repo": "CompPoly", "git_repo": "github.com/Verified-zkEVM/CompPoly", "revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062", "lean_toolchain": "leanprover/lean4:v4.31.0", "proof_assistant": "lean", "ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)", "ablator_flags": [ "--corollary-dele...
ablate_d8c7f7336c2c_10
0c4cd6125380f25f
lean
lean
github.com/Verified-zkEVM/CompPoly
e95ba1b1cac21ac3e980725abcfb2a0c707d1062
CompPoly/LinearAlgebra/PolynomialMatrix/MuldersStorjohannCorrectness/Reduction.lean
Reduction
10
lemma_delete
null
null
false
0.5
1
1
false
0
inf
0
inf
42
12
5
[ { "theorem_name": "muldersStorjohannReduceWithFuel_shape_preserved", "depth": 1, "n_commands": 0, "n_lines": 12, "is_leaf": true, "centrality": 0, "method": "deleted-dep", "proof_text": " by\n induction fuel generalizing M with\n | zero =>\n simp [muldersStorjohannReduceWithFu...
[ { "name": "muldersStorjohannStep_wellFormed", "text": "theorem muldersStorjohannStep_wellFormed\n {M : PolynomialMatrix F} (shift : Array Nat) {i j : Nat} (hM : WellFormed M) :\n WellFormed (muldersStorjohannStep M shift i j) := by\n simp only [muldersStorjohannStep, Array.getD_eq_getD_getElem?]\n c...
[ { "name": "muldersStorjohannReduce_rowSpan_superset", "fan_in": 1, "n_deps_direct": 1, "n_deps_transitive": 4, "n_lines": 7, "n_chars": 291, "n_subproofs": 0, "n_tactics": 3, "cyclomatic": 1, "n_automation": 0, "n_rewrites": 0, "n_structural": 1, "automation_only"...
4
/- Copyright (c) 2026 CompPoly Contributors. All rights reserved. Released under Apache 2.0 license as described in the file LICENSE. Authors: Valerii Huhnin -/ import CompPoly.LinearAlgebra.PolynomialMatrix.MuldersStorjohannCorrectness.Combinations /-! # Mulders-Storjohann Correctness Reduction Invariants Shape, we...
/- Copyright (c) 2026 CompPoly Contributors. All rights reserved. Released under Apache 2.0 license as described in the file LICENSE. Authors: Valerii Huhnin -/ import CompPoly.LinearAlgebra.PolynomialMatrix.MuldersStorjohannCorrectness.Combinations /-! # Mulders-Storjohann Correctness Reduction Invariants Shape, we...
@@ -161,6 +161,29 @@ · have hne' : i ≠ k := fun h ↦ hki h.symm exact matrix_row_mem_rowSpan hreplaceI_wf (replaceRow_oldRow_mem hkM hne') +theorem muldersStorjohannStep_wellFormed + {M : PolynomialMatrix F} (shift : Array Nat) {i j : Nat} (hM : WellFormed M) : + WellFormed (mulde...
{ "repo": "CompPoly", "git_repo": "github.com/Verified-zkEVM/CompPoly", "revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062", "lean_toolchain": "leanprover/lean4:v4.31.0", "proof_assistant": "lean", "ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)", "ablator_flags": [ "--corollary-dele...
ablate_d8c7f7336c2c_11
85f13ce9f2773134
lean
lean
github.com/Verified-zkEVM/CompPoly
e95ba1b1cac21ac3e980725abcfb2a0c707d1062
CompPoly/LinearAlgebra/PolynomialMatrix/MuldersStorjohannCorrectness/Reduction.lean
Reduction
11
lemma_delete
null
null
false
0.5
1
1
false
0
inf
0
inf
42
12
5
[ { "theorem_name": "muldersStorjohannReduceWithFuel_shape_preserved", "depth": 1, "n_commands": 0, "n_lines": 12, "is_leaf": true, "centrality": 0, "method": "deleted-dep", "proof_text": " by\n induction fuel generalizing M with\n | zero =>\n simp [muldersStorjohannReduceWithFu...
[ { "name": "muldersStorjohannStep_wellFormed", "text": "theorem muldersStorjohannStep_wellFormed\n {M : PolynomialMatrix F} (shift : Array Nat) {i j : Nat} (hM : WellFormed M) :\n WellFormed (muldersStorjohannStep M shift i j) := by\n simp only [muldersStorjohannStep, Array.getD_eq_getD_getElem?]\n c...
[ { "name": "muldersStorjohannReduce_shape_preserved", "fan_in": 0, "n_deps_direct": 1, "n_deps_transitive": 3, "n_lines": 7, "n_chars": 295, "n_subproofs": 0, "n_tactics": 3, "cyclomatic": 1, "n_automation": 0, "n_rewrites": 0, "n_structural": 1, "automation_only":...
3
/- Copyright (c) 2026 CompPoly Contributors. All rights reserved. Released under Apache 2.0 license as described in the file LICENSE. Authors: Valerii Huhnin -/ import CompPoly.LinearAlgebra.PolynomialMatrix.MuldersStorjohannCorrectness.Combinations /-! # Mulders-Storjohann Correctness Reduction Invariants Shape, we...
/- Copyright (c) 2026 CompPoly Contributors. All rights reserved. Released under Apache 2.0 license as described in the file LICENSE. Authors: Valerii Huhnin -/ import CompPoly.LinearAlgebra.PolynomialMatrix.MuldersStorjohannCorrectness.Combinations /-! # Mulders-Storjohann Correctness Reduction Invariants Shape, we...
@@ -41,6 +41,29 @@ simpa [Array.getD_eq_getD_getElem?] using cancelShiftedLeadingTerm_size_of_wellFormed hM hi hj shift +theorem muldersStorjohannStep_wellFormed + {M : PolynomialMatrix F} (shift : Array Nat) {i j : Nat} (hM : WellFormed M) : + WellFormed (muldersStorjohannStep M shi...
{ "repo": "CompPoly", "git_repo": "github.com/Verified-zkEVM/CompPoly", "revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062", "lean_toolchain": "leanprover/lean4:v4.31.0", "proof_assistant": "lean", "ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)", "ablator_flags": [ "--corollary-dele...
ablate_d8c7f7336c2c_12
47f10435d6a79bae
lean
lean
github.com/Verified-zkEVM/CompPoly
e95ba1b1cac21ac3e980725abcfb2a0c707d1062
CompPoly/LinearAlgebra/PolynomialMatrix/MuldersStorjohannCorrectness/Reduction.lean
Reduction
12
lemma_delete
null
null
false
0.5
1
1
false
0
inf
0
inf
42
12
5
[ { "theorem_name": "muldersStorjohannReduceWithFuel_shape_preserved", "depth": 1, "n_commands": 0, "n_lines": 12, "is_leaf": true, "centrality": 0, "method": "deleted-dep", "proof_text": " by\n induction fuel generalizing M with\n | zero =>\n simp [muldersStorjohannReduceWithFu...
[ { "name": "muldersStorjohannStep_wellFormed", "text": "theorem muldersStorjohannStep_wellFormed\n {M : PolynomialMatrix F} (shift : Array Nat) {i j : Nat} (hM : WellFormed M) :\n WellFormed (muldersStorjohannStep M shift i j) := by\n simp only [muldersStorjohannStep, Array.getD_eq_getD_getElem?]\n c...
[ { "name": "muldersStorjohannReduce_rowSpan_eq", "fan_in": 0, "n_deps_direct": 2, "n_deps_transitive": 8, "n_lines": 8, "n_chars": 331, "n_subproofs": 0, "n_tactics": 4, "cyclomatic": 1, "n_automation": 0, "n_rewrites": 0, "n_structural": 3, "automation_only": fals...
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.LinearAlgebra.PolynomialMatrix.MuldersStorjohannCorrectness.Combinations /-! # Mulders-Storjohann Correctness Reduction Invariants Shape, we...
/- Copyright (c) 2026 CompPoly Contributors. All rights reserved. Released under Apache 2.0 license as described in the file LICENSE. Authors: Valerii Huhnin -/ import CompPoly.LinearAlgebra.PolynomialMatrix.MuldersStorjohannCorrectness.Combinations /-! # Mulders-Storjohann Correctness Reduction Invariants Shape, we...
@@ -198,6 +198,29 @@ · have hne' : i ≠ k := fun h ↦ hki h.symm exact matrix_row_mem_rowSpan hreplaceI_wf (replaceRow_oldRow_mem hkM hne') +theorem muldersStorjohannStep_wellFormed + {M : PolynomialMatrix F} (shift : Array Nat) {i j : Nat} (hM : WellFormed M) : + WellFormed (mulde...
{ "repo": "CompPoly", "git_repo": "github.com/Verified-zkEVM/CompPoly", "revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062", "lean_toolchain": "leanprover/lean4:v4.31.0", "proof_assistant": "lean", "ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)", "ablator_flags": [ "--corollary-dele...
ablate_d8c7f7336c2c_13
2b2f8d0fa58f1b37
lean
lean
github.com/Verified-zkEVM/CompPoly
e95ba1b1cac21ac3e980725abcfb2a0c707d1062
CompPoly/LinearAlgebra/PolynomialMatrix/MuldersStorjohannCorrectness/Reduction.lean
Reduction
13
lemma_delete
null
null
false
0.5
1
1
false
0
inf
0
inf
42
12
5
[ { "theorem_name": "muldersStorjohannReduceWithFuel_shape_preserved", "depth": 1, "n_commands": 0, "n_lines": 12, "is_leaf": true, "centrality": 0, "method": "deleted-dep", "proof_text": " by\n induction fuel generalizing M with\n | zero =>\n simp [muldersStorjohannReduceWithFu...
[ { "name": "muldersStorjohannStep_wellFormed", "text": "theorem muldersStorjohannStep_wellFormed\n {M : PolynomialMatrix F} (shift : Array Nat) {i j : Nat} (hM : WellFormed M) :\n WellFormed (muldersStorjohannStep M shift i j) := by\n simp only [muldersStorjohannStep, Array.getD_eq_getD_getElem?]\n c...
[ { "name": "muldersStorjohannReduce_weakPopov", "fan_in": 0, "n_deps_direct": 1, "n_deps_transitive": 3, "n_lines": 8, "n_chars": 324, "n_subproofs": 0, "n_tactics": 3, "cyclomatic": 1, "n_automation": 0, "n_rewrites": 0, "n_structural": 1, "automation_only": false...
3
/- Copyright (c) 2026 CompPoly Contributors. All rights reserved. Released under Apache 2.0 license as described in the file LICENSE. Authors: Valerii Huhnin -/ import CompPoly.LinearAlgebra.PolynomialMatrix.MuldersStorjohannCorrectness.Combinations /-! # Mulders-Storjohann Correctness Reduction Invariants Shape, we...
/- Copyright (c) 2026 CompPoly Contributors. All rights reserved. Released under Apache 2.0 license as described in the file LICENSE. Authors: Valerii Huhnin -/ import CompPoly.LinearAlgebra.PolynomialMatrix.MuldersStorjohannCorrectness.Combinations /-! # Mulders-Storjohann Correctness Reduction Invariants Shape, we...
@@ -18,6 +18,29 @@ variable {F : Type*} [Field F] [BEq F] [LawfulBEq F] [DecidableEq F] +theorem muldersStorjohannStep_wellFormed + {M : PolynomialMatrix F} (shift : Array Nat) {i j : Nat} (hM : WellFormed M) : + WellFormed (muldersStorjohannStep M shift i j) := by + simp only [muldersStorjohannStep, Array....
{ "repo": "CompPoly", "git_repo": "github.com/Verified-zkEVM/CompPoly", "revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062", "lean_toolchain": "leanprover/lean4:v4.31.0", "proof_assistant": "lean", "ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)", "ablator_flags": [ "--corollary-dele...
ablate_48dee685fdd3_1
9970a1706fbdde8a
lean
lean
github.com/Verified-zkEVM/CompPoly
e95ba1b1cac21ac3e980725abcfb2a0c707d1062
CompPoly/Multivariate/CMvPolynomial.lean
CMvPolynomial
1
lemma_delete
null
null
false
0.5
1
1
false
0
inf
0
inf
42
2
1
[ { "theorem_name": "fromUnlawful_fold_eq_fold_fromUnlawful", "depth": 1, "n_commands": 0, "n_lines": 4, "is_leaf": true, "centrality": 0, "method": "deleted-dep", "proof_text": " by\n simp only [ExtTreeMap.foldl_eq_foldl_toList]\n erw [fromUnlawful_fold_eq_fold_fromUnlawful₀ 0]\n s...
[ { "name": "fromUnlawful_fold_eq_fold_fromUnlawful₀", "text": "/-- Auxiliary lemma showing that conversion from unlawful polynomials respects the sum fold. -/\nlemma fromUnlawful_fold_eq_fold_fromUnlawful₀\n {t : List (CMvMonomial n × R)} {f : CMvMonomial n → R → Unlawful n R} :\n ∀ init : Unlawful n R...
[ { "name": "fromUnlawful_fold_eq_fold_fromUnlawful", "fan_in": 0, "n_deps_direct": 1, "n_deps_transitive": 4, "n_lines": 11, "n_chars": 479, "n_subproofs": 0, "n_tactics": 4, "cyclomatic": 1, "n_automation": 2, "n_rewrites": 1, "n_structural": 0, "automation_only":...
2
/- Copyright (c) 2025 CompPoly. All rights reserved. Released under Apache 2.0 license as described in the file LICENSE. Authors: Frantisek Silvasi, Julian Sutherland, Andrei Burdușa, Derek Sorensen, Dimitris Mitsios -/ import CompPoly.Multivariate.Lawful import CompPoly.Univariate.Basic import Mathlib.Algebra.Algebra....
/- Copyright (c) 2025 CompPoly. All rights reserved. Released under Apache 2.0 license as described in the file LICENSE. Authors: Frantisek Silvasi, Julian Sutherland, Andrei Burdușa, Derek Sorensen, Dimitris Mitsios -/ import CompPoly.Multivariate.Lawful import CompPoly.Univariate.Basic import Mathlib.Algebra.Algebra....
@@ -95,12 +95,32 @@ @[simp, grind =] lemma coeff_add : coeff m (p + q) = coeff m p + coeff m q := by simp only [coeff, add_getD?] +/-- Auxiliary lemma showing that conversion from unlawful polynomials respects the sum fold. -/ +lemma fromUnlawful_fold_eq_fold_fromUnlawful₀ + {t : List (CMvMonomial n × R)} {f : 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_20667c3b75aa_0
a02d1a54d2f038fe
lean
lean
github.com/Verified-zkEVM/CompPoly
e95ba1b1cac21ac3e980725abcfb2a0c707d1062
CompPoly/Univariate/NTT/Kernel.lean
Kernel
0
lemma_delete
null
null
false
0.5
1
1
false
0
inf
0
inf
42
5
1
[ { "theorem_name": "kernel_term_eq", "depth": 1, "n_commands": 0, "n_lines": 5, "is_leaf": true, "centrality": 0, "method": "deleted-dep", "proof_text": " by\n rw [omegaInv_pow_mul_eq D hi k]\n rw [← pow_add]\n congr 1\n ring", "n_chars": 73, "n_subproofs": 0, "n_tacti...
[ { "name": "omegaInv_pow_mul_eq", "text": "/-- Rewrite powers of the inverse root as powers of the forward root. -/\ntheorem omegaInv_pow_mul_eq (D : Domain R) {i : Nat} (hi : i < D.n) (k : Nat) :\n D.omegaInv ^ (i * k) = D.omega ^ ((D.n - i) * k) := by\n rw [show D.omegaInv ^ (i * k) = (D.omegaInv ^ i) ...
[ { "name": "kernel_term_eq", "fan_in": 1, "n_deps_direct": 1, "n_deps_transitive": 1, "n_lines": 10, "n_chars": 305, "n_subproofs": 0, "n_tactics": 5, "cyclomatic": 1, "n_automation": 1, "n_rewrites": 3, "n_structural": 0, "automation_only": false, "max_nesting...
1
/- Copyright (c) 2026 CompPoly. All rights reserved. Released under Apache 2.0 license as described in the file LICENSE. Authors: Salih Erdem Koçak, Doran Pamukçu, Valerii Huhnin -/ import CompPoly.Univariate.NTT.Domain import Mathlib.Algebra.Field.GeomSum /-! # NTT Kernel Identities Shared root-of-unity orthogonalit...
/- 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, Valerii Huhnin -/ import CompPoly.Univariate.NTT.Domain import Mathlib.Algebra.Field.GeomSum /-! # NTT Kernel Identities Shared root-of-unity orthogonalit...
@@ -21,10 +21,28 @@ open scoped BigOperators +/-- Rewrite powers of the inverse root as powers of the forward root. -/ +theorem omegaInv_pow_mul_eq (D : Domain R) {i : Nat} (hi : i < D.n) (k : Nat) : + D.omegaInv ^ (i * k) = D.omega ^ ((D.n - i) * k) := by + rw [show D.omegaInv ^ (i * k) = (D.omegaInv ^ i) ^ k...
{ "repo": "CompPoly", "git_repo": "github.com/Verified-zkEVM/CompPoly", "revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062", "lean_toolchain": "leanprover/lean4:v4.31.0", "proof_assistant": "lean", "ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)", "ablator_flags": [ "--corollary-dele...
ablate_20667c3b75aa_1
bb9be35296ddef73
lean
lean
github.com/Verified-zkEVM/CompPoly
e95ba1b1cac21ac3e980725abcfb2a0c707d1062
CompPoly/Univariate/NTT/Kernel.lean
Kernel
1
lemma_delete
null
null
false
0.5
1
1
false
0
inf
0
inf
42
5
1
[ { "theorem_name": "kernel_sum_eq_if", "depth": 1, "n_commands": 0, "n_lines": 14, "is_leaf": true, "centrality": 0, "method": "deleted-dep", "proof_text": " by\n calc\n (∑ k : D.Idx, D.omega ^ ((k : Nat) * (j : Nat)) *\n D.omegaInv ^ ((i : Nat) * (k : Nat))) =\n ∑ k...
[ { "name": "omega_sum_pow_mul_eq_if_dvd", "text": "/-- Sum of powers over the NTT domain, expressed by divisibility of the exponent. -/\ntheorem omega_sum_pow_mul_eq_if_dvd (D : Domain R) (m : Nat) :\n (∑ k : D.Idx, D.omega ^ (m * (k : Nat))) = if D.n ∣ m then (D.n : R) else 0 := by\n by_cases hdiv : D.n...
[ { "name": "kernel_sum_eq_if", "fan_in": 1, "n_deps_direct": 3, "n_deps_transitive": 4, "n_lines": 20, "n_chars": 972, "n_subproofs": 0, "n_tactics": 14, "cyclomatic": 1, "n_automation": 1, "n_rewrites": 2, "n_structural": 5, "automation_only": false, "max_nest...
4
/- Copyright (c) 2026 CompPoly. All rights reserved. Released under Apache 2.0 license as described in the file LICENSE. Authors: Salih Erdem Koçak, Doran Pamukçu, Valerii Huhnin -/ import CompPoly.Univariate.NTT.Domain import Mathlib.Algebra.Field.GeomSum /-! # NTT Kernel Identities Shared root-of-unity orthogonalit...
/- 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, Valerii Huhnin -/ import CompPoly.Univariate.NTT.Domain import Mathlib.Algebra.Field.GeomSum /-! # NTT Kernel Identities Shared root-of-unity orthogonalit...
@@ -44,6 +44,41 @@ congr 1 ring +/-- Sum of powers over the NTT domain, expressed by divisibility of the exponent. -/ +theorem omega_sum_pow_mul_eq_if_dvd (D : Domain R) (m : Nat) : + (∑ k : D.Idx, D.omega ^ (m * (k : Nat))) = if D.n ∣ m then (D.n : R) else 0 := by + by_cases hdiv : D.n ∣ m + · rw [if_pos ...
{ "repo": "CompPoly", "git_repo": "github.com/Verified-zkEVM/CompPoly", "revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062", "lean_toolchain": "leanprover/lean4:v4.31.0", "proof_assistant": "lean", "ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)", "ablator_flags": [ "--corollary-dele...
ablate_20667c3b75aa_2
35cdd2497a401f20
lean
lean
github.com/Verified-zkEVM/CompPoly
e95ba1b1cac21ac3e980725abcfb2a0c707d1062
CompPoly/Univariate/NTT/Kernel.lean
Kernel
2
lemma_delete
null
null
false
0.5
1
1
false
0
inf
0
inf
42
5
1
[ { "theorem_name": "kernel_sum_eq_if", "depth": 1, "n_commands": 0, "n_lines": 14, "is_leaf": true, "centrality": 0, "method": "deleted-dep", "proof_text": " by\n calc\n (∑ k : D.Idx, D.omega ^ ((k : Nat) * (j : Nat)) *\n D.omegaInv ^ ((i : Nat) * (k : Nat))) =\n ∑ k...
[ { "name": "omega_sum_pow_mul_eq_if_dvd", "text": "/-- Sum of powers over the NTT domain, expressed by divisibility of the exponent. -/\ntheorem omega_sum_pow_mul_eq_if_dvd (D : Domain R) (m : Nat) :\n (∑ k : D.Idx, D.omega ^ (m * (k : Nat))) = if D.n ∣ m then (D.n : R) else 0 := by\n by_cases hdiv : D.n...
[ { "name": "kernel_sum_forward_inverse_eq_if", "fan_in": 0, "n_deps_direct": 1, "n_deps_transitive": 5, "n_lines": 9, "n_chars": 407, "n_subproofs": 0, "n_tactics": 5, "cyclomatic": 3, "n_automation": 2, "n_rewrites": 0, "n_structural": 0, "automation_only": false,...
5
/- 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, Valerii Huhnin -/ import CompPoly.Univariate.NTT.Domain import Mathlib.Algebra.Field.GeomSum /-! # NTT Kernel Identities Shared root-of-unity orthogonalit...
/- 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, Valerii Huhnin -/ import CompPoly.Univariate.NTT.Domain import Mathlib.Algebra.Field.GeomSum /-! # NTT Kernel Identities Shared root-of-unity orthogonalit...
@@ -44,6 +44,41 @@ congr 1 ring +/-- Sum of powers over the NTT domain, expressed by divisibility of the exponent. -/ +theorem omega_sum_pow_mul_eq_if_dvd (D : Domain R) (m : Nat) : + (∑ k : D.Idx, D.omega ^ (m * (k : Nat))) = if D.n ∣ m then (D.n : R) else 0 := by + by_cases hdiv : D.n ∣ m + · rw [if_pos ...
{ "repo": "CompPoly", "git_repo": "github.com/Verified-zkEVM/CompPoly", "revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062", "lean_toolchain": "leanprover/lean4:v4.31.0", "proof_assistant": "lean", "ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)", "ablator_flags": [ "--corollary-dele...
ablate_87dee2962695_0
c567fd94d4c52614
lean
lean
github.com/Verified-zkEVM/CompPoly
e95ba1b1cac21ac3e980725abcfb2a0c707d1062
CompPoly/ToMathlib/Polynomial/Roots.lean
Roots
0
lemma_delete
null
null
false
0.5
1
1
false
0
inf
0
inf
42
1
1
[ { "theorem_name": "prod_X_sub_C_dvd_prod_mul_sub", "depth": 1, "n_commands": 0, "n_lines": 5, "is_leaf": true, "centrality": 0, "method": "deleted-dep", "proof_text": " by\n rw [← Finset.prod_sdiff hE, mul_comm]\n exact mul_dvd_mul_left _ (prod_X_sub_C_dvd _ _\n (hinj.mono (Fins...
[ { "name": "prod_X_sub_C_dvd", "text": "/-- `∏ i ∈ s, (X - aᵢ)` divides `p` when the distinct `aᵢ` are all roots of `p`. -/\nlemma prod_X_sub_C_dvd [Field R]\n {ι : Type*} (s : Finset ι) (a : ι → R) (hinj : Set.InjOn a s)\n (p : R[X]) (hr : ∀ i ∈ s, p.eval (a i) = 0) :\n (∏ i ∈ s, (X - C (a i))) ∣ p...
[ { "name": "prod_X_sub_C_dvd_prod_mul_sub", "fan_in": 0, "n_deps_direct": 1, "n_deps_transitive": 1, "n_lines": 12, "n_chars": 641, "n_subproofs": 0, "n_tactics": 5, "cyclomatic": 1, "n_automation": 0, "n_rewrites": 2, "n_structural": 1, "automation_only": false, ...
1
/- Copyright (c) 2026 CompPoly. All rights reserved. Released under Apache 2.0 license as described in the file LICENSE. Authors: Juan Conejero -/ import Mathlib.Algebra.Polynomial.Roots /-! # Root sets of products of distinct linear factors - `∏ i ∈ s, (X - C (a i))` over injectively indexed points: it divides every...
/- Copyright (c) 2026 CompPoly. All rights reserved. Released under Apache 2.0 license as described in the file LICENSE. Authors: Juan Conejero -/ import Mathlib.Algebra.Polynomial.Roots /-! # Root sets of products of distinct linear factors - `∏ i ∈ s, (X - C (a i))` over injectively indexed points: it divides every...
@@ -19,12 +19,26 @@ variable {R : Type*} +/-- `∏ i ∈ s, (X - aᵢ)` divides `p` when the distinct `aᵢ` are all roots of `p`. -/ +lemma prod_X_sub_C_dvd [Field R] + {ι : Type*} (s : Finset ι) (a : ι → R) (hinj : Set.InjOn a s) + (p : R[X]) (hr : ∀ i ∈ s, p.eval (a i) = 0) : + (∏ i ∈ s, (X - C (a i))) ∣ p := ...
{ "repo": "CompPoly", "git_repo": "github.com/Verified-zkEVM/CompPoly", "revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062", "lean_toolchain": "leanprover/lean4:v4.31.0", "proof_assistant": "lean", "ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)", "ablator_flags": [ "--corollary-dele...
ablate_b53e1e5083b5_0
8c28a9d8b4d17c33
lean
lean
github.com/Verified-zkEVM/CompPoly
e95ba1b1cac21ac3e980725abcfb2a0c707d1062
CompPoly/ToMathlib/Finsupp/Fin.lean
Fin
0
lemma_delete
null
null
false
0.5
1
1
false
0
inf
0
inf
42
4
1
[ { "theorem_name": "snoc_ne_zero_iff", "depth": 1, "n_commands": 0, "n_lines": 4, "is_leaf": true, "centrality": 0, "method": "deleted-dep", "proof_text": " by\n refine ⟨fun h => ?_, fun h => h.casesOn snoc_ne_zero_of_left snoc_ne_zero_of_right⟩\n refine imp_iff_not_or.1 fun h' c =>...
[ { "name": "snoc_ne_zero_of_left", "text": "theorem snoc_ne_zero_of_left (h : s ≠ 0) : snoc s y ≠ 0 := by\n contrapose! h with c\n ext a\n simp only [← snoc_castSucc y s a, c, coe_zero, Pi.zero_apply]\n\n", "fan_in": 1, "n_lines": 6, "n_chars": 164, "n_subproofs": 0, "n_tactics": 4, ...
[ { "name": "snoc_ne_zero_iff", "fan_in": 0, "n_deps_direct": 3, "n_deps_transitive": 5, "n_lines": 6, "n_chars": 243, "n_subproofs": 0, "n_tactics": 4, "cyclomatic": 1, "n_automation": 0, "n_rewrites": 1, "n_structural": 2, "automation_only": false, "max_nestin...
2
/- Copyright (c) 2021 Ivan Sadofschi Costa. All rights reserved. Released under Apache 2.0 license as described in the file LICENSE. Authors: Ivan Sadofschi Costa, Quang Dao -/ import Mathlib.Data.Finsupp.Fin import Mathlib.Algebra.BigOperators.Finsupp.Fin /-! # Tuple operations on maps `Fin n →₀ M` We interpret maps...
/- Copyright (c) 2021 Ivan Sadofschi Costa. All rights reserved. Released under Apache 2.0 license as described in the file LICENSE. Authors: Ivan Sadofschi Costa, Quang Dao -/ import Mathlib.Data.Finsupp.Fin import Mathlib.Algebra.BigOperators.Finsupp.Fin /-! # Tuple operations on maps `Fin n →₀ M` We interpret maps...
@@ -174,11 +174,19 @@ -- refine imp_iff_not_or.1 fun h' c => h ?_ -- rw [h', c, Finsupp.cons_zero_zero] +theorem snoc_ne_zero_of_left (h : s ≠ 0) : snoc s y ≠ 0 := by + contrapose! h with c + ext a + simp only [← snoc_castSucc y s a, c, coe_zero, Pi.zero_apply] + theorem snoc_ne_zero_of_right (h : y ≠ 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_b53e1e5083b5_1
a9f021355fb79923
lean
lean
github.com/Verified-zkEVM/CompPoly
e95ba1b1cac21ac3e980725abcfb2a0c707d1062
CompPoly/ToMathlib/Finsupp/Fin.lean
Fin
1
lemma_delete
null
null
false
0.5
1
1
false
0
inf
0
inf
42
4
1
[ { "theorem_name": "insertNth_ne_zero_iff", "depth": 1, "n_commands": 0, "n_lines": 5, "is_leaf": true, "centrality": 0, "method": "deleted-dep", "proof_text": " by\n refine ⟨fun h => ?_,\n fun h => h.casesOn (insertNth_ne_zero_of_left p) (insertNth_ne_zero_of_right p)⟩\n refine ...
[ { "name": "insertNth_ne_zero_of_left", "text": "theorem insertNth_ne_zero_of_left (h : y ≠ 0) : insertNth p y s ≠ 0 := by\n contrapose! h with c\n rw [← insertNth_apply_same p y s, c, Finsupp.coe_zero, Pi.zero_apply]\n\n", "fan_in": 1, "n_lines": 5, "n_chars": 176, "n_subproofs": 0, "n...
[ { "name": "insertNth_ne_zero_iff", "fan_in": 0, "n_deps_direct": 3, "n_deps_transitive": 5, "n_lines": 17, "n_chars": 794, "n_subproofs": 0, "n_tactics": 5, "cyclomatic": 1, "n_automation": 0, "n_rewrites": 1, "n_structural": 2, "automation_only": false, "max_...
2
/- Copyright (c) 2021 Ivan Sadofschi Costa. All rights reserved. Released under Apache 2.0 license as described in the file LICENSE. Authors: Ivan Sadofschi Costa, Quang Dao -/ import Mathlib.Data.Finsupp.Fin import Mathlib.Algebra.BigOperators.Finsupp.Fin /-! # Tuple operations on maps `Fin n →₀ M` We interpret maps...
/- Copyright (c) 2021 Ivan Sadofschi Costa. All rights reserved. Released under Apache 2.0 license as described in the file LICENSE. Authors: Ivan Sadofschi Costa, Quang Dao -/ import Mathlib.Data.Finsupp.Fin import Mathlib.Algebra.BigOperators.Finsupp.Fin /-! # Tuple operations on maps `Fin n →₀ M` We interpret maps...
@@ -174,12 +174,20 @@ -- refine imp_iff_not_or.1 fun h' c => h ?_ -- rw [h', c, Finsupp.cons_zero_zero] +theorem insertNth_ne_zero_of_left (h : y ≠ 0) : insertNth p y s ≠ 0 := by + contrapose! h with c + rw [← insertNth_apply_same p y s, c, Finsupp.coe_zero, Pi.zero_apply] + theorem insertNth_ne_zero_of_righ...
{ "repo": "CompPoly", "git_repo": "github.com/Verified-zkEVM/CompPoly", "revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062", "lean_toolchain": "leanprover/lean4:v4.31.0", "proof_assistant": "lean", "ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)", "ablator_flags": [ "--corollary-dele...
ablate_fb3f4ebb00c9_0
2955cb1b8b3f495f
lean
lean
github.com/Verified-zkEVM/CompPoly
e95ba1b1cac21ac3e980725abcfb2a0c707d1062
CompPoly/Univariate/ReedSolomon/GaoCorrectness.lean
GaoCorrectness
0
lemma_delete
null
null
false
0.5
1
1
false
0
inf
0
inf
42
16
1
[ { "theorem_name": "bezout_solutions_cross_mul", "depth": 1, "n_commands": 0, "n_lines": 6, "is_leaf": true, "centrality": 0, "method": "deleted-dep", "proof_text": " by\n have hcross : V' * G - V * G' = (V' * U - V * U') * g₀ := by rw [← hBez, ← hBez']; ring\n have hlt : (V' * G - ...
[ { "name": "degree_mul_lt_of_bounds", "text": "/-- `deg A + d₀ ≤ deg g₀` and `deg B < d₀` imply `deg (A * B) < deg g₀`. -/\nprivate lemma degree_mul_lt_of_bounds [Semiring F] [NoZeroDivisors F]\n {A B g₀ : F[X]} (hg₀ : g₀ ≠ 0) (d₀ : ℕ)\n (hA : A.degree + d₀ ≤ g₀.degree) (hB : B.degree < d₀) :\n (A *...
[ { "name": "bezout_solutions_cross_mul", "fan_in": 1, "n_deps_direct": 1, "n_deps_transitive": 1, "n_lines": 21, "n_chars": 1180, "n_subproofs": 2, "n_tactics": 7, "cyclomatic": 1, "n_automation": 1, "n_rewrites": 1, "n_structural": 1, "automation_only": false, ...
1
/- Copyright (c) 2026 CompPoly. All rights reserved. Released under Apache 2.0 license as described in the file LICENSE. Authors: Juan Conejero -/ import Mathlib.InformationTheory.Hamming import CompPoly.Univariate.ReedSolomon.GaoDecoder import CompPoly.ToMathlib.Polynomial.Roots /-! # Gao Decoder Correctness Correct...
/- Copyright (c) 2026 CompPoly. All rights reserved. Released under Apache 2.0 license as described in the file LICENSE. Authors: Juan Conejero -/ import Mathlib.InformationTheory.Hamming import CompPoly.Univariate.ReedSolomon.GaoDecoder import CompPoly.ToMathlib.Polynomial.Roots /-! # Gao Decoder Correctness Correct...
@@ -39,6 +39,18 @@ Two degree-bounded solutions of the Bézout identity cross-multiply (`bezout_solutions_cross_mul`), so the quotient `G / V` is unique. -/ +/-- `deg A + d₀ ≤ deg g₀` and `deg B < d₀` imply `deg (A * B) < deg g₀`. -/ +private lemma degree_mul_lt_of_bounds [Semiring F] [NoZeroDivisors F] + {A B 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_fb3f4ebb00c9_1
f1b50c02f0b95c52
lean
lean
github.com/Verified-zkEVM/CompPoly
e95ba1b1cac21ac3e980725abcfb2a0c707d1062
CompPoly/Univariate/ReedSolomon/GaoCorrectness.lean
GaoCorrectness
1
lemma_delete
null
null
false
0.5
1
1
false
0
inf
0
inf
42
16
1
[ { "theorem_name": "disagreement_card_le_error_locator_natDegree", "depth": 1, "n_commands": 0, "n_lines": 4, "is_leaf": true, "centrality": 0, "method": "deleted-dep", "proof_text": "\n (Finset.card_le_card (disagreement_subset_error_locator_zeros s a _ _ U _ _ hroot\n (by rw [mu...
[ { "name": "disagreement_subset_error_locator_zeros", "text": "/-- If `V * (f₁ - g₁) = U * g₀` and `g₀` vanishes on aᵢ, then `V` vanishes at every\naᵢ where `f₁` and `g₁` disagree. -/\nlemma disagreement_subset_error_locator_zeros [CommRing F] [NoZeroDivisors F]\n {ι : Type*} [DecidableEq F] (s : Finset ι...
[ { "name": "disagreement_card_le_error_locator_natDegree", "fan_in": 1, "n_deps_direct": 1, "n_deps_transitive": 1, "n_lines": 12, "n_chars": 775, "n_subproofs": 0, "n_tactics": 4, "cyclomatic": 1, "n_automation": 1, "n_rewrites": 1, "n_structural": 0, "automation_...
1
/- Copyright (c) 2026 CompPoly. All rights reserved. Released under Apache 2.0 license as described in the file LICENSE. Authors: Juan Conejero -/ import Mathlib.InformationTheory.Hamming import CompPoly.Univariate.ReedSolomon.GaoDecoder import CompPoly.ToMathlib.Polynomial.Roots /-! # Gao Decoder Correctness Correct...
/- Copyright (c) 2026 CompPoly. All rights reserved. Released under Apache 2.0 license as described in the file LICENSE. Authors: Juan Conejero -/ import Mathlib.InformationTheory.Hamming import CompPoly.Univariate.ReedSolomon.GaoDecoder import CompPoly.ToMathlib.Polynomial.Roots /-! # Gao Decoder Correctness Correct...
@@ -39,13 +39,28 @@ Two degree-bounded solutions of the Bézout identity cross-multiply (`bezout_solutions_cross_mul`), so the quotient `G / V` is unique. -/ +/-- If `V * (f₁ - g₁) = U * g₀` and `g₀` vanishes on aᵢ, then `V` vanishes at every +aᵢ where `f₁` and `g₁` disagree. -/ +lemma disagreement_subset_error_loca...
{ "repo": "CompPoly", "git_repo": "github.com/Verified-zkEVM/CompPoly", "revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062", "lean_toolchain": "leanprover/lean4:v4.31.0", "proof_assistant": "lean", "ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)", "ablator_flags": [ "--corollary-dele...
ablate_fb3f4ebb00c9_2
6b54ed7b30953e0e
lean
lean
github.com/Verified-zkEVM/CompPoly
e95ba1b1cac21ac3e980725abcfb2a0c707d1062
CompPoly/Univariate/ReedSolomon/GaoCorrectness.lean
GaoCorrectness
2
lemma_delete
null
null
false
0.5
1
1
false
0
inf
0
inf
42
16
1
[ { "theorem_name": "disagreement_card_le_error_locator_natDegree", "depth": 1, "n_commands": 0, "n_lines": 4, "is_leaf": true, "centrality": 0, "method": "deleted-dep", "proof_text": "\n (Finset.card_le_card (disagreement_subset_error_locator_zeros s a _ _ U _ _ hroot\n (by rw [mu...
[ { "name": "disagreement_subset_error_locator_zeros", "text": "/-- If `V * (f₁ - g₁) = U * g₀` and `g₀` vanishes on aᵢ, then `V` vanishes at every\naᵢ where `f₁` and `g₁` disagree. -/\nlemma disagreement_subset_error_locator_zeros [CommRing F] [NoZeroDivisors F]\n {ι : Type*} [DecidableEq F] (s : Finset ι...
[ { "name": "hammingDist_le_error_locator_natDegree", "fan_in": 1, "n_deps_direct": 1, "n_deps_transitive": 2, "n_lines": 22, "n_chars": 1168, "n_subproofs": 1, "n_tactics": 5, "cyclomatic": 1, "n_automation": 1, "n_rewrites": 1, "n_structural": 3, "automation_only"...
2
/- Copyright (c) 2026 CompPoly. All rights reserved. Released under Apache 2.0 license as described in the file LICENSE. Authors: Juan Conejero -/ import Mathlib.InformationTheory.Hamming import CompPoly.Univariate.ReedSolomon.GaoDecoder import CompPoly.ToMathlib.Polynomial.Roots /-! # Gao Decoder Correctness Correct...
/- Copyright (c) 2026 CompPoly. All rights reserved. Released under Apache 2.0 license as described in the file LICENSE. Authors: Juan Conejero -/ import Mathlib.InformationTheory.Hamming import CompPoly.Univariate.ReedSolomon.GaoDecoder import CompPoly.ToMathlib.Polynomial.Roots /-! # Gao Decoder Correctness Correct...
@@ -39,13 +39,28 @@ Two degree-bounded solutions of the Bézout identity cross-multiply (`bezout_solutions_cross_mul`), so the quotient `G / V` is unique. -/ +/-- If `V * (f₁ - g₁) = U * g₀` and `g₀` vanishes on aᵢ, then `V` vanishes at every +aᵢ where `f₁` and `g₁` disagree. -/ +lemma disagreement_subset_error_loca...
{ "repo": "CompPoly", "git_repo": "github.com/Verified-zkEVM/CompPoly", "revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062", "lean_toolchain": "leanprover/lean4:v4.31.0", "proof_assistant": "lean", "ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)", "ablator_flags": [ "--corollary-dele...
ablate_fb3f4ebb00c9_3
c15495e4fe85f949
lean
lean
github.com/Verified-zkEVM/CompPoly
e95ba1b1cac21ac3e980725abcfb2a0c707d1062
CompPoly/Univariate/ReedSolomon/GaoCorrectness.lean
GaoCorrectness
3
lemma_delete
null
null
false
0.5
1
1
false
0
inf
0
inf
42
16
4
[ { "theorem_name": "natDegree_nodalPoly", "depth": 1, "n_commands": 0, "n_lines": 4, "is_leaf": true, "centrality": 0, "method": "deleted-dep", "proof_text": " by\n rw [toPoly_nodalPoly, Polynomial.natDegree_prod _ _ (fun i _ => X_sub_C_ne_zero _)]\n simp only [Fin.getElem_fin, natD...
[ { "name": "toPoly_nodalPoly", "text": "/-- `(nodalPoly D).toPoly = ∏ i, (X - C D.val[i])`. -/\nlemma toPoly_nodalPoly [CommRing F] [Nontrivial F] (D : Domain F) :\n (nodalPoly D).toPoly = ∏ i : Fin D.n, (X - C (D.val[i])) := by\n rw [nodalPoly, ← Array.foldl_toList,\n ← List.foldl_map (f := fun a => ...
[ { "name": "natDegree_nodalPoly", "fan_in": 1, "n_deps_direct": 1, "n_deps_transitive": 1, "n_lines": 8, "n_chars": 411, "n_subproofs": 0, "n_tactics": 4, "cyclomatic": 1, "n_automation": 1, "n_rewrites": 1, "n_structural": 0, "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: Juan Conejero -/ import Mathlib.InformationTheory.Hamming import CompPoly.Univariate.ReedSolomon.GaoDecoder import CompPoly.ToMathlib.Polynomial.Roots /-! # Gao Decoder Correctness Correct...
/- Copyright (c) 2026 CompPoly. All rights reserved. Released under Apache 2.0 license as described in the file LICENSE. Authors: Juan Conejero -/ import Mathlib.InformationTheory.Hamming import CompPoly.Univariate.ReedSolomon.GaoDecoder import CompPoly.ToMathlib.Polynomial.Roots /-! # Gao Decoder Correctness Correct...
@@ -42,9 +42,21 @@ section Decoder variable [BEq F] [LawfulBEq F] +/-- `(nodalPoly D).toPoly = ∏ i, (X - C D.val[i])`. -/ +lemma toPoly_nodalPoly [CommRing F] [Nontrivial F] (D : Domain F) : + (nodalPoly D).toPoly = ∏ i : Fin D.n, (X - C (D.val[i])) := by + rw [nodalPoly, ← Array.foldl_toList, + ← List.foldl...
{ "repo": "CompPoly", "git_repo": "github.com/Verified-zkEVM/CompPoly", "revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062", "lean_toolchain": "leanprover/lean4:v4.31.0", "proof_assistant": "lean", "ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)", "ablator_flags": [ "--corollary-dele...
ablate_fb3f4ebb00c9_4
66cf1a3dbfaffa56
lean
lean
github.com/Verified-zkEVM/CompPoly
e95ba1b1cac21ac3e980725abcfb2a0c707d1062
CompPoly/Univariate/ReedSolomon/GaoCorrectness.lean
GaoCorrectness
4
lemma_delete
null
null
false
0.5
1
1
false
0
inf
0
inf
42
16
4
[ { "theorem_name": "natDegree_nodalPoly", "depth": 1, "n_commands": 0, "n_lines": 4, "is_leaf": true, "centrality": 0, "method": "deleted-dep", "proof_text": " by\n rw [toPoly_nodalPoly, Polynomial.natDegree_prod _ _ (fun i _ => X_sub_C_ne_zero _)]\n simp only [Fin.getElem_fin, natD...
[ { "name": "toPoly_nodalPoly", "text": "/-- `(nodalPoly D).toPoly = ∏ i, (X - C D.val[i])`. -/\nlemma toPoly_nodalPoly [CommRing F] [Nontrivial F] (D : Domain F) :\n (nodalPoly D).toPoly = ∏ i : Fin D.n, (X - C (D.val[i])) := by\n rw [nodalPoly, ← Array.foldl_toList,\n ← List.foldl_map (f := fun a => ...
[ { "name": "toPoly_nodalPoly_ne_zero", "fan_in": 2, "n_deps_direct": 1, "n_deps_transitive": 1, "n_lines": 6, "n_chars": 297, "n_subproofs": 0, "n_tactics": 3, "cyclomatic": 1, "n_automation": 0, "n_rewrites": 1, "n_structural": 1, "automation_only": false, "ma...
1
/- Copyright (c) 2026 CompPoly. All rights reserved. Released under Apache 2.0 license as described in the file LICENSE. Authors: Juan Conejero -/ import Mathlib.InformationTheory.Hamming import CompPoly.Univariate.ReedSolomon.GaoDecoder import CompPoly.ToMathlib.Polynomial.Roots /-! # Gao Decoder Correctness Correct...
/- Copyright (c) 2026 CompPoly. All rights reserved. Released under Apache 2.0 license as described in the file LICENSE. Authors: Juan Conejero -/ import Mathlib.InformationTheory.Hamming import CompPoly.Univariate.ReedSolomon.GaoDecoder import CompPoly.ToMathlib.Polynomial.Roots /-! # Gao Decoder Correctness Correct...
@@ -42,9 +42,19 @@ section Decoder variable [BEq F] [LawfulBEq F] +/-- `(nodalPoly D).toPoly = ∏ i, (X - C D.val[i])`. -/ +lemma toPoly_nodalPoly [CommRing F] [Nontrivial F] (D : Domain F) : + (nodalPoly D).toPoly = ∏ i : Fin D.n, (X - C (D.val[i])) := by + rw [nodalPoly, ← Array.foldl_toList, + ← List.foldl...
{ "repo": "CompPoly", "git_repo": "github.com/Verified-zkEVM/CompPoly", "revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062", "lean_toolchain": "leanprover/lean4:v4.31.0", "proof_assistant": "lean", "ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)", "ablator_flags": [ "--corollary-dele...
ablate_fb3f4ebb00c9_5
77470f1b4c089bcd
lean
lean
github.com/Verified-zkEVM/CompPoly
e95ba1b1cac21ac3e980725abcfb2a0c707d1062
CompPoly/Univariate/ReedSolomon/GaoCorrectness.lean
GaoCorrectness
5
lemma_delete
null
null
false
0.5
1
1
false
0
inf
0
inf
42
16
4
[ { "theorem_name": "natDegree_nodalPoly", "depth": 1, "n_commands": 0, "n_lines": 4, "is_leaf": true, "centrality": 0, "method": "deleted-dep", "proof_text": " by\n rw [toPoly_nodalPoly, Polynomial.natDegree_prod _ _ (fun i _ => X_sub_C_ne_zero _)]\n simp only [Fin.getElem_fin, natD...
[ { "name": "toPoly_nodalPoly", "text": "/-- `(nodalPoly D).toPoly = ∏ i, (X - C D.val[i])`. -/\nlemma toPoly_nodalPoly [CommRing F] [Nontrivial F] (D : Domain F) :\n (nodalPoly D).toPoly = ∏ i : Fin D.n, (X - C (D.val[i])) := by\n rw [nodalPoly, ← Array.foldl_toList,\n ← List.foldl_map (f := fun a => ...
[ { "name": "degree_nodalPoly", "fan_in": 3, "n_deps_direct": 2, "n_deps_transitive": 3, "n_lines": 6, "n_chars": 264, "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) 2026 CompPoly. All rights reserved. Released under Apache 2.0 license as described in the file LICENSE. Authors: Juan Conejero -/ import Mathlib.InformationTheory.Hamming import CompPoly.Univariate.ReedSolomon.GaoDecoder import CompPoly.ToMathlib.Polynomial.Roots /-! # Gao Decoder Correctness Correct...
/- Copyright (c) 2026 CompPoly. All rights reserved. Released under Apache 2.0 license as described in the file LICENSE. Authors: Juan Conejero -/ import Mathlib.InformationTheory.Hamming import CompPoly.Univariate.ReedSolomon.GaoDecoder import CompPoly.ToMathlib.Polynomial.Roots /-! # Gao Decoder Correctness Correct...
@@ -42,13 +42,26 @@ section Decoder variable [BEq F] [LawfulBEq F] +/-- `(nodalPoly D).toPoly = ∏ i, (X - C D.val[i])`. -/ +lemma toPoly_nodalPoly [CommRing F] [Nontrivial F] (D : Domain F) : + (nodalPoly D).toPoly = ∏ i : Fin D.n, (X - C (D.val[i])) := by + rw [nodalPoly, ← Array.foldl_toList, + ← List.fold...
{ "repo": "CompPoly", "git_repo": "github.com/Verified-zkEVM/CompPoly", "revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062", "lean_toolchain": "leanprover/lean4:v4.31.0", "proof_assistant": "lean", "ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)", "ablator_flags": [ "--corollary-dele...
ablate_fb3f4ebb00c9_6
5914399b0032a285
lean
lean
github.com/Verified-zkEVM/CompPoly
e95ba1b1cac21ac3e980725abcfb2a0c707d1062
CompPoly/Univariate/ReedSolomon/GaoCorrectness.lean
GaoCorrectness
6
lemma_delete
null
null
false
0.5
1
1
false
0
inf
0
inf
42
16
4
[ { "theorem_name": "natDegree_nodalPoly", "depth": 1, "n_commands": 0, "n_lines": 4, "is_leaf": true, "centrality": 0, "method": "deleted-dep", "proof_text": " by\n rw [toPoly_nodalPoly, Polynomial.natDegree_prod _ _ (fun i _ => X_sub_C_ne_zero _)]\n simp only [Fin.getElem_fin, natD...
[ { "name": "toPoly_nodalPoly", "text": "/-- `(nodalPoly D).toPoly = ∏ i, (X - C D.val[i])`. -/\nlemma toPoly_nodalPoly [CommRing F] [Nontrivial F] (D : Domain F) :\n (nodalPoly D).toPoly = ∏ i : Fin D.n, (X - C (D.val[i])) := by\n rw [nodalPoly, ← Array.foldl_toList,\n ← List.foldl_map (f := fun a => ...
[ { "name": "nodalPoly_eval_node_eq_zero", "fan_in": 1, "n_deps_direct": 1, "n_deps_transitive": 1, "n_lines": 8, "n_chars": 386, "n_subproofs": 0, "n_tactics": 4, "cyclomatic": 1, "n_automation": 1, "n_rewrites": 1, "n_structural": 1, "automation_only": false, ...
1
/- Copyright (c) 2026 CompPoly. All rights reserved. Released under Apache 2.0 license as described in the file LICENSE. Authors: Juan Conejero -/ import Mathlib.InformationTheory.Hamming import CompPoly.Univariate.ReedSolomon.GaoDecoder import CompPoly.ToMathlib.Polynomial.Roots /-! # Gao Decoder Correctness Correct...
/- Copyright (c) 2026 CompPoly. All rights reserved. Released under Apache 2.0 license as described in the file LICENSE. Authors: Juan Conejero -/ import Mathlib.InformationTheory.Hamming import CompPoly.Univariate.ReedSolomon.GaoDecoder import CompPoly.ToMathlib.Polynomial.Roots /-! # Gao Decoder Correctness Correct...
@@ -42,9 +42,21 @@ section Decoder variable [BEq F] [LawfulBEq F] +/-- `(nodalPoly D).toPoly = ∏ i, (X - C D.val[i])`. -/ +lemma toPoly_nodalPoly [CommRing F] [Nontrivial F] (D : Domain F) : + (nodalPoly D).toPoly = ∏ i : Fin D.n, (X - C (D.val[i])) := by + rw [nodalPoly, ← Array.foldl_toList, + ← List.foldl...
{ "repo": "CompPoly", "git_repo": "github.com/Verified-zkEVM/CompPoly", "revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062", "lean_toolchain": "leanprover/lean4:v4.31.0", "proof_assistant": "lean", "ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)", "ablator_flags": [ "--corollary-dele...
ablate_fb3f4ebb00c9_7
7563906809d34ea1
lean
lean
github.com/Verified-zkEVM/CompPoly
e95ba1b1cac21ac3e980725abcfb2a0c707d1062
CompPoly/Univariate/ReedSolomon/GaoCorrectness.lean
GaoCorrectness
7
lemma_delete
null
null
false
0.5
1
1
false
0
inf
0
inf
42
16
4
[ { "theorem_name": "natDegree_nodalPoly", "depth": 1, "n_commands": 0, "n_lines": 4, "is_leaf": true, "centrality": 0, "method": "deleted-dep", "proof_text": " by\n rw [toPoly_nodalPoly, Polynomial.natDegree_prod _ _ (fun i _ => X_sub_C_ne_zero _)]\n simp only [Fin.getElem_fin, natD...
[ { "name": "toPoly_nodalPoly", "text": "/-- `(nodalPoly D).toPoly = ∏ i, (X - C D.val[i])`. -/\nlemma toPoly_nodalPoly [CommRing F] [Nontrivial F] (D : Domain F) :\n (nodalPoly D).toPoly = ∏ i : Fin D.n, (X - C (D.val[i])) := by\n rw [nodalPoly, ← Array.foldl_toList,\n ← List.foldl_map (f := fun a => ...
[ { "name": "partialGcd_stopSpec", "fan_in": 2, "n_deps_direct": 2, "n_deps_transitive": 5, "n_lines": 15, "n_chars": 706, "n_subproofs": 0, "n_tactics": 4, "cyclomatic": 1, "n_automation": 3, "n_rewrites": 1, "n_structural": 0, "automation_only": false, "max_ne...
5
/- Copyright (c) 2026 CompPoly. All rights reserved. Released under Apache 2.0 license as described in the file LICENSE. Authors: Juan Conejero -/ import Mathlib.InformationTheory.Hamming import CompPoly.Univariate.ReedSolomon.GaoDecoder import CompPoly.ToMathlib.Polynomial.Roots /-! # Gao Decoder Correctness Correct...
/- Copyright (c) 2026 CompPoly. All rights reserved. Released under Apache 2.0 license as described in the file LICENSE. Authors: Juan Conejero -/ import Mathlib.InformationTheory.Hamming import CompPoly.Univariate.ReedSolomon.GaoDecoder import CompPoly.ToMathlib.Polynomial.Roots /-! # Gao Decoder Correctness Correct...
@@ -48,13 +48,26 @@ rw [receivedInterpolant, CLagrange.cinterpolate_eq_interpolate] simpa using Lagrange.degree_interpolate_lt (s := .univ) r.get D.node_injective.injOn +/-- `(nodalPoly D).toPoly = ∏ i, (X - C D.val[i])`. -/ +lemma toPoly_nodalPoly [CommRing F] [Nontrivial F] (D : Domain F) : + (nodalPoly 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_fb3f4ebb00c9_8
e4cc9697f1f99f5b
lean
lean
github.com/Verified-zkEVM/CompPoly
e95ba1b1cac21ac3e980725abcfb2a0c707d1062
CompPoly/Univariate/ReedSolomon/GaoCorrectness.lean
GaoCorrectness
8
lemma_delete
null
null
false
0.5
1
1
false
0
inf
0
inf
42
16
1
[ { "theorem_name": "hammingDist_le_error_locator_natDegree", "depth": 1, "n_commands": 0, "n_lines": 4, "is_leaf": true, "centrality": 0, "method": "deleted-dep", "proof_text": " by\n obtain rfl : b = fun i => g₁.eval (a i) := funext fun i => (hb i).symm; rw [hammingDist_comm]\n exa...
[ { "name": "disagreement_card_le_error_locator_natDegree", "text": "/-- From the Bézout identity `G = U g₀ + V g₁` and `G = f₁ V` (with `V ≠ 0`,\n`g₀` rooted on the aᵢ), `f₁` disagrees with `g₁` at at most `V.natDegree` nodes. -/\nlemma disagreement_card_le_error_locator_natDegree [CommRing F] [IsDomain F]\n...
[ { "name": "decode_sound_aux", "fan_in": 1, "n_deps_direct": 3, "n_deps_transitive": 6, "n_lines": 30, "n_chars": 1719, "n_subproofs": 4, "n_tactics": 14, "cyclomatic": 1, "n_automation": 3, "n_rewrites": 1, "n_structural": 2, "automation_only": false, "max_nes...
6
/- Copyright (c) 2026 CompPoly. All rights reserved. Released under Apache 2.0 license as described in the file LICENSE. Authors: Juan Conejero -/ import Mathlib.InformationTheory.Hamming import CompPoly.Univariate.ReedSolomon.GaoDecoder import CompPoly.ToMathlib.Polynomial.Roots /-! # Gao Decoder Correctness Correct...
/- Copyright (c) 2026 CompPoly. All rights reserved. Released under Apache 2.0 license as described in the file LICENSE. Authors: Juan Conejero -/ import Mathlib.InformationTheory.Hamming import CompPoly.Univariate.ReedSolomon.GaoDecoder import CompPoly.ToMathlib.Polynomial.Roots /-! # Gao Decoder Correctness Correct...
@@ -51,6 +51,17 @@ sub_eq_zero] at hev exact hev.resolve_right hne +/-- From the Bézout identity `G = U g₀ + V g₁` and `G = f₁ V` (with `V ≠ 0`, +`g₀` rooted on the aᵢ), `f₁` disagrees with `g₁` at at most `V.natDegree` nodes. -/ +lemma disagreement_card_le_error_locator_natDegree [CommRing F] [IsDomain F...
{ "repo": "CompPoly", "git_repo": "github.com/Verified-zkEVM/CompPoly", "revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062", "lean_toolchain": "leanprover/lean4:v4.31.0", "proof_assistant": "lean", "ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)", "ablator_flags": [ "--corollary-dele...
ablate_fb3f4ebb00c9_9
882becf09d722cb7
lean
lean
github.com/Verified-zkEVM/CompPoly
e95ba1b1cac21ac3e980725abcfb2a0c707d1062
CompPoly/Univariate/ReedSolomon/GaoCorrectness.lean
GaoCorrectness
9
lemma_delete
null
null
false
0.5
1
1
false
0
inf
0
inf
42
16
1
[ { "theorem_name": "decode_sound_aux", "depth": 1, "n_commands": 0, "n_lines": 13, "is_leaf": true, "centrality": 0, "method": "deleted-dep", "proof_text": " by\n have hVtp : V.toPoly ≠ 0 := (toPoly_eq_zero_iff _).not.mpr hVne0\n refine ⟨by rwa [← degree_toPoly], ?_⟩\n have hGV : G...
[ { "name": "hammingDist_le_error_locator_natDegree", "text": "/-- From the Bézout identity `G = U g₀ + V g₁` and `G = f₁ V`\n(with `V ≠ 0`, `g₀` rooted on the aᵢ), a word `b` with `g₁(aᵢ) = b i` satisfies\n`hammingDist b (f₁ ∘ a) ≤ V.natDegree`. -/\nlemma hammingDist_le_error_locator_natDegree [CommRing F] [...
[ { "name": "decode_sound", "fan_in": 1, "n_deps_direct": 3, "n_deps_transitive": 12, "n_lines": 25, "n_chars": 1416, "n_subproofs": 6, "n_tactics": 22, "cyclomatic": 1, "n_automation": 1, "n_rewrites": 3, "n_structural": 3, "automation_only": false, "max_nestin...
12
/- Copyright (c) 2026 CompPoly. All rights reserved. Released under Apache 2.0 license as described in the file LICENSE. Authors: Juan Conejero -/ import Mathlib.InformationTheory.Hamming import CompPoly.Univariate.ReedSolomon.GaoDecoder import CompPoly.ToMathlib.Polynomial.Roots /-! # Gao Decoder Correctness Correct...
/- Copyright (c) 2026 CompPoly. All rights reserved. Released under Apache 2.0 license as described in the file LICENSE. Authors: Juan Conejero -/ import Mathlib.InformationTheory.Hamming import CompPoly.Univariate.ReedSolomon.GaoDecoder import CompPoly.ToMathlib.Polynomial.Roots /-! # Gao Decoder Correctness Correct...
@@ -62,6 +62,27 @@ (by rw [mul_sub, mul_comm V f₁, ← hsucc, hbez]; ring))).trans (card_eval_zero_le_natDegree s a hinj _ hV) +/-- From the Bézout identity `G = U g₀ + V g₁` and `G = f₁ V` +(with `V ≠ 0`, `g₀` rooted on the aᵢ), a word `b` with `g₁(aᵢ) = b i` satisfies +`hammingDist b (f₁ ∘ a) ≤ V.natDegree`...
{ "repo": "CompPoly", "git_repo": "github.com/Verified-zkEVM/CompPoly", "revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062", "lean_toolchain": "leanprover/lean4:v4.31.0", "proof_assistant": "lean", "ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)", "ablator_flags": [ "--corollary-dele...
ablate_fb3f4ebb00c9_10
e60b047d71098992
lean
lean
github.com/Verified-zkEVM/CompPoly
e95ba1b1cac21ac3e980725abcfb2a0c707d1062
CompPoly/Univariate/ReedSolomon/GaoCorrectness.lean
GaoCorrectness
10
lemma_delete
null
null
false
0.5
1
1
false
0
inf
0
inf
42
16
1
[ { "theorem_name": "decode_sound_aux", "depth": 1, "n_commands": 0, "n_lines": 13, "is_leaf": true, "centrality": 0, "method": "deleted-dep", "proof_text": " by\n have hVtp : V.toPoly ≠ 0 := (toPoly_eq_zero_iff _).not.mpr hVne0\n refine ⟨by rwa [← degree_toPoly], ?_⟩\n have hGV : G...
[ { "name": "hammingDist_le_error_locator_natDegree", "text": "/-- From the Bézout identity `G = U g₀ + V g₁` and `G = f₁ V`\n(with `V ≠ 0`, `g₀` rooted on the aᵢ), a word `b` with `g₁(aᵢ) = b i` satisfies\n`hammingDist b (f₁ ∘ a) ≤ V.natDegree`. -/\nlemma hammingDist_le_error_locator_natDegree [CommRing F] [...
[ { "name": "decode_eq_none", "fan_in": 0, "n_deps_direct": 1, "n_deps_transitive": 13, "n_lines": 16, "n_chars": 712, "n_subproofs": 1, "n_tactics": 5, "cyclomatic": 2, "n_automation": 1, "n_rewrites": 0, "n_structural": 3, "automation_only": false, "max_nestin...
13
/- Copyright (c) 2026 CompPoly. All rights reserved. Released under Apache 2.0 license as described in the file LICENSE. Authors: Juan Conejero -/ import Mathlib.InformationTheory.Hamming import CompPoly.Univariate.ReedSolomon.GaoDecoder import CompPoly.ToMathlib.Polynomial.Roots /-! # Gao Decoder Correctness Correct...
/- Copyright (c) 2026 CompPoly. All rights reserved. Released under Apache 2.0 license as described in the file LICENSE. Authors: Juan Conejero -/ import Mathlib.InformationTheory.Hamming import CompPoly.Univariate.ReedSolomon.GaoDecoder import CompPoly.ToMathlib.Polynomial.Roots /-! # Gao Decoder Correctness Correct...
@@ -62,6 +62,27 @@ (by rw [mul_sub, mul_comm V f₁, ← hsucc, hbez]; ring))).trans (card_eval_zero_le_natDegree s a hinj _ hV) +/-- From the Bézout identity `G = U g₀ + V g₁` and `G = f₁ V` +(with `V ≠ 0`, `g₀` rooted on the aᵢ), a word `b` with `g₁(aᵢ) = b i` satisfies +`hammingDist b (f₁ ∘ a) ≤ V.natDegree`...
{ "repo": "CompPoly", "git_repo": "github.com/Verified-zkEVM/CompPoly", "revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062", "lean_toolchain": "leanprover/lean4:v4.31.0", "proof_assistant": "lean", "ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)", "ablator_flags": [ "--corollary-dele...
ablate_fb3f4ebb00c9_11
92505aff4ef3dce4
lean
lean
github.com/Verified-zkEVM/CompPoly
e95ba1b1cac21ac3e980725abcfb2a0c707d1062
CompPoly/Univariate/ReedSolomon/GaoCorrectness.lean
GaoCorrectness
11
lemma_delete
null
null
false
0.5
1
1
false
0
inf
0
inf
42
16
1
[ { "theorem_name": "decode_eq_some", "depth": 1, "n_commands": 0, "n_lines": 43, "is_leaf": true, "centrality": 0, "method": "deleted-dep", "proof_text": " by\n -- Define the set of error positions.\n simp only [hammingDist] at herr\n set E := Finset.univ.filter (fun i : Fin D.n =>...
[ { "name": "bezout_solutions_cross_mul", "text": "/-- Two degree-bounded Bézout solutions `(U,V,G)`, `(U',V',G')` of `U g₀ + V g₁ = ·`\n(with `deg G, deg G' < d₀` and `deg V + d₀, deg V' + d₀ ≤ deg g₀`) cross-multiply:\n`V * G' = V' * G`. -/\ntheorem bezout_solutions_cross_mul [CommRing F] [NoZeroDivisors F]...
[ { "name": "decode_eq_some", "fan_in": 1, "n_deps_direct": 6, "n_deps_transitive": 9, "n_lines": 51, "n_chars": 3256, "n_subproofs": 15, "n_tactics": 46, "cyclomatic": 1, "n_automation": 7, "n_rewrites": 7, "n_structural": 6, "automation_only": false, "max_nest...
9
/- Copyright (c) 2026 CompPoly. All rights reserved. Released under Apache 2.0 license as described in the file LICENSE. Authors: Juan Conejero -/ import Mathlib.InformationTheory.Hamming import CompPoly.Univariate.ReedSolomon.GaoDecoder import CompPoly.ToMathlib.Polynomial.Roots /-! # Gao Decoder Correctness Correct...
/- Copyright (c) 2026 CompPoly. All rights reserved. Released under Apache 2.0 license as described in the file LICENSE. Authors: Juan Conejero -/ import Mathlib.InformationTheory.Hamming import CompPoly.Univariate.ReedSolomon.GaoDecoder import CompPoly.ToMathlib.Polynomial.Roots /-! # Gao Decoder Correctness Correct...
@@ -51,6 +51,26 @@ · exact (WithBot.add_lt_add_left (by simp only [ne_eq, degree_eq_bot, hA0, not_false_eq_true]) hB).trans_le hA +/-- Two degree-bounded Bézout solutions `(U,V,G)`, `(U',V',G')` of `U g₀ + V g₁ = ·` +(with `deg G, deg G' < d₀` and `deg V + d₀, deg V' + d₀ ≤ deg g₀`) cross-multiply: +`V * 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_fb3f4ebb00c9_12
754342787ba60fbb
lean
lean
github.com/Verified-zkEVM/CompPoly
e95ba1b1cac21ac3e980725abcfb2a0c707d1062
CompPoly/Univariate/ReedSolomon/GaoCorrectness.lean
GaoCorrectness
12
lemma_delete
null
null
false
0.5
1
1
false
0
inf
0
inf
42
16
1
[ { "theorem_name": "decode_eq_some", "depth": 1, "n_commands": 0, "n_lines": 43, "is_leaf": true, "centrality": 0, "method": "deleted-dep", "proof_text": " by\n -- Define the set of error positions.\n simp only [hammingDist] at herr\n set E := Finset.univ.filter (fun i : Fin D.n =>...
[ { "name": "bezout_solutions_cross_mul", "text": "/-- Two degree-bounded Bézout solutions `(U,V,G)`, `(U',V',G')` of `U g₀ + V g₁ = ·`\n(with `deg G, deg G' < d₀` and `deg V + d₀, deg V' + d₀ ≤ deg g₀`) cross-multiply:\n`V * G' = V' * G`. -/\ntheorem bezout_solutions_cross_mul [CommRing F] [NoZeroDivisors F]...
[ { "name": "decode_unique", "fan_in": 0, "n_deps_direct": 1, "n_deps_transitive": 10, "n_lines": 11, "n_chars": 593, "n_subproofs": 0, "n_tactics": 2, "cyclomatic": 1, "n_automation": 0, "n_rewrites": 0, "n_structural": 0, "automation_only": false, "max_nesting...
10
/- Copyright (c) 2026 CompPoly. All rights reserved. Released under Apache 2.0 license as described in the file LICENSE. Authors: Juan Conejero -/ import Mathlib.InformationTheory.Hamming import CompPoly.Univariate.ReedSolomon.GaoDecoder import CompPoly.ToMathlib.Polynomial.Roots /-! # Gao Decoder Correctness Correct...
/- Copyright (c) 2026 CompPoly. All rights reserved. Released under Apache 2.0 license as described in the file LICENSE. Authors: Juan Conejero -/ import Mathlib.InformationTheory.Hamming import CompPoly.Univariate.ReedSolomon.GaoDecoder import CompPoly.ToMathlib.Polynomial.Roots /-! # Gao Decoder Correctness Correct...
@@ -51,6 +51,26 @@ · exact (WithBot.add_lt_add_left (by simp only [ne_eq, degree_eq_bot, hA0, not_false_eq_true]) hB).trans_le hA +/-- Two degree-bounded Bézout solutions `(U,V,G)`, `(U',V',G')` of `U g₀ + V g₁ = ·` +(with `deg G, deg G' < d₀` and `deg V + d₀, deg V' + d₀ ≤ deg g₀`) cross-multiply: +`V * 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_b77df46487ff_0
fcad71d3983f86e0
lean
lean
github.com/Verified-zkEVM/CompPoly
e95ba1b1cac21ac3e980725abcfb2a0c707d1062
CompPoly/Univariate/CMvEquiv.lean
CMvEquiv
0
lemma_delete
null
null
false
0.5
1
1
false
0
inf
0
inf
42
5
2
[ { "theorem_name": "natDegree_mvToUnivariate", "depth": 1, "n_commands": 0, "n_lines": 8, "is_leaf": true, "centrality": 0, "method": "deleted-dep", "proof_text": " by\n rw [mvToUnivariate_eq_map_finSuccEquiv]\n have hmap : (Polynomial.map (MvPolynomial.isEmptyRingEquiv R (Fin 0)).t...
[ { "name": "mvToUnivariate_eq_map_finSuccEquiv", "text": "/-- The `MvPolynomial (Fin 1)` to `Polynomial` bridge factors through\n`finSuccEquiv` and `isEmptyRingEquiv`. -/\nprivate lemma mvToUnivariate_eq_map_finSuccEquiv [CommSemiring R]\n (p : MvPolynomial (Fin 1) R) :\n mvToUnivariate p =\n Poly...
[ { "name": "natDegree_mvToUnivariate", "fan_in": 1, "n_deps_direct": 1, "n_deps_transitive": 1, "n_lines": 14, "n_chars": 618, "n_subproofs": 1, "n_tactics": 8, "cyclomatic": 1, "n_automation": 0, "n_rewrites": 2, "n_structural": 0, "automation_only": false, "m...
1
/- Copyright (c) 2026 CompPoly. All rights reserved. Released under Apache 2.0 license as described in the file LICENSE. Authors: Andrew Zitek-Estrada -/ import CompPoly.Multivariate.FinSuccEquiv import CompPoly.Multivariate.MvPolyEquiv.Eval import CompPoly.Univariate.ToPoly.Impl import Mathlib.Algebra.MvPolynomial.Po...
/- Copyright (c) 2026 CompPoly. All rights reserved. Released under Apache 2.0 license as described in the file LICENSE. Authors: Andrew Zitek-Estrada -/ import CompPoly.Multivariate.FinSuccEquiv import CompPoly.Multivariate.MvPolyEquiv.Eval import CompPoly.Univariate.ToPoly.Impl import Mathlib.Algebra.MvPolynomial.Po...
@@ -46,11 +46,41 @@ (p : MvPolynomial (Fin 1) R) : Polynomial R := MvPolynomial.eval₂ Polynomial.C (fun _ ↦ Polynomial.X) p +/-- The `MvPolynomial (Fin 1)` to `Polynomial` bridge factors through +`finSuccEquiv` and `isEmptyRingEquiv`. -/ +private lemma mvToUnivariate_eq_map_finSuccEquiv [CommSemiring 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_b77df46487ff_1
0942fe2ed2dead21
lean
lean
github.com/Verified-zkEVM/CompPoly
e95ba1b1cac21ac3e980725abcfb2a0c707d1062
CompPoly/Univariate/CMvEquiv.lean
CMvEquiv
1
lemma_delete
null
null
false
0.5
1
1
false
0
inf
0
inf
42
5
2
[ { "theorem_name": "natDegree_mvToUnivariate", "depth": 1, "n_commands": 0, "n_lines": 8, "is_leaf": true, "centrality": 0, "method": "deleted-dep", "proof_text": " by\n rw [mvToUnivariate_eq_map_finSuccEquiv]\n have hmap : (Polynomial.map (MvPolynomial.isEmptyRingEquiv R (Fin 0)).t...
[ { "name": "mvToUnivariate_eq_map_finSuccEquiv", "text": "/-- The `MvPolynomial (Fin 1)` to `Polynomial` bridge factors through\n`finSuccEquiv` and `isEmptyRingEquiv`. -/\nprivate lemma mvToUnivariate_eq_map_finSuccEquiv [CommSemiring R]\n (p : MvPolynomial (Fin 1) R) :\n mvToUnivariate p =\n Poly...
[ { "name": "cmvEquiv_symm_toPoly", "fan_in": 2, "n_deps_direct": 1, "n_deps_transitive": 1, "n_lines": 23, "n_chars": 1111, "n_subproofs": 0, "n_tactics": 17, "cyclomatic": 1, "n_automation": 1, "n_rewrites": 5, "n_structural": 1, "automation_only": false, "max...
1
/- Copyright (c) 2026 CompPoly. All rights reserved. Released under Apache 2.0 license as described in the file LICENSE. Authors: Andrew Zitek-Estrada -/ import CompPoly.Multivariate.FinSuccEquiv import CompPoly.Multivariate.MvPolyEquiv.Eval import CompPoly.Univariate.ToPoly.Impl import Mathlib.Algebra.MvPolynomial.Po...
/- Copyright (c) 2026 CompPoly. All rights reserved. Released under Apache 2.0 license as described in the file LICENSE. Authors: Andrew Zitek-Estrada -/ import CompPoly.Multivariate.FinSuccEquiv import CompPoly.Multivariate.MvPolyEquiv.Eval import CompPoly.Univariate.ToPoly.Impl import Mathlib.Algebra.MvPolynomial.Po...
@@ -46,11 +46,50 @@ (p : MvPolynomial (Fin 1) R) : Polynomial R := MvPolynomial.eval₂ Polynomial.C (fun _ ↦ Polynomial.X) p +/-- The `MvPolynomial (Fin 1)` to `Polynomial` bridge factors through +`finSuccEquiv` and `isEmptyRingEquiv`. -/ +private lemma mvToUnivariate_eq_map_finSuccEquiv [CommSemiring 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_b77df46487ff_2
cc881ac8d184ff0b
lean
lean
github.com/Verified-zkEVM/CompPoly
e95ba1b1cac21ac3e980725abcfb2a0c707d1062
CompPoly/Univariate/CMvEquiv.lean
CMvEquiv
2
lemma_delete
null
null
false
0.5
1
1
false
0
inf
0
inf
42
5
2
[ { "theorem_name": "natDegree_mvToUnivariate", "depth": 1, "n_commands": 0, "n_lines": 8, "is_leaf": true, "centrality": 0, "method": "deleted-dep", "proof_text": " by\n rw [mvToUnivariate_eq_map_finSuccEquiv]\n have hmap : (Polynomial.map (MvPolynomial.isEmptyRingEquiv R (Fin 0)).t...
[ { "name": "mvToUnivariate_eq_map_finSuccEquiv", "text": "/-- The `MvPolynomial (Fin 1)` to `Polynomial` bridge factors through\n`finSuccEquiv` and `isEmptyRingEquiv`. -/\nprivate lemma mvToUnivariate_eq_map_finSuccEquiv [CommSemiring R]\n (p : MvPolynomial (Fin 1) R) :\n mvToUnivariate p =\n Poly...
[ { "name": "eval_cmvEquiv_symm", "fan_in": 0, "n_deps_direct": 2, "n_deps_transitive": 3, "n_lines": 9, "n_chars": 426, "n_subproofs": 0, "n_tactics": 2, "cyclomatic": 1, "n_automation": 0, "n_rewrites": 1, "n_structural": 0, "automation_only": false, "max_nest...
3
/- Copyright (c) 2026 CompPoly. All rights reserved. Released under Apache 2.0 license as described in the file LICENSE. Authors: Andrew Zitek-Estrada -/ import CompPoly.Multivariate.FinSuccEquiv import CompPoly.Multivariate.MvPolyEquiv.Eval import CompPoly.Univariate.ToPoly.Impl import Mathlib.Algebra.MvPolynomial.Po...
/- Copyright (c) 2026 CompPoly. All rights reserved. Released under Apache 2.0 license as described in the file LICENSE. Authors: Andrew Zitek-Estrada -/ import CompPoly.Multivariate.FinSuccEquiv import CompPoly.Multivariate.MvPolyEquiv.Eval import CompPoly.Univariate.ToPoly.Impl import Mathlib.Algebra.MvPolynomial.Po...
@@ -46,6 +46,29 @@ (p : MvPolynomial (Fin 1) R) : Polynomial R := MvPolynomial.eval₂ Polynomial.C (fun _ ↦ Polynomial.X) p +/-- The `MvPolynomial (Fin 1)` to `Polynomial` bridge factors through +`finSuccEquiv` and `isEmptyRingEquiv`. -/ +private lemma mvToUnivariate_eq_map_finSuccEquiv [CommSemiring 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_b77df46487ff_3
0fe9dcbde915ac06
lean
lean
github.com/Verified-zkEVM/CompPoly
e95ba1b1cac21ac3e980725abcfb2a0c707d1062
CompPoly/Univariate/CMvEquiv.lean
CMvEquiv
3
lemma_delete
null
null
false
0.5
1
1
false
0
inf
0
inf
42
5
2
[ { "theorem_name": "natDegree_mvToUnivariate", "depth": 1, "n_commands": 0, "n_lines": 8, "is_leaf": true, "centrality": 0, "method": "deleted-dep", "proof_text": " by\n rw [mvToUnivariate_eq_map_finSuccEquiv]\n have hmap : (Polynomial.map (MvPolynomial.isEmptyRingEquiv R (Fin 0)).t...
[ { "name": "mvToUnivariate_eq_map_finSuccEquiv", "text": "/-- The `MvPolynomial (Fin 1)` to `Polynomial` bridge factors through\n`finSuccEquiv` and `isEmptyRingEquiv`. -/\nprivate lemma mvToUnivariate_eq_map_finSuccEquiv [CommSemiring R]\n (p : MvPolynomial (Fin 1) R) :\n mvToUnivariate p =\n Poly...
[ { "name": "natDegree_cmvEquiv_symm_sub", "fan_in": 0, "n_deps_direct": 3, "n_deps_transitive": 4, "n_lines": 10, "n_chars": 475, "n_subproofs": 0, "n_tactics": 3, "cyclomatic": 1, "n_automation": 0, "n_rewrites": 1, "n_structural": 0, "automation_only": false, ...
4
/- Copyright (c) 2026 CompPoly. All rights reserved. Released under Apache 2.0 license as described in the file LICENSE. Authors: Andrew Zitek-Estrada -/ import CompPoly.Multivariate.FinSuccEquiv import CompPoly.Multivariate.MvPolyEquiv.Eval import CompPoly.Univariate.ToPoly.Impl import Mathlib.Algebra.MvPolynomial.Po...
/- Copyright (c) 2026 CompPoly. All rights reserved. Released under Apache 2.0 license as described in the file LICENSE. Authors: Andrew Zitek-Estrada -/ import CompPoly.Multivariate.FinSuccEquiv import CompPoly.Multivariate.MvPolyEquiv.Eval import CompPoly.Univariate.ToPoly.Impl import Mathlib.Algebra.MvPolynomial.Po...
@@ -46,6 +46,29 @@ (p : MvPolynomial (Fin 1) R) : Polynomial R := MvPolynomial.eval₂ Polynomial.C (fun _ ↦ Polynomial.X) p +/-- The `MvPolynomial (Fin 1)` to `Polynomial` bridge factors through +`finSuccEquiv` and `isEmptyRingEquiv`. -/ +private lemma mvToUnivariate_eq_map_finSuccEquiv [CommSemiring 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_19ac2c6438c9_0
fb0ef37ea0880d0b
lean
lean
github.com/Verified-zkEVM/CompPoly
e95ba1b1cac21ac3e980725abcfb2a0c707d1062
CompPoly/Fields/Binary/Tower/Concrete/Algebra.lean
Algebra
0
lemma_delete
null
null
false
0.5
1
1
false
0
inf
0
inf
42
8
4
[ { "theorem_name": "concreteTowerAlgebraMap_succ_1", "depth": 1, "n_commands": 0, "n_lines": 6, "is_leaf": true, "centrality": 0, "method": "deleted-dep", "proof_text": " by\n unfold concreteTowerAlgebraMap\n simp only [Nat.left_eq_add, one_ne_zero, ↓reduceDIte,\n Nat.add_one_sub...
[ { "name": "concreteTowerAlgebraMap_id", "text": "lemma concreteTowerAlgebraMap_id (k : ℕ) :\n concreteTowerAlgebraMap (h_le:=by omega) = RingHom.id (ConcreteBTField k) := by\n unfold concreteTowerAlgebraMap\n exact (Ne.dite_eq_left_iff fun h a ↦ h rfl).mpr rfl\n\n", "fan_in": 4, "n_lines": 6, ...
[ { "name": "concreteTowerAlgebraMap_succ_1", "fan_in": 4, "n_deps_direct": 1, "n_deps_transitive": 1, "n_lines": 9, "n_chars": 336, "n_subproofs": 0, "n_tactics": 6, "cyclomatic": 1, "n_automation": 1, "n_rewrites": 3, "n_structural": 0, "automation_only": false, ...
1
/- 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.Field /-! # Concrete Binary Tower Algebra Algebra maps and embeddings for the concrete bitve...
/- 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.Field /-! # Concrete Binary Tower Algebra Algebra maps and embeddings for the concrete bitve...
@@ -100,8 +100,18 @@ exact Eq.mp ringHomEq.symm (canonicalAlgMap (r - 1)) exact next_embedding.comp map_to_r_sub_1 +lemma concreteTowerAlgebraMap_id (k : ℕ) : + concreteTowerAlgebraMap (h_le:=by omega) = RingHom.id (ConcreteBTField k) := by + unfold concreteTowerAlgebraMap + exact (Ne.dite_eq_left_if...
{ "repo": "CompPoly", "git_repo": "github.com/Verified-zkEVM/CompPoly", "revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062", "lean_toolchain": "leanprover/lean4:v4.31.0", "proof_assistant": "lean", "ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)", "ablator_flags": [ "--corollary-dele...
ablate_19ac2c6438c9_4
0888e38785868429
lean
lean
github.com/Verified-zkEVM/CompPoly
e95ba1b1cac21ac3e980725abcfb2a0c707d1062
CompPoly/Fields/Binary/Tower/Concrete/Algebra.lean
Algebra
4
lemma_delete
null
null
false
0.5
1
1
false
0
inf
0
inf
42
8
3
[ { "theorem_name": "concreteTowerAlgebraMap_succ_last", "depth": 1, "n_commands": 0, "n_lines": 16, "is_leaf": true, "centrality": 0, "method": "deleted-dep", "proof_text": " by\n induction r using Nat.strong_induction_on with\n | h r ih_r => -- prove for width = r + 1\n intro l ...
[ { "name": "concreteTowerAlgebraMap_succ", "text": "/-! Right associativity of the Tower Map -/\nlemma concreteTowerAlgebraMap_succ (l r : ℕ) (h_le : l ≤ r) :\n concreteTowerAlgebraMap (l:=l) (r:=r + 1) (h_le:=by omega) =\n (concreteTowerAlgebraMap (l:=r) (r:=r + 1) (h_le:=by omega)).comp\n (concreteTow...
[ { "name": "algebraMap_eq_zero_x", "fan_in": 0, "n_deps_direct": 2, "n_deps_transitive": 7, "n_lines": 25, "n_chars": 1185, "n_subproofs": 4, "n_tactics": 22, "cyclomatic": 2, "n_automation": 13, "n_rewrites": 3, "n_structural": 1, "automation_only": false, "ma...
5
/- 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.Field /-! # Concrete Binary Tower Algebra Algebra maps and embeddings for the concrete bitve...
/- 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.Field /-! # Concrete Binary Tower Algebra Algebra maps and embeddings for the concrete bitve...
@@ -113,6 +113,18 @@ rw [concreteTowerAlgebraMap_id] rw [RingHom.comp_id] +/-! Right associativity of the Tower Map -/ +lemma concreteTowerAlgebraMap_succ (l r : ℕ) (h_le : l ≤ r) : + concreteTowerAlgebraMap (l:=l) (r:=r + 1) (h_le:=by omega) = + (concreteTowerAlgebraMap (l:=r) (r:=r + 1) (h_le:=by omega))....
{ "repo": "CompPoly", "git_repo": "github.com/Verified-zkEVM/CompPoly", "revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062", "lean_toolchain": "leanprover/lean4:v4.31.0", "proof_assistant": "lean", "ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)", "ablator_flags": [ "--corollary-dele...