Sharp tolerance redistribution for ternary Boolean compression capacity

Sharp change laws are derived for the least observable total cost forcing a specified compression error in nonnegative ternary Boolean responses of treewidth at most two. A prescribed tolerance total gives a five-piece modulus as a supremum over the unchanged common observable floor, with positive rational attainment below half the total and limiting sharpness from half the total onward, at floor zero. A second law covers a conserved but freely chosen total, coordinate-change caps and floor changes. A shared-domain bridge links compact and published fixed-profile capacity formulas. The results retain conditional candidate status under the named capacity, graph-realization and distance premises.