Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 3.4 — eventual criticality

Proved
DenseLanguageGeneration.PatientScope.eventually_critical

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

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

Let L=(L1,L2,…)\mathcal L=(L_1,L_2,\ldots)L=(L1​,L2​,…) be any indexed family of infinite positive-integer languages, fix a target index i⋆i_\stari⋆​, and let aaa enumerate K=Li⋆K=L_{i_\star}K=Li⋆​​ injectively and completely. Then

∃T<∞ ∀t≥T:K is critical after the first t inputs.\exists T<\infty\ \forall t\ge T:\quad K\text{ is critical after the first }t\text{ inputs}.∃T<∞ ∀t≥T:K is critical after the first t inputs.

The time may depend on the family, chosen target index and enumeration. Criticality uses containment in earlier critical languages. No target minimality, scope inclusion or eventual correctness is assumed. This stabilization result supplies the criticality input for validity of patient-scope.

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
Preamble
import Definitions.Def_DenseLanguageGeneration_PatientScope_criticalChain

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

/-- Cai et al., STOC 2027 submission #335 (October 2026), Lemma 3.4,
printed p.10 (PDF p.12). No scope or algorithm-success hypothesis. -/
theorem eventually_critical (L : Family) (i : ℕ) (a : ℕ → ℕ+)
    (ha : IsEnumeration (L i) a) :
    ∃ T : ℕ, ∀ t ≥ T, Critical L (history a t) i := by sorry

end DenseLanguageGeneration.PatientScope
Source
Cai, Li, Shen, Wang and Zhang, STOC 2027 submission #335 (October 2026), Lemma 3.4, printed p.10 (PDF p.12); 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