Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 3.12 — validity and the settling time from its proof

Proved
DenseLanguageGeneration.PatientScope.validity

by mikedeng1 · Nov 10, 2026 · Mathlib 0df444a (Lean v4.33.1)

language-generationlearning-theoryonline-algorithmsp2o-batch-stoc27ap2o-gran-per-chapterp2o-plan-paperp2o-strengthenedp2o-v1

Let L\mathcal LL be any indexed countable family of infinite positive-integer languages, K=Li⋆K=L_{i_\star}K=Li⋆​​ any target, and aaa any injective full enumeration of KKK. Run the operational patient-scope generator GLG_{\mathcal L}GL​. There is a finite run-dependent threshold after which every response belongs to KKK and differs from all inputs through that response and from every earlier response:

∃t0 ∀t≥t0:bt∈K∖({as:s≤t}∪{bs:s<t}).\exists t_0\ \forall t\ge t_0:\quad b_t\in K\setminus\bigl(\{a_s:s\le t\}\cup\{b_s:s<t\}\bigr).∃t0​ ∀t≥t0​:bt​∈K∖({as​:s≤t}∪{bs​:s<t}).

Also, as established in the proof, there exists a completed time T⋆T^\starT⋆ such that at every time t≥T⋆t\ge T^\start≥T⋆, the target is critical and inside the scope, and the focus is a subset of KKK. Both assertions are conclusions, with no successful-run hypothesis.

This exposes the proof's settling invariant for subsequent counting arguments. Earlier invalid responses still constrain novelty. Thresholds need not be uniform over targets or enumerations.

Differences from the source:

  • encoding: positive family indices and rounds → family index i means source index i+1; stream index t means round t+1; history at completed time t has t inputs; reason: bijections preserve the countable family and every legal causal run, including the initial time zero
  • generalization: the proof supplies target criticality, eventual scope inclusion and the time T* after which foci are subsets of K → eventual NR correctness together with existence of SettledFrom; reason: records the explicit invariant proved on the same page for reuse by the charging lemma; no new hypothesis, and dropping the extra conjunct gives exactly Lemma 3.12
Preamble
import Definitions.Def_DenseLanguageGeneration_PatientScope_density

set_option autoImplicit false
open ActiveLanguageGeneration.Hierarchy
Formal statement
namespace DenseLanguageGeneration.PatientScope

/-- Cai et al., STOC 2027 submission #335 (October 2026), Lemma 3.12
and its concluding proof invariant, printed p.15 (PDF p.17).
T* is furnished by the run, never a hypothesis or a generator argument. -/
theorem validity (L : Family) (i : ℕ) (a : ℕ → ℕ+)
    (ha : IsEnumeration (L i) a) :
    Generates (generator L) (L i) a ∧ ∃ T : ℕ, SettledFrom L i a T := by sorry

end DenseLanguageGeneration.PatientScope
Source
Cai, Li, Shen, Wang and Zhang, STOC 2027 submission #335 (October 2026), Lemma 3.12 and its proof, printed p.15 (PDF p.17); https://github.com/sigact-stoc/stoc2027/releases/download/papers-1/335.pdf
Human review
  • Endorsed by Shuze Chen · Nov 10, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Nov 10, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me