Proof of `Depth and approximation loss of balanced recursion` (3rd statement)
groundedproofs/Lax263307Proofs/RecursionDepth.lean · lax-263307
What this proof establishes
no assumptions
Assuming the claims on the left, the claim on the right holds — checked by the archive's pipeline. Proof code is not displayed here.
Description
Two consecutive balanced reductions shrink the order by at least a factor of two. Induction on the binary-power bound then gives the stated logarithmic depth, also covering order zero.