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. ∀ k. PrimeValuationSupport(n,pb,pc,eb,ec,vb,vc,l) → (∀ x. ∀ y. Lt(x,l) → BetaAt(eb,ec,x,y) → Dvd(k,y)) → PrimeValuationsDivisible(n,k)
Every linked abbreviation expands hygienically to the identical original native formula.
Definition DAG
Actual proof prerequisites
Complete tactic proof in conservative notation
All 80 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–15
03Establish hcaseL16–19
04Separate the logical casesL20–20
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L20
cases hcase
05Construct an explicit witnessL21–21
Supply the displayed value, then prove that it has the required property.
- L21
exists 0
06Calculate and transport equalitiesL22–23
07Use earlier factsL24–24
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L24
apply PA5
08Separate the logical casesL25–28
09Establish hmemberL29–38
Establish this local claim before using it. It is not an additional assumption. The following proof commands apply hsupport right right right left.
- L29
have hmember : ∃ i. Lt(i,l) ∧ BetaAt(pb,pc,i,p)Definitions: Lt(i,l)BetaAt(pb,pc,i,p)Original native command in the exact edition - L30
specialize hsupport_right_right_right_left (p) - L31
apply hsupport_right_right_right_left - L32
exact hp - L33
specialize power_valuation_nonzero_exponent_divides_base (p) - L34
specialize power_valuation_nonzero_exponent_divides_base (n) - L35
specialize power_valuation_nonzero_exponent_divides_base (e) - L36
apply power_valuation_nonzero_exponent_divides_base - L37
exact hval - L38
exact hcase_right
10Separate the logical casesL39–40
11Establish hrowL41–44
Establish this local claim before using it. It is not an additional assumption. The following proof commands apply hsupport right right left.
- L41
have hrow : ∃ q. ∃ f. ∃ v. BetaAt(pb,pc,x,q) ∧ (BetaAt(eb,ec,x,f) ∧ (BetaAt(vb,vc,x,v) ∧ (Prime(q) ∧ (¬f = 0 ∧ (BoundedPowerValuation(q,n,n,f) ∧ Pow(q,f,v))))))Definitions: BetaAt(pb,pc,x,q)BetaAt(eb,ec,x,f)BetaAt(vb,vc,x,v)Prime(q)BoundedPowerValuation(q,n,n,f)Pow(q,f,v)Original native command in the exact edition - L42
specialize hsupport_right_right_left (x) - L43
apply hsupport_right_right_left - L44
exact hmember_witness_left
12Separate the logical casesL45–53
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L45
cases hrow - L46
cases hrow_witness - L47
cases hrow_witness_witness - L48
cases hrow_witness_witness_witness - L49
cases hrow_witness_witness_witness_right - L50
cases hrow_witness_witness_witness_right_right - L51
cases hrow_witness_witness_witness_right_right_right - L52
cases hrow_witness_witness_witness_right_right_right_right - L53
cases hrow_witness_witness_witness_right_right_right_right_right
13Establish hprimeeqL54–63
Establish this local claim before using it. It is not an additional assumption. The following proof commands apply beta at unique.
- L54
have hprimeeq : p = x1 - L55
specialize beta_at_unique (pb) - L56
specialize beta_at_unique (pc) - L57
specialize beta_at_unique (x) - L58
specialize beta_at_unique (p) - L59
specialize beta_at_unique (x1) - L60
apply beta_at_unique - L61
exact hmember_witness_right - L62
exact hrow_witness_witness_witness_left - L63
rewrite hprimeeq at hval
14Calculate and transport equalitiesL64–66
15Establish hexpeqL67–76
Establish this local claim before using it. It is not an additional assumption. The following proof commands apply power valuation functional.
- L67
have hexpeq : e = x2 - L68
specialize power_valuation_functional (x1) - L69
specialize power_valuation_functional (n) - L70
specialize power_valuation_functional (e) - L71
specialize power_valuation_functional (x2) - L72
apply power_valuation_functional - L73
exact hval - L74
exact hrow_witness_witness_witness_right_right_right_right_right_left - L75
rewrite hexpeq - L76
specialize hcommon (x)
Original defined command ledger · 80 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 k - 0010
intro hsupport - 0011
intro hcommon - 0012
intro p - 0013
intro e - 0014
intro hp - 0015
intro hval - 0016
have hcase : e = 0 \/ ~(e = 0) - 0017
specialize eq_decidable (e) - 0018
specialize eq_decidable (0) - 0019
apply eq_decidable - 0020
cases hcase - 0021
exists 0 - 0022
rewrite hcase_left - 0023
symm - 0024
apply PA5 - 0025
cases hsupport - 0026
cases hsupport_right - 0027
cases hsupport_right_right - 0028
cases hsupport_right_right_right - 0029
have hmember : ∃ i. Lt(i,l) ∧ BetaAt(pb,pc,i,p) - 0030
specialize hsupport_right_right_right_left (p) - 0031
apply hsupport_right_right_right_left - 0032
exact hp - 0033
specialize power_valuation_nonzero_exponent_divides_base (p) - 0034
specialize power_valuation_nonzero_exponent_divides_base (n) - 0035
specialize power_valuation_nonzero_exponent_divides_base (e) - 0036
apply power_valuation_nonzero_exponent_divides_base - 0037
exact hval - 0038
exact hcase_right - 0039
cases hmember - 0040
cases hmember_witness - 0041
have hrow : ∃ q. ∃ f. ∃ v. BetaAt(pb,pc,x,q) ∧ (BetaAt(eb,ec,x,f) ∧ (BetaAt(vb,vc,x,v) ∧ (Prime(q) ∧ (¬f = 0 ∧ (BoundedPowerValuation(q,n,n,f) ∧ Pow(q,f,v)))))) - 0042
specialize hsupport_right_right_left (x) - 0043
apply hsupport_right_right_left - 0044
exact hmember_witness_left - 0045
cases hrow - 0046
cases hrow_witness - 0047
cases hrow_witness_witness - 0048
cases hrow_witness_witness_witness - 0049
cases hrow_witness_witness_witness_right - 0050
cases hrow_witness_witness_witness_right_right - 0051
cases hrow_witness_witness_witness_right_right_right - 0052
cases hrow_witness_witness_witness_right_right_right_right - 0053
cases hrow_witness_witness_witness_right_right_right_right_right - 0054
have hprimeeq : p = x1 - 0055
specialize beta_at_unique (pb) - 0056
specialize beta_at_unique (pc) - 0057
specialize beta_at_unique (x) - 0058
specialize beta_at_unique (p) - 0059
specialize beta_at_unique (x1) - 0060
apply beta_at_unique - 0061
exact hmember_witness_right - 0062
exact hrow_witness_witness_witness_left - 0063
rewrite hprimeeq at hval - 0064
rewrite hprimeeq at hval - 0065
rewrite hprimeeq at hval - 0066
rewrite hprimeeq at hval - 0067
have hexpeq : e = x2 - 0068
specialize power_valuation_functional (x1) - 0069
specialize power_valuation_functional (n) - 0070
specialize power_valuation_functional (e) - 0071
specialize power_valuation_functional (x2) - 0072
apply power_valuation_functional - 0073
exact hval - 0074
exact hrow_witness_witness_witness_right_right_right_right_right_left - 0075
rewrite hexpeq - 0076
specialize hcommon (x) - 0077
specialize hcommon (x2) - 0078
apply hcommon - 0079
exact hmember_witness_left - 0080
exact hrow_witness_witness_witness_right_left