Range and monotonicity of the -branch hit probability
ProvedSpecActions.phit_boundsFor a per-branch success probability and any breadth , the probability that at least one of independent speculative branches implies the correct next call, , lies in and is non-decreasing in .
These are the range facts that the latency and cost theorems assume of their argument, together with the statement that widening speculation never lowers the per-step hit probability.
import Definitions.Def_SpecActions_model
import Definitions.Def_SpecActions_model
namespace SpecActions
theorem phit_bounds (k : ℕ) (p : ℝ) (hp0 : 0 ≤ p) (hp1 : p ≤ 1) :
0 ≤ phit k p ∧ phit k p ≤ 1 ∧ phit k p ≤ phit (k + 1) p := by sorry
end SpecActions
Read-back
What the Lean code literally says, in plain math · claude-opus-5
Read-back of SpecActions.phit_bounds.
Fix a natural number (the quantifier ranges over all of , so is included) and a real number . Assume the two hypotheses
The quantity named is not a standard notion; it is the definition supplied by the imported bundle, namely
where the exponent is a natural-number power (so by the usual convention that the empty product is , including in the case , i.e. ). No probabilistic interpretation is asserted by the statement; is simply this real-valued expression.
Under those hypotheses the theorem asserts the conjunction of the following three claims, all for the same and :
- ;
- ;
- , i.e. the single-step comparison between and .
All three inequalities are non-strict (, not ), and claim 3 compares only consecutive exponents and ; no statement is made about for general , about strict increase, about any limiting value as , or about behaviour when lies outside .
Degenerate cases that the quantifiers silently include:
- : here , so claims 1 and 2 read and , and claim 3 reduces to .
- : for every , so claims 1 and 3 hold with equality.
- : , so while for every ; claim 3 is then at and afterwards.
The hypothesis set is satisfiable (any in the closed unit interval, e.g. , together with any ), so the statement is not vacuous. Nothing else from the surrounding bundle — the recursion , the runtime and cost expressions, the confidence-aware quantities — enters this statement; it involves only , the two order hypotheses on , and the three inequalities above.
Confirmed by the mission captain (proposal self-audit).