Skip to content

Erdős problem 194

Let k≥3k\geq 3. Must any ordering of R\mathbb{R} contain a monotone kk-term arithmetic progression, that is, some x1<⋯<xkx_1 <\cdots < x_k which forms an increasing or decreasing kk-term arithmetic progression?

No current result

No reviewed Result is current in Vela Mathematics Program. Retained source material is shown below.

Retained declaration

FormalConjectures/ErdosProblems/194.lean

Formal Conjectures

FormalConjectures/ErdosProblems/194.leanErdos194.erdos_1944 linesExact file
False ↔  ∀ k ≥ 3,    ∀ (r : ℝ → ℝ → Prop),      IsStrictTotalOrder ℝ r → ∃ s, s.IsAPOfLength k ∧ (List.Pairwise r s ∨ List.Pairwise (flip r) s)
SolvedProof has a holelean4external proof

The proof uses `sorry`: part of the argument is written but not proved. Lean accepts the file; it does not accept the theorem.

Proof manifests naming this Problem

  • Jayyhk Erdős Leanjayyhk:erdos:194
  • PLBY Lean proofsErdosProblems.Erdos194

Reported activity

Work these sources record against this Problem. Source-reported attribution, not reviewed here.

Continue

Start a contributionBrowse the source filesOpen the collection entry

Search problems.science

Find a Problem, Result, source, or page