## → # and Its Interpretation as Condensation of Redundant StatesThe first reduction rule of the STC is calling, also known as idempotence. The rule is:
Calling: ## → #
In words: two adjacent marks condense into a single mark.
Scope: The rule applies to any substring ## anywhere in an expression. It does not matter what surrounds the two marks; if they appear side by side, they can be replaced by a single mark.
Examples:
### → ## → # (multiple marks condense stepwise).[##] → [#] (calling inside an enclosure).# ## → # # → # (spaces are irrelevant).Interpretation: Calling embodies the principle that repetition of the same distinction is idle. Drawing a boundary twice in the same place is no different from drawing it once. In logical terms, calling corresponds to the idempotence of conjunction: $A \land A = A$. In algebraic terms, it is the absorption law of a semilattice. In physical terms, it is the fusion of two identical quanta into one.
Calling is a length‑reducing rule: it shortens the expression by one mark. This guarantees that repeated application of calling will eventually terminate (there are only finitely many marks). Calling is also local: it does not require examining the global structure of the expression; it operates on a contiguous pair of marks.
In the Bruhat‑Tits tree, calling corresponds to coalescing two leaves at the same vertex. If two marks occupy the same position in the hierarchy, they are redundant and can be merged. This merging reduces the complexity of the pattern without changing its topological type.
[[A]] → A for Any Expression AThe second reduction rule is crossing, also known as involution. The rule is:
Crossing: [[A]] → A (for any expression A)
In words: an enclosure that contains only another enclosure cancels the outer boundary, leaving the inner expression.
Scope: The rule applies whenever an expression matches the pattern [[A]], where A is any (possibly empty) expression. The inner expression A can be arbitrarily complex—it may contain marks, enclosures, and juxtapositions. The only requirement is that the outer enclosure contains exactly one element, and that element is itself an enclosure.
Examples:
[[]] → blank (empty expression). Here A is empty.[[#]] → #. Here A = #.[[[#]]] → [#]. Here A = [#].[[# [#]]] → # [#]. Here A = # [#].[[[#] #]] → [#] #. Here A = [#] #.Interpretation: Crossing embodies the principle that to cross a boundary again is to uncross it. If you draw a boundary around a boundary, you return to the original state. In logical terms, crossing corresponds to double negation elimination: $\neg \neg A = A$. In topological terms, it is the cancellation of a boundary that encloses only another boundary—like removing a shell to reveal the core.
Crossing is also length‑reducing: it removes two brackets (the outer pair). Since brackets come in pairs, the total length of the expression decreases. Like calling, crossing is local: it operates on a specific pattern of brackets, independent of the surrounding context.
In the Bruhat‑Tits tree, crossing corresponds to removing a redundant level of nesting. If a node in the tree has only one child, and that child is also a node (not a leaf), then the parent node can be eliminated, promoting the child to the parent’s position. This simplifies the tree without changing the hierarchical relationships among the leaves.
The STC adopts the crossing rule in its authentic form, exactly as stated by Spencer‑Brown. This commitment has several important consequences.
[[#]] Is not Stable; it Reduces to #.Many early drafts of the STC sought to keep [[#]] as a stable reference point—a syntactic “point at infinity” for projective cross‑ratios. However, under the authentic crossing rule, [[#]] reduces to #. This forces us to use the mark # itself as the projective reference. This is not a drawback; it is a simplification. The mark is the most primitive object in the calculus, so it is natural for it to play the role of infinity.
[[]] Reduces to a Blank Space (the Empty expression).Applying crossing with A empty yields [[]] → blank. The empty expression is the void—the absence of any token. This result reinforces that the void is not a token; it is the result of complete cancellation.
Some drafts introduced a rule like [ ] → _ (void token) or [ ] → (deletion). These are unnecessary. The empty enclosure [ ] is already a valid expression; it does not need to be reduced further. It is irreducible because it does not match ## or [[A]]. It represents the concept of an empty container, which is distinct from the void (blank). The void is the absence of any expression; [ ] is an expression (an empty enclosure).
Because crossing is [[A]] → A for any A, the pattern [[#] [#] [#]] is irreducible: the outer enclosure contains three items, not a single enclosure. This pattern is shared by the Z boson and the Higgs boson. The STC does not alter the crossing rule to distinguish them; that would require a clear and compelling reason, which has not been established. The degeneracy is acknowledged as an open issue (see Chapter 13).
Calling matches ##; crossing matches [[A]]. These patterns cannot overlap: ## cannot appear inside [[A]] because [[A]] contains brackets, not marks. Therefore, there is no ambiguity about which rule to apply in any given situation. This non‑overlapping property is key to proving confluence.
A rewrite system is confluent (has the Church‑Rosser property) if, whenever an expression can be reduced in two different ways, the results can be further reduced to a common normal form. Confluence guarantees that the final result is independent of the order of reduction—a crucial property for a physical theory, where observables should not depend on the sequence of measurements.
The STC’s reduction rules are confluent. The proof rests on two observations:
Termination proof: Define the weight of an expression as the total number of marks plus the number of bracket pairs. Calling reduces the weight by 1; crossing reduces the weight by 1. Since weight is a positive integer, reduction cannot continue indefinitely.
Uniqueness of normal forms: Because the system is confluent and terminating, every expression reduces to a unique normal form. This normal form is the canonical representative of the expression’s equivalence class. Two expressions are equivalent if they reduce to the same normal form.
Example reduction sequence: Consider the expression [[#]]##.
[[#]]: #.##.#.The normal form is #. Any other reduction order yields the same result.
Significance for physics: Confluence ensures that the STC is deterministic. Given an initial pattern (a particle configuration), the rules produce a unique outcome (a final state). This determinism is not at odds with quantum probability; rather, the probabilities arise from the coarse‑graining of the syntactic dynamics when projected onto an Archimedean measurement basis (see Chapter 1). At the syntactic level, the evolution is deterministic and reversible (each reduction can be reversed by an expansion, though the rules themselves are not invertible).
Thus, the STC provides a syntactic foundation for unitary quantum evolution. The reduction rules are the dynamics, and confluence guarantees unitarity (in the sense of uniqueness of outcome). This is a radical departure from conventional quantum mechanics, where unitarity is imposed as a separate axiom.
Chapter 6 has presented the two reduction rules of the STC: calling (## → #) and crossing ([[A]] → A). These rules are taken directly from Spencer‑Brown’s Laws of Form and are applied in their authentic form. The consequences of this authenticity include the reduction of [[#]] to # and the acceptance of the Z‑boson/Higgs degeneracy as an unresolved issue.
The rules are non‑overlapping and length‑reducing, ensuring confluence and termination. Every expression reduces to a unique normal form, providing a deterministic dynamics at the syntactic level. This sets the stage for the next chapter, where we will examine normal forms in detail and prove the irreducibility of the particle patterns.