Combinatorics
Approved
There is a permutation of the natural numbers containing no four-term arithmetic progression in increasing or decreasing order. This disproves the conjecture that every permutation must contain one.
Submitted by JenW1N
The PDF is a working mathematical exposition. Lean verification applies to the formal source, not the prose.
Formal statement
Proof target
import Mathlib
import FormalConjectures.ErdosProblems.«196»
import TaskSupport
namespace Bounty
theorem target : fcTypeOfName% "Erdos196.erdos_196" := by
sorry
end Bounty
Original conjecture (Lean type)
True ↔ ∀ (f : ℕ ≃ ℕ), HasMonotoneAP (⇑f) 4Original conjecture source: FormalConjectures/ErdosProblems/196.lean
References
Something wrong with this formalization?
A statement that does not faithfully capture the original conjecture is the one real risk here, so we would rather hear about it early - before someone spends weeks on it.
Our channel is in the Bittensor Discord server. Join the server first, then open the channel to send your report.
1 piece · 20 lemmas
Individual lemmas, special cases and supporting work, shown in their original scope.
2 Sept 2026
Erdős 196: monotone 4-AP API for permutations, decidable AP tests, growth obstruction
5FqLp5…FfZZiK · 20 lemmas
conjectures-tasks
The pinned statement, the Lean challenge file and the exact bundle you build against.
versions/fc-v2-erdos196-erdos-196-3bbe9ed98063619d7bcec9d7-formalized →
conjectures-contribution
Every published piece for this problem, with its Lean source and its signed record.
contributions/erdos-196 →