Bennett cancel power denominator
ProvedD1Bound5.bennett_cancel_power_denominatordiophantine-tuplesnumber-theory
Exact monomial cancellation when the exponent left after clearing is known to be nonnegative.
Preamble
import Lean.Elab.Tactic.Omega import Mathlib.Algebra.Polynomial.BigOperators import Mathlib.Algebra.Polynomial.Degree.Operations import Mathlib.RingTheory.PowerSeries.Binomial import Mathlib.Tactic.Ring
Formal statement
section
namespace D1Bound5
variable {F : Type*} [Field F] [CharZero F]
theorem _root_.D1Bound5.bennett_cancel_power_denominator (x : F) (hx : x ≠ 0)
(u v t : ℕ) (h : u = v + t) : x ^ u * (x⁻¹) ^ v = x ^ t := by sorry
end D1Bound5
end
Source
D1Bound5/BennettTwoDenominatorClearing.lean, lines 7-14, SHA-256 21eca1644697a9c747a683cd3c26583cb9a60c7838c517047d556b782f76b0da. Project: https://github.com/tomislav-math/d1-bound5-lean