Theorem 6 — depth-focused time savings
ProvedSpecActions.thm6_depth_timeUnder the depth-focused policy, with deterministic real-call latency and speculative latency , and per-step guess correctness probability ,
for every . The latency coefficient is , against for breadth speculation, so the theoretical speedup ceiling rises from to . The number of active branches stays bounded because the system can run at most speculative steps ahead and inconsistent subtrees are pruned immediately.
import Definitions.Def_SpecActions_model
import Definitions.Def_SpecActions_model
namespace SpecActions
theorem thm6_depth_time (T : ℕ) (a b p : ℝ) (ha : 0 < a) (hb : 0 < b)
(hba : b < a) (hp0 : 0 ≤ p) (hp1 : p ≤ 1) (hT : 1 ≤ T) :
(depthSeqTime T a - depthSpecTime T a b p) / depthSeqTime T a
= ((T : ℝ) - 1) / (T : ℝ) * p * (1 - b / a) := by sorry
end SpecActions
Read-back
What the Lean code literally says, in plain math · claude-opus-5
Read-back of SpecActions.thm6_depth_time.
The declaration fixes a natural number and three real numbers , , , and assumes exactly the following six hypotheses:
- ;
- ;
- (strict);
- ;
- ;
- , an inequality between natural numbers, i.e. (so is excluded).
Two quantities taken from the imported bundle appear; unfolded, they are
where in both expressions the natural number is cast into the reals, and the subtraction inside is real subtraction of that cast (not truncated natural-number subtraction, so it would be at — a case the hypothesis removes). No probabilistic, algorithmic, or latency interpretation of , , , , , or is part of the statement: they are just these real-valued arithmetic expressions.
Under those hypotheses the declaration asserts the single equality of real numbers
that is, written out completely,
Here and on the right-hand side are again the real number obtained from the cast of , minus one, and the cast of itself. The claim is an exact equation — not an inequality, an approximation, an asymptotic statement, or a bound — and it is asserted for the one fixed tuple satisfying the hypotheses, hence (the binders being universal) for every such tuple.
Degenerate and boundary content of the quantifiers. All three divisions occurring in the statement have nonzero denominators under the hypotheses: gives , and gives and ; so no division-by-zero junk value is involved on either side. The hypotheses are jointly satisfiable (e.g. , , , ), so the statement is not vacuous. Included boundary instances are: , where both sides are ; , where both sides are ; and , where the right-hand side is . The hypotheses and force , hence ; the equation is nevertheless asserted only as the displayed identity, with no accompanying sign, monotonicity, or magnitude claim about either side. Nothing is asserted about any other definition in the imported bundle (phit, hits, hitsClosed, seqTime, specTime, seqCost, specCost, depthSeqCost, depthSpecCost, qhit, dqhit, specObjective), and in particular no relation between and any exponential-latency parameter is claimed.
The proof body of the declaration is left as a placeholder (sorry), so no proof is supplied for the asserted equality.
Confirmed by the mission captain (proposal self-audit).