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. ∀ j. ∀ ab. ∀ ac. ∀ bb. ∀ bc. ∀ cb. ∀ cc. ∀ L. FpMonicNormalization(p,k,ab,ac,bb,bc,L) → FpMonicNormalization(p,j,ab,ac,cb,cc,L) → k = j
Every linked abbreviation expands hygienically to the identical original native formula.
Definition DAG
Actual proof prerequisites
Complete tactic proof in conservative notation
All 39 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.
01Fix variables and assumptionsL1–10
02Fix variables and assumptionsL11–12
03Separate the logical casesL13–20
04Establish heL21–30
Establish this local claim before using it. It is not an additional assumption. The following proof commands apply beta at unique.
- L21
have he : x1=x - L22
specialize beta_at_unique (ab) - L23
specialize beta_at_unique (ac) - L24
specialize beta_at_unique (0) - L25
specialize beta_at_unique (x1) - L26
specialize beta_at_unique (x) - L27
apply beta_at_unique - L28
exact hsecond_right_left_witness_left - L29
exact hfirst_right_left_witness_left - L30
rewrite he at hsecond_right_left_witness_right
05Calculate and transport equalitiesL31–32
06Use earlier factsL33–39
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L33
specialize prime_field_inverse_functional (p) - L34
specialize prime_field_inverse_functional (x) - L35
specialize prime_field_inverse_functional (k) - L36
specialize prime_field_inverse_functional (j) - L37
apply prime_field_inverse_functional - L38
exact hfirst_right_left_witness_right - L39
exact hsecond_right_left_witness_right
Original defined command ledger · 39 lines
- 0001
intro p - 0002
intro k - 0003
intro j - 0004
intro ab - 0005
intro ac - 0006
intro bb - 0007
intro bc - 0008
intro cb - 0009
intro cc - 0010
intro L - 0011
intro hfirst - 0012
intro hsecond - 0013
cases hfirst - 0014
cases hfirst_right - 0015
cases hsecond - 0016
cases hsecond_right - 0017
cases hfirst_right_left - 0018
cases hfirst_right_left_witness - 0019
cases hsecond_right_left - 0020
cases hsecond_right_left_witness - 0021
have he : x1=x - 0022
specialize beta_at_unique (ab) - 0023
specialize beta_at_unique (ac) - 0024
specialize beta_at_unique (0) - 0025
specialize beta_at_unique (x1) - 0026
specialize beta_at_unique (x) - 0027
apply beta_at_unique - 0028
exact hsecond_right_left_witness_left - 0029
exact hfirst_right_left_witness_left - 0030
rewrite he at hsecond_right_left_witness_right - 0031
rewrite he at hsecond_right_left_witness_right - 0032
rewrite he at hsecond_right_left_witness_right - 0033
specialize prime_field_inverse_functional (p) - 0034
specialize prime_field_inverse_functional (x) - 0035
specialize prime_field_inverse_functional (k) - 0036
specialize prime_field_inverse_functional (j) - 0037
apply prime_field_inverse_functional - 0038
exact hfirst_right_left_witness_right - 0039
exact hsecond_right_left_witness_right