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.
For n>1 the exponent gcd and a real beta table classify and witness all positive root degrees. The unit n=1 has a separate uniform certificate for every positive degree. Zero is excluded. NaturalSquarefreeDecomposition is deliberately distinct from the unrelated polynomial definition.
Exact theorem in conservative defined notation
∀ n. ∀ pb. ∀ pc. ∀ eb. ∀ ec. ∀ vb. ∀ vc. ∀ l. ∀ i. ∀ e. PrimeExponentEntries(n,pb,pc,eb,ec,vb,vc,l) → Lt(i,l) → BetaAt(eb,ec,i,e) → ∃ x. Prime(x) ∧ BoundedPowerValuation(x,n,n,e)
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.
01Fix variables and assumptionsL1–10
02Fix variables and assumptionsL11–13
03Establish hrowL14–17
Establish this local claim before using it. It is not an additional assumption. The following proof commands apply hentries.
- L14
have hrow : ∃ p. ∃ f. ∃ v. BetaAt(pb,pc,i,p) ∧ (BetaAt(eb,ec,i,f) ∧ (BetaAt(vb,vc,i,v) ∧ (Prime(p) ∧ (¬f = 0 ∧ (BoundedPowerValuation(p,n,n,f) ∧ Pow(p,f,v))))))Definitions: BetaAt(pb,pc,i,p)BetaAt(eb,ec,i,f)BetaAt(vb,vc,i,v)Prime(p)BoundedPowerValuation(p,n,n,f)Pow(p,f,v)Original native command in the exact edition - L15
specialize hentries (i) - L16
apply hentries - L17
exact hi
04Separate the logical casesL18–26
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L18
cases hrow - L19
cases hrow_witness - L20
cases hrow_witness_witness - L21
cases hrow_witness_witness_witness - L22
cases hrow_witness_witness_witness_right - L23
cases hrow_witness_witness_witness_right_right - L24
cases hrow_witness_witness_witness_right_right_right - L25
cases hrow_witness_witness_witness_right_right_right_right - L26
cases hrow_witness_witness_witness_right_right_right_right_right
05Establish heqL27–35
Establish this local claim before using it. It is not an additional assumption. The following proof commands apply beta at unique.
06Construct an explicit witnessL36–36
Supply the displayed value, then prove that it has the required property.
- L36
exists x
07Separate the logical casesL37–37
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L37
split
08Use earlier factsL38–38
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L38
exact hrow_witness_witness_witness_right_right_right_left
09Calculate and transport equalitiesL39–44
10Use earlier factsL45–45
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L45
exact hrow_witness_witness_witness_right_right_right_right_right_left
Original defined command ledger · 45 lines
- 0001
intro n - 0002
intro pb - 0003
intro pc - 0004
intro eb - 0005
intro ec - 0006
intro vb - 0007
intro vc - 0008
intro l - 0009
intro i - 0010
intro e - 0011
intro hentries - 0012
intro hi - 0013
intro hat - 0014
have hrow : ∃ p. ∃ f. ∃ v. BetaAt(pb,pc,i,p) ∧ (BetaAt(eb,ec,i,f) ∧ (BetaAt(vb,vc,i,v) ∧ (Prime(p) ∧ (¬f = 0 ∧ (BoundedPowerValuation(p,n,n,f) ∧ Pow(p,f,v)))))) - 0015
specialize hentries (i) - 0016
apply hentries - 0017
exact hi - 0018
cases hrow - 0019
cases hrow_witness - 0020
cases hrow_witness_witness - 0021
cases hrow_witness_witness_witness - 0022
cases hrow_witness_witness_witness_right - 0023
cases hrow_witness_witness_witness_right_right - 0024
cases hrow_witness_witness_witness_right_right_right - 0025
cases hrow_witness_witness_witness_right_right_right_right - 0026
cases hrow_witness_witness_witness_right_right_right_right_right - 0027
have heq : e = x1 - 0028
specialize beta_at_unique (eb) - 0029
specialize beta_at_unique (ec) - 0030
specialize beta_at_unique (i) - 0031
specialize beta_at_unique (e) - 0032
specialize beta_at_unique (x1) - 0033
apply beta_at_unique - 0034
exact hat - 0035
exact hrow_witness_witness_witness_right_left - 0036
exists x - 0037
split - 0038
exact hrow_witness_witness_witness_right_right_right_left - 0039
rewrite heq - 0040
rewrite heq - 0041
rewrite heq - 0042
rewrite heq - 0043
rewrite heq - 0044
rewrite heq - 0045
exact hrow_witness_witness_witness_right_right_right_right_right_left