Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Exact fixed-scale failure probability on a center-exposure atom

Proved
OAI.Problem310.FixedScaleProbability.measure_fixed_scale_on_center_atom

by Shuze Chen · Oct 16, 2026 · Mathlib 0df444a (Lean v4.33.1)

measure-theoryoai-mathprobability

Let C,I,S,TC,I,S,TC,I,S,T be finite sets: SSS indexes selector coordinates, TTT terminal coordinates, CCC the exposed center coordinates and III the fresh trials. Bits are written 000 (false) and 111 (true). Let νs,νt\nu_s,\nu_tνs​,νt​ be probability measures on {0,1}\{0,1\}{0,1} with νs{0}=νs{1}=12\nu_s\{0\}=\nu_s\{1\}=\tfrac12νs​{0}=νs​{1}=21​ and νt{0}=1−p\nu_t\{0\}=1-pνt​{0}=1−p for a real number p≤1p\le 1p≤1 (as νt\nu_tνt​ is a probability measure, this forces 0≤p≤10\le p\le 10≤p≤1 and νt{1}=p\nu_t\{1\}=pνt​{1}=p). Let P=νs⊗S⊗νt⊗T\mathbb{P}=\nu_s^{\otimes S}\otimes\nu_t^{\otimes T}P=νs⊗S​⊗νt⊗T​ be the law of a pair (a,τ)(a,\tau)(a,τ) of independent random tables a∈{0,1}Sa\in\{0,1\}^Sa∈{0,1}S (i.i.d. fair bits) and τ∈{0,1}T\tau\in\{0,1\}^Tτ∈{0,1}T (i.i.d. bits equal to 111 with probability ppp).

Let center:C→S\mathrm{center}:C\to Scenter:C→S and fresh:I→S\mathrm{fresh}:I\to Sfresh:I→S be such that the combined map on the disjoint union C⊔IC\sqcup IC⊔I is injective (all center and fresh coordinates are distinct), let value:C→{0,1}\mathrm{value}:C\to\{0,1\}value:C→{0,1} prescribe the exposed center bits, and let addr:{0,1}S×I→T\mathrm{addr}:\{0,1\}^S\times I\to Taddr:{0,1}S×I→T choose the terminal coordinate of each trial, possibly depending on the whole selector table, such that addr(a,⋅)\mathrm{addr}(a,\cdot)addr(a,⋅) is injective for every aaa. Consider the event that the center exposure equals value\mathrm{value}value and every active trial fails:

F={(a,τ): a(center(c))=value(c)  for all c∈C,  and  τ(addr(a,i))=0  for every i∈I with a(fresh(i))=1}.F=\Big\{(a,\tau):\ a(\mathrm{center}(c))=\mathrm{value}(c)\ \text{ for all } c\in C,\ \text{ and }\ \tau(\mathrm{addr}(a,i))=0\ \text{ for every } i\in I \text{ with } a(\mathrm{fresh}(i))=1\Big\}.F={(a,τ): a(center(c))=value(c)  for all c∈C,  and  τ(addr(a,i))=0  for every i∈I with a(fresh(i))=1}.

Theorem. Under these assumptions,

P(F)=(∏c∈Cνs{value(c)})⋅(1−p2)∣I∣.\mathbb{P}(F)=\Big(\prod_{c\in C}\nu_s\{\mathrm{value}(c)\}\Big)\cdot\Big(1-\frac p2\Big)^{|I|}.P(F)=(c∈C∏​νs​{value(c)})⋅(1−2p​)∣I∣.

Conditionally on the exposure atom, each fresh trial is active with probability 12\tfrac1221​ independently of the others, and an active trial fails with probability 1−p1-p1−p independently of everything else, even though the terminal coordinate it reads may depend on all selector bits. This is the finite-product form of the conditional miss estimate at one fixed scale.

Formalization Note The measure is (Measure.pi (fun _ : S => νs)).prod (Measure.pi (fun _ : T => νt)) and takes values in [0,∞][0,\infty][0,∞]; the hypotheses on νs\nu_sνs​ are νs {false} = 1 / 2 and νs {true} = 1 / 2, and the one on νt\nu_tνt​ is νt {false} = ENNReal.ofReal (1 - p) with p ≤ 1. The factor 1−p/21-p/21−p/2 appears as ENNReal.ofReal (1 - p / 2). Distinctness of center and fresh coordinates is Function.Injective (Sum.elim center fresh).

Preamble
import Mathlib
import Definitions.Def_DyadicAvoidance
import Definitions.Def_OAI_MeasureTheory_DyadicAvoidance_PeriodicBasic
import Definitions.Def_OAI_MeasureTheory_DyadicAvoidance_GridSeparation
import Definitions.Def_OAI_MeasureTheory_DyadicAvoidance_FiniteTableModel
import Definitions.Def_OAI_MeasureTheory_DyadicAvoidance_OrderedRouting
import Definitions.Def_OAI_MeasureTheory_DyadicAvoidance_RoutingPath
import Definitions.Def_OAI_MeasureTheory_DyadicAvoidance_CenterRouteExposure
import Definitions.Def_OAI_MeasureTheory_DyadicAvoidance_ExceptionalCenters
import Definitions.Def_OAI_MeasureTheory_DyadicAvoidance_CenterFailureBound
import Definitions.Def_OAI_MeasureTheory_DyadicAvoidance_FirstDefault
import Definitions.Def_OAI_MeasureTheory_DyadicAvoidance_ConcreteLabelMeasures
import Definitions.Def_OAI_MeasureTheory_DyadicAvoidance_CenterFirstDefault
import Definitions.Def_OAI_MeasureTheory_DyadicAvoidance_RandomSetDensity
import Definitions.Def_OAI_MeasureTheory_DyadicAvoidance_RoutedSetDensity
import Definitions.Def_OAI_MeasureTheory_DyadicAvoidance_RoutedExposure
import Definitions.Def_OAI_MeasureTheory_DyadicAvoidance_FirstDefaultSelection
import Definitions.Def_OAI_MeasureTheory_DyadicAvoidance_FiniteLocalPredicate
import Definitions.Def_OAI_MeasureTheory_DyadicAvoidance_WindowData
import Definitions.Def_OAI_MeasureTheory_DyadicAvoidance_WindowTableModel
import Definitions.Def_OAI_MeasureTheory_DyadicAvoidance_StableRoutingBridge
import Definitions.Def_OAI_MeasureTheory_DyadicAvoidance_WindowExceptionalTransfer
import Definitions.Def_OAI_MeasureTheory_DyadicAvoidance_TrialAddresses
import Definitions.Def_OAI_MeasureTheory_DyadicAvoidance_WindowTrialAddresses

open OAI OAI.Problem310
universe u_A u_I u_K u_C u_S u_T
open MeasureTheory ProbabilityTheory
open scoped BigOperators
Formal statement
theorem OAI.Problem310.FixedScaleProbability.measure_fixed_scale_on_center_atom
    {C : Type u_C} {I : Type u_I} {S : Type u_S} {T : Type u_T} [Fintype C] [Fintype I] [Fintype S] [Fintype T]
    (νs νt : Measure Bool) [IsProbabilityMeasure νs] [IsProbabilityMeasure νt]
    (hfalse : νs {false} = 1 / 2) (htrue : νs {true} = 1 / 2)
    (center : C → S) (fresh : I → S)
    (hinj : Function.Injective (Sum.elim center fresh)) (value : C → Bool)
    (addr : (S → Bool) → I → T) (haddr : ∀ a, Function.Injective (addr a))
    (p : ℝ) (hp : p ≤ 1) (hterminal : νt {false} = ENNReal.ofReal (1 - p)) :
    ((Measure.pi (fun _ : S => νs)).prod (Measure.pi (fun _ : T => νt)))
      {z : (S → Bool) × (T → Bool) |
        (∀ c, z.1 (center c) = value c) ∧
        ∀ i, z.1 (fresh i) = true → z.2 (addr z.1 i) = false} =
      (∏ c, νs {value c}) * (ENNReal.ofReal (1 - p / 2)) ^ Fintype.card I := by sorry
Source
https://github.com/openai/math/blob/1581d4cbdd69a0faf34b2089614fe2a814316a6a/lean/OAI/MeasureTheory/DyadicAvoidance/FixedScaleProbability.lean#L64-L97

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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me