Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Fact 3.13 — both non-switch announcement clauses

Proved
DenseLanguageGeneration.PatientScope.non_switch_announcements

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\mathcal LL be any indexed family of infinite positive-integer languages, K=Li⋆K=L_{i_\star}K=Li⋆​​ any target, and aaa any injective full enumeration of KKK. In any paper round t≥2t\ge2t≥2, suppose the adversary's input ata_tat​ has never been announced by either party and is not a switch loss. Then both

at∈Ft−1,bt−1≤at,a_t\in F_{t-1},\qquad b_{t-1}\le a_t,at​∈Ft−1​,bt−1​≤at​,

where Ft−1F_{t-1}Ft−1​ is the previous end-of-round focus and bt−1b_{t-1}bt−1​ the previous response of patient-scope. Whenever both integers belong to KKK, their target ranks satisfy

rK(bt−1)≤rK(at).r_K(b_{t-1})\le r_K(a_t).rK​(bt−1​)≤rK​(at​).

This is the non-switch counterpart of the charging lemma. The ambient comparison remains meaningful on early rounds outside KKK; on the settled tail the rank comparison is exactly the source's relabeled inequality. The previous response exists because t≥2t\ge2t≥2.

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
  • encoding: comparison of integers, stated following the partial rank relabeling of K → both original membership and ambient order comparison, with the same comparison of ranks whenever both integers lie in K; reason: the rank map is increasing on K and undefined outside it; this spells out the source comparison without assigning a false rank to an invalid early response
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), Fact 3.13,
printed p.15 (PDF p.17). Stream index t+1 has a previous response at index t.
State time t+1 is the end of that previous round. The ambient comparison remains
meaningful even for early outputs outside K. On the settled tail, both members
of K have their one-based rank comparison explicitly as well. -/
theorem non_switch_announcements (L : Family) (i : ℕ) (a : ℕ → ℕ+)
    (ha : IsEnumeration (L i) a) (t : ℕ)
    (hnew : UnannouncedInput (generator L) a (t + 1))
    (hns : ¬ SwitchLoss L a (t + 1)) :
    a (t + 1) ∈ focusAt L a (t + 1) ∧
    outputAt (generator L) a t ≤ a (t + 1) ∧
    (∀ (hb : outputAt (generator L) a t ∈ (L i).val)
       (hx : a (t + 1) ∈ (L i).val),
      rank (L i) ⟨outputAt (generator L) a t, hb⟩ ≤
        rank (L i) ⟨a (t + 1), hx⟩) := by sorry

end DenseLanguageGeneration.PatientScope
Source
Cai, Li, Shen, Wang and Zhang, STOC 2027 submission #335 (October 2026), Fact 3.13, printed p.15 (PDF p.17); analogous proof of Fact 3.11, printed p.12 (PDF p.14); 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