I.T11 — Minimal Alphabet Theorem

|Gen| = 5 is the unique cardinality achieving completeness (all 3 rewiring levels have channels), rigidity (no non-trivial rho-automorphism), and saturation (tetration has no channel). 4 generators fail completeness; 6 generators fail rigidity.