Finite gcd bezout
ProvedErdosProblems.Erdos68.PaperComplete.finite_gcd_bezouterdos-68factorial-momentformalization
The gcd of finitely many integer weights is an integer linear combination with coefficients supported on that finite set.
Preamble
import Definitions.Def_ErdosProblems_Erdos68_FactorialChannelCertificate
import Definitions.Def_ErdosProblems_Erdos68_DivisorChannelBasis
import Definitions.Def_ErdosProblems_Erdos68_PaperCompleteIntegerSpan
import Lean.Elab.Tactic.Omega
import Mathlib.Algebra.BigOperators.Finsupp.Basic
import Mathlib.Algebra.BigOperators.Ring.Finset
import Mathlib.Algebra.GCDMonoid.Finset
import Mathlib.Data.Finsupp.Basic
import Mathlib.Data.Finsupp.SMul
import Mathlib.Data.Int.GCD
import Mathlib.Data.Int.ModEq
import Mathlib.Data.Nat.Choose.Multinomial
import Mathlib.Data.Nat.GCD.Prime
import Mathlib.Data.Nat.Prime.Basic
import Mathlib.Data.Rat.Lemmas
import Mathlib.NumberTheory.Divisors
import Mathlib.RingTheory.Coprime.Lemmas
import Mathlib.Tactic.Linarith
import Mathlib.Tactic.NormNum
import Mathlib.Tactic.NormNum.NatFactorial
import Mathlib.Tactic.Ring
open scoped BigOperators
open Finsupp
open ErdosProblems.Erdos68.PaperComplete
Formal statement
theorem ErdosProblems.Erdos68.PaperComplete.finite_gcd_bezout (s : Finset ℕ) (w : ℕ → ℤ) :
∃ z : ℕ →₀ ℤ, SupportedOn z s ∧
integerEvaluation w z = ((s.gcd (fun i => (w i).natAbs) : ℕ) : ℤ) := by sorry
Source
Pinned Lean source: https://github.com/wcook04/plectis-erdos-lean/blob/fcb1eff5111efabc25fcf3dfcd6ec48d42ef345c/ErdosProblems/Erdos68/PaperCompleteIntegerSpan.lean#L47-L79
Correspondence: finite channel-moment analysis for Erdős #68. No novelty or whole-problem claim.