AFTD Auto-Formalizing Theoretical Domains

op_258_forces

def

The 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 monochromatic K_k.

Statement

def op_258_forces (a : ℕ+ → ℝ) (k : ℕ) : Prop
Source
step towards op_258_triangle_forcing_implies_decay_ramsey
Verified
18 Oct 2026
Axioms
none listed
Built on 2
  • op_258_boundedA colouring c of the edges of the complete graph K_n is a-bounded if for every colour i the number of edges of colour i is at most a i *…
  • op_258_has_mono_cliqueThe colouring c of the edges of K_n has a monochromatic K_k: there are a k-element vertex set s and a colour i such that every edge inside…
Used by 8
  • op_258_forces_twoFor every decay profile a, a forces a monochromatic K_2.
  • op_258_forces_mono_boundIf b ≤ a pointwise and a forces a monochromatic K_k, then b forces a monochromatic K_k.
  • op_258_forces_mono_cliqueIf a forces a monochromatic K_k, then a forces a monochromatic K_j for every j ≤ k.
  • op_258_forces_all_of_forces_stepAssume that for every positive antitone profile a with Σ a i > 1 and every k ≥ 3, forcing a monochromatic K_k implies forcing a…
  • op_258_forces_iffFor every decay profile a and k, "a forces a monochromatic K_k" holds if and only if the raw statement "for all sufficiently large n,…
  • op_258_sum_ne_top_of_forces_threeIf a positive antitone profile a forces a monochromatic triangle K_3 on sufficiently large complete graphs, then the infinite sum of a_i…
  • op_258_forces_of_capacity_lt_oneIf k ≥ 2 and Σ_i min(a_i, 1 - 1/(k-1)) < 1, then every a-bounded colouring of K_n for large n already contains a monochromatic K_k; i.e. a…
  • op_258_forces_of_forces_smul_blowupFor γ ≥ 1 and k ≥ 1: if a forces a monochromatic K_{γk}, then the profile γ·a forces a monochromatic K_k.

Lean source view module on GitHub

/-- Forcing predicate: `a` forces a monochromatic `K_k` if all sufficiently large complete graphs, under any `a`-bounded edge colouring, contain a monochromatic `K_k`. -/
def op_258_forces (a : ℕ+ → ℝ) (k : ℕ) : Prop := ∃ n₀ : ℕ, ∀ n ≥ n₀, ∀ c : (SimpleGraph.completeGraph (Fin n)).edgeSet → ℕ+,
    op_258_bounded a n c → op_258_has_mono_clique n c k
See it in the graphDiscuss this resultChallenge it