A nonnegative progression product is positive exactly when every term is
ProvedWikipedia.SzemeredisTheorem.cyclicAPProduct_pos_iff_of_nonnegadditive-combinatoricsgreen-tao-port-8822number-theory
For any natural length and modulus, any nonnegative real cyclic weight , and any cyclic progression ,
The statement includes length zero under the empty-product convention and does not require a positive modulus.
Preamble
/- Mechanically transplanted from https://github.com/plby/lean-proofs.git at 8822f7ddef30fadbd92e1c6ab4ed897af356af5e. Original scopes and proof bytes are oracle-derived. -/ import Definitions.Def_GreenTaoPort_Wikipedia_SzemeredisTheorem_ArithmeticProgression_Count import Definitions.Def_GreenTaoPort_Wikipedia_SzemeredisTheorem_ArithmeticProgression_CountExtraction import Definitions.Def_GreenTaoPort_Wikipedia_SzemeredisTheorem_Finite_Mean import Mathlib.Algebra.BigOperators.Expect import Mathlib.Algebra.Order.BigOperators.GroupWithZero.Finset import Mathlib.Data.Fintype.Card import Mathlib.Data.ZMod.Basic import Mathlib.Tactic set_option autoImplicit true set_option relaxedAutoImplicit false set_option maxSynthPendingDepth 3 /-! # Extracting an off-diagonal cyclic progression For extraction it is convenient to use unnormalized finite masses. In particular, summing over the filtered finset of nonzero differences avoids introducing a type of nonzero residues, which would be empty when `N = 1`, and avoids dividing by `N - 1`. -/ open Wikipedia.SzemeredisTheorem open scoped BigOperators
Formal statement
theorem Wikipedia.SzemeredisTheorem.cyclicAPProduct_pos_iff_of_nonneg
{k N : ℕ} {f : ZMod N → ℝ}
(hf : ∀ x, 0 ≤ f x) (a d : ZMod N) :
0 < cyclicAPProduct k N f a d ↔
∀ j : Fin k, 0 < f (cyclicAPTerm a d j) := by sorry
Source