[field] PASS  irreducible cubic root and sqrt(1423) isolated rigorously
[field] PASS  the six displayed monomials form a valid number-field basis
[topology] PASS  rooted binary DAG suppresses to a strict level-two theta 3-blob
[parameters] PASS  all rooted/effective/tree edges lie in Theta_0^circ and are edgewise strictly continuous-time K2P
[parameters] PASS  exact global minimum eigenvalue 1/16 and rate margin 11/900
[root splitting] PASS  all three comparison-tree edges admit strict stochastic half-time roots
[root splitting] PASS  the compatible theta root uses the certified K odot K factorization
[construction] PASS  cubic symmetric-ansatz equations verified exactly
[factorization] PASS  all 16 core identities M_yz=P_(y+z)R_yR_z
[Fourier] PASS  all 64 Fourier coordinates agree exactly
[patterns] PASS  all 64 probabilities agree, are positive, and sum to 1
[patterns] PASS  rigorous global minimum at 8 patterns lies in [0.0149867914232259, 0.0149867914232259]
[four-leaf topology] PASS  exact rooted binary graft has 11 vertices, 12 arcs, and four displayed trees
[four-leaf topology] PASS  root suppression retains one maximal strict level-2 theta blob; the cherry is on a cut-edge side
[four-leaf topology] PASS  comparison tree is the binary quartet with split 14|23
[four-leaf edges] PASS  each new K edge has row (5/8,1/8,1/8,1/8) and CT margin 1/4
[four-leaf edges] PASS  suppressed K odot K stem has row (7/16,3/16,3/16,3/16) and CT margin 3/16
[four-leaf edges] PASS  the full graft retains the certified global CT-margin minimum 11/900
[four-leaf Fourier] PASS  literal graphs and graft formula agree on all 256 coordinates (64 consistent, 192 zero)
[four-leaf pruning] PASS  all 256 patterns agree by displayed-tree pruning, quartet pruning, Fourier inversion, and Markov extension
[four-leaf patterns] PASS  all probabilities are positive, sum to 1, and the certified exact minimum has 16 minimizers
[four-leaf scope] PASS  this is an exact n=4 regression of the shared cherry-graft identity
[four-leaf scope] INFO  iteration to arbitrary n requires the separate theorem-level graft lemma

ALL FOUR-LEAF GRAFT CHECKS PASSED
