2370 — The Physical Soft-Triangle Nodes Form a Two-Route Cyclic Packet
Question
Entry 2369 identifies four physically eligible nodes in one , -soft chart. Before any physical readout, the source requires:
- retaining the two lower-denominator occurrences separately;
- preserving boundary orientation;
- assembling all three cyclic Cut/soft charts.
Sequence claim: seqclaim-90c2ae8cb7506a54c3967eda.
Chain orientation
Use the ordered physical boundary coordinates
The oriented endpoint coefficient is at a lower endpoint and at an upper endpoint. At every physical node,
Thus all four iterated corner restrictions carry the same chain orientation.
This is an iterated restriction coefficient, not yet a Picard--Lefschetz intersection number.
Two source routes
After removing the common - and -weights, the two occurrence terms have leading rational factors
Therefore:
- both routes have a simple pole;
- has a simple pole;
- has a double pole;
- at , the divided relation
supplies an additional coherence datum.
The two occurrences cannot be collapsed before forming the multi-Rees complex.
Cyclic assembly
The three source charts are
The cyclic residue orientation is in all three charts. Each of the four local node labels forms a free orbit of length three. Hence the assembled packet has
Equivalently, it is four copies of the regular -representation before relations.
Result
The static support and orientations are canonical. The differential joining the two occurrence routes at the divided collision remains to be derived.
Scope
This result does not compute:
- local residue normalizations;
- the endpoint-cover logarithmic differential;
- the Picard--Lefschetz coefficient of the physical current;
- relations among the twelve nodes;
- occurrence-forgotten or physical readout ranks.
Durable verification
- research/benincasa/check_soft_triangle_occurrence_corner_packet.py;
- research/benincasa/soft-triangle-occurrence-corner-packet.json;
- exact corner-orientation, route-valuation, and cyclic-orbit assertions;
- epistemic event ev-000000003248-3ea954fb-6e63-4310-9141-fd4875ecc974.
Next falsifier
Construct the divided-collision coherence map between the simple and double occurrence grades. Combine it with the endpoint restrictions and compute the homology of the twelve-node cyclic packet. A surviving class must then be paired with the source-normalized physical current; a fitted occurrence sum is prohibited.