mathlib documentation

data.zsqrtd.basic

structure zsqrtd (d : ℤ) :

Type

re : ℤ
im : ℤ

The ring of integers adjoined with a square root of d. These have the form a + b √d where a b : ℤ. The components are called re and im by analogy to the negative d case, but of course both parts are real here since d is nonnegative.

@[instance]

def zsqrtd.decidable_eq {d : ℤ} :

decidable_eq (ℤ√d)

Equations

zsqrtd.decidable_eq = id (λ (_v : ℤ√d), _v.cases_on (λ (re im : ℤ) (w : ℤ√d), w.cases_on (λ (w_re w_im : ℤ), decidable.by_cases (λ (a : re = w_re), eq.rec (decidable.by_cases (λ (a : im = w_im), eq.rec (is_true _) a) (λ (a : ¬im = w_im), is_false _)) a) (λ (a : ¬re = w_re), is_false _))))

theorem zsqrtd.ext {d : ℤ} {z w : ℤ√d} :

z = w ↔ z.re = w.re ∧ z.im = w.im

def zsqrtd.of_int {d : ℤ} (n : ℤ) :

Convert an integer to a ℤ√d

Equations

zsqrtd.of_int n = {re := n, im := 0}

theorem zsqrtd.of_int_re {d : ℤ} (n : ℤ) :

(zsqrtd.of_int n).re = n

theorem zsqrtd.of_int_im {d : ℤ} (n : ℤ) :

(zsqrtd.of_int n).im = 0

def zsqrtd.zero {d : ℤ} :

The zero of the ring

Equations

zsqrtd.zero = zsqrtd.of_int 0

@[instance]

def zsqrtd.has_zero {d : ℤ} :

has_zero (ℤ√d)

Equations

zsqrtd.has_zero = {zero := zsqrtd.zero d}

@[simp]

theorem zsqrtd.zero_re {d : ℤ} :

0.re = 0

@[simp]

theorem zsqrtd.zero_im {d : ℤ} :

0.im = 0

@[instance]

def zsqrtd.inhabited {d : ℤ} :

inhabited (ℤ√d)

Equations

zsqrtd.inhabited = {default := 0}

def zsqrtd.one {d : ℤ} :

The one of the ring

Equations

zsqrtd.one = zsqrtd.of_int 1

@[instance]

def zsqrtd.has_one {d : ℤ} :

has_one (ℤ√d)

Equations

zsqrtd.has_one = {one := zsqrtd.one d}

@[simp]

theorem zsqrtd.one_re {d : ℤ} :

1.re = 1

@[simp]

theorem zsqrtd.one_im {d : ℤ} :

1.im = 0

def zsqrtd.sqrtd {d : ℤ} :

The representative of √d in the ring

Equations

zsqrtd.sqrtd = {re := 0, im := 1}

@[simp]

theorem zsqrtd.sqrtd_re {d : ℤ} :

zsqrtd.sqrtd.re = 0

@[simp]

theorem zsqrtd.sqrtd_im {d : ℤ} :

zsqrtd.sqrtd.im = 1

def zsqrtd.add {d : ℤ} (a a_1 : ℤ√d) :

Addition of elements of ℤ√d

Equations

{re := x, im := y}.add {re := x', im := y'} = {re := x + x', im := y + y'}

@[instance]

def zsqrtd.has_add {d : ℤ} :

has_add (ℤ√d)

Equations

zsqrtd.has_add = {add := zsqrtd.add d}

@[simp]

theorem zsqrtd.add_def {d : ℤ} (x y x' y' : ℤ) :

{re := x, im := y} + {re := x', im := y'} = {re := x + x', im := y + y'}

@[simp]

theorem zsqrtd.add_re {d : ℤ} (z w : ℤ√d) :

(z + w).re = z.re + w.re

@[simp]

theorem zsqrtd.add_im {d : ℤ} (z w : ℤ√d) :

(z + w).im = z.im + w.im

@[simp]

theorem zsqrtd.bit0_re {d : ℤ} (z : ℤ√d) :

(bit0 z).re = bit0 z.re

@[simp]

theorem zsqrtd.bit0_im {d : ℤ} (z : ℤ√d) :

(bit0 z).im = bit0 z.im

@[simp]

theorem zsqrtd.bit1_re {d : ℤ} (z : ℤ√d) :

(bit1 z).re = bit1 z.re

@[simp]

theorem zsqrtd.bit1_im {d : ℤ} (z : ℤ√d) :

(bit1 z).im = bit0 z.im

def zsqrtd.neg {d : ℤ} (a : ℤ√d) :

Negation in ℤ√d

Equations

{re := x, im := y}.neg = {re := -x, im := -y}

@[instance]

def zsqrtd.has_neg {d : ℤ} :

has_neg (ℤ√d)

Equations

zsqrtd.has_neg = {neg := zsqrtd.neg d}

@[simp]

theorem zsqrtd.neg_re {d : ℤ} (z : ℤ√d) :

(-z).re = -z.re

@[simp]

theorem zsqrtd.neg_im {d : ℤ} (z : ℤ√d) :

(-z).im = -z.im

def zsqrtd.conj {d : ℤ} (a : ℤ√d) :

Conjugation in ℤ√d. The conjugate of a + b √d is a - b √d.

Equations

{re := x, im := y}.conj = {re := x, im := -y}

@[simp]

theorem zsqrtd.conj_re {d : ℤ} (z : ℤ√d) :

z.conj.re = z.re

@[simp]

theorem zsqrtd.conj_im {d : ℤ} (z : ℤ√d) :

z.conj.im = -z.im

def zsqrtd.mul {d : ℤ} (a a_1 : ℤ√d) :

Multiplication in ℤ√d

Equations

{re := x, im := y}.mul {re := x', im := y'} = {re := x * x' + (d * y) * y', im := x * y' + y * x'}

@[instance]

def zsqrtd.has_mul {d : ℤ} :

has_mul (ℤ√d)

Equations

zsqrtd.has_mul = {mul := zsqrtd.mul d}

@[simp]

theorem zsqrtd.mul_re {d : ℤ} (z w : ℤ√d) :

(z * w).re = (z.re) * w.re + (d * z.im) * w.im

@[simp]

theorem zsqrtd.mul_im {d : ℤ} (z w : ℤ√d) :

(z * w).im = (z.re) * w.im + (z.im) * w.re

@[instance]

def zsqrtd.comm_ring {d : ℤ} :

comm_ring (ℤ√d)

Equations

zsqrtd.comm_ring = {add := has_add.add zsqrtd.has_add, add_assoc := _, zero := 0, zero_add := _, add_zero := _, neg := has_neg.neg zsqrtd.has_neg, add_left_neg := _, add_comm := _, mul := has_mul.mul zsqrtd.has_mul, mul_assoc := _, one := 1, one_mul := _, mul_one := _, left_distrib := _, right_distrib := _, mul_comm := _}

@[instance]

def zsqrtd.add_comm_monoid {d : ℤ} :

add_comm_monoid (ℤ√d)

Equations

zsqrtd.add_comm_monoid = add_comm_group.to_add_comm_monoid (ℤ√d)

@[instance]

def zsqrtd.add_monoid {d : ℤ} :

add_monoid (ℤ√d)

Equations

zsqrtd.add_monoid = add_group.to_add_monoid (ℤ√d)

@[instance]

def zsqrtd.monoid {d : ℤ} :

monoid (ℤ√d)

Equations

zsqrtd.monoid = ring.to_monoid (ℤ√d)

@[instance]

def zsqrtd.comm_monoid {d : ℤ} :

comm_monoid (ℤ√d)

Equations

zsqrtd.comm_monoid = comm_semiring.to_comm_monoid (ℤ√d)

@[instance]

def zsqrtd.comm_semigroup {d : ℤ} :

comm_semigroup (ℤ√d)

Equations

zsqrtd.comm_semigroup = comm_ring.to_comm_semigroup (ℤ√d)

@[instance]

def zsqrtd.semigroup {d : ℤ} :

semigroup (ℤ√d)

Equations

zsqrtd.semigroup = monoid.to_semigroup (ℤ√d)

@[instance]

def zsqrtd.add_comm_semigroup {d : ℤ} :

add_comm_semigroup (ℤ√d)

Equations

zsqrtd.add_comm_semigroup = add_comm_monoid.to_add_comm_semigroup (ℤ√d)

@[instance]

def zsqrtd.add_semigroup {d : ℤ} :

add_semigroup (ℤ√d)

Equations

zsqrtd.add_semigroup = add_monoid.to_add_semigroup (ℤ√d)

@[instance]

def zsqrtd.comm_semiring {d : ℤ} :

comm_semiring (ℤ√d)

Equations

zsqrtd.comm_semiring = comm_ring.to_comm_semiring

@[instance]

def zsqrtd.semiring {d : ℤ} :

semiring (ℤ√d)

Equations

zsqrtd.semiring = ring.to_semiring

@[instance]

def zsqrtd.ring {d : ℤ} :

Equations

zsqrtd.ring = comm_ring.to_ring (ℤ√d)

@[instance]

def zsqrtd.distrib {d : ℤ} :

distrib (ℤ√d)

Equations

zsqrtd.distrib = ring.to_distrib (ℤ√d)

@[instance]

def zsqrtd.nontrivial {d : ℤ} :

nontrivial (ℤ√d)

@[simp]

theorem zsqrtd.coe_nat_re {d : ℤ} (n : ℕ) :

@[simp]

theorem zsqrtd.coe_nat_im {d : ℤ} (n : ℕ) :

theorem zsqrtd.coe_nat_val {d : ℤ} (n : ℕ) :

↑n = {re := ↑n, im := 0}

@[simp]

theorem zsqrtd.coe_int_re {d : ℤ} (n : ℤ) :

@[simp]

theorem zsqrtd.coe_int_im {d : ℤ} (n : ℤ) :

theorem zsqrtd.coe_int_val {d : ℤ} (n : ℤ) :

↑n = {re := n, im := 0}

@[instance]

def zsqrtd.char_zero {d : ℤ} :

char_zero (ℤ√d)

@[simp]

theorem zsqrtd.of_int_eq_coe {d : ℤ} (n : ℤ) :

zsqrtd.of_int n = ↑n

@[simp]

theorem zsqrtd.smul_val {d : ℤ} (n x y : ℤ) :

(↑n) * {re := x, im := y} = {re := n * x, im := n * y}

@[simp]

theorem zsqrtd.muld_val {d : ℤ} (x y : ℤ) :

zsqrtd.sqrtd * {re := x, im := y} = {re := d * y, im := x}

@[simp]

theorem zsqrtd.smuld_val {d : ℤ} (n x y : ℤ) :

(zsqrtd.sqrtd * ↑n) * {re := x, im := y} = {re := (d * n) * y, im := n * x}

theorem zsqrtd.decompose {d x y : ℤ} :

{re := x, im := y} = ↑x + zsqrtd.sqrtd * ↑y

theorem zsqrtd.mul_conj {d x y : ℤ} :

{re := x, im := y} * {re := x, im := y}.conj = (↑x) * ↑x - ((↑d) * ↑y) * ↑y

theorem zsqrtd.conj_mul {d : ℤ} {a b : ℤ√d} :

(a * b).conj = (a.conj) * b.conj

theorem zsqrtd.coe_int_add {d : ℤ} (m n : ℤ) :

↑(m + n) = ↑m + ↑n

theorem zsqrtd.coe_int_sub {d : ℤ} (m n : ℤ) :

↑(m - n) = ↑m - ↑n

theorem zsqrtd.coe_int_mul {d : ℤ} (m n : ℤ) :

↑m * n = (↑m) * ↑n

theorem zsqrtd.coe_int_inj {d m n : ℤ} (h : ↑m = ↑n) :

m = n

def zsqrtd.sq_le (a c b d : ℕ) :

Prop

Read sq_le a c b d as a √c ≤ b √d

Equations

zsqrtd.sq_le a c b d = ((c * a) * a ≤ (d * b) * b)

theorem zsqrtd.sq_le_of_le {c d x y z w : ℕ} (xz : z ≤ x) (yw : y ≤ w) (xy : zsqrtd.sq_le x c y d) :

zsqrtd.sq_le z c w d

theorem zsqrtd.sq_le_add_mixed {c d x y z w : ℕ} (xy : zsqrtd.sq_le x c y d) (zw : zsqrtd.sq_le z c w d) :

c * x * z ≤ d * y * w

theorem zsqrtd.sq_le_add {c d x y z w : ℕ} (xy : zsqrtd.sq_le x c y d) (zw : zsqrtd.sq_le z c w d) :

zsqrtd.sq_le (x + z) c (y + w) d

theorem zsqrtd.sq_le_cancel {c d x y z w : ℕ} (zw : zsqrtd.sq_le y d x c) (h : zsqrtd.sq_le (x + z) c (y + w) d) :

zsqrtd.sq_le z c w d

theorem zsqrtd.sq_le_smul {c d x y : ℕ} (n : ℕ) (xy : zsqrtd.sq_le x c y d) :

zsqrtd.sq_le (n * x) c (n * y) d

theorem zsqrtd.sq_le_mul {d x y z w : ℕ} :

(zsqrtd.sq_le x 1 y d → zsqrtd.sq_le z 1 w d → zsqrtd.sq_le (x * w + y * z) d (x * z + (d * y) * w) 1) ∧ (zsqrtd.sq_le x 1 y d → zsqrtd.sq_le w d z 1 → zsqrtd.sq_le (x * z + (d * y) * w) 1 (x * w + y * z) d) ∧ (zsqrtd.sq_le y d x 1 → zsqrtd.sq_le z 1 w d → zsqrtd.sq_le (x * z + (d * y) * w) 1 (x * w + y * z) d) ∧ (zsqrtd.sq_le y d x 1 → zsqrtd.sq_le w d z 1 → zsqrtd.sq_le (x * w + y * z) d (x * z + (d * y) * w) 1)

def zsqrtd.nonnegg (c d : ℕ) (a a_1 : ℤ) :

Prop

"Generalized" nonneg. nonnegg c d x y means a √c + b √d ≥ 0; we are interested in the case c = 1 but this is more symmetric

Equations

zsqrtd.nonnegg c d -[1+ a] -[1+ b] = false
zsqrtd.nonnegg c d -[1+ a] ↑b = zsqrtd.sq_le (a + 1) d b c
zsqrtd.nonnegg c d ↑a -[1+ b] = zsqrtd.sq_le (b + 1) c a d
zsqrtd.nonnegg c d ↑a ↑b = true

theorem zsqrtd.nonnegg_comm {c d : ℕ} {x y : ℤ} :

zsqrtd.nonnegg c d x y = zsqrtd.nonnegg d c y x

theorem zsqrtd.nonnegg_neg_pos {c d a b : ℕ} :

zsqrtd.nonnegg c d (-↑a) ↑b ↔ zsqrtd.sq_le a d b c

theorem zsqrtd.nonnegg_pos_neg {c d a b : ℕ} :

zsqrtd.nonnegg c d ↑a (-↑b) ↔ zsqrtd.sq_le b c a d

theorem zsqrtd.nonnegg_cases_right {c d a : ℕ} {b : ℤ} (a_1 : ∀ (x : ℕ), b = -↑x → zsqrtd.sq_le x c a d) :

zsqrtd.nonnegg c d ↑a b

theorem zsqrtd.nonnegg_cases_left {c d b : ℕ} {a : ℤ} (h : ∀ (x : ℕ), a = -↑x → zsqrtd.sq_le x d b c) :

zsqrtd.nonnegg c d a ↑b

def zsqrtd.norm {d : ℤ} (n : ℤ√d) :

Equations

n.norm = (n.re) * n.re - (d * n.im) * n.im

@[simp]

theorem zsqrtd.norm_zero {d : ℤ} :

0.norm = 0

@[simp]

theorem zsqrtd.norm_one {d : ℤ} :

1.norm = 1

@[simp]

theorem zsqrtd.norm_int_cast {d : ℤ} (n : ℤ) :

↑n.norm = n * n

@[simp]

theorem zsqrtd.norm_nat_cast {d : ℤ} (n : ℕ) :

↑n.norm = (↑n) * ↑n

@[simp]

theorem zsqrtd.norm_mul {d : ℤ} (n m : ℤ√d) :

(n * m).norm = (n.norm) * m.norm

theorem zsqrtd.norm_eq_mul_conj {d : ℤ} (n : ℤ√d) :

↑(n.norm) = n * n.conj

@[instance]

def zsqrtd.is_monoid_hom {d : ℤ} :

is_monoid_hom zsqrtd.norm

theorem zsqrtd.norm_nonneg {d : ℤ} (hd : d ≤ 0) (n : ℤ√d) :

theorem zsqrtd.norm_eq_one_iff {d : ℤ} {x : ℤ√d} :

x.norm.nat_abs = 1 ↔ is_unit x

def zsqrtd.nonneg {d : ℕ} (a : ℤ√↑d) :

Prop

Nonnegativity of an element of ℤ√d.

Equations

{re := a, im := b}.nonneg = zsqrtd.nonnegg d 1 a b

def zsqrtd.le {d : ℕ} (a b : ℤ√↑d) :

Prop

Equations

a.le b = (b - a).nonneg

@[instance]

def zsqrtd.has_le {d : ℕ} :

has_le (ℤ√↑d)

Equations

zsqrtd.has_le = {le := zsqrtd.le d}

def zsqrtd.lt {d : ℕ} (a b : ℤ√↑d) :

Prop

Equations

a.lt b = ¬b ≤ a

@[instance]

def zsqrtd.has_lt {d : ℕ} :

has_lt (ℤ√↑d)

Equations

zsqrtd.has_lt = {lt := zsqrtd.lt d}

@[instance]

def zsqrtd.decidable_nonnegg (c d : ℕ) (a b : ℤ) :

decidable (zsqrtd.nonnegg c d a b)

Equations

zsqrtd.decidable_nonnegg c d a b = a.cases_on (λ (a : ℕ), b.cases_on (λ (b : ℕ), _.mpr (_.mpr (_.mpr decidable.true))) (λ (b : ℕ), _.mpr (_.mpr (((c * (b + 1)) * (b + 1)).decidable_le ((d * a) * a))))) (λ (a : ℕ), b.cases_on (λ (b : ℕ), _.mpr (_.mpr (((d * (a + 1)) * (a + 1)).decidable_le ((c * b) * b)))) (λ (b : ℕ), _.mpr decidable.false))

@[instance]

def zsqrtd.decidable_nonneg {d : ℕ} (a : ℤ√↑d) :

decidable a.nonneg

Equations

{re := a, im := b}.decidable_nonneg = zsqrtd.decidable_nonnegg d 1 a b

@[instance]

def zsqrtd.decidable_le {d : ℕ} (a b : ℤ√↑d) :

decidable (a ≤ b)

Equations

a.decidable_le b = (b - a).decidable_nonneg

theorem zsqrtd.nonneg_cases {d : ℕ} {a : ℤ√↑d} (a_1 : a.nonneg) :

∃ (x y : ℕ), a = {re := ↑x, im := ↑y} ∨ a = {re := ↑x, im := -↑y} ∨ a = {re := -↑x, im := ↑y}

theorem zsqrtd.nonneg_add_lem {d x y z w : ℕ} (xy : {re := ↑x, im := -↑y}.nonneg) (zw : {re := -↑z, im := ↑w}.nonneg) :

({re := ↑x, im := -↑y} + {re := -↑z, im := ↑w}).nonneg

theorem zsqrtd.nonneg_add {d : ℕ} {a b : ℤ√↑d} (ha : a.nonneg) (hb : b.nonneg) :

(a + b).nonneg

theorem zsqrtd.le_refl {d : ℕ} (a : ℤ√↑d) :

a ≤ a

theorem zsqrtd.le_trans {d : ℕ} {a b c : ℤ√↑d} (ab : a ≤ b) (bc : b ≤ c) :

a ≤ c

theorem zsqrtd.nonneg_iff_zero_le {d : ℕ} {a : ℤ√↑d} :

a.nonneg ↔ 0 ≤ a

theorem zsqrtd.le_of_le_le {d : ℕ} {x y z w : ℤ} (xz : x ≤ z) (yw : y ≤ w) :

{re := x, im := y} ≤ {re := z, im := w}

theorem zsqrtd.le_arch {d : ℕ} (a : ℤ√↑d) :

∃ (n : ℕ), a ≤ ↑n

theorem zsqrtd.nonneg_total {d : ℕ} (a : ℤ√↑d) :

a.nonneg ∨ (-a).nonneg

theorem zsqrtd.le_total {d : ℕ} (a b : ℤ√↑d) :

a ≤ b ∨ b ≤ a

@[instance]

def zsqrtd.preorder {d : ℕ} :

preorder (ℤ√↑d)

Equations

zsqrtd.preorder = {le := zsqrtd.le d, lt := zsqrtd.lt d, le_refl := _, le_trans := _, lt_iff_le_not_le := _}

theorem zsqrtd.add_le_add_left {d : ℕ} (a b : ℤ√↑d) (ab : a ≤ b) (c : ℤ√↑d) :

c + a ≤ c + b

theorem zsqrtd.le_of_add_le_add_left {d : ℕ} (a b c : ℤ√↑d) (h : c + a ≤ c + b) :

a ≤ b

theorem zsqrtd.add_lt_add_left {d : ℕ} (a b : ℤ√↑d) (h : a < b) (c : ℤ√↑d) :

c + a < c + b

theorem zsqrtd.nonneg_smul {d : ℕ} {a : ℤ√↑d} {n : ℕ} (ha : a.nonneg) :

((↑n) * a).nonneg

theorem zsqrtd.nonneg_muld {d : ℕ} {a : ℤ√↑d} (ha : a.nonneg) :

(zsqrtd.sqrtd * a).nonneg

theorem zsqrtd.nonneg_mul_lem {d x y : ℕ} {a : ℤ√↑d} (ha : a.nonneg) :

({re := ↑x, im := ↑y} * a).nonneg

theorem zsqrtd.nonneg_mul {d : ℕ} {a b : ℤ√↑d} (ha : a.nonneg) (hb : b.nonneg) :

(a * b).nonneg

theorem zsqrtd.mul_nonneg {d : ℕ} (a b : ℤ√↑d) (a_1 : 0 ≤ a) (a_2 : 0 ≤ b) :

0 ≤ a * b

theorem zsqrtd.not_sq_le_succ (c d y : ℕ) (h : 0 < c) :

¬zsqrtd.sq_le (y + 1) c 0 d

@[class]

structure zsqrtd.nonsquare (x : ℕ) :

Prop

ns : ∀ (n : ℕ), x ≠ n * n

A nonsquare is a natural number that is not equal to the square of an integer. This is implemented as a typeclass because it's a necessary condition for much of the Pell equation theory.

Instances

pell.dnsq

theorem zsqrtd.d_pos {d : ℕ} [dnsq : zsqrtd.nonsquare d] :

0 < d

theorem zsqrtd.divides_sq_eq_zero {d : ℕ} [dnsq : zsqrtd.nonsquare d] {x y : ℕ} (h : x * x = (d * y) * y) :

x = 0 ∧ y = 0

theorem zsqrtd.divides_sq_eq_zero_z {d : ℕ} [dnsq : zsqrtd.nonsquare d] {x y : ℤ} (h : x * x = ((↑d) * y) * y) :

x = 0 ∧ y = 0

theorem zsqrtd.not_divides_square {d : ℕ} [dnsq : zsqrtd.nonsquare d] (x y : ℕ) :

(x + 1) * (x + 1) ≠ (d * (y + 1)) * (y + 1)

theorem zsqrtd.nonneg_antisymm {d : ℕ} [dnsq : zsqrtd.nonsquare d] {a : ℤ√↑d} (a_1 : a.nonneg) (a_2 : (-a).nonneg) :

a = 0

theorem zsqrtd.le_antisymm {d : ℕ} [dnsq : zsqrtd.nonsquare d] {a b : ℤ√↑d} (ab : a ≤ b) (ba : b ≤ a) :

a = b

@[instance]

def zsqrtd.decidable_linear_order {d : ℕ} [dnsq : zsqrtd.nonsquare d] :

decidable_linear_order (ℤ√↑d)

Equations

zsqrtd.decidable_linear_order = {le := preorder.le zsqrtd.preorder, lt := preorder.lt zsqrtd.preorder, le_refl := _, le_trans := _, lt_iff_le_not_le := _, le_antisymm := _, le_total := _, decidable_le := zsqrtd.decidable_le d, decidable_eq := decidable_eq_of_decidable_le zsqrtd.decidable_le, decidable_lt := decidable_lt_of_decidable_le zsqrtd.decidable_le}

theorem zsqrtd.eq_zero_or_eq_zero_of_mul_eq_zero {d : ℕ} [dnsq : zsqrtd.nonsquare d] {a b : ℤ√↑d} (a_1 : a * b = 0) :

a = 0 ∨ b = 0

@[instance]

def zsqrtd.integral_domain {d : ℕ} [dnsq : zsqrtd.nonsquare d] :

integral_domain (ℤ√↑d)

Equations

zsqrtd.integral_domain = {add := comm_ring.add zsqrtd.comm_ring, add_assoc := _, zero := comm_ring.zero zsqrtd.comm_ring, zero_add := _, add_zero := _, neg := comm_ring.neg zsqrtd.comm_ring, add_left_neg := _, add_comm := _, mul := comm_ring.mul zsqrtd.comm_ring, mul_assoc := _, one := comm_ring.one zsqrtd.comm_ring, one_mul := _, mul_one := _, left_distrib := _, right_distrib := _, mul_comm := _, exists_pair_ne := _, eq_zero_or_eq_zero_of_mul_eq_zero := _}

theorem zsqrtd.mul_pos {d : ℕ} [dnsq : zsqrtd.nonsquare d] (a b : ℤ√↑d) (a0 : 0 < a) (b0 : 0 < b) :

0 < a * b

@[instance]

def zsqrtd.decidable_linear_ordered_comm_ring {d : ℕ} [dnsq : zsqrtd.nonsquare d] :

decidable_linear_ordered_comm_ring (ℤ√↑d)

Equations

zsqrtd.decidable_linear_ordered_comm_ring = {add := comm_ring.add zsqrtd.comm_ring, add_assoc := _, zero := comm_ring.zero zsqrtd.comm_ring, zero_add := _, add_zero := _, neg := comm_ring.neg zsqrtd.comm_ring, add_left_neg := _, add_comm := _, mul := comm_ring.mul zsqrtd.comm_ring, mul_assoc := _, one := comm_ring.one zsqrtd.comm_ring, one_mul := _, mul_one := _, left_distrib := _, right_distrib := _, le := decidable_linear_order.le zsqrtd.decidable_linear_order, lt := decidable_linear_order.lt zsqrtd.decidable_linear_order, le_refl := _, le_trans := _, lt_iff_le_not_le := _, le_antisymm := _, add_le_add_left := _, exists_pair_ne := _, mul_pos := _, le_total := _, zero_lt_one := _, mul_comm := _, decidable_le := decidable_linear_order.decidable_le zsqrtd.decidable_linear_order, decidable_eq := decidable_linear_order.decidable_eq zsqrtd.decidable_linear_order, decidable_lt := decidable_linear_order.decidable_lt zsqrtd.decidable_linear_order}

@[instance]

def zsqrtd.decidable_linear_ordered_semiring {d : ℕ} [dnsq : zsqrtd.nonsquare d] :

decidable_linear_ordered_semiring (ℤ√↑d)

Equations

zsqrtd.decidable_linear_ordered_semiring = decidable_linear_ordered_comm_ring.to_decidable_linear_ordered_semiring

@[instance]

def zsqrtd.linear_ordered_semiring {d : ℕ} [dnsq : zsqrtd.nonsquare d] :

linear_ordered_semiring (ℤ√↑d)

Equations

zsqrtd.linear_ordered_semiring = linear_ordered_ring.to_linear_ordered_semiring

@[instance]

def zsqrtd.ordered_semiring {d : ℕ} [dnsq : zsqrtd.nonsquare d] :

ordered_semiring (ℤ√↑d)

Equations

zsqrtd.ordered_semiring = ordered_ring.to_ordered_semiring