Context
The theorem identifies optimal raw height on one fixed presentation graph. It explains the raw/canonical gap as a mean-circulation versus total-circulation effect.
Definitions
- The augmented graph adds a boundary vertex , an edge for the initial weight, and edges for finite final weights.
- .
Proof or evidence
Gauge invariance of circulation gives the lower bound. The upper bound is the feasibility criterion for a pair of difference constraints on every edge; absence of negative cycles follows exactly when the proposed bound dominates every mean circulation.
Verification notes
The difference-constraints proof, sign convention, boundary coordinates, and integer shortest-path step were independently reconstructed. Exhaustive checks cover all 343 weighted oriented triangles with edge weights in [-3,3]; see /research-artifacts/result-review-2026-09-01-batch-22/review_prequery_height_output.json.
Limitations
- This is fixed-graph infrastructure and says nothing about minimizing over different presentations.
- The result is an application of classical difference-constraints and maximum-cycle-mean duality; no novelty is claimed.
Notes
Produced by the review lane; captured with attribution and reconciled against this repository's gauge sign convention, which is the packet's after replacing z by -z. CLASSIFIED AS CLASSICAL INFRASTRUCTURE, NOT NOVELTY: it is standard difference constraints plus maximum-cycle-mean potential duality applied to the skew-symmetric bidirected expansion. Interpretation: after optimal weight pushing on a FIXED graph raw height is a maximum MEAN circulation, while a pinned access-tree normalization can concentrate the TOTAL circulation on one chord or final coordinate, so the raw/canonical gap on a fixed presentation is a mean-versus-total effect. The boundary vertex is required; without it the initial and final weights are unconstrained and the identity fails.