Does the Symbolic LM Calculus Canonically Induce the Modal Measurement Theory? – Read Online

Does the Symbolic LM Calculus Canonically Induce the Modal Measurement Theory?
Adversarial bridge analysis between formula-valued Logical Matrices and the later chain-ring modal/effect framework

Research synthesis and independent finite verification

18 September 2026

Abstract

This report asks whether the formula-valued Logical Matrix (LM) calculus developed in Operator-Level Boolean Computation with Correspondence Matrices can be regarded as the canonical symbolic source of the later modal measurement theory over the finite chain ring $A ≅ 𝔽_{2} [u] ∕ (u^{4})$ . The answer is mixed but mathematically useful. Paper B already proves that Boolean valuation commutes with LM pairing. That fact extends naturally to arbitrary matrix, module, and tensor expressions after an explicit scalar enrichment. However, direct Boolean valuation cannot produce the nilpotent and unit amplitudes of the chain ring: every Boolean-ring homomorphism into the local ring $A$ lands in its idempotents ${0, 1}$ . The correct positive bridge is therefore not direct valuation but scalar enrichment $B \otimes_{𝔽_{2}} A$ , followed by valuation specialization $v \otimes {Id}_{A}$ . In this enriched calculus, each symbolic amplitude has a canonical Boolean support predicate whose satisfying valuations are exactly those for which the corresponding concrete ring-valued modal amplitude is nonzero. This yields a precise symbolic-support theorem connecting formula semantics to modal possibility.

The report also proves negative boundaries. The later rules that effects are rows of reversible $A$ -bases and that a nonzero contraction denotes a possible event are additional measurement structure, not consequences of the Paper-B LM semantics. The original LM state encoding generates only coordinate effects under valuation and therefore does not generate the complete 192 reversible projective two-outcome basis family. A division-free branch update $J_{i}^{B} = B^{- 1} P_{i} B$ is nevertheless available for every reversible modal basis and is compatible with projective unit rescaling and valuation. Zero divisors still obstruct a closed unrestricted process theory: nonzero states need not be tensor-closed, and conditioning can take unimodular preparations to nonunimodular conditional states.

Independent exhaustive checks reproduce the 16-element chain ring, its 8 units and 2 idempotents, $| {GL}_{2} (A) | = 24576$ , the 192 unordered projective reversible bases, 98,304 branch-support checks, 262,144 symbolic-support fiber checks, and the failure of 144 out of 256 ordinary Boolean-ring matrix products to remain inside the restricted 16-element Paper-B LM family.

1 Research question and verdict
1.1 Executive verdict
2 Primary sources and methodological boundary
3 Strict type map
4 Q1: What is a formula-valued LM mathematically?
5 Q2: What is LM pairing mathematically?
6 Q3: Valuation naturality
7 A decisive negative theorem: direct valuation cannot produce chain-ring amplitudes
8 The CM-to-chain-ring identification is linear before it is multiplicative
9 The correct positive bridge: scalar enrichment
10 The strongest bridge theorem: symbolic support realizes modal possibility
11 Q4: Can formula-valued LMs represent modal effects?
11.1 As measurement semantics: only a restricted subset
11.2 As coefficient data: every effect can be encoded after choices
12 Q5: “nonzero = possible” is extra structure
13 Q6: Symbolic observables/effects
14 Q7: Sequential measurement and update
14.1 Projective well-definedness
14.2 Symbolic update
15 Why this is not yet a closed process theory
15.1 Nonzero states are not tensor-closed
15.2 Unimodular preparation is not conditioning-closed
16 Failure results and exact boundaries
17 Prior-art matrix
18 Adversarial interpretation
18.1 What is routine
18.2 What is genuinely informative in the synthesis
19 Computational verification
20 Paper implications
21 Strongest defensible theorem and final answer
A Reproducibility notes
B Search strategy

1 Research question and verdict

The central question is whether the schematic chain

formula-valued LM \to Boolean valuation \to CM/coefficient representation \to state/resource \to effect/measurement \to logical or modal outcome

is a genuine mathematical semantics, rather than a collection of later constructions sharing matrix notation.

1.1 Executive verdict

There is a genuine bridge, but the later modal measurement theory is not canonically derivable from Paper B as it currently stands.

The strongest defensible formulation is:

Paper B canonically supplies a symbolic Boolean layer and a valuation-natural contraction calculus. After independently choosing the chain-ring amplitude algebra $A$ , there is a natural scalar-enriched symbolic extension in which valuation continues to commute with states, effects, contractions, matrix operations, and tensor products. In that extension, every ring-valued amplitude has a canonical Boolean support predicate describing exactly the valuations for which the corresponding modal event is nonzero. However, the rules that effects are rows of reversible $A$ -bases and that nonzero means possible are extra measurement structure. They are not consequences of the original formula-valued LM calculus.

Thus the clean architecture is

Boolean symbolic LM calculus \to A -enriched symbolic calculus \overset{valuation}{\to} A -valued states/effects \overset{support contract}{\to} modal outcomes .

The missing structure consists of at least three independent ingredients:

(1): a chosen cyclic/chain-ring multiplication on the four CM coefficients;
(2): a chosen admissible measurement family, such as rows of matrices in ${GL}_{n} (A)$ ;
(3): the support interpretation $a \neq 0 ⟺$ “possible.”

2 Primary sources and methodological boundary

The analysis treated the manuscript Operator-Level Boolean Computation with Correspondence Matrices (“Paper B”) as background rather than rediscovering its results. The primary Paper-B text read for this investigation includes Section 8.1–8.2 and its proof appendix. In the parsed copy used for the review, lines 560–669 define the Boolean algebra of formulas modulo equivalence, the formula-valued LM, positive and general valuation, logical pairing, Proposition 2, and Theorem 3. Lines 780–874 contain the appendix proof and finite verification scope.

The later modal source read was PURE_BOOLEAN_MODAL_CM_ADDENDUM.tex. In the parsed copy used for the review, lines 45–118 explicitly state that the modal nonzero-support readout is an “additional contract,” introduce the chain ring, define states and separability, and specify reversible effect bases. Lines 440–539 contain the complete 192-basis support classification, and lines 620–643 identify the remaining multi-round measurement/update problem.

The supplied adversarial-review archive is included verbatim and unpacked in this research package. It contains the earlier novelty dossier, theorem candidates, search logs, source-audit files, and a large set of reproduced computational outputs. The current report adds a separate bridge analysis and fresh independent checks.

3 Strict type map

The investigation keeps the following object types separate.


Layer	Object	Map	Status / preserved structure



Binary truth function	$C \in M_{2} (𝔽_{2})$	$C \mapsto {LM}_{X, Y} (C)$	Injective for freely assignable $X, Y$ ; preserves XOR and entrywise Boolean operations; not ordinary matrix multiplication.
Formula-valued LM	${LM}_{X, Y} (C) \in M_{2} (B)$	entrywise Boolean valuation $v$	Canonical for each valuation; preserves Boolean-ring operations.
Valued CM	$v (LM) \in M_{2} (𝔽_{2})$	vectorization	Linear bijection after cell-order choice; basis/order dependent.
Four coefficients	$c \in 𝔽_{2}^{4}$	cyclic-basis identification	Vector-space bijection to $A$ ; does not inherit ordinary $2 \times 2$ matrix multiplication.
Chain-ring scalar	$a \in A ≅ 𝔽_{2} [u] ∕ (u^{4})$	regular representation $Λ$	Injective algebra representation into $M_{4} (𝔽_{2})$ after multiplication on $A$ is chosen.
One-system state	$ψ \in A^{n}$	effect application	Free $A$ -module object; one CM is only one scalar of $A$ , not a whole state.
Bipartite resource	$M \in M_{m, n} (A)$	$M \mapsto U M V^{T}$	Local $A$ -linear action; distinct type from original Boolean CMs.
Effect	$e \in {(A^{n})}^{*} ≅ A^{1 \times n}$	$e (ψ) = e ψ$	$A$ -linear functional; row identification uses a free-module basis.
Measurement	rows of $B \in {GL}_{n} (A)$	$B ψ$	Reversible coordinate change; additional modal choice.
Outcome scalar	$e ψ \in A$ or $e M f^{T} \in A$	$a \mapsto [a \neq 0]$	Support zero-test; not a ring/semiring homomorphism in general.
Symbolic enriched layer	$S A = B \otimes_{𝔽_{2}} A$	$v_{A} = v \otimes {Id}_{A}$	Canonical once $A$ is chosen; preserves ring, module, matrix, and tensor operations.
Symbolic modal outcome	$q \in S A$	$Supp A (q) \in B$	Exact valuation-wise zero/nonzero semantics; support itself is not an algebra homomorphism.

A key typing correction is

one 2 \times 2 Boolean CM \neq one modal state .

After a four-feature basis is chosen, one CM becomes one scalar of $A$ . A one-bit modal state needs two such scalars:

ψ = a_{0} | 0 ⟩ + a_{1} | 1 ⟩ \in A^{2} .

A two-party resource requires four such scalars.

4 Q1: What is a formula-valued LM mathematically?

Let $B$ be the Lindenbaum Boolean algebra of propositional formulas modulo logical equivalence. Write it as a Boolean ring using

f + g = f \oplus g, f g = f \land g, \neg f = 1 + f .

For freely assignable symbols $X, Y$ , define

X_{1} = X, X_{2} = \neg X, Y_{1} = Y, Y_{2} = \neg Y .

For a binary truth table $C = (c_{i j}) \in M_{2} (𝔽_{2})$ , Paper B defines

{LM}_{X, Y} (C) = \underset{i, j}{\oplus} c_{i j} | X_{i} ⟩ ⟨ Y_{j} | \in M_{2} (B) .

Equivalently, after expansion,

{LM}_{X, Y} (Θ) = (\begin{matrix} X Θ Y & X Θ \neg Y \\ \neg X Θ Y & \neg X Θ \neg Y \end{matrix}) .

Theorem 4.1 (Algebraic status of the Paper-B LM family). For fixed freely assignable $X, Y$ , the map

ℓ_{X, Y} : M_{2} {(𝔽_{2})}_{c o e ff} \to M_{2} (B), C ⟼ {LM}_{X, Y} (C),

is injective and $𝔽_{2}$ -linear. It preserves entrywise Boolean operations. It is not, in general, a homomorphism from ordinary Boolean-ring matrix multiplication on $M_{2} (𝔽_{2})$ to matrix multiplication in $M_{2} (B)$ .

Proof. Linearity follows from the XOR sum defining the LM. Positive valuation sends the LM back to its coefficient CM, so equality of two LMs implies equality of their coefficient matrices. Therefore the map is injective. Entrywise Boolean operations commute with the substitution producing the four polarity positions. Ordinary matrix product is different: multiplication mixes row/column positions by XOR–AND contraction. Exhaustive evaluation of all $1 6^{2} = 256$ products of the 16 Paper-B LMs shows that 144 products leave the restricted 16-element LM family, so the family is not closed under this multiplication. □

Remark 4.2. The most economical description is therefore: a Paper-B LM is a special predicate-valued matrix over a free/Lindenbaum Boolean ring. The ambient space $M_{2} (B)$ is natural; the 16 matrices generated by binary truth functions are a distinguished subset/subalgebra only for the entrywise Boolean operations. Calling the construction merely a relation would lose the XOR–AND scalar algebra used by Paper B.

5 Q2: What is LM pairing mathematically?

For a formula $F \in B$ , Paper B defines

s (F) = (\begin{matrix} F \\ \neg F \end{matrix}), s {(F)}^{T} = (F, \neg F) .

The symbolic pairing is

P_{C} (L_{1}, L_{2}) = s {(L_{1})}^{T} {LM}_{X, Y} (C) s (L_{2}),

where scalar multiplication is conjunction and scalar addition is XOR.

Proposition 5.1 (LM pairing is Boolean-ring matrix contraction). For the special LM associated with a binary connective $Θ$ ,

⟨ L_{1} | {LM}_{X, Y} (Θ) | L_{2} ⟩ \equiv (L_{1} \leftrightarrow X) Θ (Y \leftrightarrow L_{2}) .

Thus the Paper-B “logical pairing” is ordinary matrix contraction over the Boolean ring $B$ , with a non-linear special state embedding $F \mapsto (F, \neg F)$ .

The roles of the connectives are exact:

AND is scalar multiplication;
XOR is scalar addition and reduction;
negation appears in the complement-paired state encoding;
OR is not the matrix-addition operation used by the pairing.

The pairing may be described semantically as predicate evaluation or relationship extraction, but those descriptions do not add algebraic structure beyond the Boolean-ring contraction.

6 Q3: Valuation naturality

Let

v : B \to 𝔽_{2}

be a Boolean valuation. Extend $v$ entrywise to matrices and vectors.

Theorem 6.1 (Valuation naturality). For compatible Boolean-ring matrices and vectors,

v (M N) = v (M) v (N),

and

v (x^{T} M y) = v {(x)}^{T} v (M) v (y) .

The same statement holds for finite Kronecker tensor products.

Proof. Every output entry is a finite expression built from Boolean-ring addition and multiplication. A Boolean valuation is a homomorphism for those operations, so it may be moved through each finite sum and product. □

This theorem is already present in Paper B for the LM pairing case. Its broader matrix/tensor version is a routine homomorphism-extension fact. It is useful for organizing the bridge, but it should not be presented as deep novelty.

7 A decisive negative theorem: direct valuation cannot produce chain-ring amplitudes

The strongest possible bridge would send Boolean formulas directly into the later amplitude ring

A = 𝔽_{2} [u] ∕ (u^{4}) .

That is impossible except for the embedded Boolean scalars.

Theorem 7.1 (Idempotent obstruction). Let $B$ be a Boolean ring and let $h : B \to A$ be a unital ring homomorphism. Then every $h (b)$ is idempotent. In the local chain ring $A = 𝔽_{2} [u] ∕ (u^{4})$ , the only idempotents are $0$ and $1$ . Therefore

im h \subseteq {0, 1} ≅ 𝔽_{2},

and $h$ factors through an ordinary Boolean valuation

B \to 𝔽_{2} ↪ A .

Proof. Every element of a Boolean ring satisfies $b^{2} = b$ . Hence

h {(b)}^{2} = h (b^{2}) = h (b) .

A local ring has no idempotents other than $0$ and $1$ . The stated chain ring is local, so the image is Boolean. □

Corollary 7.2. Nilpotent and nontrivial unit amplitudes such as

u, u^{2}, u^{3}, 1 + u

can never arise as direct values of Paper-B Boolean formulas under a ring-homomorphic valuation.

This rules out the claim that the chain-ring amplitude theory is obtained by simply changing the codomain of Paper-B valuation.

8 The CM-to-chain-ring identification is linear before it is multiplicative

There is a natural-looking sequence

M_{2} (𝔽_{2}) \to_{}^{{vec}_{κ}} 𝔽_{2}^{4} \to_{}^{α_{β}} A,

where $κ$ fixes a cell order and $β$ fixes an ordered $𝔽_{2}$ -basis of $A$ . Both arrows are vector-space bijections.

They are not an identification of ordinary $2 \times 2$ matrix multiplication with the chain-ring multiplication. Two immediate invariants separate the algebras:

$M_{2} (𝔽_{2})$ is noncommutative, while $A$ is commutative;
$| {GL}_{2} (𝔽_{2}) | = 6$ , while $A$ has 8 units.

Therefore the later cyclic product

E_{r} ⋆ E_{s} = E_{r + s mod 4}

is additional algebraic structure placed on the four-component coefficient space. Once supplied,

A ≅ 𝔽_{2} [C_{4}] ≅ 𝔽_{2} [u] ∕ (u^{4}),

and its regular representation

Λ : A ↪ M_{4} (𝔽_{2})

is an injective algebra homomorphism. The multiplication itself, however, is not forced by the original LM valuation theorem.

9 The correct positive bridge: scalar enrichment

The direct-valuation obstruction suggests the right construction.

Definition 9.1 (Enriched symbolic scalar algebra). Let

S A = B \otimes_{𝔽_{2}} A .

For the current chain ring,

S A ≅ B [u] ∕ (u^{4}) .

Theorem 9.2 (Canonical specialization after choosing $A$ ). For every Boolean valuation $v : B \to 𝔽_{2}$ , there is a canonical $A$ -algebra specialization

v_{A} = v \otimes {Id}_{A} : S A \to A,

defined on pure tensors by

v_{A} (f \otimes a) = v (f) a .

It preserves addition and multiplication and therefore extends entrywise to matrices, vectors, contractions, and tensor products. In particular,

v_{A} (e ψ) = v_{A} (e) v_{A} (ψ),

and

v_{A} (E M F^{T}) = v_{A} (E) v_{A} (M) v_{A} {(F)}^{T} .

Remark 9.3 (Universal property). The tensor product is the coproduct of the commutative $𝔽_{2}$ -algebras $B$ and $A$ . Therefore this is a genuine universal property, but it is a universal property after the amplitude algebra $A$ has been independently selected. It does not derive $A$ from the formula calculus.

For finitely many Boolean generators, if

Ω = {Hom}_{B o o l} (B, 2)

is the valuation set, then extensionally

B ≅ 𝔽_{2}^{Ω} and hence S A ≅ A^{Ω} .

So an enriched symbolic scalar may be read simply as an $A$ -valued function of the Boolean valuation. This is the finite Boolean-power viewpoint.

10 The strongest bridge theorem: symbolic support realizes modal possibility

Let

q \in S A ≅ A^{Ω} .

Define the symbolic support predicate $Supp A (q) \in B$ to have exactly the valuation set

{v \in Ω : v_{A} (q) \neq 0} .

For

q = f_{0} + f_{1} u + f_{2} u^{2} + f_{3} u^{3}, f_{i} \in B,

one may write

Supp A (q) = f_{0} \lor f_{1} \lor f_{2} \lor f_{3} .

Although this coordinate formula uses the displayed basis, the resulting Boolean predicate is basis-independent up to logical equivalence because it is defined by the intrinsic condition $v_{A} (q) \neq 0$ .

Theorem 10.1 (Symbolic-support bridge). Let

e \in S A^{1 \times n}, ψ \in S A^{n} .

Define

P o s s (e, ψ) = Supp A (e ψ) \in B .

Then for every Boolean valuation $v$ ,

v (P o s s (e, ψ)) = 1 ⟺ v_{A} (e) v_{A} (ψ) \neq 0 .

For a bipartite symbolic resource $M$ ,

v (Supp A (e M f^{T})) = 1 ⟺ v_{A} (e) v_{A} (M) v_{A} {(f)}^{T} \neq 0 .

Proof. Choose an $𝔽_{2}$ -basis ${β_{k}}$ of $A$ and write the symbolic scalar contraction as

q = \sum_{k} f_{k} β_{k} .

At valuation $v$ ,

v_{A} (q) = \sum_{k} v (f_{k}) β_{k} .

Linear independence of the basis gives

v_{A} (q) = 0 ⟺ v (f_{k}) = 0 for all k .

Therefore

v_{A} (q) \neq 0 ⟺ \underset{k}{\lor} v (f_{k}) = 1 ⟺ v (\underset{k}{\lor} f_{k}) = 1 .

□

Corollary 10.2 (Satisfiability/possibility bridge).

Supp A (e ψ) is satisfiable ⟺ \exists v : v_{A} (e) v_{A} (ψ) \neq 0 .

The same holds for bipartite contractions $e M f^{T}$ .

This is the strongest bridge found in the investigation. It says that a single symbolic contraction can compute an ordinary Boolean formula describing exactly the parameter valuations under which the corresponding concrete ring-modal event is possible.

11 Q4: Can formula-valued LMs represent modal effects?

Two meanings of “represent” must be distinguished.

11.1 As measurement semantics: only a restricted subset

The Paper-B logical state map is

s (L) = (\begin{matrix} L \\ \neg L \end{matrix}) .

For every valuation,

v (s (L)) \in {(\begin{matrix} 1 \\ 0 \end{matrix}), (\begin{matrix} 0 \\ 1 \end{matrix})} .

So the bare Paper-B bra/ket construction yields only coordinate rows after valuation. It does not directly yield the embedded- $𝔽_{2}$ effect $(1, 1)$ , which already occurs in a standard modal $X$ -type basis.

Proposition 11.1 (Negative measurement-family characterization). The original Paper-B LM pairing semantics does not generate the complete 192 reversible projective modal bases over $A$ . It does not even generate every reversible basis in the embedded $𝔽_{2}$ subtheory.

This is a negative version of the requested measurement-family characterization.

11.2 As coefficient data: every effect can be encoded after choices

Fix a CM cell ordering and the cyclic $𝔽_{2}$ -basis of $A$ . Every $a \in A$ has a unique four-bit coefficient representation, hence a unique Boolean CM in that basis, and therefore a Paper-B LM representative in a chosen operand frame. An effect

e = (a, b) \in A^{2}

can consequently be encoded by two such LMs, and a $2 \times 2$ reversible basis by four.

Thus every modal effect is LM-encodable as coefficient data, but this encoding is:

dependent on the chosen four-feature basis;
dependent on CM cell order;
dependent on the chosen LM operand frame/positive-valuation convention;
not a derivation of effect semantics;
not an identification of LM matrix multiplication with $A$ -multiplication.

The correct statement is therefore:

Every modal effect is LM-encodable after the chain-ring coefficient basis is fixed, but not every modal effect is an LM effect in the original Paper-B pairing sense.

12 Q5: “nonzero = possible” is extra structure

The later modal source explicitly introduces nonzero readout as an additional contract. The algebra shows why it cannot be hidden inside ordinary Boolean valuation semantics.

Define

σ : A \to {0, 1}, σ (a) = {\begin{matrix} 0, & a = 0, \\ 1, & a \neq 0 . \end{matrix}

This map is neither additive in the $𝔽_{2}$ sense nor multiplicative to Boolean support. For example,

σ (u) = σ (u^{2}) = 1,

but

σ (u + u^{2}) = 1 \neq 1 \oplus 1 = 0 .

More importantly, zero divisors give

u \neq 0, u^{3} \neq 0, u u^{3} = u^{4} = 0,

σ (u) \land σ (u^{3}) = 1 while σ (u u^{3}) = 0 .

Proposition 12.1 (Support is not a semiring homomorphism). The nonzero map $σ : A \to 2$ cannot be a homomorphism from the chain ring to either the Boolean ring $(2, \oplus, \land)$ or the ordinary Boolean semiring $(2, \lor, \land)$ . Consequently, the support semantics is an independently selected zero-test rather than a functorial quotient of the amplitude algebra.

The symbolic-support theorem does not contradict this. It says that, once the zero-test is chosen, its valuation fibers can be represented exactly by Boolean formulas.

13 Q6: Symbolic observables/effects

The most useful symbolic generalization is not a new Boolean algebra of observables but a module of symbolic effects:

E_{n} = {(S A^{n})}^{*} ≅ S A^{1 \times n} .

An effect may carry genuine formulas in its coefficients, for example

e = ((x \land \neg y) + u (x \oplus z), u^{2} (f \leftrightarrow g) + u^{3} z) .

For a symbolic state $ψ$ , the contraction

e ψ \in S A

retains the complete symbolic $A$ -valued amplitude. Applying support gives

Supp A (e ψ) \in B,

a Boolean formula describing exactly when the effect is modally possible after specialization.

Thus the framework naturally exposes two levels of output:

e ψ (symbolic amplitude) and Supp A (e ψ) (symbolic possibility condition) .

Calling this an “effect algebra” would currently be premature because no partial sum, orthosupplement, or effect-algebra order has been shown to satisfy the standard axioms. “Symbolic effect module” or “predicate-parametrized effect calculus” is more accurate.

14 Q7: Sequential measurement and update

The chain ring creates a normalization problem because possible amplitudes can be nonunits. However, reversible-basis measurements admit a clean branch update that requires no division by the observed amplitude.

Let

B \in {GL}_{n} (A)

be a reversible measurement basis, with rows interpreted as effects. Let $P_{i}$ be the diagonal coordinate projector having a single $1$ in coordinate $i$ . Define

J_{i}^{B} = B^{- 1} P_{i} B .

Theorem 14.1 (Division-free reversible-basis update). For every commutative ring $A$ and every $B \in {GL}_{n} (A)$ , the maps $J_{i}^{B}$ satisfy

{(J_{i}^{B})}^{2} = J_{i}^{B},

J_{i}^{B} J_{j}^{B} = 0 (i \neq j),

and

\sum_{i} J_{i}^{B} = I .

c_{i} = {(B ψ)}_{i},

then

J_{i}^{B} ψ \neq 0 ⟺ c_{i} \neq 0 .

Moreover,

B (J_{i}^{B} ψ) = P_{i} B ψ,

so a repeat of the same measurement has support only on outcome $i$ .

Proof. Idempotence, orthogonality, and resolution of the identity follow by conjugating the coordinate projectors. Let

b_{i} = B^{- 1} e_{i} .

Then

J_{i}^{B} ψ = c_{i} b_{i} .

The column $b_{i}$ is unimodular because it is a column of an invertible matrix. Hence its entries generate the unit ideal, so there exist $r_{j}$ with

\sum_{j} r_{j} {(b_{i})}_{j} = 1 .

If $c_{i} b_{i} = 0$ , multiplying by the $r_{j}$ combination yields $c_{i} = 0$ . The converse is immediate. Finally,

B J_{i}^{B} ψ = P_{i} B ψ .

□

14.1 Projective well-definedness

If the effect rows are independently rescaled by units,

B^{'} = D B

with $D$ diagonal and invertible, then

{(B^{'})}^{- 1} P_{i} B^{'} = B^{- 1} D^{- 1} P_{i} D B = B^{- 1} P_{i} B .

Therefore the branch projector is invariant under the same row-unit projectivization already used by the modal support theory. Outcome permutations only relabel $i$ .

14.2 Symbolic update

For

\tilde{B} \in {GL}_{n} (S A)

define

{\tilde{J}}_{i} = {\tilde{B}}^{- 1} P_{i} \tilde{B} .

Then every specialization satisfies

v_{A} ({\tilde{J}}_{i}) = J_{i}^{v_{A} (\tilde{B})} .

So valuation commutes with the branch-update construction as long as the symbolic basis remains invertible under the relevant specialization.

15 Why this is not yet a closed process theory

The projector update is algebraically clean, but the zero divisors prevent the set of all nonzero states from being a well-behaved monoidal state class.

15.1 Nonzero states are not tensor-closed

Take

ψ = (u, 0), ϕ = (u^{3}, 0) .

Both are nonzero, but over $A$

ψ \otimes_{A} ϕ = 0

because $u u^{3} = u^{4} = 0$ .

15.2 Unimodular preparation is not conditioning-closed

Restricting preparations to unimodular vectors repairs the elementary tensor-annihilation problem for simple tensors, but conditioning can leave that class. Consider the bipartite coefficient matrix

M = (\begin{matrix} 1 & 0 \\ 0 & u \end{matrix}) .

As a four-component vector it is unimodular because one entry is a unit. Applying Alice’s second standard effect leaves Bob in

(0, u),

which is nonzero but nonunimodular.

Therefore a satisfactory closed sequential theory still needs an explicit decision about admissible states, branch objects, quotients, ideals, or a richer process semantics. The symbolic predicate layer can describe when a branch exists, but it does not turn a nonunit branch amplitude into an invertible one.

16 Failure results and exact boundaries


Proposed identification	Result



“An LM is a modal effect.”	False as stated. Paper-B bras evaluate only to coordinate effects.
“Boolean valuation directly gives $A$ -amplitudes.”	False. Every Boolean-ring homomorphism into the local chain ring lands in ${0, 1}$ .
“The ordinary $2 \times 2$ CM algebra is the phase ring.”	False. The four-component identification is linear; the cyclic product is additional structure.
“Valuation naturality derives modal possibility.”	False. It derives concrete amplitudes. The zero/nonzero interpretation is a separate support contract.
“Nonzero support is ordinary relational semantics.”	False compositionally. XOR cancellation and zero divisors prevent support from being a semiring homomorphism.
“Existing LM semantics generates all 192 measurements.”	False. The full family is LM-encodable as coefficient data after adding the $A$ -structure, but not generated by the original complement-paired effect semantics.
“Symbolic formulas solve normalization.”	False. They can describe branch conditions but do not invert nonunits.
“All nonzero ring states form a monoidal state theory.”	False: $u \otimes_{A} u^{3} = 0$ .
“Unimodular preparations solve closure.”	False: conditioning can yield nonunimodular nonzero states.
“The bridge extends unchanged to arbitrary finite rings.”	False as stated. The clean $B \otimes_{𝔽_{2}} A$ enrichment requires an $𝔽_{2}$ -algebra such as a characteristic-two ring; other scalar systems require a modified control/Boolean-power construction.

17 Prior-art matrix

The novelty search translated each candidate theorem into conventional mathematics rather than searching only CM terminology.


Construction/result	Prior-art assessment



$2 \times 2$ matrices for the 16 binary truth functions	Known. Bricken’s 1997 notes explicitly discuss XOR as binary addition, AND as multiplication, all 16 binary logic matrices, truth-value vectors, and expressions of the form $⟨ x \| B \| y ⟩$ . Edwards, Stern, and matrix-logic traditions are older.
Truth vectors and matrix logical gates	Known. Mizraji’s vector logic represents classical logical connectives by matrices acting on Kronecker products of truth vectors.
Quantum-flavored logical observables	Known adjacent work. Eigenlogic treats logical observables in a genuine vector/Hilbert-space style distinct from Paper-B formula-valued LMs.
Formula/Lindenbaum algebra modulo logical equivalence	Standard algebraic logic.
Valuation commuting with matrix expressions	Standard homomorphism preservation and already proved in Paper B for LM pairing.
$B \otimes A$ enrichment and $A^{Ω}$ interpretation	Standard base-change / Boolean-power mathematics. The contribution is its application as the exact typed bridge between the two CM layers.
Boolean-to-local-ring idempotent obstruction	Elementary ring theory; not a novelty target.
Modal effects with possible iff nonzero	Established in modal quantum theory over finite fields, especially Schumacher–Westmoreland.
Finite-field/XOR quantum-like programming	Established adjacent work in James–Ortiz–Sabry.
Semiring-valued quantum-like process theories	Established broad area; Gogioso’s framework is a direct comparison point.
Possibilistic contextuality as support/global-section obstruction	Established by Abramsky–Brandenburger and follow-on sheaf-theoretic work.
States/effects and categorical measurement/update	Established broader categorical foundations, including effectus theory.
Exact symbolic-support theorem for the CM-derived chain-ring enrichment	No exact prior formulation located in this search. Best characterized as a potentially useful new synthesis theorem rather than a new base algebraic construction.
Negative theorem that original LM pairing does not generate the 192-basis family	Appears to be a useful internal comparison theorem; mathematically elementary once the types are separated.
$B^{- 1} P_{i} B$ update	Standard conjugated-projector/change-of-basis algebra; useful as the natural division-free update for the current modal model.

18 Adversarial interpretation

The project survives an adversarial reading, but in a narrower form than a claim of derivation.

18.1 What is routine

valuation naturality is homomorphism preservation;
matrix semantics for logic has substantial prior art;
semiring/ring-valued process models and modal nonzero semantics have prior art;
conjugated coordinate projectors are standard algebra.

18.2 What is genuinely informative in the synthesis

the idempotent obstruction proves that the strongest direct-valuation bridge is impossible;
the tensor-product scalar enrichment gives the correct universal replacement;
the support predicate gives an exact formula-level representation of concrete modal possibility;
the effect-family comparison identifies which sense of “LM measurement” does and does not extend to the 192 modal bases;
the update construction shows that nonunit amplitudes do not by themselves block a division-free branch map;
the zero-divisor closure counterexamples locate the remaining process-theoretic weakness precisely.

19 Computational verification

A fresh independent checker is included as

tests/lm_modal_bridge_checks.py.

It uses only the Python standard library. The exact machine-readable output is included as

tests/lm_modal_bridge_checks_output.json.

The expanded run verified:


Check	Count/result



Elements of $A = 𝔽_{2} [u] ∕ (u^{4})$	16
Units	8
Idempotents	exactly $0, 1$
$\| {GL}_{2} (A) \|$	24,576
Unordered reversible projective two-outcome bases	192
Projector idempotence checks	384
Projector orthogonality checks	384
Resolution-of-identity checks	192
Branch nonzero iff effect coefficient nonzero	98,304
Same-basis repeatability checks	98,304
Unit row-scaling invariance checks	24,576
Symbolic support fiber checks	262,144
Paper-B LM matrix products tested	256
Products remaining in restricted 16-LM family	112
Products leaving restricted 16-LM family	144
Nonzero-state tensor annihilation example	confirmed
Unimodular preparation to nonunimodular conditional example	confirmed

The 262,144 symbolic-support checks exhaust all

1 6^{4} = 65, 536

symbolic $A$ -valued scalars whose four coefficient formulas are Boolean functions of two variables, and all four valuations of those variables.

The package also preserves the original checker and output generated during the first pass, plus rerun logs showing that both the original and expanded scripts execute successfully in the current environment.

20 Paper implications

The bridge is strong enough to deserve a substantial theory section, but the present evidence does not support a standalone paper whose headline claim is that Paper-B LMs derive modal quantum measurement.

The best placement is a central section of the broader Boolean–modal synthesis paper. A strong narrative is:

formula LM \to Boolean-ring contraction \to valuation naturality \to idempotent obstruction \to A -enrichment \to symbolic-support theorem \to modal effects/bases \to extra support contract \to division-free branch update \to tensor/update closure obstruction .

This structure has three advantages:

1.: it answers the skeptical question of why the original logical pairing has anything to do with the later modal measurement rule;
2.: it clearly separates generic prior art from CM-specific typing and synthesis;
3.: it uses negative theorems as part of the contribution rather than forcing an overstated positive unification.

21 Strongest defensible theorem and final answer

The single best theorem to carry forward is the support-bridge statement

v (Supp A ({⟨ E, S ⟩}_{B \otimes A})) = 1 ⟺ {⟨ v_{A} (E), v_{A} (S) ⟩}_{A} \neq 0 .

Together with its existential form,

Supp A (⟨ E, S ⟩) satisfiable ⟺ \exists v : {⟨ v_{A} (E), v_{A} (S) ⟩}_{A} \neq 0 .

It should be stated beside the negative companion theorem

No direct Boolean-ring valuation B \to 𝔽_{2} [u] ∕ (u^{4}) can generate non-Boolean amplitudes.

The pair identifies the bridge almost exactly:

The formula-valued LM calculus and the later modal theory do more than merely coexist, but the modal theory is an enriched realization of the symbolic Boolean semantics, not a theorem forced by the original LM semantics alone. The correct bridge is scalar enrichment plus specialization, followed by an independently declared support interpretation and measurement-family choice.

A Reproducibility notes

Run the expanded checker from the root of this package with

python tests/lm_modal_bridge_checks.py

The output should match tests/lm_modal_bridge_checks_output.json modulo the environment string. The script contains no network calls and depends only on the Python standard library.

The prior adversarial-review archive is preserved under inputs/ and unpacked under prior_adversarial_review/. The package manifest records SHA-256 hashes for every included file.

B Search strategy

The prior-art search used conventional mathematical translations rather than CM-specific vocabulary. Queries included Boolean matrix logic, matrix logic and vector logic, formula/Lindenbaum algebra, matrices over semirings, Boolean powers, modal quantum theory, finite-field quantum computation, possibilistic contextuality, effectus theory, categorical quantum mechanics, and semiring-valued quantum-like theories. The machine-readable search ledger is included separately in research/SEARCH_LOG.csv.

References

[1] William Bricken. Notes on Matrix Techniques for Logic. March 1997. https://wbricken.com/pdfs/01bm/01math/03math-supporting/math-tangential/04matrix-tech.pdf.

[2] C. R. Edwards. The logic of Boolean matrices. The Computer Journal, 15(3):247–253, 1972. doi:10.1093/comjnl/15.3.247.

[3] August Stern. Matrix Logic: Theory and Applications. North-Holland, 1988. doi:10.1016/C2009-0-14445-8.

[4] Eduardo Mizraji. Vector logics: The matrix-vector representation of logical calculus. Fuzzy Sets and Systems, 50(2):179–185, 1992. doi:10.1016/0165-0114(92)90216-Q.

[5] Eduardo Mizraji. Vector logic: A natural algebraic representation of the fundamental logical gates. Journal of Logic and Computation, 18(1):97–121, 2008. doi:10.1093/logcom/exm057.

[6] Daizhan Cheng and Hongsheng Qi. A linear representation of dynamics of Boolean networks. IEEE Transactions on Automatic Control, 55(10):2251–2258, 2010. doi:10.1109/TAC.2010.2043294.

[7] Daizhan Cheng, Yin Zhao, and Xiangru Xu. Matrix approach to Boolean calculus. In Proceedings of the 50th IEEE CDC-ECC, pages 6950–6955, 2011. doi:10.1109/CDC.2011.6160289.

[8] Francois Dubois and Zeno Toffano. Eigenlogic: A quantum view for multiple-valued and fuzzy systems. arXiv:1607.03509, 2016.

[9] Benjamin Schumacher and Michael D. Westmoreland. Modal quantum theory. Foundations of Physics, 42:918–925, 2012. doi:10.1007/s10701-012-9650-z; arXiv:1010.2929.

[10] Roshan P. James, Gerardo Ortiz, and Amr Sabry. Quantum computing over finite fields: Reversible relational programming with exclusive disjunctions. arXiv:1101.3764, 2011.

[11] Samson Abramsky and Adam Brandenburger. The sheaf-theoretic structure of non-locality and contextuality. New Journal of Physics, 13(11):113036, 2011. doi:10.1088/1367-2630/13/11/113036; arXiv:1102.0264.

[12] Kenta Cho, Bart Jacobs, Bas Westerbaan, and Abraham Westerbaan. An introduction to effectus theory. arXiv:1512.05813, 2015.

[13] Stefano Gogioso. Fantastic quantum theories and where to find them. arXiv:1703.10576, 2017.

[14] Brian Theory. Operator-Level Boolean Computation with Correspondence Matrices. Unpublished manuscript supplied in the ChatGPT File Library, accessed 18 September 2026.

[15] Brian Theory. Pure Boolean Modal CM Addendum. Research manuscript/source file PURE_BOOLEAN_MODAL_CM_ADDENDUM.tex, accessed 18 September 2026.

Does the Symbolic LM Calculus Canonically Induce the Modal Measurement Theory? Adversarial bridge analysis between formula-valued Logical Matrices and the later chain-ring modal/effect framework