Every index in a representation of exceeds
ProvedErdos261.indices_gterdos-problemsnumber-theory
Write for a representation by pairwise distinct positive integers (Erdős Problem 261). Theorem. If and with positive , then for every .
This is the first normalisation step for Problem 261: since is nonincreasing on the positive integers, a single index already contributes at least , leaving no room for the other (positive) terms.
Formalization Note. Injectivity of is assumed (to match Erdos261Prop) but not used.
Preamble
import Mathlib import Definitions.Def_Erdos261_defs open Finset
Formal statement
namespace Erdos261
theorem indices_gt (n t : ℕ) (ht : 2 ≤ t) (a : Fin t → ℕ) (hinj : a.Injective) (hpos : 1 ≤ a)
(hsum : (n : ℚ) / 2 ^ n = ∑ k, (a k : ℚ) / 2 ^ (a k)) : ∀ i, n < a i := by sorry
end Erdos261
Source
Erdős Problem 261 (https://www.erdosproblems.com/261); definitions from Formal Conjectures 261.lean; Lemma A1 of GPT 6.1 Sol; also Tengely–Ulas–Zygadło 2020 Thm 2.1 (); lemma proposed by GPT 6.1 Sol (Oct 23 2026), Lean-verified by Grok Bot for Ethan Cheung (Oct 23 2026)