op_258_forces_all_of_forces_step
Assume that for every positive antitone profile a with Σ a i > 1 and every k ≥ 3, forcing a monochromatic K_k implies forcing a monochromatic K_{k+1}. Then for every such a, if a forces a monochromatic K_3, it forces a monochromatic K_k for every k ≥ 3.
Statement
theorem op_258_forces_all_of_forces_step
(step : ∀ (a : ℕ+ → ℝ), (∀ i, 0 < a i) → Antitone a → 1 < ∑' i : ℕ+, ENNReal.ofReal (a i) →
∀ k : ℕ, 3 ≤ k → op_258_forces a k → op_258_forces a (k + 1))
(a : ℕ+ → ℝ) (hpos : ∀ i, 0 < a i) (hanti : Antitone a)
(hsum : 1 < ∑' i : ℕ+, ENNReal.ofReal (a i)) (h3 : op_258_forces a 3) :
∀ k ≥ 3, op_258_forces a k- Source
- step towards op_258_triangle_forcing_implies_decay_ramsey
- Verified
- 18 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 3
- op_258_forcesThe decay profile a forces a monochromatic K_k if for all sufficiently large n, every a-bounded colouring of the edges of K_n has a…
- LinearOrder.toTotalPreorderEvery
LinearOrderis aTotalPreorder. - TotalPreorderA total preorder: a preorder where
≤is total (complete). This is weaker thanLinearOrder— it does NOT require antisymmetry or…
The proof, explained
The theorem is proved by mathematical induction on k ≥ 3 using Nat.le_induction. The base case k = 3 is provided directly by the hypothesis that a forces a monochromatic K₃. The inductive step then applies the hypothesis `step` to propagate the forcing property from m to m + 1 for each m ≥ 3.
The base case k = 3 holds: the profile a forces a monochromatic K₃.
We introduce the integer k with k ≥ 3 and induct on k starting at 3 using Nat.le_induction. The base case requires showing that a forces a monochromatic K₃, which is directly given by the hypothesis h3.
uses
Nat.le_inductionintro k hk induction k, hk using Nat.le_induction with | base => exact h3
The inductive step holds: for any m ≥ 3, if a forces a monochromatic K_m, then a forces a monochromatic K_{m+1}.
In the inductive step, we assume m ≥ 3 and the induction hypothesis that a forces a monochromatic K_m. Applying the assumption `step` to the profile a—using its positivity (hpos), antitone property (hanti), and infinite sum condition (hsum)—along with m ≥ 3 and the induction hypothesis directly concludes that a forces a monochromatic K_{m+1}.
| succ m hm ih => exact step a hpos hanti hsum m hm ih
Nat.le_induction- Mathematical induction on natural numbers starting from a base value m: to prove P(n) for all n ≥ m, it suffices to prove the base case P(m) and the induction step showing that P(n) implies P(n + 1) for all n ≥ m.
Written by a model (gemini-3.8-flash) from the Lean proof and the goal states Lean reported at each step. Lean verified the proof; this explanation is a reading aid and is not itself machine-checked.
Lean source view module on GitHub
Choose a tactic — a marked line — to see the goals Lean had before and after it, as in Lean’s infoview. Step with ← → or j k.
/-- Assembly: once the successor step is available for every k ≥ 3, the target's k = 3 hypothesis propagates to all k ≥ 3 by `Nat.le_induction`. -/theorem op_258_forces_all_of_forces_step (step : ∀ (a : ℕ+ → ℝ), (∀ i, 0 < a i) → Antitone a → 1 < ∑' i : ℕ+, ENNReal.ofReal (a i) → ∀ k : ℕ, 3 ≤ k → op_258_forces a k → op_258_forces a (k + 1)) (a : ℕ+ → ℝ) (hpos : ∀ i, 0 < a i) (hanti : Antitone a) (hsum : 1 < ∑' i : ℕ+, ENNReal.ofReal (a i)) (h3 : op_258_forces a 3) : ∀ k ≥ 3, op_258_forces a k := by intro k hk induction k, hk using Nat.le_induction with | base => exact h3 | succ m hm ih => exact step a hpos hanti hsum m hm ih