Current library: Alpha v34, 4,223 checked-use theorems; Stable remains 432. Historical first admissions, original proof editions, and non-admitted aliases are preserved. Exact original first-admission records.
Historical partial components only: this chapter proves exact natural polynomial Taylor remainders, bounded corrections, and one-step divisibility lifts. G095 is now closed in the separate Alpha-v27 hensel-lifting branch for integer polynomials, unrestricted input roots, unique canonical representatives, and every positive prime power. Full G095 proof · Alpha v27
Exact theorem in conservative defined notation
∀ b. ∀ c. ∀ t. ∀ h. ∀ l. ∀ n. ∀ d. ∀ z. HornerDerivative(b,c,t,l,n,d) → Horner(b,c,t + h,l,z) → ModEq(h · h,z,n + h · d)
Every linked abbreviation expands hygienically to the identical original native formula.
Definition DAG
Actual proof prerequisites
Complete unchanged native tactic proof
All 28 lines are the exact independently kernel-checked original 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
02Establish hremL11–20
Establish this local claim before using it. It is not an additional assumption. The following proof commands apply beta horner taylor remainder exists.
- L11
have hrem : exists q. z = (n + h * d) + (h * h) * q - L12
specialize beta_horner_taylor_remainder_exists b - L13
specialize beta_horner_taylor_remainder_exists c - L14
specialize beta_horner_taylor_remainder_exists t - L15
specialize beta_horner_taylor_remainder_exists h - L16
specialize beta_horner_taylor_remainder_exists l - L17
specialize beta_horner_taylor_remainder_exists n - L18
specialize beta_horner_taylor_remainder_exists d - L19
specialize beta_horner_taylor_remainder_exists z - L20
apply beta_horner_taylor_remainder_exists
03Use earlier factsL21–22
04Separate the logical casesL23–23
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L23
cases hrem
05Construct an explicit witnessL24–25
06Calculate and transport equalitiesL26–27
07Use earlier factsL28–28
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L28
exact hrem_witness
Original defined command ledger · 28 lines
- 0001
intro b - 0002
intro c - 0003
intro t - 0004
intro h - 0005
intro l - 0006
intro n - 0007
intro d - 0008
intro z - 0009
intro hpair - 0010
intro hshifted - 0011
have hrem : exists q. z = (n + h * d) + (h * h) * q - 0012
specialize beta_horner_taylor_remainder_exists b - 0013
specialize beta_horner_taylor_remainder_exists c - 0014
specialize beta_horner_taylor_remainder_exists t - 0015
specialize beta_horner_taylor_remainder_exists h - 0016
specialize beta_horner_taylor_remainder_exists l - 0017
specialize beta_horner_taylor_remainder_exists n - 0018
specialize beta_horner_taylor_remainder_exists d - 0019
specialize beta_horner_taylor_remainder_exists z - 0020
apply beta_horner_taylor_remainder_exists - 0021
exact hpair - 0022
exact hshifted - 0023
cases hrem - 0024
exists 0 - 0025
exists x - 0026
rewrite PA5 - 0027
rewrite PA3 - 0028
exact hrem_witness