Rational-sequence and Dyck-quotient review evidence

learning_dyck_review.py is a dependency-free exact checker for the two reviewed result units. It works over rational numbers and literal stack semantics. The audit covers:

• Berlekamp–Massey recovery from exactly 2r coefficients for exhaustive small rational recurrences;
• the finite-difference family of two rank-r sequences agreeing on exactly 2r-1 coefficients, which proves the corrected sample count is sharp;
• generalized-Dyck bounded Hankel ranks, identity minors, neutral padding, and the neutral-free parity boundary;
• balanced-word saturation, bounded future signatures, bonding maps, named degree-lowering actions, and the deep-stack/failure boundary for every two-state one-bracket controller with one neutral letter.

Run python learning_dyck_review.py. The script writes its JSON result to standard output; independent-output.json is the committed transcript. Finite agreement does not replace the unrestricted proofs described on the result pages.