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. ∀ k. ∀ ab. ∀ ac. ∀ bb. ∀ bc. ∀ L. ∀ d. FpRepresentedDegree(p,ab,ac,L,d) → FpMonicNormalization(p,k,ab,ac,bb,bc,L) → FpRepresentedDegree(p,bb,bc,L,d)
Every linked abbreviation expands hygienically to the identical original native formula.
Definition DAG
Actual proof prerequisites
Complete tactic proof in conservative notation
All 27 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–10
02Separate the logical casesL11–11
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L11
cases hd
03Use earlier factsL12–21
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L12
specialize prime_field_polynomial_monic_represented_degree (p) - L13
specialize prime_field_polynomial_monic_represented_degree (bb) - L14
specialize prime_field_polynomial_monic_represented_degree (bc) - L15
specialize prime_field_polynomial_monic_represented_degree (L) - L16
specialize prime_field_polynomial_monic_represented_degree (d) - L17
apply prime_field_polynomial_monic_represented_degree - L18
specialize prime_field_polynomial_monic_normalization_monic (p) - L19
specialize prime_field_polynomial_monic_normalization_monic (k) - L20
specialize prime_field_polynomial_monic_normalization_monic (ab) - L21
specialize prime_field_polynomial_monic_normalization_monic (ac)
04Use earlier factsL22–27
Instantiate or apply named facts and discharge the corresponding proof obligations.
Original defined command ledger · 27 lines
- 0001
intro p - 0002
intro k - 0003
intro ab - 0004
intro ac - 0005
intro bb - 0006
intro bc - 0007
intro L - 0008
intro d - 0009
intro hd - 0010
intro h - 0011
cases hd - 0012
specialize prime_field_polynomial_monic_represented_degree (p) - 0013
specialize prime_field_polynomial_monic_represented_degree (bb) - 0014
specialize prime_field_polynomial_monic_represented_degree (bc) - 0015
specialize prime_field_polynomial_monic_represented_degree (L) - 0016
specialize prime_field_polynomial_monic_represented_degree (d) - 0017
apply prime_field_polynomial_monic_represented_degree - 0018
specialize prime_field_polynomial_monic_normalization_monic (p) - 0019
specialize prime_field_polynomial_monic_normalization_monic (k) - 0020
specialize prime_field_polynomial_monic_normalization_monic (ab) - 0021
specialize prime_field_polynomial_monic_normalization_monic (ac) - 0022
specialize prime_field_polynomial_monic_normalization_monic (bb) - 0023
specialize prime_field_polynomial_monic_normalization_monic (bc) - 0024
specialize prime_field_polynomial_monic_normalization_monic (L) - 0025
apply prime_field_polynomial_monic_normalization_monic - 0026
exact h - 0027
exact hd_left