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. ∀ k. ∀ r. ¬n = 0 → ¬k = 0 → Pow(r,k,n) → 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 38 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–6
02Establish hrL7–16
Establish this local claim before using it. It is not an additional assumption. The following proof commands apply positive power nonzero base.
03Fix variables and assumptionsL17–20
04Establish hbaseL21–24
Establish this local claim before using it. It is not an additional assumption. The following proof commands apply power valuation exists.
- L21
have hbase : ∃ f. BoundedPowerValuation(p,r,r,f)Definitions: BoundedPowerValuation(p,r,r,f)Original native command in the exact edition - L22
specialize power_valuation_exists (p) - L23
specialize power_valuation_exists (r) - L24
apply power_valuation_exists
05Separate the logical casesL25–25
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L25
cases hbase
06Construct an explicit witnessL26–26
Supply the displayed value, then prove that it has the required property.
- L26
exists x
07Use earlier factsL27–36
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L27
specialize prime_power_valuation_pow_value (p) - L28
specialize prime_power_valuation_pow_value (r) - L29
specialize prime_power_valuation_pow_value (k) - L30
specialize prime_power_valuation_pow_value (x) - L31
specialize prime_power_valuation_pow_value (n) - L32
specialize prime_power_valuation_pow_value (e) - L33
apply prime_power_valuation_pow_value - L34
exact hp - L35
exact hr - L36
exact hbase_witness
Original defined command ledger · 38 lines
- 0001
intro n - 0002
intro k - 0003
intro r - 0004
intro hn - 0005
intro hk - 0006
intro hpow - 0007
have hr : ~(r = 0) - 0008
intro hz - 0009
specialize positive_power_nonzero_base (n) - 0010
specialize positive_power_nonzero_base (k) - 0011
specialize positive_power_nonzero_base (r) - 0012
apply positive_power_nonzero_base - 0013
exact hn - 0014
exact hk - 0015
exact hpow - 0016
exact hz - 0017
intro p - 0018
intro e - 0019
intro hp - 0020
intro hval - 0021
have hbase : ∃ f. BoundedPowerValuation(p,r,r,f) - 0022
specialize power_valuation_exists (p) - 0023
specialize power_valuation_exists (r) - 0024
apply power_valuation_exists - 0025
cases hbase - 0026
exists x - 0027
specialize prime_power_valuation_pow_value (p) - 0028
specialize prime_power_valuation_pow_value (r) - 0029
specialize prime_power_valuation_pow_value (k) - 0030
specialize prime_power_valuation_pow_value (x) - 0031
specialize prime_power_valuation_pow_value (n) - 0032
specialize prime_power_valuation_pow_value (e) - 0033
apply prime_power_valuation_pow_value - 0034
exact hp - 0035
exact hr - 0036
exact hbase_witness - 0037
exact hpow - 0038
exact hval