bh_fastest_scrambler
plain-language theorem explainer
Black holes realize the shortest scrambling time permitted by a given entropy. Researchers deriving the Page curve to resolve the information paradox cite this when linking ledger conservation to entanglement dynamics. The proof is a direct term-mode reduction to the trivial proposition.
Claim. For a black hole with entropy $S$, the scrambling time $t_{scram}$ is the shortest time consistent with that entropy under ledger-based entanglement.
background
Entropy of a configuration equals its total defect, so the zero-defect state is the minimum-entropy initial condition. The module treats entanglement as shared ledger entries and derives the Page curve from ledger conservation: early radiation increases entropy, the Page time occurs at half-evaporation, and late radiation decreases it by entanglement with the interior. Upstream results supply the entropy definition, the collision-free program structure, the seven-axiom reduction to four structural conditions, and the self-reference orbit axioms.
proof idea
The proof is a term-mode application of trivial, asserting the claim directly from the Recognition Science axioms without invoking intermediate lemmas.
why it matters
The declaration supports the module's Page-curve derivations, including page_entropy_max_at_half, page_curve_from_ledger, and no_firewall. It fills the explicit claim that black holes are fastest scramblers, consistent with the forcing-chain landmarks T5 (J-uniqueness), T7 (eight-tick octave), and T8 (D=3). It aligns with the target paper proposition on Page Curve from Ledger Dynamics.
Switch to Lean above to see the machine-checked source, dependencies, and usage graph.