The Brown Joint Realizability Theorem (N = 3)
Matthew Rick Brown Brown
This paper solves the joint-realizability problem exactly for generic three-state (N=3) quantum probability histories. It proves that a generic 3\times3 unistochastic matrix has exactly two gauge-inequivalent unitary completions, shows that the reachable endpoint set is genuinely two-dimensional, and eliminates the hidden connecting phases to obtain a finite necessary-and-sufficient algebraic criterion for determining whether three probability matrices A,B,C can arise from one consistent unitary composition. The resulting decision procedure reduces the problem to at most four completion branches and degree-\leq8 polynomial equations, and its floating-point implementation was validated on 500 constructed-realizable and 500 unrelated triples with no errors in the reported tests. The theorem applies to the generic stratum; several nongeneric boundary and singular cases remain for a fully exhaustive N=3 decision procedure.
•Sep 19, 2026•0 citations