Five famous problems about polynomial maps are linked by known implication routes, but their common breakthrough remains elusive. This anonymous, unrefereed candidate does not claim that breakthrough. It makes one route smaller and more testable. The structural paper uses a complementary-minor duality to turn a family of equations whose size grows with the parameter into an adjacent-flag problem of fixed width. In the first coupled case, the surviving geometry has only four variables. The computational companion then studies that quartic obstruction exactly. A major repair distinguishes two coefficient gauges: a centered staircase gauge and a backward p-adic gauge. They agree only after localizing where an explicit transition determinant is invertible. The release also keeps two logical limits visible. Transversality can identify bad loci without proving that they are empty, and a pure leading monomial can prove zero-dimensionality without proving saturation. The p-adic addendum gives a separate positive signal. Twelve designated-prime cases through fifty-seven certify, while the index fifteen shows why the designated finite-field route can have exceptions even when another prime certifies the characteristic-zero instance. A conjectural slope-four valuation law could turn that bounded signal into a uniform argument, but it is still open. The public package contains three papers, exact code and data, ordinary and optimized replay receipts, negative controls, claims, reviews, provenance and checksums. Internal review passed after repair, but internal review, replay, hashes, a DOI and publication are not independent mathematical validation. The most useful next work is an integral or Smith-form proof of the slope law, finite-field norm coprimality, a uniform elimination or saturation certificate across the residual quartic charts, and unaffiliated specialist reconstruction. This audio briefing is a communication aid, not additional evidence.