Composition Impossibility Theorem

• Composition impossibility theorem is a recurring pattern where natural composition rules for systems fail under basic consistency and formal constraints.
• It highlights failures in quantum process theory, hidden-variable models, relation algebras, cryptography, and radical compositions, revealing limits in standard compositional methods.
• The theorem underscores that rules valid for simple cases can become inconsistent in complex systems governed by causal, contextual, or algebraic restrictions.

Searching arXiv for the cited papers to ground the article in the published sources. {"query":"id:(Guérin et al., 2018) OR id:(Maddux, 2016) OR id:(Schlosshauer et al., 2013) OR id:(Laneve et al., 2021) OR id:(Morales et al., 2019)","max_results":10} I’m checking the exact arXiv records and metadata for the five papers referenced in the source material. “Composition impossibility theorem” is not a single theorem with one formal statement, but a recurring no-go pattern in which a seemingly natural rule for building a composite object from well-defined constituents fails under basic assumptions. In the cited literature, the phrase and closely related formulations occur in quantum process theory, deterministic hidden-variables models, algebra of binary relations, relativistic quantum cryptography, and the theory of radicals and polynomial solvability. In each setting, the obstruction concerns a specific compositional principle: parallel tensoring of process matrices, subsystem-to-composite ontic composition, finite relational representation under composition and intersection, composable realization of oblivious transfer from bare communication, or finite nesting of radicals to reconstruct generic roots (Guérin et al., 2018, Schlosshauer et al., 2013, Maddux, 2016, Laneve et al., 2021, Morales et al., 2019).

1. Recurring structure of composition impossibility

A common structure links these otherwise disparate results. One begins with local or single-instance objects that are individually valid: process matrices, ontic states, binary relations, cryptographic resources, or analytic/radical expressions. One then posits a rule that should build a valid global object while preserving basic consistency with known special cases. The theorem shows that the rule is either unique and invalid outside a restricted regime, or directly inconsistent with the ambient formalism.

Domain	Objects being composed	Obstruction
Quantum processes	Process matrices $W,W'$	The only bilinear, order-consistent candidate is $W \otimes W'$, but it fails the process constraints for indefinite causal order
Hidden-variables models	Ontic states $\lambda_1,\lambda_2$	$PI_{c,tr}$ leads to violation of $\sum_k pr(M=k \mid \lambda)=1$
Relation algebras	Composition $;$ and intersection $\cdot$	A finite algebra is representable only on an infinite base
Relativistic cryptography	Protocol/resource composition for OT	No composable OT from bare communication for $\epsilon<1/12$
Abel–Ruffini setting	Finite compositions of analytic functions and radicals	Such compositions have solvable monodromy, but generic degree-$n$ roots have monodromy $S_n$ for $W \otimes W'$0

This shared pattern suggests that “composition impossibility” typically does not mean that composite systems are meaningless or unusable. It means that a preferred composition rule, chosen for its apparent naturality or consistency with simpler cases, is incompatible with the formal constraints of the theory under consideration.

2. Quantum processes and the failure of a natural tensor product

In the process-matrix formalism, a quantum process matrix $W \otimes W'$1 is the most general object assigning joint probabilities to local quantum operations without assuming a background causal order. For two parties $W \otimes W'$2 and $W \otimes W'$3, with input spaces $W \otimes W'$4 and output spaces $W \otimes W'$5, the spaces are $W \otimes W'$6 and $W \otimes W'$7. A valid process satisfies positivity $W \otimes W'$8, trace normalization $W \otimes W'$9, and the “no-loop” linear constraint $\lambda_1,\lambda_2$0, where $\lambda_1,\lambda_2$1 projects onto the linear subspace defined by the paper’s constraints. Local operations are represented by Choi matrices $\lambda_1,\lambda_2$2, and the generalized Born rule is

$\lambda_1,\lambda_2$3

This reduces to the standard state- and channel-based probability rules in fixed-order cases (Guérin et al., 2018).

The central question is whether there exists a binary map $\lambda_1,\lambda_2$4 giving a parallel composition of two processes for the same parties. The desired properties are: validity, meaning $\lambda_1,\lambda_2$5 is itself a valid bipartite process; consistency, meaning that if $\lambda_1,\lambda_2$6 and $\lambda_1,\lambda_2$7 have the same definite causal order then $\lambda_1,\lambda_2$8; and convex linearity, meaning that composition commutes with mixing. Under the relaxed assumptions of positivity only, consistency on definite-order processes, and real-linearity in each argument, Theorem 1 shows that there is no bilinear map other than the ordinary tensor product:

$\lambda_1,\lambda_2$9

The proof proceeds by extending convex linearity to a real-linear map on the full span, proving Hermiticity and operator-norm bounds, and then using PTI operators (“products of traceless or identity”) with eigenvalues in $PI_{c,tr}$0 to force tensor-product action on a generating basis (Guérin et al., 2018).

The decisive obstruction appears in Theorem 2. Since the unique linear and order-consistent candidate is the tensor product, any valid rule must coincide with $PI_{c,tr}$1. But for indefinite causal order this tensor product fails the “no-loop” constraint. The paper gives the example

$PI_{c,tr}$2

for which $PI_{c,tr}$3 violates $PI_{c,tr}$4 and therefore does not yield normalized probabilities; this is explicitly identified with the “grandfather paradox” causal loop. The consequence is that general quantum processes do not admit a bilinear, positivity-preserving, order-consistent parallel composition. The paper therefore concludes that a Shannon theory of general quantum processes cannot possess a natural rule for composing resources, in contrast with states and fixed-order channels, where tensor products are well defined (Guérin et al., 2018).

3. Hidden-variable composition for product states

A distinct composition impossibility appears in deterministic hidden-variables theories. In the ontological framework, a pure state $PI_{c,tr}$5 is associated with a measurable ontic-state space $PI_{c,tr}$6 and a probability density $PI_{c,tr}$7 on $PI_{c,tr}$8, with $PI_{c,tr}$9. For an observable $\sum_k pr(M=k \mid \lambda)=1$0 with spectrum $\sum_k pr(M=k \mid \lambda)=1$1, there is a response function

$\sum_k pr(M=k \mid \lambda)=1$2

subject to the no-“null-shot” condition

$\sum_k pr(M=k \mid \lambda)=1$3

The Born rule is recovered on average, and in the deterministic case one has $\sum_k pr(M=k \mid \lambda)=1$4, so $\sum_k pr(M=k \mid \lambda)=1$5 is well defined (Schlosshauer et al., 2013).

The composition principle at issue is preparation-independence in its compositional form. The weaker rule used in the theorem is $\sum_k pr(M=k \mid \lambda)=1$6: if $\sum_k pr(M=k \mid \lambda)=1$7 tracks $\sum_k pr(M=k \mid \lambda)=1$8 on $\sum_k pr(M=k \mid \lambda)=1$9 and $;$0 tracks $;$1 on $;$2, then $;$3 tracks $;$4 on $;$5. Tracking means that for every $;$6 and eigenvalue $;$7,

$;$8

Together with determinism and the weak projector assumption $;$9—if $\cdot$0 and $\cdot$1 then $\cdot$2—this suffices for the no-go argument (Schlosshauer et al., 2013).

The theorem states that any deterministic hidden-variables model on a two-dimensional Hilbert space $\cdot$3 that reproduces quantum statistics on $\cdot$4, satisfies assumption $\cdot$5, and satisfies $\cdot$6 cannot be extended to cover tensor-product states in $\cdot$7 without contradicting $\cdot$8. The proof has three steps. First, for any distinct nonorthogonal states $\cdot$9, each $\epsilon<1/12$0 contains a subset of measure $\epsilon<1/12$1 whose members also track $\epsilon<1/12$2. Second, choosing qubit states $\epsilon<1/12$3 with $\epsilon<1/12$4 yields a nonempty set of ontic states that track both single-qubit states; by $\epsilon<1/12$5, $\epsilon<1/12$6 then tracks all four product states $\epsilon<1/12$7, $\epsilon<1/12$8. Third, the Pusey–Barrett–Rudolph measurement provides an orthonormal basis $\epsilon<1/12$9 with $n$0 for each pair $n$1, so tracking forces zero response probability for all four outcomes, violating normalization (Schlosshauer et al., 2013).

The significance of this theorem is sharply delimited in the source. It does not target locality in the Bell sense or noncontextuality in the Bell–Kochen–Specker sense. Rather, it targets the classical-looking assumption that subsystem “real states” can be combined into a complete state for a nonentangled product system. The paper’s stated implication is that one must reject or modify $n$2, for example by adding contextual or relational data that arise only at the composite level (Schlosshauer et al., 2013).

4. Composition and intersection in relation algebras

In algebraic logic, the composition impossibility theorem takes the form of a failure of the finite representation property (FRP). For a nonempty set $n$3, an algebra of binary relations over $n$4 is a set $n$5 equipped with composition

$n$6

and intersection

$n$7

and closed under both operations. If $n$8 denotes the class of all abstract algebras of similarity type $n$9 that arise concretely in this way, then $S_n$0 has the FRP if every finite representable algebra also has a representation over a finite base set. Maddux’s theorem states that $S_n$1 does not have the finite representation property (Maddux, 2016).

The counterexample is a finite three-element algebra

$S_n$2

represented over the infinite set $S_n$3 by $S_n$4, $S_n$5, and $S_n$6. This algebra is closed under composition and intersection, with key equations

$S_n$7

The proof shows that any abstract algebra satisfying these equations must be represented on an infinite set. Thus a finite abstract algebra exists that is representable over an infinite base but over no finite base (Maddux, 2016).

The argument proceeds through a sequence of lemmas. First, one derives $S_n$8. Next, one defines a diversity relation $S_n$9 as a relation disjoint from $W \otimes W'$00, and calls it dense if every $W \otimes W'$01 admits $W \otimes W'$02 with $W \otimes W'$03. Then $W \otimes W'$04 is shown to be a nonempty dense diversity relation. From this, Proposition 4.4 constructs an infinite chain of distinct points $W \otimes W'$05 such that for all $W \otimes W'$06,

$W \otimes W'$07

Hence $W \otimes W'$08 must be infinite (Maddux, 2016).

The importance of the example lies in its minimality and in the role of the two operations. The source emphasizes that the example uses the smallest nontrivial set of relations $W \otimes W'$09 and only composition and intersection. It further states that if one omits intersection or replaces it by union, many finite representation theorems reappear. The theorem therefore isolates the simultaneous presence of $W \otimes W'$10 and $W \otimes W'$11 as already sufficient to force infinite representability in some finite algebras (Maddux, 2016).

5. Composable oblivious transfer in relativistic quantum cryptography

In relativistic quantum cryptography, the relevant impossibility concerns composable construction of oblivious transfer (OT). The formal setting is Abstract Cryptography implemented with Causal Boxes. A cryptographic resource $W \otimes W'$12 is an abstract box with interfaces; converters $W \otimes W'$13 attached to the interfaces form $W \otimes W'$14; and distinguishers $W \otimes W'$15 induce a distinguishing advantage

$W \otimes W'$16

A protocol $W \otimes W'$17 $W \otimes W'$18-constructs a target primitive from a setup if it satisfies correctness and simulation-based security against dishonest Alice and dishonest Bob. Causal boxes model quantum messages tagged by space–time points, with outputs at $W \otimes W'$19 depending only on inputs in the causal past of $W \otimes W'$20; composition of causal boxes remains causal (Laneve et al., 2021).

The paper formalizes several OT variants: Rabin OT, $W \otimes W'$21-Rabin OT, $W \otimes W'$22-out-of-$W \otimes W'$23 OT, and Randomized OT (ROT). It proves equivalences among them: ROT $W \otimes W'$24 OT and OT $W \otimes W'$25 ROT are perfect; OT $W \otimes W'$26 is perfect; and $W \otimes W'$27 uses Crépeau’s reduction with $W \otimes W'$28 parallel Rabin-OT and distinguishing advantage at most $W \otimes W'$29. The main impossibility theorem is Theorem 3.1: for any $W \otimes W'$30, there is no protocol using only relativistic quantum communication, or even general non-signalling communication, that composably constructs ROT. Corollary 3.2 transfers the same bound to $W \otimes W'$31-out-of-$W \otimes W'$32 OT, and Theorem 3.3 gives the $W \otimes W'$33-Rabin OT bound $W \otimes W'$34, equivalently $W \otimes W'$35. For string-OT of length $W \otimes W'$36, the bound sharpens to $W \otimes W'$37 (Laneve et al., 2021).

The proof is a simulation-based distinguishing argument. Assuming a protocol $W \otimes W'$38 $W \otimes W'$39-constructs ROT, one obtains a composed resource $W \otimes W'$40 within $W \otimes W'$41 of the ideal ROT by the triangle inequality. A distinguisher then performs a man-in-the-middle attack: it chooses $W \otimes W'$42, feeds it to the composed resource, receives $W \otimes W'$43, and checks whether it equals the original $W \otimes W'$44. In the ideal ROT resource equality always holds, while in the simulated construction the simulator must guess $W \otimes W'$45 with probability at least $W \otimes W'$46 on the branch $W \otimes W'$47, because Minkowski causality places the required output outside the light-cone of the value available to the simulator. This yields distinguishing advantage at least $W \otimes W'$48, so $W \otimes W'$49 and therefore $W \otimes W'$50 (Laneve et al., 2021).

The paper extends the impossibility to secure two-party computation via an AND-function primitive, and from there to multi-party computation. It also records a mutual construction between oblivious transfer and bit commitment: bit commitment $W \otimes W'$51 OT using $W \otimes W'$52 ideal commitments with distinguishing advantage $W \otimes W'$53, and OT $W \otimes W'$54 bit commitment using $W \otimes W'$55 instances of $W \otimes W'$56-out-of-$W \otimes W'$57 OT with distinguishing advantage $W \otimes W'$58. The stated interpretation is that no purely relativistic and quantum protocol can yield a composable OT or general MPC from bare communication alone; extra setup assumptions are required (Laneve et al., 2021).

6. Radical composition and Abel–Ruffini

A classical version of composition impossibility appears in the Abel–Ruffini theorem. In the formulation given in the cited source, one seeks an algebraic expression

$W \otimes W'$59

where each $W \otimes W'$60 is analytic in the coefficients, $W \otimes W'$61 denotes an $W \otimes W'$62th-root operation, and $W \otimes W'$63 is analytic or built from field operations. The expression is intended to reconstruct the roots of a general polynomial from its coefficients. The precise impossibility statement is that for $W \otimes W'$64 there is no such finite composition of analytic functions and radical extractions that yields all roots of the general polynomial as single-valued functions of the coefficients (Morales et al., 2019).

The proof strategy is topological and group-theoretic. Let $W \otimes W'$65 be coefficient space with the discriminant locus removed. A closed loop $W \otimes W'$66 in $W \otimes W'$67 analytically continues each root function $W \otimes W'$68 to some $W \otimes W'$69, defining a monodromy representation

$W \otimes W'$70

For the general degree-$W \otimes W'$71 polynomial, the image is the full symmetric group $W \otimes W'$72. By contrast, a single $W \otimes W'$73th-root extraction has cyclic monodromy of order $W \otimes W'$74, and compositions built by field operations and radicals remain within a solvable extension tower. The decisive mismatch is therefore that any finite radical composition has solvable monodromy, whereas $W \otimes W'$75 is non-solvable for $W \otimes W'$76 (Morales et al., 2019).

The source illustrates the contrast with low-degree formulas. The quadratic formula uses one square root, and its monodromy is a transposition of order $W \otimes W'$77. Cardano’s cubic formula uses one square root and two cube roots, and its monodromy embeds into a solvable extension of cyclic groups of orders $W \otimes W'$78 and $W \otimes W'$79. For quintics, the source gives the family $W \otimes W'$80 with $W \otimes W'$81 for small $W \otimes W'$82, along which the five roots undergo a $W \otimes W'$83-cycle. This concretizes the impossibility: finite nesting of radicals cannot keep pace with the full $W \otimes W'$84 monodromy (Morales et al., 2019).

The visualization paper makes this obstruction geometric. Using JavaScript and p5.js, it tracks loops in coefficient space whose analytic continuation returns radical-based expressions to their initial values while permuting the roots nontrivially. In the stated interpretation, the visualization does not replace the proof; it renders the monodromy obstruction explicit by showing the mismatch between single-valued radical compositions and the actual permutation behavior of generic roots (Morales et al., 2019).

7. Comparative interpretation and limits of the no-go claims

Taken together, these theorems identify several distinct senses in which composition can fail. In quantum process theory, the failure concerns a bilinear, positivity-preserving, order-consistent parallel composition for indefinite causal order; the tensor product remains valid on definite-order processes but not in general (Guérin et al., 2018). In deterministic hidden-variables theories, the contradiction is tied to $W \otimes W'$85 and shows that subsystem ontic states do not straightforwardly determine the ontic description of a product system, even when the quantum state is nonentangled (Schlosshauer et al., 2013). In algebraic logic, the obstruction is representational: closure under composition and intersection can force any representation of a finite algebra onto an infinite base (Maddux, 2016). In relativistic cryptography, the impossibility is composable and setup-sensitive: OT and MPC cannot be constructed from bare communication under Abstract Cryptography security, even with relativistic causality and quantum communication (Laneve et al., 2021). In Abel–Ruffini, the obstruction is not to solving particular equations, but to any single-valued finite composition of analytic functions and radicals that reconstructs roots of the generic polynomial of degree at least five (Morales et al., 2019).

A recurrent misconception is to read these theorems as blanket denials of composite structure. The sources support a narrower reading. The quantum-process result excludes a natural resource-composition rule but leaves open one-copy or single-shot information-theoretic approaches (Guérin et al., 2018). The hidden-variables result excludes a classical-looking compositional rule but explicitly points toward additional contextual or relational variables at the composite level (Schlosshauer et al., 2013). The cryptographic result excludes construction from bare communication, not from stronger setup assumptions such as shared resources, relativistic multiple agents, bounded-storage, or trusted hardware (Laneve et al., 2021). The algebraic and Abel–Ruffini results likewise isolate precise formal constraints—finite representation over finite bases in one case, radical composition in the other—rather than denying the broader mathematical theories in which they arise (Maddux, 2016, Morales et al., 2019).

In that sense, “composition impossibility theorem” functions less as the name of one doctrine than as a recurring mathematical schema. The theorems differ in ontology, proof technique, and domain of application, but they converge on a single methodological lesson: a composition rule that is natural in simple or classical regimes can fail decisively when the global structure is governed by causal constraints, contextuality, representational closure, composable security, or monodromy.