2909 — The Minimal Pointed-Kummer Sewing Source Is a Bridge of Two Triangles
Frozen graph
The smallest connected simple graph whose separating Cut returns two complete one-loop three-site sectors has vertices
and edges
The left triangle is , the right triangle is , and is the unique bridge.
Deleting gives exactly
The total graph has
while each Cut component has loop rank one.
Minimality
Two vertex-disjoint triangle loops require at least six vertices and six edges. Connecting them while retaining a separating Cut requires one further edge. Thus the six-site, seven-edge double triangle is minimal in the declared simple-graph class.
Resolved Cut interface
Retain two bridge occurrences
The two regional partial energies are
Only afterward impose the physical diagonal
Result
This graph is the first correctly typed global source target for Entry 2906. The five-cycle packet is not a substitute: no Cut of a pentagon returns two complete triangle factors.
The graph census does not itself define coefficient sewing. The required immutable input is now precise:
- complete canonical or OFPT integrand for this labelled graph;
- every simultaneous denominator term;
- source contour;
- bridge-Cut factorization before finite-part reduction.
Only that packet may determine the map between the two pointed Kummer torsors.
Next finite construction
Instantiate the general cosmological-polytope contour formula on this graph. Derive its source vertices, full facet set, orientation, localization Jacobian, and bridge-Cut residue. Stop before selecting an affine coefficient adapter.
Durable artifacts
research/benincasa/check_minimal_double_triangle_cut_source.pyresearch/benincasa/minimal-double-triangle-cut-source.json