Current library: Alpha v34, 4,223 checked-use theorems; Stable remains 432. Historical first admissions, original proof editions, and non-admitted aliases are preserved.
Coefficients are highest-degree-first. The divisor has a nonzero decoded head; primality supplies its actual inverse. Empty quotients and remainders are included. Functionality compares the constructed execution lengths and decoded coefficients, never arbitrary beta codes. Formal polynomial equivalence compares every coefficient, not evaluations on a finite field. The formal identity and remainder-degree bound are proved separately, not assumed by the execution graph. Arbitrary quotient/remainder-pair uniqueness from a formal identity, multiplication associativity, gcd/Bezout, irreducible-polynomial existence, and the full G091 prime-power-field goal remain open. The seven displayed new names are conservative first-order notation, not new kernel primitives.
Exact theorem in conservative defined notation
∀ p. ∀ ab. ∀ ac. ∀ L. ∀ AB. ∀ AC. ∀ K. ∀ bb. ∀ bc. ∀ M. ∀ N. ∀ i. ∀ r. Le(N,L) → Le(N,K) → BetaPrefixEqual(ab,ac,AB,AC,N) → Lt(i,N) → FpConvolutionCoefficient(p,ab,ac,L,bb,bc,M,i,r) → FpConvolutionCoefficient(p,AB,AC,K,bb,bc,M,i,r)
Every linked abbreviation expands hygienically to the identical original native formula.
Definition DAG
Actual proof prerequisites
Complete tactic proof in conservative notation
All 65 original proof lines are preserved. Only local proposition formulas are abbreviated; every abbreviation has an exact binder-safe expansion check. The linked exact edition contains the unchanged replay script.
Read the argument
Proof checkpoints
This is a reading aid, not a new proof or a proof-tree certificate. Checkpoint groups are consecutive commands, not inferred branch boundaries. Every step links to the preserved script.
Named ingredients (1)
01Fix variables and assumptionsL1–10
02Fix variables and assumptionsL11–18
03Separate the logical casesL19–23
04Construct an explicit witnessL24–26
05Separate the logical casesL27–27
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L27
split
06Fix variables and assumptionsL28–29
07Establish htL30–33
Establish this local claim before using it. It is not an additional assumption. The following proof commands apply hr witness witness witness left.
- L30
have ht : ∃ t. BetaAt(x,x1,j,t) ∧ PolynomialDiagonalTerm(ab,ac,L,bb,bc,M,i,j,t)Definitions: BetaAt(x,x1,j,t)PolynomialDiagonalTerm(ab,ac,L,bb,bc,M,i,j,t)Original native command in the exact edition - L31
specialize hr_witness_witness_witness_left (j) - L32
apply hr_witness_witness_witness_left - L33
exact hj
08Separate the logical casesL34–35
09Construct an explicit witnessL36–36
Supply the displayed value, then prove that it has the required property.
- L36
exists x3
10Separate the logical casesL37–37
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L37
split
11Use earlier factsL38–47
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L38
exact ht_witness_left - L39
specialize polynomial_diagonal_left_prefix_transport (ab) - L40
specialize polynomial_diagonal_left_prefix_transport (ac) - L41
specialize polynomial_diagonal_left_prefix_transport (L) - L42
specialize polynomial_diagonal_left_prefix_transport (AB) - L43
specialize polynomial_diagonal_left_prefix_transport (AC) - L44
specialize polynomial_diagonal_left_prefix_transport (K) - L45
specialize polynomial_diagonal_left_prefix_transport (bb) - L46
specialize polynomial_diagonal_left_prefix_transport (bc) - L47
specialize polynomial_diagonal_left_prefix_transport (M)
12Use earlier factsL48–57
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L48
specialize polynomial_diagonal_left_prefix_transport (N) - L49
specialize polynomial_diagonal_left_prefix_transport (i) - L50
specialize polynomial_diagonal_left_prefix_transport (j) - L51
specialize polynomial_diagonal_left_prefix_transport (x3) - L52
apply polynomial_diagonal_left_prefix_transport - L53
exact hl - L54
exact hk - L55
exact he - L56
specialize lt_of_lt_of_le (j) - L57
specialize lt_of_lt_of_le (S i)
13Use earlier factsL58–62
14Separate the logical casesL63–63
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L63
split
Original defined command ledger · 65 lines
- 0001
intro p - 0002
intro ab - 0003
intro ac - 0004
intro L - 0005
intro AB - 0006
intro AC - 0007
intro K - 0008
intro bb - 0009
intro bc - 0010
intro M - 0011
intro N - 0012
intro i - 0013
intro r - 0014
intro hl - 0015
intro hk - 0016
intro he - 0017
intro hi - 0018
intro hr - 0019
cases hr - 0020
cases hr_witness - 0021
cases hr_witness_witness - 0022
cases hr_witness_witness_witness - 0023
cases hr_witness_witness_witness_right - 0024
exists x - 0025
exists x1 - 0026
exists x2 - 0027
split - 0028
intro j - 0029
intro hj - 0030
have ht : ∃ t. BetaAt(x,x1,j,t) ∧ PolynomialDiagonalTerm(ab,ac,L,bb,bc,M,i,j,t) - 0031
specialize hr_witness_witness_witness_left (j) - 0032
apply hr_witness_witness_witness_left - 0033
exact hj - 0034
cases ht - 0035
cases ht_witness - 0036
exists x3 - 0037
split - 0038
exact ht_witness_left - 0039
specialize polynomial_diagonal_left_prefix_transport (ab) - 0040
specialize polynomial_diagonal_left_prefix_transport (ac) - 0041
specialize polynomial_diagonal_left_prefix_transport (L) - 0042
specialize polynomial_diagonal_left_prefix_transport (AB) - 0043
specialize polynomial_diagonal_left_prefix_transport (AC) - 0044
specialize polynomial_diagonal_left_prefix_transport (K) - 0045
specialize polynomial_diagonal_left_prefix_transport (bb) - 0046
specialize polynomial_diagonal_left_prefix_transport (bc) - 0047
specialize polynomial_diagonal_left_prefix_transport (M) - 0048
specialize polynomial_diagonal_left_prefix_transport (N) - 0049
specialize polynomial_diagonal_left_prefix_transport (i) - 0050
specialize polynomial_diagonal_left_prefix_transport (j) - 0051
specialize polynomial_diagonal_left_prefix_transport (x3) - 0052
apply polynomial_diagonal_left_prefix_transport - 0053
exact hl - 0054
exact hk - 0055
exact he - 0056
specialize lt_of_lt_of_le (j) - 0057
specialize lt_of_lt_of_le (S i) - 0058
specialize lt_of_lt_of_le (N) - 0059
apply lt_of_lt_of_le - 0060
exact hj - 0061
exact hi - 0062
exact ht_witness_right - 0063
split - 0064
exact hr_witness_witness_witness_right_left - 0065
exact hr_witness_witness_witness_right_right