/-
Copyright 2025 The Formal Conjectures Authors.
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
-/
module
public import FormalConjecturesUtilErdős Problem 348
References:
[Ge26] Geneson, J., Deletion thresholds and exponential examples for complete sequences. arXiv:2609.25107 (2026).
@[expose] public sectionnamespace Erdos348open Erdos348def erdos_348.answer : Set (ℕ × ℕ) := {(m, n) : ℕ × ℕ | m < n ∧ m ≤ 1}For what values of $0 \leq m < n$ is there a complete sequence $A = {a_1 \leq a_2 \leq \cdots}$ of integers such that
$A$ remains complete after removing any $m$ elements, but
$A$ is not complete after removing any $n$ elements.
Geneson [Ge26, Theorem 1] proved that the pairs are exactly those with $m \leq 1$. Completeness allows finitely many exceptions, and deletions remove indexed occurrences.
@[category research solved, question value, AMS 11]
theorem erdos_348 :
{ (m, n) | (m) (n) (_ : m < n) (a : ℕ → ℕ) (_ : Monotone a)
(_ : ∀ s, s.card = m → IsAddCompleteNatSeq' (Function.updateFinset a s 0))
(_ : ∀ t, t.card = n → ¬IsAddCompleteNatSeq' (Function.updateFinset a t 0)) } =
erdos_348.answer := ⊢ {x |
∃ m n,
∃ (_ : m < n),
∃ a,
∃ (_ : Monotone a) (_ : ∀ (s : Finset ℕ), s.card = m → IsAddCompleteNatSeq' (Function.updateFinset a s 0)) (_
: ∀ (t : Finset ℕ), t.card = n → ¬IsAddCompleteNatSeq' (Function.updateFinset a t 0)), (m, n) = x} =
erdos_348.answer
All goals completed! 🐙end Erdos348