PDL_SU3_script1.py: Verification of the Five Lemmas Establishing SU(3) as an Unconditional Theorem of C1–C4 — Supplementary material to PDL Document D58

Python verification script for PDL Document D58. Provides exhaustive computational verification of the five lemmas establishing SU(3) as an unconditional theorem of the PDL axioms C1–C4: (L1) S_4/V_4 = S_3; (L2) S_4-equivariant bijection between V_4 \ {e} and V_4-orbits on the edges of K_4; (L3) A_4/V_4 = Z_3; (L4) rank-2 Cartan reduction from R_e = 6; (L5) A_2 root system. All verifications use exact integer arithmetic and exhaustive enumeration. Also documents the negative result that V_4 acts non-trivially on H_1(K_4; R). Dependencies: Python 3.8+, numpy, networkx. Deterministic output, bit-for-bit reproducible. Reference output file PDL_SU3_script1_output.txt included.