Pell's equation and Matiyasevic's theorem

This file solves Pell's equation, i.e. integer solutions to x ^ 2 - d * y ^ 2 = 1 in the special case that d = a ^ 2 - 1. This is then applied to prove Matiyasevic's theorem that the power function is Diophantine, which is the last key ingredient in the solution to Hilbert's tenth problem. For the definition of Diophantine function, see NumberTheory.Dioph.

For results on Pell's equation for arbitrary (positive, non-square) d, see NumberTheory.Pell.

Main definition

• pell is a function assigning to a natural number n the n-th solution to Pell's equation constructed recursively from the initial solution (0, 1).

Main statements

• eq_pell shows that every solution to Pell's equation is recursively obtained using pell
• matiyasevic shows that a certain system of Diophantine equations has a solution if and only if the first variable is the x-component in a solution to Pell's equation - the key step towards Hilbert's tenth problem in Davis' version of Matiyasevic's theorem.
• eq_pow_of_pell shows that the power function is Diophantine.

Implementation notes

The proof of Matiyasevic's theorem doesn't follow Matiyasevic's original account of using Fibonacci numbers but instead Davis' variant of using solutions to Pell's equation.

References

• M. Carneiro, A Lean formalization of Matiyasevič's theorem
• M. Davis, Hilbert's tenth problem is unsolvable

Tags

Pell's equation, Matiyasevic's theorem, Hilbert's tenth problem

def Pell.IsPell {d : ℤ} : ℤ√d → Prop

The property of being a solution to the Pell equation, expressed as a property of elements of ℤ√d.

Equations

• Pell.IsPell { re := x_1, im := y } = (x_1 * x_1 - d * y * y = 1)

theorem Pell.isPell_norm {d : ℤ} {b : ℤ√d} : Pell.IsPell b ↔ b * star b = 1

theorem Pell.isPell_iff_mem_unitary {d : ℤ} {b : ℤ√d} : Pell.IsPell b ↔ b ∈ unitary (ℤ√d)

theorem Pell.isPell_mul {d : ℤ} {b c : ℤ√d} (hb : Pell.IsPell b) (hc : Pell.IsPell c) : Pell.IsPell (b * c)

theorem Pell.isPell_star {d : ℤ} {b : ℤ√d} : Pell.IsPell b ↔ Pell.IsPell (star b)

@[simp]

theorem Pell.d_pos {a : ℕ} (a1 : 1 < a) : 0 < Pell.d a1

def Pell.pell {a : ℕ} (a1 : 1 < a) : ℕ → ℕ × ℕ

The Pell sequences, i.e. the sequence of integer solutions to x ^ 2 - d * y ^ 2 = 1, where d = a ^ 2 - 1, defined together in mutual recursion.

Equations

• Pell.pell a1 0 = (1, 0)
• Pell.pell a1 n.succ = ((Pell.pell a1 n).1 * a + Pell.d a1 * (Pell.pell a1 n).2, (Pell.pell a1 n).1 + (Pell.pell a1 n).2 * a)

def Pell.xn {a : ℕ} (a1 : 1 < a) (n : ℕ) : ℕ

The Pell x sequence.

Equations

• Pell.xn a1 n = (Pell.pell a1 n).1

def Pell.yn {a : ℕ} (a1 : 1 < a) (n : ℕ) : ℕ

The Pell y sequence.

Equations

• Pell.yn a1 n = (Pell.pell a1 n).2

@[simp]

theorem Pell.pell_val {a : ℕ} (a1 : 1 < a) (n : ℕ) : Pell.pell a1 n = (Pell.xn a1 n, Pell.yn a1 n)

@[simp]

theorem Pell.xn_zero {a : ℕ} (a1 : 1 < a) : Pell.xn a1 0 = 1

@[simp]

theorem Pell.yn_zero {a : ℕ} (a1 : 1 < a) : Pell.yn a1 0 = 0

@[simp]

theorem Pell.xn_succ {a : ℕ} (a1 : 1 < a) (n : ℕ) : Pell.xn a1 (n + 1) = Pell.xn a1 n * a + Pell.d a1 * Pell.yn a1 n

@[simp]

theorem Pell.yn_succ {a : ℕ} (a1 : 1 < a) (n : ℕ) : Pell.yn a1 (n + 1) = Pell.xn a1 n + Pell.yn a1 n * a

theorem Pell.xn_one {a : ℕ} (a1 : 1 < a) : Pell.xn a1 1 = a

theorem Pell.yn_one {a : ℕ} (a1 : 1 < a) : Pell.yn a1 1 = 1

def Pell.xz {a : ℕ} (a1 : 1 < a) (n : ℕ) : ℤ

The Pell x sequence, considered as an integer sequence.

Equations

• Pell.xz a1 n = ↑(Pell.xn a1 n)

def Pell.yz {a : ℕ} (a1 : 1 < a) (n : ℕ) : ℤ

The Pell y sequence, considered as an integer sequence.

Equations

• Pell.yz a1 n = ↑(Pell.yn a1 n)

def Pell.az (a : ℕ) : ℤ

The element a such that d = a ^ 2 - 1, considered as an integer.

Equations

• Pell.az a = ↑a

theorem Pell.asq_pos {a : ℕ} (a1 : 1 < a) : 0 < a * a

theorem Pell.dz_val {a : ℕ} (a1 : 1 < a) : ↑(Pell.d a1) = Pell.az a * Pell.az a - 1

@[simp]

theorem Pell.xz_succ {a : ℕ} (a1 : 1 < a) (n : ℕ) : Pell.xz a1 (n + 1) = Pell.xz a1 n * Pell.az a + ↑(Pell.d a1) * Pell.yz a1 n

@[simp]

theorem Pell.yz_succ {a : ℕ} (a1 : 1 < a) (n : ℕ) : Pell.yz a1 (n + 1) = Pell.xz a1 n + Pell.yz a1 n * Pell.az a

def Pell.pellZd {a : ℕ} (a1 : 1 < a) (n : ℕ) : ℤ√↑(Pell.d a1)

The Pell sequence can also be viewed as an element of ℤ√d

Equations

• Pell.pellZd a1 n = { re := ↑(Pell.xn a1 n), im := ↑(Pell.yn a1 n) }

@[simp]

theorem Pell.pellZd_re {a : ℕ} (a1 : 1 < a) (n : ℕ) : (Pell.pellZd a1 n).re = ↑(Pell.xn a1 n)

@[simp]

theorem Pell.pellZd_im {a : ℕ} (a1 : 1 < a) (n : ℕ) : (Pell.pellZd a1 n).im = ↑(Pell.yn a1 n)

theorem Pell.isPell_nat {a : ℕ} (a1 : 1 < a) {x y : ℕ} : Pell.IsPell { re := ↑x, im := ↑y } ↔ x * x - Pell.d a1 * y * y = 1

@[simp]

theorem Pell.pellZd_succ {a : ℕ} (a1 : 1 < a) (n : ℕ) : Pell.pellZd a1 (n + 1) = Pell.pellZd a1 n * { re := ↑a, im := 1 }

theorem Pell.isPell_one {a : ℕ} (a1 : 1 < a) : Pell.IsPell { re := ↑a, im := 1 }

theorem Pell.isPell_pellZd {a : ℕ} (a1 : 1 < a) (n : ℕ) : Pell.IsPell (Pell.pellZd a1 n)

@[simp]

theorem Pell.pell_eqz {a : ℕ} (a1 : 1 < a) (n : ℕ) : Pell.xz a1 n * Pell.xz a1 n - ↑(Pell.d a1) * Pell.yz a1 n * Pell.yz a1 n = 1

@[simp]

theorem Pell.pell_eq {a : ℕ} (a1 : 1 < a) (n : ℕ) : Pell.xn a1 n * Pell.xn a1 n - Pell.d a1 * Pell.yn a1 n * Pell.yn a1 n = 1

instance Pell.dnsq {a : ℕ} (a1 : 1 < a) : Zsqrtd.Nonsquare (Pell.d a1)

Equations

• ⋯ = ⋯

theorem Pell.xn_ge_a_pow {a : ℕ} (a1 : 1 < a) (n : ℕ) : a ^ n ≤ Pell.xn a1 n

theorem Pell.n_lt_a_pow {a : ℕ} (a1 : 1 < a) (n : ℕ) : n < a ^ n

theorem Pell.n_lt_xn {a : ℕ} (a1 : 1 < a) (n : ℕ) : n < Pell.xn a1 n

theorem Pell.x_pos {a : ℕ} (a1 : 1 < a) (n : ℕ) : 0 < Pell.xn a1 n

theorem Pell.eq_pell_lem {a : ℕ} (a1 : 1 < a) (n : ℕ) (b : ℤ√↑(Pell.d a1)) : 1 ≤ b → Pell.IsPell b → b ≤ Pell.pellZd a1 n → ∃ (n : ℕ), b = Pell.pellZd a1 n

theorem Pell.eq_pellZd {a : ℕ} (a1 : 1 < a) (b : ℤ√↑(Pell.d a1)) (b1 : 1 ≤ b) (hp : Pell.IsPell b) : ∃ (n : ℕ), b = Pell.pellZd a1 n

theorem Pell.eq_pell {a : ℕ} (a1 : 1 < a) {x y : ℕ} (hp : x * x - Pell.d a1 * y * y = 1) : ∃ (n : ℕ), x = Pell.xn a1 n ∧ y = Pell.yn a1 n

Every solution to Pell's equation is recursively obtained from the initial solution (1,0) using the recursion pell.

theorem Pell.pellZd_add {a : ℕ} (a1 : 1 < a) (m n : ℕ) : Pell.pellZd a1 (m + n) = Pell.pellZd a1 m * Pell.pellZd a1 n

theorem Pell.xn_add {a : ℕ} (a1 : 1 < a) (m n : ℕ) : Pell.xn a1 (m + n) = Pell.xn a1 m * Pell.xn a1 n + Pell.d a1 * Pell.yn a1 m * Pell.yn a1 n

theorem Pell.yn_add {a : ℕ} (a1 : 1 < a) (m n : ℕ) : Pell.yn a1 (m + n) = Pell.xn a1 m * Pell.yn a1 n + Pell.yn a1 m * Pell.xn a1 n

theorem Pell.pellZd_sub {a : ℕ} (a1 : 1 < a) {m n : ℕ} (h : n ≤ m) : Pell.pellZd a1 (m - n) = Pell.pellZd a1 m * star (Pell.pellZd a1 n)

theorem Pell.xz_sub {a : ℕ} (a1 : 1 < a) {m n : ℕ} (h : n ≤ m) : Pell.xz a1 (m - n) = Pell.xz a1 m * Pell.xz a1 n - ↑(Pell.d a1) * Pell.yz a1 m * Pell.yz a1 n

theorem Pell.yz_sub {a : ℕ} (a1 : 1 < a) {m n : ℕ} (h : n ≤ m) : Pell.yz a1 (m - n) = Pell.xz a1 n * Pell.yz a1 m - Pell.xz a1 m * Pell.yz a1 n

theorem Pell.xy_coprime {a : ℕ} (a1 : 1 < a) (n : ℕ) : (Pell.xn a1 n).Coprime (Pell.yn a1 n)

theorem Pell.strictMono_y {a : ℕ} (a1 : 1 < a) : StrictMono (Pell.yn a1)

theorem Pell.strictMono_x {a : ℕ} (a1 : 1 < a) : StrictMono (Pell.xn a1)

theorem Pell.yn_ge_n {a : ℕ} (a1 : 1 < a) (n : ℕ) : n ≤ Pell.yn a1 n

theorem Pell.y_mul_dvd {a : ℕ} (a1 : 1 < a) (n k : ℕ) : Pell.yn a1 n ∣ Pell.yn a1 (n * k)

theorem Pell.y_dvd_iff {a : ℕ} (a1 : 1 < a) (m n : ℕ) : Pell.yn a1 m ∣ Pell.yn a1 n ↔ m ∣ n

theorem Pell.xy_modEq_yn {a : ℕ} (a1 : 1 < a) (n k : ℕ) : Pell.xn a1 (n * k) ≡ Pell.xn a1 n ^ k [MOD Pell.yn a1 n ^ 2] ∧ Pell.yn a1 (n * k) ≡ k * Pell.xn a1 n ^ (k - 1) * Pell.yn a1 n [MOD Pell.yn a1 n ^ 3]

theorem Pell.ysq_dvd_yy {a : ℕ} (a1 : 1 < a) (n : ℕ) : Pell.yn a1 n * Pell.yn a1 n ∣ Pell.yn a1 (n * Pell.yn a1 n)

theorem Pell.dvd_of_ysq_dvd {a : ℕ} (a1 : 1 < a) {n t : ℕ} (h : Pell.yn a1 n * Pell.yn a1 n ∣ Pell.yn a1 t) : Pell.yn a1 n ∣ t

theorem Pell.pellZd_succ_succ {a : ℕ} (a1 : 1 < a) (n : ℕ) : Pell.pellZd a1 (n + 2) + Pell.pellZd a1 n = ↑(2 * a) * Pell.pellZd a1 (n + 1)

theorem Pell.xy_succ_succ {a : ℕ} (a1 : 1 < a) (n : ℕ) : Pell.xn a1 (n + 2) + Pell.xn a1 n = 2 * a * Pell.xn a1 (n + 1) ∧ Pell.yn a1 (n + 2) + Pell.yn a1 n = 2 * a * Pell.yn a1 (n + 1)

theorem Pell.xn_succ_succ {a : ℕ} (a1 : 1 < a) (n : ℕ) : Pell.xn a1 (n + 2) + Pell.xn a1 n = 2 * a * Pell.xn a1 (n + 1)

theorem Pell.yn_succ_succ {a : ℕ} (a1 : 1 < a) (n : ℕ) : Pell.yn a1 (n + 2) + Pell.yn a1 n = 2 * a * Pell.yn a1 (n + 1)

theorem Pell.xz_succ_succ {a : ℕ} (a1 : 1 < a) (n : ℕ) : Pell.xz a1 (n + 2) = ↑(2 * a) * Pell.xz a1 (n + 1) - Pell.xz a1 n

theorem Pell.yz_succ_succ {a : ℕ} (a1 : 1 < a) (n : ℕ) : Pell.yz a1 (n + 2) = ↑(2 * a) * Pell.yz a1 (n + 1) - Pell.yz a1 n

theorem Pell.yn_modEq_a_sub_one {a : ℕ} (a1 : 1 < a) (n : ℕ) : Pell.yn a1 n ≡ n [MOD a - 1]

theorem Pell.yn_modEq_two {a : ℕ} (a1 : 1 < a) (n : ℕ) : Pell.yn a1 n ≡ n [MOD 2]

theorem Pell.x_sub_y_dvd_pow_lem (y2 y1 y0 yn1 yn0 xn1 xn0 ay a2 : ℤ) : (a2 * yn1 - yn0) * ay + y2 - (a2 * xn1 - xn0) = y2 - a2 * y1 + y0 + a2 * (yn1 * ay + y1 - xn1) - (yn0 * ay + y0 - xn0)

theorem Pell.x_sub_y_dvd_pow {a : ℕ} (a1 : 1 < a) (y n : ℕ) : 2 * ↑a * ↑y - ↑y * ↑y - 1 ∣ Pell.yz a1 n * (↑a - ↑y) + ↑(y ^ n) - Pell.xz a1 n

theorem Pell.xn_modEq_x2n_add_lem {a : ℕ} (a1 : 1 < a) (n j : ℕ) : Pell.xn a1 n ∣ Pell.d a1 * Pell.yn a1 n * (Pell.yn a1 n * Pell.xn a1 j) + Pell.xn a1 j

theorem Pell.xn_modEq_x2n_add {a : ℕ} (a1 : 1 < a) (n j : ℕ) : Pell.xn a1 (2 * n + j) + Pell.xn a1 j ≡ 0 [MOD Pell.xn a1 n]

theorem Pell.xn_modEq_x2n_sub_lem {a : ℕ} (a1 : 1 < a) {n j : ℕ} (h : j ≤ n) : Pell.xn a1 (2 * n - j) + Pell.xn a1 j ≡ 0 [MOD Pell.xn a1 n]

theorem Pell.xn_modEq_x2n_sub {a : ℕ} (a1 : 1 < a) {n j : ℕ} (h : j ≤ 2 * n) : Pell.xn a1 (2 * n - j) + Pell.xn a1 j ≡ 0 [MOD Pell.xn a1 n]

theorem Pell.xn_modEq_x4n_add {a : ℕ} (a1 : 1 < a) (n j : ℕ) : Pell.xn a1 (4 * n + j) ≡ Pell.xn a1 j [MOD Pell.xn a1 n]

theorem Pell.xn_modEq_x4n_sub {a : ℕ} (a1 : 1 < a) {n j : ℕ} (h : j ≤ 2 * n) : Pell.xn a1 (4 * n - j) ≡ Pell.xn a1 j [MOD Pell.xn a1 n]

theorem Pell.eq_of_xn_modEq_lem1 {a : ℕ} (a1 : 1 < a) {i n j : ℕ} : i < j → j < n → Pell.xn a1 i % Pell.xn a1 n < Pell.xn a1 j % Pell.xn a1 n

theorem Pell.eq_of_xn_modEq_lem2 {a : ℕ} (a1 : 1 < a) {n : ℕ} (h : 2 * Pell.xn a1 n = Pell.xn a1 (n + 1)) : a = 2 ∧ n = 0

theorem Pell.eq_of_xn_modEq_lem3 {a : ℕ} (a1 : 1 < a) {i n : ℕ} (npos : 0 < n) {j : ℕ} : i < j → j ≤ 2 * n → j ≠ n → ¬(a = 2 ∧ n = 1 ∧ i = 0 ∧ j = 2) → Pell.xn a1 i % Pell.xn a1 n < Pell.xn a1 j % Pell.xn a1 n

theorem Pell.eq_of_xn_modEq_le {a : ℕ} (a1 : 1 < a) {i j n : ℕ} (ij : i ≤ j) (j2n : j ≤ 2 * n) (h : Pell.xn a1 i ≡ Pell.xn a1 j [MOD Pell.xn a1 n]) (ntriv : ¬(a = 2 ∧ n = 1 ∧ i = 0 ∧ j = 2)) : i = j

theorem Pell.eq_of_xn_modEq {a : ℕ} (a1 : 1 < a) {i j n : ℕ} (i2n : i ≤ 2 * n) (j2n : j ≤ 2 * n) (h : Pell.xn a1 i ≡ Pell.xn a1 j [MOD Pell.xn a1 n]) (ntriv : a = 2 → n = 1 → (i = 0 → j ≠ 2) ∧ (i = 2 → j ≠ 0)) : i = j

theorem Pell.eq_of_xn_modEq' {a : ℕ} (a1 : 1 < a) {i j n : ℕ} (ipos : 0 < i) (hin : i ≤ n) (j4n : j ≤ 4 * n) (h : Pell.xn a1 j ≡ Pell.xn a1 i [MOD Pell.xn a1 n]) : j = i ∨ j + i = 4 * n

theorem Pell.modEq_of_xn_modEq {a : ℕ} (a1 : 1 < a) {i j n : ℕ} (ipos : 0 < i) (hin : i ≤ n) (h : Pell.xn a1 j ≡ Pell.xn a1 i [MOD Pell.xn a1 n]) : j ≡ i [MOD 4 * n] ∨ j + i ≡ 0 [MOD 4 * n]

theorem Pell.xy_modEq_of_modEq {a b c : ℕ} (a1 : 1 < a) (b1 : 1 < b) (h : a ≡ b [MOD c]) (n : ℕ) : Pell.xn a1 n ≡ Pell.xn b1 n [MOD c] ∧ Pell.yn a1 n ≡ Pell.yn b1 n [MOD c]

theorem Pell.matiyasevic {a k x y : ℕ} : (∃ (a1 : 1 < a), Pell.xn a1 k = x ∧ Pell.yn a1 k = y) ↔ 1 < a ∧ k ≤ y ∧ (x = 1 ∧ y = 0 ∨ ∃ (u : ℕ) (v : ℕ) (s : ℕ) (t : ℕ) (b : ℕ), x * x - (a * a - 1) * y * y = 1 ∧ u * u - (a * a - 1) * v * v = 1 ∧ s * s - (b * b - 1) * t * t = 1 ∧ 1 < b ∧ b ≡ 1 [MOD 4 * y] ∧ b ≡ a [MOD u] ∧ 0 < v ∧ y * y ∣ v ∧ s ≡ x [MOD u] ∧ t ≡ k [MOD 4 * y])

theorem Pell.eq_pow_of_pell_lem {a y k : ℕ} (hy0 : y ≠ 0) (hk0 : k ≠ 0) (hyk : y ^ k < a) : ↑(y ^ k) < 2 * ↑a * ↑y - ↑y * ↑y - 1

theorem Pell.eq_pow_of_pell {m n k : ℕ} : n ^ k = m ↔ k = 0 ∧ m = 1 ∨ 0 < k ∧ (n = 0 ∧ m = 0 ∨ 0 < n ∧ ∃ (w : ℕ) (a : ℕ) (t : ℕ) (z : ℕ) (a1 : 1 < a), Pell.xn a1 k ≡ Pell.yn a1 k * (a - n) + m [MOD t] ∧ 2 * a * n = t + (n * n + 1) ∧ m < t ∧ n ≤ w ∧ k ≤ w ∧ a * a - ((w + 1) * (w + 1) - 1) * (w * z) * (w * z) = 1)