The Achievable Set Is the Only Survivor: The Ratio of Sums, and the Ratio of What Survives Them

The sever's pairing operator was constructed as a universal object: one rule, applied to any input, returning a complete description. The construction failed in exactly the way universal constructions fail — by producing too much. The operator's fixed points, the objects that survive it, turned out to be the interesting thing, and they were never classified. This paper classifies them. The surviving set is precisely the set of parity assignments on the operator's generators. The proof runs through three steps. First, the operator's action is stripped to a pairing condition: a candidate survives if and only if every generator's image under the pairing equals the candidate's parity. Second, a counting argument shows the number of surviving assignments is exactly 2^{N}, where N is the number of generators — no more, no less. Third, and most surprisingly, the surviving set is in exact bijection with the parity lattice, and every invariant of the operator is already visible as a parity: there is no hidden structure. The number 2^{N} is not an upper bound or an estimate. It is the exact count of survivors, stated as a number for the first time.