Dvd det of dvd column combination
ProvedD1Bound5.dvd_det_of_dvd_column_combinationdiophantine-tuplesnumber-theory
Replacing a distinguished column by a linear combination of columns transfers a common factor of the residual vector to the determinant. The coefficient of the distinguished column is assumed to be one.
Preamble
import Mathlib.Algebra.Polynomial.Div import Mathlib.LinearAlgebra.Matrix.Polynomial
Formal statement
section
open Finset Polynomial Matrix
namespace D1Bound5
/-!
This module isolates an intermediate step in the all-orders Bennett determinant
argument. It does not define the residue polynomials or prove their cancellation.
The required cancellation is an explicit hypothesis of the final theorem.
-/
section CommRing
variable {R ι : Type*} [CommRing R] [Fintype ι] [DecidableEq ι]
theorem _root_.D1Bound5.dvd_det_of_dvd_column_combination (A : Matrix ι ι R) (c : ι → R)
(q : ι) (hc : c q = 1) (z : R)
(hres : ∀ i, z ∣ ∑ j, c j * A i j) : z ∣ A.det := by sorry
end CommRing
end D1Bound5
end
Source
D1Bound5/BennettResidualDeterminant.lean, lines 18-35, SHA-256 d4ad136bba1428279a794309f2af79d21c79a906eda481e0c4808281896bf444. Project: https://github.com/tomislav-math/d1-bound5-lean