Helper definitions and theorems for constructing linear arithmetic proofs.

@[reducible, inline]

abbrev Nat.Internal.Linear.Var : Type

Equations

• Nat.Internal.Linear.Var = Nat

@[reducible, inline]

abbrev Nat.Internal.Linear.Context : Type

Equations

• Nat.Internal.Linear.Context = Lean.RArray Nat

@[reducible, inline]

abbrev Nat.Internal.Linear.fixedVar : Nat

When encoding polynomials. We use fixedVar for encoding numerals. The denotation of fixedVar is always 1.

Equations

• Nat.Internal.Linear.fixedVar = 100000000

@[reducible, inline]

noncomputable abbrev Nat.Internal.Linear.Var.denote (ctx : Context) (v : Var) : Nat

Equations

• Nat.Internal.Linear.Var.denote ctx v = Bool.rec (Lean.RArray.get ctx v) 1 (Nat.beq v Nat.Internal.Linear.fixedVar)

inductive Nat.Internal.Linear.Expr : Type

• num (v : Nat) : Expr
• var (i : Var) : Expr
• add (a b : Expr) : Expr
• mulL (k : Nat) (a : Expr) : Expr
• mulR (a : Expr) (k : Nat) : Expr

@[instance_reducible]

instance Nat.Internal.Linear.instInhabitedExpr : Inhabited Expr

Equations

• Nat.Internal.Linear.instInhabitedExpr = { default := Nat.Internal.Linear.instInhabitedExpr.default }

@[instance_reducible]

instance Nat.Internal.Linear.instBEqExpr : BEq Expr

Equations

• Nat.Internal.Linear.instBEqExpr = { beq := Nat.Internal.Linear.instBEqExpr.beq }

def Nat.Internal.Linear.instBEqExpr.beq : Expr → Expr → Bool

Equations

• Nat.Internal.Linear.instBEqExpr.beq (Nat.Internal.Linear.Expr.num a) (Nat.Internal.Linear.Expr.num b) = (a == b)
• Nat.Internal.Linear.instBEqExpr.beq (Nat.Internal.Linear.Expr.var a) (Nat.Internal.Linear.Expr.var b) = (a == b)
• Nat.Internal.Linear.instBEqExpr.beq (a.add a_1) (b.add b_1) = (Nat.Internal.Linear.instBEqExpr.beq a b && Nat.Internal.Linear.instBEqExpr.beq a_1 b_1)
• Nat.Internal.Linear.instBEqExpr.beq (Nat.Internal.Linear.Expr.mulL a a_1) (Nat.Internal.Linear.Expr.mulL b b_1) = (a == b && Nat.Internal.Linear.instBEqExpr.beq a_1 b_1)
• Nat.Internal.Linear.instBEqExpr.beq (a.mulR a_1) (b.mulR b_1) = (Nat.Internal.Linear.instBEqExpr.beq a b && a_1 == b_1)
• Nat.Internal.Linear.instBEqExpr.beq x✝¹ x✝ = false

@[reducible, inline]

noncomputable abbrev Nat.Internal.Linear.Expr.denote (ctx : Context) : Expr → Nat

Equations

• Nat.Internal.Linear.Expr.denote ctx (a.add b) = (Nat.Internal.Linear.Expr.denote ctx a).add (Nat.Internal.Linear.Expr.denote ctx b)
• Nat.Internal.Linear.Expr.denote ctx (Nat.Internal.Linear.Expr.num k) = k
• Nat.Internal.Linear.Expr.denote ctx (Nat.Internal.Linear.Expr.var v) = Nat.Internal.Linear.Var.denote ctx v
• Nat.Internal.Linear.Expr.denote ctx (Nat.Internal.Linear.Expr.mulL k e) = k.mul (Nat.Internal.Linear.Expr.denote ctx e)
• Nat.Internal.Linear.Expr.denote ctx (e.mulR k) = (Nat.Internal.Linear.Expr.denote ctx e).mul k

@[reducible, inline]

abbrev Nat.Internal.Linear.Poly : Type

Equations

• Nat.Internal.Linear.Poly = List (Nat × Nat.Internal.Linear.Var)

@[reducible, inline]

noncomputable abbrev Nat.Internal.Linear.Poly.denote (ctx : Context) (p : Poly) : Nat

Equations

• Nat.Internal.Linear.Poly.denote ctx [] = 0
• Nat.Internal.Linear.Poly.denote ctx ((k, v) :: p_2) = (k.mul (Nat.Internal.Linear.Var.denote ctx v)).add (Nat.Internal.Linear.Poly.denote ctx p_2)

def Nat.Internal.Linear.Poly.insert (k : Nat) (v : Var) (p : Poly) : Poly

Equations

• One or more equations did not get rendered due to their size.
• Nat.Internal.Linear.Poly.insert k v [] = [(k, v)]

def Nat.Internal.Linear.Poly.norm (p : Poly) : Poly

Equations

• p.norm = Nat.Internal.Linear.Poly.norm.go p []

def Nat.Internal.Linear.Poly.norm.go (p r : Poly) : Poly

Equations

• Nat.Internal.Linear.Poly.norm.go [] r = r
• Nat.Internal.Linear.Poly.norm.go ((k, v) :: p_2) r = Nat.Internal.Linear.Poly.norm.go p_2 (Nat.Internal.Linear.Poly.insert k v r)

def Nat.Internal.Linear.Poly.cancelAux (fuel : Nat) (m₁ m₂ r₁ r₂ : Poly) : Poly × Poly

Equations

• One or more equations did not get rendered due to their size.
• Nat.Internal.Linear.Poly.cancelAux 0 m₁ m₂ r₁ r₂ = (List.reverse r₁ ++ m₁, List.reverse r₂ ++ m₂)
• Nat.Internal.Linear.Poly.cancelAux fuel_2.succ m₁ [] r₁ r₂ = (List.reverse r₁ ++ m₁, List.reverse r₂)
• Nat.Internal.Linear.Poly.cancelAux fuel_2.succ [] m₂ r₁ r₂ = (List.reverse r₁, List.reverse r₂ ++ m₂)

def Nat.Internal.Linear.hugeFuel : Nat

Equations

• Nat.Internal.Linear.hugeFuel = 1000000

def Nat.Internal.Linear.Poly.cancel (p₁ p₂ : Poly) : Poly × Poly

Equations

• p₁.cancel p₂ = Nat.Internal.Linear.Poly.cancelAux Nat.Internal.Linear.hugeFuel p₁ p₂ [] []

def Nat.Internal.Linear.Poly.isNum? (p : Poly) : Option Nat

Equations

• Nat.Internal.Linear.Poly.isNum? [] = some 0
• Nat.Internal.Linear.Poly.isNum? [(k, v)] = bif v == Nat.Internal.Linear.fixedVar then some k else none
• p.isNum? = none

def Nat.Internal.Linear.Poly.isZero (p : Poly) : Bool

Equations

• Nat.Internal.Linear.Poly.isZero [] = true
• p.isZero = false

def Nat.Internal.Linear.Poly.isNonZero (p : Poly) : Bool

Equations

• Nat.Internal.Linear.Poly.isNonZero [] = false
• Nat.Internal.Linear.Poly.isNonZero ((k, v) :: p_2) = bif v == Nat.Internal.Linear.fixedVar then decide (k > 0) else Nat.Internal.Linear.Poly.isNonZero p_2

@[inline]

abbrev Nat.Internal.Linear.Poly.denote_eq (ctx : Context) (mp : Poly × Poly) : Prop

Equations

• Nat.Internal.Linear.Poly.denote_eq ctx mp = (Nat.Internal.Linear.Poly.denote ctx mp.fst = Nat.Internal.Linear.Poly.denote ctx mp.snd)

@[inline]

abbrev Nat.Internal.Linear.Poly.denote_le (ctx : Context) (mp : Poly × Poly) : Prop

Equations

• Nat.Internal.Linear.Poly.denote_le ctx mp = (Nat.Internal.Linear.Poly.denote ctx mp.fst ≤ Nat.Internal.Linear.Poly.denote ctx mp.snd)

def Nat.Internal.Linear.Expr.toPoly (e : Expr) : Poly

Equations

• e.toPoly = Nat.Internal.Linear.Expr.toPoly.go 1 e []

def Nat.Internal.Linear.Expr.toPoly.go (coeff : Nat) : Expr → Poly → Poly

Equations

• Nat.Internal.Linear.Expr.toPoly.go coeff (Nat.Internal.Linear.Expr.num k) = bif k == 0 then id else fun (x : Nat.Internal.Linear.Poly) => (coeff * k, Nat.Internal.Linear.fixedVar) :: x
• Nat.Internal.Linear.Expr.toPoly.go coeff (Nat.Internal.Linear.Expr.var i) = fun (x : Nat.Internal.Linear.Poly) => (coeff, i) :: x
• Nat.Internal.Linear.Expr.toPoly.go coeff (a.add b) = Nat.Internal.Linear.Expr.toPoly.go coeff a ∘ Nat.Internal.Linear.Expr.toPoly.go coeff b
• Nat.Internal.Linear.Expr.toPoly.go coeff (Nat.Internal.Linear.Expr.mulL k a) = bif k == 0 then id else Nat.Internal.Linear.Expr.toPoly.go (coeff * k) a
• Nat.Internal.Linear.Expr.toPoly.go coeff (a.mulR k) = bif k == 0 then id else Nat.Internal.Linear.Expr.toPoly.go (coeff * k) a

def Nat.Internal.Linear.Expr.toNormPoly (e : Expr) : Poly

Equations

• e.toNormPoly = e.toPoly.norm

def Nat.Internal.Linear.Expr.inc (e : Expr) : Expr

Equations

• e.inc = e.add (Nat.Internal.Linear.Expr.num 1)

structure Nat.Internal.Linear.PolyCnstr : Type

• eq : Bool
• lhs : Poly
• rhs : Poly

@[instance_reducible]

instance Nat.Internal.Linear.instBEqPolyCnstr : BEq PolyCnstr

Equations

• Nat.Internal.Linear.instBEqPolyCnstr = { beq := Nat.Internal.Linear.instBEqPolyCnstr.beq }

def Nat.Internal.Linear.instBEqPolyCnstr.beq : PolyCnstr → PolyCnstr → Bool

Equations

• Nat.Internal.Linear.instBEqPolyCnstr.beq { eq := a, lhs := a_1, rhs := a_2 } { eq := b, lhs := b_1, rhs := b_2 } = (a == b && (a_1 == b_1 && a_2 == b_2))
• Nat.Internal.Linear.instBEqPolyCnstr.beq x✝¹ x✝ = false

instance Nat.Internal.Linear.instReflBEqPolyCnstr : ReflBEq PolyCnstr

instance Nat.Internal.Linear.instLawfulBEqPolyCnstr : LawfulBEq PolyCnstr

structure Nat.Internal.Linear.ExprCnstr : Type

• eq : Bool
• lhs : Expr
• rhs : Expr

@[reducible, inline]

abbrev Nat.Internal.Linear.PolyCnstr.denote (ctx : Context) (c : PolyCnstr) : Prop

Equations

• Nat.Internal.Linear.PolyCnstr.denote ctx c = bif c.eq then Nat.Internal.Linear.Poly.denote_eq ctx (c.lhs, c.rhs) else Nat.Internal.Linear.Poly.denote_le ctx (c.lhs, c.rhs)

def Nat.Internal.Linear.PolyCnstr.norm (c : PolyCnstr) : PolyCnstr

Equations

• c.norm = match c.lhs.norm.cancel c.rhs.norm with | (lhs, rhs) => { eq := c.eq, lhs := lhs, rhs := rhs }

def Nat.Internal.Linear.PolyCnstr.isUnsat (c : PolyCnstr) : Bool

Equations

• c.isUnsat = bif c.eq then c.lhs.isZero && c.rhs.isNonZero || c.lhs.isNonZero && c.rhs.isZero else c.lhs.isNonZero && c.rhs.isZero

def Nat.Internal.Linear.PolyCnstr.isValid (c : PolyCnstr) : Bool

Equations

• c.isValid = bif c.eq then c.lhs.isZero && c.rhs.isZero else c.lhs.isZero

@[reducible, inline]

abbrev Nat.Internal.Linear.ExprCnstr.denote (ctx : Context) (c : ExprCnstr) : Prop

Equations

• One or more equations did not get rendered due to their size.

def Nat.Internal.Linear.ExprCnstr.toPoly (c : ExprCnstr) : PolyCnstr

Equations

• c.toPoly = { eq := c.eq, lhs := c.lhs.toPoly, rhs := c.rhs.toPoly }

def Nat.Internal.Linear.ExprCnstr.toNormPoly (c : ExprCnstr) : PolyCnstr

Equations

• c.toNormPoly = match c.lhs.toNormPoly.cancel c.rhs.toNormPoly with | (lhs, rhs) => { eq := c.eq, lhs := lhs, rhs := rhs }

def Nat.Internal.Linear.monomialToExpr (k : Nat) (v : Var) : Expr

Equations

• One or more equations did not get rendered due to their size.

def Nat.Internal.Linear.Poly.toExpr (p : Poly) : Expr

Equations

• Nat.Internal.Linear.Poly.toExpr [] = Nat.Internal.Linear.Expr.num 0
• Nat.Internal.Linear.Poly.toExpr ((k, v) :: p_2) = Nat.Internal.Linear.Poly.toExpr.go (Nat.Internal.Linear.monomialToExpr k v) p_2

def Nat.Internal.Linear.Poly.toExpr.go (e : Expr) (p : Poly) : Expr

Equations

• Nat.Internal.Linear.Poly.toExpr.go e [] = e
• Nat.Internal.Linear.Poly.toExpr.go e ((k, v) :: p_2) = Nat.Internal.Linear.Poly.toExpr.go (e.add (Nat.Internal.Linear.monomialToExpr k v)) p_2

def Nat.Internal.Linear.PolyCnstr.toExpr (c : PolyCnstr) : ExprCnstr

Equations

• c.toExpr = { eq := c.eq, lhs := c.lhs.toExpr, rhs := c.rhs.toExpr }

theorem Nat.Internal.Linear.Poly.denote_insert (ctx : Context) (k : Nat) (v : Var) (p : Poly) : denote ctx (insert k v p) = denote ctx p + k * Var.denote ctx v

theorem Nat.Internal.Linear.Poly.denote_norm_go (ctx : Context) (p r : Poly) : denote ctx (norm.go p r) = denote ctx p + denote ctx r

theorem Nat.Internal.Linear.Poly.denote_sort (ctx : Context) (m : Poly) : denote ctx m.norm = denote ctx m

theorem Nat.Internal.Linear.Poly.denote_append (ctx : Context) (p q : Poly) : denote ctx (p ++ q) = denote ctx p + denote ctx q

theorem Nat.Internal.Linear.Poly.denote_cons (ctx : Context) (k : Nat) (v : Var) (p : Poly) : denote ctx ((k, v) :: p) = k * Var.denote ctx v + denote ctx p

theorem Nat.Internal.Linear.Poly.denote_reverse (ctx : Context) (p : Poly) : denote ctx (List.reverse p) = denote ctx p

theorem Nat.Internal.Linear.Poly.denote_eq_cancelAux (ctx : Context) (fuel : Nat) (m₁ m₂ r₁ r₂ : Poly) (h : denote_eq ctx (List.reverse r₁ ++ m₁, List.reverse r₂ ++ m₂)) : denote_eq ctx (cancelAux fuel m₁ m₂ r₁ r₂)

theorem Nat.Internal.Linear.Poly.of_denote_eq_cancelAux (ctx : Context) (fuel : Nat) (m₁ m₂ r₁ r₂ : Poly) (h : denote_eq ctx (cancelAux fuel m₁ m₂ r₁ r₂)) : denote_eq ctx (List.reverse r₁ ++ m₁, List.reverse r₂ ++ m₂)

theorem Nat.Internal.Linear.Poly.denote_eq_cancel {ctx : Context} {m₁ m₂ : Poly} (h : denote_eq ctx (m₁, m₂)) : denote_eq ctx (m₁.cancel m₂)

theorem Nat.Internal.Linear.Poly.of_denote_eq_cancel {ctx : Context} {m₁ m₂ : Poly} (h : denote_eq ctx (m₁.cancel m₂)) : denote_eq ctx (m₁, m₂)

theorem Nat.Internal.Linear.Poly.denote_eq_cancel_eq (ctx : Context) (m₁ m₂ : Poly) : denote_eq ctx (m₁.cancel m₂) = denote_eq ctx (m₁, m₂)

theorem Nat.Internal.Linear.Poly.denote_le_cancelAux (ctx : Context) (fuel : Nat) (m₁ m₂ r₁ r₂ : Poly) (h : denote_le ctx (List.reverse r₁ ++ m₁, List.reverse r₂ ++ m₂)) : denote_le ctx (cancelAux fuel m₁ m₂ r₁ r₂)

theorem Nat.Internal.Linear.Poly.of_denote_le_cancelAux (ctx : Context) (fuel : Nat) (m₁ m₂ r₁ r₂ : Poly) (h : denote_le ctx (cancelAux fuel m₁ m₂ r₁ r₂)) : denote_le ctx (List.reverse r₁ ++ m₁, List.reverse r₂ ++ m₂)

theorem Nat.Internal.Linear.Poly.denote_le_cancel {ctx : Context} {m₁ m₂ : Poly} (h : denote_le ctx (m₁, m₂)) : denote_le ctx (m₁.cancel m₂)

theorem Nat.Internal.Linear.Poly.of_denote_le_cancel {ctx : Context} {m₁ m₂ : Poly} (h : denote_le ctx (m₁.cancel m₂)) : denote_le ctx (m₁, m₂)

theorem Nat.Internal.Linear.Poly.denote_le_cancel_eq (ctx : Context) (m₁ m₂ : Poly) : denote_le ctx (m₁.cancel m₂) = denote_le ctx (m₁, m₂)

theorem Nat.Internal.Linear.Expr.denote_toPoly_go {k : Nat} {p : Poly} (ctx : Context) (e : Expr) : Poly.denote ctx (toPoly.go k e p) = k * denote ctx e + Poly.denote ctx p

theorem Nat.Internal.Linear.Expr.denote_toPoly (ctx : Context) (e : Expr) : Poly.denote ctx e.toPoly = denote ctx e

theorem Nat.Internal.Linear.Expr.eq_of_toNormPoly (ctx : Context) (a b : Expr) (h : a.toNormPoly = b.toNormPoly) : denote ctx a = denote ctx b

theorem Nat.Internal.Linear.Expr.of_cancel_eq (ctx : Context) (a b c d : Expr) (h : a.toNormPoly.cancel b.toNormPoly = (c.toPoly, d.toPoly)) : (denote ctx a = denote ctx b) = (denote ctx c = denote ctx d)

theorem Nat.Internal.Linear.Expr.of_cancel_le (ctx : Context) (a b c d : Expr) (h : a.toNormPoly.cancel b.toNormPoly = (c.toPoly, d.toPoly)) : (denote ctx a ≤ denote ctx b) = (denote ctx c ≤ denote ctx d)

theorem Nat.Internal.Linear.Expr.of_cancel_lt (ctx : Context) (a b c d : Expr) (h : a.inc.toNormPoly.cancel b.toNormPoly = (c.inc.toPoly, d.toPoly)) : (denote ctx a < denote ctx b) = (denote ctx c < denote ctx d)

theorem Nat.Internal.Linear.ExprCnstr.toPoly_norm_eq (c : ExprCnstr) : c.toPoly.norm = c.toNormPoly

theorem Nat.Internal.Linear.ExprCnstr.denote_toPoly (ctx : Context) (c : ExprCnstr) : PolyCnstr.denote ctx c.toPoly = denote ctx c

theorem Nat.Internal.Linear.ExprCnstr.denote_toNormPoly (ctx : Context) (c : ExprCnstr) : PolyCnstr.denote ctx c.toNormPoly = denote ctx c

theorem Nat.Internal.Linear.Poly.of_isZero (ctx : Context) {p : Poly} (h : p.isZero = true) : denote ctx p = 0

theorem Nat.Internal.Linear.Poly.of_isNonZero (ctx : Context) {p : Poly} (h : p.isNonZero = true) : denote ctx p > 0

theorem Nat.Internal.Linear.PolyCnstr.eq_false_of_isUnsat (ctx : Context) {c : PolyCnstr} : c.isUnsat = true → denote ctx c = False

theorem Nat.Internal.Linear.PolyCnstr.eq_true_of_isValid (ctx : Context) {c : PolyCnstr} : c.isValid = true → denote ctx c = True

theorem Nat.Internal.Linear.ExprCnstr.eq_false_of_isUnsat (ctx : Context) (c : ExprCnstr) (h : c.toNormPoly.isUnsat = true) : denote ctx c = False

theorem Nat.Internal.Linear.ExprCnstr.eq_true_of_isValid (ctx : Context) (c : ExprCnstr) (h : c.toNormPoly.isValid = true) : denote ctx c = True

theorem Nat.Internal.Linear.ExprCnstr.eq_of_toNormPoly_eq (ctx : Context) (c d : ExprCnstr) (h : (c.toNormPoly == d.toPoly) = true) : denote ctx c = denote ctx d

theorem Nat.Internal.Linear.Expr.eq_of_toNormPoly_eq (ctx : Context) (e e' : Expr) (h : (e.toNormPoly == e'.toPoly) = true) : denote ctx e = denote ctx e'

def Nat.Internal.elimOffset {α : Sort u} (a b k : Nat) (h₁ : a + k = b + k) (h₂ : a = b → α) : α

Equations

• Nat.Internal.elimOffset a b k h₁ h₂ = h₂ ⋯