Erdős·erdos:195
Erdős Problem 195
No independent check recorded yet. A formal artifact, declaration or published object is attached, but no rebuild of it is recorded here.
Fidelity F2: The correspondence is declared through an alignment table and written divergences.
arithmetic progressions·Source
AI activity
How grades workNo AI contribution recorded against this statement.
Fidelity
How fidelity is gradedF2 declared. The correspondence is declared through an alignment table and written divergences.
Declared by the projects
3As each project's formalization.yaml states it.
A permutation of the integers with no monotone 4-term AP whose difference is not divisible by 4 (Erdős #195, partial)
- authors
- Alex Lopez
- method
- agent — Claude Opus 5.5 (claude-opus-5-5), Fable 5.1
- review
- self-assessed (none)
- sorry
- 0 unproved goals declared
- sources
- A permutation of ℤ with no monotone 4-term AP whose difference is not divisible by 4 (docs/proof.md in this repository) — other; A permutation of ℤ with no monotone 4-term AP of odd common difference (docs/proof.md of Alex-lop/erdos-195-odd-difference) — other; Erdős Problem #195 — background; On permutations avoiding arithmetic progressions — background
- related
- Alex-lop/erdos-195-odd-difference — builds-on; google-deepmind/formal-conjectures/blob/a64e959c32c270df4dd0d96d2027481f15750534/FormalConjectures/ErdosProblems/195.lean — other
- divergences
- none known
- checked by
- nobody independent of its authors yet
A permutation of the integers with no monotone 4-term AP of odd difference (Erdős #195, partial)
- authors
- Alex Lopez
- method
- agent — Claude Opus 5.5 (claude-opus-5-5)
- review
- self-assessed (none)
- sorry
- 0 unproved goals declared
- sources
- A permutation of ℤ with no monotone 4-term AP of odd common difference (docs/proof.md in this repository) — other; Erdős Problem #195 — background; On permutations avoiding arithmetic progressions — background; Avoiding monotone arithmetic progressions in permutations of integers — background
- related
- google-deepmind/formal-conjectures/blob/a64e959c32c270df4dd0d96d2027481f15750534/FormalConjectures/ErdosProblems/195.lean — other
- divergences
- none known
- checked by
- nobody independent of its authors yet
Geneson-type bands with a growing 2-adic modulus: finitely many monotone 4-term APs of each 2-adic depth in a permutation of ℤ, and a 4-permutable subset of ℤ of density one (Erdős #195, partial)
- authors
- Alex Lopez
- method
- agent — Claude Fable 5.1, Claude Fable 5.2, Claude Opus 5.5 (claude-opus-5-5)
- review
- self-assessed (none)
- sorry
- 0 unproved goals declared
- sources
- Theorem H (stage-dependent modulus; docs/proof.md in this repository) — other; Density bounds for permutations avoiding monotone arithmetic progressions — other; Erdős Problem #195 — background; On permutations avoiding arithmetic progressions — background
- related
- Alex-lop/erdos-195-odd-difference — other; Alex-lop/erdos-195-difference-not-div-4 — other; google-deepmind/formal-conjectures/blob/5d8b04d3d41b745cc3f2f3cdd5ed04b60c500983/FormalConjectures/ErdosProblems/195.lean — other
- divergences
- Theorem H is stated in docs/proof.md for every real base a ≥ 1 + √2 and every sequence t_s with t_s → ∞ (the seam theorem holds for every t_s); the Lean statement uses a = 3 and t_s = s + 1 and states only finiteness for each valuation, not the explicit bound. A monotone 4-term AP is recorded by the pair (first term in index order, difference), so each one is counted once, with a negative difference for a decreasing one. Corollary Z1 is stated in docs/proof.md for every real base a ≥ 1 + √2 and every t_s → ∞ (with the upper Banach density of Z_bot equal to 0); the Lean statement uses a = 3 and t_s = s + 1, and states density one as the limit of |S ∩ [-n, n]| / (2n + 1) (Finset.filter under open Classical), which implies Geneson's lower symmetric density 1. Proposition Z3 names three progressions in docs/proof.md §8; the Lean statements (Erdos195Bands.phi10, no_reinsertion, ES_not_extendable) conclude only that a monotone 4-term AP exists, and their proofs produce one of the three. Proposition Z3′ is formalized as stated in docs/proof.md §9 (Erdos195Bands.no_reinsertion_binary_zone), for a = 3 and t_s = s + 1; binary orders are stated through pairs x, x + 2^j u with u odd.
- checked by
- nobody independent of its authors yet
Follow and discuss
All discussionFollow this problem
An email when it has a new claim, check, bounty or discussion. You confirm once and can stop with one click.
Discussion and bounties for this problem load here.
Seen recently
What the monitors picked up in the last thirty days, not yet graded.
Something wrong or missing here? Request a correction or add a claim, with its sources.
Claims and corrections from readers
All of themFormal material
Formal statements · 1
Cited proofs · 0
No proof artifact cited by the formal record.
Also known as · 3
- https://www.erdosproblems.com/195
- https://github.com/google-deepmind/formal-conjectures/blob/main/FormalConjectures/ErdosProblems/195.lean
- FormalConjectures/ErdosProblems/195.lean
Cite this record
qed.bot, “Erdős Problem 195”, https://qed.bot/s/erdos-195, as of 20 Nov 2026.