Computational theorem · finite classification

QA-BUCK-MIN-011

Minimal support-packet classification

Exact statement

For the pinned (3,1,1) endpoint partition, target Δ54\Delta_5^4, and squared twists about proper curves, the three-packet cross-linking problem has 55 labelled support multisets in three occupancy types, and three packets are minimal.

StatusExact proof and computation
External reviewNo documented external or specialist review of this Quotient Arsenal result is recorded.

Context

Finite quotient words do not lift one factor at a time independently. Local affine lift fibres must be transported through the ordered product; the target defect then lives in a product-image cokernel that is invariant under quotient Hurwitz moves.

Proof or evidence

The support equations are solved exhaustively and minimality is proved separately.

Verification notes

The colored-crossing, diagonal-selection, and three-strand shadow proofs were reconstructed. An independent implementation enumerated all 2,925 three-support multisets and 256 positive shadow words. The later winding closures remain at L3 because their archived replay dependency is still unavailable.

Limitations

  • Necessary quotient solutions are not asserted mapping-class factorizations.

Open work

Apply stronger receipts before attempting geometric lifts.