norm_num extensions on natural numbers

This file provides a norm_num extension to prove that natural numbers are prime and compute its minimal factor. Todo: compute the list of all factors.

Implementation Notes

For numbers larger than 25 bits, the primality proof produced by norm_num is an expression that is thousands of levels deep, and the Lean kernel seems to raise a stack overflow when type-checking that proof. If we want an implementation that works for larger primes, we should generate a proof that has a smaller depth.

Note: evalMinFac.aux does not raise a stack overflow, which can be checked by replacing the prf' in the recursive call by something like (.sort .zero)

theorem Mathlib.Meta.NormNum.not_prime_mul_of_ble (a : ℕ) (b : ℕ) (n : ℕ) (h : a * b = n) (h₁ : Nat.ble a 1 = false) (h₂ : Nat.ble b 1 = false) : ¬Nat.Prime n

def Mathlib.Meta.NormNum.MinFacHelper (n : ℕ) (k : ℕ) : Prop

A predicate representing partial progress in a proof of minFac.

theorem Mathlib.Meta.NormNum.MinFacHelper.one_lt {n : ℕ} {k : ℕ} (h : Mathlib.Meta.NormNum.MinFacHelper n k) : 1 < n

theorem Mathlib.Meta.NormNum.minFacHelper_0 (n : ℕ) (h1 : Nat.ble 2 n = true) (h2 : 1 = n % 2) : Mathlib.Meta.NormNum.MinFacHelper n 3

theorem Mathlib.Meta.NormNum.minFacHelper_1 {n : ℕ} {k : ℕ} {k' : ℕ} (e : k + 2 = k') (h : Mathlib.Meta.NormNum.MinFacHelper n k) (np : Nat.minFac n ≠ k) : Mathlib.Meta.NormNum.MinFacHelper n k'

theorem Mathlib.Meta.NormNum.minFacHelper_2 {n : ℕ} {k : ℕ} {k' : ℕ} (e : k + 2 = k') (nk : ¬Nat.Prime k) (h : Mathlib.Meta.NormNum.MinFacHelper n k) : Mathlib.Meta.NormNum.MinFacHelper n k'

theorem Mathlib.Meta.NormNum.minFacHelper_3 {n : ℕ} {k : ℕ} {k' : ℕ} (e : k + 2 = k') (nk : Nat.beq (n % k) 0 = false) (h : Mathlib.Meta.NormNum.MinFacHelper n k) : Mathlib.Meta.NormNum.MinFacHelper n k'

theorem Mathlib.Meta.NormNum.isNat_minFac_1 {a : ℕ} : Mathlib.Meta.NormNum.IsNat a 1 → Mathlib.Meta.NormNum.IsNat (Nat.minFac a) 1

theorem Mathlib.Meta.NormNum.isNat_minFac_2 {a : ℕ} {a' : ℕ} : Mathlib.Meta.NormNum.IsNat a a' → a' % 2 = 0 → Mathlib.Meta.NormNum.IsNat (Nat.minFac a) 2

theorem Mathlib.Meta.NormNum.isNat_minFac_3 {n : ℕ} {n' : ℕ} (k : ℕ) : Mathlib.Meta.NormNum.IsNat n n' → Mathlib.Meta.NormNum.MinFacHelper n' k → 0 = n' % k → Mathlib.Meta.NormNum.IsNat (Nat.minFac n) k

theorem Mathlib.Meta.NormNum.isNat_minFac_4 {n : ℕ} {n' : ℕ} {k : ℕ} : Mathlib.Meta.NormNum.IsNat n n' → Mathlib.Meta.NormNum.MinFacHelper n' k → Nat.ble (k * k) n' = false → Mathlib.Meta.NormNum.IsNat (Nat.minFac n) n'

def Mathlib.Meta.NormNum.evalMinFac : Mathlib.Meta.NormNum.NormNumExt

The norm_num extension which identifies expressions of the form minFac n.

theorem Mathlib.Meta.NormNum.isNat_prime_0 {n : ℕ} : Mathlib.Meta.NormNum.IsNat n 0 → ¬Nat.Prime n

theorem Mathlib.Meta.NormNum.isNat_prime_1 {n : ℕ} : Mathlib.Meta.NormNum.IsNat n 1 → ¬Nat.Prime n

theorem Mathlib.Meta.NormNum.isNat_prime_2 {n : ℕ} {n' : ℕ} : Mathlib.Meta.NormNum.IsNat n n' → Nat.ble 2 n' = true → Mathlib.Meta.NormNum.IsNat (Nat.minFac n') n' → Nat.Prime n

theorem Mathlib.Meta.NormNum.isNat_not_prime {n : ℕ} {n' : ℕ} (h : Mathlib.Meta.NormNum.IsNat n n') : ¬Nat.Prime n' → ¬Nat.Prime n

def Mathlib.Meta.NormNum.evalNatPrime : Mathlib.Meta.NormNum.NormNumExt

The norm_num extension which identifies expressions of the form Nat.Prime n.