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 products and sums use actual beta-coded coefficients; equality is formal coefficient equivalence, not equality of evaluations or raw codes. The zero gcd is included. Uniqueness is up to formal equivalence, not unique Bézout coefficients. This proves the polynomial gcd component, not G091 irreducible-polynomial existence or arbitrary prime-power-field construction.
Exact theorem in conservative defined notation
∀ p. ∀ ub. ∀ uc. ∀ ab. ∀ ac. ∀ L. ∀ cb. ∀ cc. BetaAt(ub,uc,0,1) → FpPolyProduct(p,ub,uc,1,ab,ac,L,cb,cc,L) → PolynomialEquivalent(cb,cc,L,ab,ac,L)
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 (1)
01Fix variables and assumptionsL1–10
02Use earlier factsL11–20
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L11
specialize prime_field_polynomial_equal_implies_equivalent (cb) - L12
specialize prime_field_polynomial_equal_implies_equivalent (cc) - L13
specialize prime_field_polynomial_equal_implies_equivalent (ab) - L14
specialize prime_field_polynomial_equal_implies_equivalent (ac) - L15
specialize prime_field_polynomial_equal_implies_equivalent (L) - L16
apply prime_field_polynomial_equal_implies_equivalent - L17
specialize prime_field_polynomial_convolution_left_unit_equal (p) - L18
specialize prime_field_polynomial_convolution_left_unit_equal (ub) - L19
specialize prime_field_polynomial_convolution_left_unit_equal (uc) - L20
specialize prime_field_polynomial_convolution_left_unit_equal (ab)
03Use earlier factsL21–27
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L21
specialize prime_field_polynomial_convolution_left_unit_equal (ac) - L22
specialize prime_field_polynomial_convolution_left_unit_equal (L) - L23
specialize prime_field_polynomial_convolution_left_unit_equal (cb) - L24
specialize prime_field_polynomial_convolution_left_unit_equal (cc) - L25
apply prime_field_polynomial_convolution_left_unit_equal - L26
exact hu - L27
exact hc
Original defined command ledger · 27 lines
- 0001
intro p - 0002
intro ub - 0003
intro uc - 0004
intro ab - 0005
intro ac - 0006
intro L - 0007
intro cb - 0008
intro cc - 0009
intro hu - 0010
intro hc - 0011
specialize prime_field_polynomial_equal_implies_equivalent (cb) - 0012
specialize prime_field_polynomial_equal_implies_equivalent (cc) - 0013
specialize prime_field_polynomial_equal_implies_equivalent (ab) - 0014
specialize prime_field_polynomial_equal_implies_equivalent (ac) - 0015
specialize prime_field_polynomial_equal_implies_equivalent (L) - 0016
apply prime_field_polynomial_equal_implies_equivalent - 0017
specialize prime_field_polynomial_convolution_left_unit_equal (p) - 0018
specialize prime_field_polynomial_convolution_left_unit_equal (ub) - 0019
specialize prime_field_polynomial_convolution_left_unit_equal (uc) - 0020
specialize prime_field_polynomial_convolution_left_unit_equal (ab) - 0021
specialize prime_field_polynomial_convolution_left_unit_equal (ac) - 0022
specialize prime_field_polynomial_convolution_left_unit_equal (L) - 0023
specialize prime_field_polynomial_convolution_left_unit_equal (cb) - 0024
specialize prime_field_polynomial_convolution_left_unit_equal (cc) - 0025
apply prime_field_polynomial_convolution_left_unit_equal - 0026
exact hu - 0027
exact hc