Current library: Alpha v34, 4,223 checked-use theorems; Stable remains 432. Historical first admissions, original proof editions, and non-admitted aliases are preserved.
All coefficients retain the established highest-degree-first order. Trimming handles empty and all-zero prefixes; monic normalization requires a nonzero leading coefficient. Synthetic division has a nonempty input of length S n and a quotient of length n, unique in decoded values. Its coefficient recurrence, actual evaluation remainder and positive-degree drop are checked. General polynomial Euclidean division, gcd/Bezout, an arbitrary-convolution factor theorem, irreducible-polynomial existence and the full G091 prime-power-field endpoint remain open. These exact theorems are first admitted to Alpha v32; Stable remains unchanged.
Exact theorem in conservative defined notation
∀ p. ∀ b. ∀ c. ∀ a. ∀ n. Prime(p) → BetaPrefixInto(b,c,S n,p) → Lt(a,p) → ∃ x. ∃ y. ∃ z. FpSyntheticDivision(p,b,c,a,n,x,y,z) ∧ (∀ m. ∀ k. ∀ i. FpSyntheticDivision(p,b,c,a,n,m,k,i) → i = z ∧ (∀ j. ∀ u. Lt(j,n) → BetaAt(m,k,j,u) → BetaAt(x,y,j,u)))
Every linked abbreviation expands hygienically to the identical original native formula.
Definition DAG
Actual proof prerequisites
Complete tactic proof in conservative notation
All 45 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 (2)
01Fix variables and assumptionsL1–8
02Establish heL9–18
Establish this local claim before using it. It is not an additional assumption. The following proof commands apply prime field polynomial synthetic exists.
- L9
have he : ∃ qb. ∃ qc. ∃ r. FpSyntheticDivision(p,b,c,a,n,qb,qc,r)Definitions: FpSyntheticDivision(p,b,c,a,n,qb,qc,r)Original native command in the exact edition - L10
specialize prime_field_polynomial_synthetic_exists (p) - L11
specialize prime_field_polynomial_synthetic_exists (b) - L12
specialize prime_field_polynomial_synthetic_exists (c) - L13
specialize prime_field_polynomial_synthetic_exists (a) - L14
specialize prime_field_polynomial_synthetic_exists (n) - L15
apply prime_field_polynomial_synthetic_exists - L16
exact hp - L17
exact hc - L18
exact ha
03Separate the logical casesL19–21
04Construct an explicit witnessL22–24
05Separate the logical casesL25–25
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L25
split
06Use earlier factsL26–26
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L26
exact he_witness_witness_witness
07Fix variables and assumptionsL27–30
08Use earlier factsL31–40
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L31
specialize prime_field_polynomial_synthetic_functional (p) - L32
specialize prime_field_polynomial_synthetic_functional (b) - L33
specialize prime_field_polynomial_synthetic_functional (c) - L34
specialize prime_field_polynomial_synthetic_functional (a) - L35
specialize prime_field_polynomial_synthetic_functional (n) - L36
specialize prime_field_polynomial_synthetic_functional (Qb) - L37
specialize prime_field_polynomial_synthetic_functional (Qc) - L38
specialize prime_field_polynomial_synthetic_functional (s) - L39
specialize prime_field_polynomial_synthetic_functional (x) - L40
specialize prime_field_polynomial_synthetic_functional (x1)
Original defined command ledger · 45 lines
- 0001
intro p - 0002
intro b - 0003
intro c - 0004
intro a - 0005
intro n - 0006
intro hp - 0007
intro hc - 0008
intro ha - 0009
have he : ∃ qb. ∃ qc. ∃ r. FpSyntheticDivision(p,b,c,a,n,qb,qc,r) - 0010
specialize prime_field_polynomial_synthetic_exists (p) - 0011
specialize prime_field_polynomial_synthetic_exists (b) - 0012
specialize prime_field_polynomial_synthetic_exists (c) - 0013
specialize prime_field_polynomial_synthetic_exists (a) - 0014
specialize prime_field_polynomial_synthetic_exists (n) - 0015
apply prime_field_polynomial_synthetic_exists - 0016
exact hp - 0017
exact hc - 0018
exact ha - 0019
cases he - 0020
cases he_witness - 0021
cases he_witness_witness - 0022
exists x - 0023
exists x1 - 0024
exists x2 - 0025
split - 0026
exact he_witness_witness_witness - 0027
intro Qb - 0028
intro Qc - 0029
intro s - 0030
intro hQ - 0031
specialize prime_field_polynomial_synthetic_functional (p) - 0032
specialize prime_field_polynomial_synthetic_functional (b) - 0033
specialize prime_field_polynomial_synthetic_functional (c) - 0034
specialize prime_field_polynomial_synthetic_functional (a) - 0035
specialize prime_field_polynomial_synthetic_functional (n) - 0036
specialize prime_field_polynomial_synthetic_functional (Qb) - 0037
specialize prime_field_polynomial_synthetic_functional (Qc) - 0038
specialize prime_field_polynomial_synthetic_functional (s) - 0039
specialize prime_field_polynomial_synthetic_functional (x) - 0040
specialize prime_field_polynomial_synthetic_functional (x1) - 0041
specialize prime_field_polynomial_synthetic_functional (x2) - 0042
apply prime_field_polynomial_synthetic_functional - 0043
exact hp - 0044
exact hQ - 0045
exact he_witness_witness_witness