Equal probabilities in the original and two-stage experiments
ProvedFormalizedScopeReach.equal_probabilitiesAssume a countable vocabulary, normalized original and outcome-avoiding path laws, and unequal outcome and threshold times almost surely under the original law. The original probability of an outcome before the threshold equals the probability of at least one successful Bernoulli trial in the explicit two-stage experiment on one outcome-free timeline.
import Definitions.Def_FormalizedScopeReach_Trials open scoped BigOperators ENNReal open MeasureTheory ProbabilityTheory
namespace FormalizedScopeReach
theorem equal_probabilities {V : Type} [Countable V] (M : Model V)
[IsProbabilityMeasure (originalLaw M)] [IsProbabilityMeasure (avoidingLaw M)]
(hne : ∀ᵐ x ∂originalLaw M, T_O M x ≠ T_E M x) :
originalLaw M {x | T_O M x < T_E M x} =
twoStageLaw M 1 {z | true ∈ z.2 0} := by sorry
end FormalizedScopeReach
Read-back
What the Lean code literally says, in plain math · GPT-6 (Codex independent sub-agent)
Read-back: equal probabilities
For every countable type and every model consisting of a distinguished element , a probability mass function for each finite list of elements of (so ), and an arbitrary predicate on such lists satisfying , the following assertion holds. Write for the set of all finite lists over , with every subset measurable; for , write for its length, for its first elements, and for its element at position , with positions numbered from . Call terminal precisely when holds and holds for every . Define its original weight by if it is terminal, and by otherwise, and define the original measure , where is unit mass at . Define modified step weights by and for ; define if is terminal and contains no , and otherwise; and define the avoiding measure . All arithmetic in these weights is in the extended nonnegative reals: subtraction is truncated at zero, , and a positive quantity divided by zero is . In particular, when , the probability mass function condition makes for every , so all the modified step weights at that history are zero. Assume separately that both and have total mass exactly one. For every finite list , define to be one plus the zero-based position of its first occurrence of if there is such an occurrence, and otherwise; define to be the least natural number with and , and if there is no such . These times take values in with its usual order. Assume also that for -almost every , meaning that the set where they are equal has -measure zero. For a fixed finite list , let be the distribution of the Boolean list obtained by taking independent Boolean variables with and , where the subscript denotes conversion to a real number; these probabilities lie in because is a probability mass function. Define a measure on pairs , where is a family of finite lists indexed by the singleton set and is a family of Boolean lists indexed by that same set, as follows: take the one-coordinate product measure on , and form the sum, over every possible , of times the distribution of in which the only coordinate has law . Equivalently, this measure first samples one list from and then, conditional on that entire list, performs the independent Boolean trials at all its positions, storing both the sampled list and the trial list in singleton-indexed families. The comparison in the left-hand event below is strict: a first occurrence simultaneous with the first stopping prefix does not belong to that event. On a terminal list, , so the almost-everywhere inequality of times specifically excludes positive original probability of the first occurring at the final position of a terminal list; it permits lists having no . The time definitions also cover arbitrary nonterminal lists, including lists on which both times are infinite, where the strict comparison is false and the inequality-of-times hypothesis fails if those lists have positive original measure. Empty lists are included in the underlying list space; their products have value , their trial list is empty and has no true entry, and both times are infinite, but they have zero original and avoiding weight because stopping at the empty list is prohibited. Trial probabilities and are allowed. The model contains no assumption that stopping is monotone under extension and no rule that an original list ends at its first ; the original weight uses every step up to its terminal end. The countable type may be finite, but a model cannot exist when it is empty because it must supply . The two unit-mass assumptions are requirements on the displayed sums, not consequences included in the definition of a model; for example, a stopping predicate that is always false makes both sums zero and cannot satisfy them. The experiment in the conclusion has exactly one sampled list, with no sample-size variable or zero-sample case. The conclusion is the following exact equality of measure values in :
Confirmed by the mission captain (proposal self-audit).