The Modal Structure

What this text is

The Forcing Argument shows that each step of the derivation is forced and gives proof sketches. This text develops the central mathematical result in full: the adjoint quadruple ${\Pi }^{\to }⊣\square ⊣◊⊣{\nabla }^{\leftarrow }$, its concrete models, the comonadic and monadic dynamics it generates, and the internal recursion theorem showing that the structure reproduces itself.

This is the Relational Infinity-Topos Modality (RITM) — the mathematical object the derivation produces.

---

Part I: abstract definition

The adjoint quadruple

Definition 1.1 (RITM). A Relational Infinity-Topos Modality on a locally presentable category $\mathcal{E}$ is a quadruple of adjoint idempotent endofunctors

$${\Pi }^{\to }⊣\square ⊣◊⊣{\nabla }^{\leftarrow }$$

satisfying five axioms:

1. ${\Pi }^{\to }$ preserves finite limits.
2. ${\nabla }^{\leftarrow }$ preserves finite colimits.
3. $\square ◊\cong ◊\square$ (the two composites commute).
4. Both composites $\square ◊$ and $◊\square$ are idempotent.
5. The outer adjunction ${\Pi }^{\to }⊣{\nabla }^{\leftarrow }$ is cohesive: the unit is an effective epimorphism and the counit is an effective monomorphism.

In canonical terms:

• $\square$ is Nucleus — consolidation under closure.
• $◊$ is the co-Nucleus — release from closure.
• $\square ◊$ is the comonad $C$ — reflexive propagation (Nucleus applied to release).
• $◊\square$ is the monad $M$ — directed transformation (Flow at the categorical level).
• ${\Pi }^{\to }$ collects connected components — the forward Flow projection.
• ${\nabla }^{\leftarrow }$ disperses into discrete parts — the backward inclusion.

The comonad and monad

Proposition 1.2. From the middle adjunction $\square ⊣◊$:

• $C:=\square ◊$ is a comonad with counit $\epsilon :C\Rightarrow \mathrm{Id}$ and comultiplication $\delta :=\square \eta ◊:C\Rightarrow CC$.
• $M:=◊\square$ is a monad with unit $\eta :\mathrm{Id}\Rightarrow M$ and multiplication $\mu :=◊\epsilon \square :MM\Rightarrow M$.

Proof. The comonad and monad laws follow directly from the triangle identities of $\square ⊣◊$. $\square$

Coalgebras and algebras

Definition 1.3 ($C$-coalgebra). A pair $(Y,\gamma )$ with $\gamma :Y\to CY$ satisfying: ${\epsilon }_Y\circ \gamma ={\mathrm{id}}_Y,{\delta }_Y\circ \gamma =C\gamma \circ \gamma .$

Definition 1.4 ($M$-algebra). A pair $(X,\alpha )$ with $\alpha :MX\to X$ satisfying: $\alpha \circ {\eta }_X={\mathrm{id}}_X,\alpha \circ {\mu }_X=\alpha \circ M\alpha .$

Theorem 1.5 (Duality). For each $C$-coalgebra $(Y,\gamma )$, define $\alpha :={\epsilon }_Y\circ \square \gamma :MY\to Y$. Then $(Y,\alpha )$ is an $M$-algebra. Conversely, from an $M$-algebra $(X,\alpha )$, define $\gamma :=\square {\eta }_X:X\to CX$. These constructions are inverse up to natural equivalence.

Proof. Check the algebra axioms using the triangle identities: $\alpha \circ {\eta }_Y={\epsilon }_Y\circ \square \gamma \circ {\eta }_Y={\epsilon }_Y\circ \square (\gamma \circ {\eta }_Y)={\mathrm{id}}_Y.$ Naturality of $\eta ,\epsilon$ ensures the mutual inverses. $\square$

In canonical terms: $C$-coalgebras are geometric objects (stable under the comonad — cf. coalgebras); $M$-algebras are logical objects (closed under the monad). Their duality is the relational version of field–particle correspondence.

---

Part II: the presheaf cell model

Construction

The simplest nontrivial RITM lives in the presheaf category $\mathrm{PSh}(\{0\to 1\})$: functors from the category with two objects and one non-identity morphism to $\mathsf{Set}$.

Objects. A presheaf $X$ consists of sets $X_0,X_1$ and a map $u^{\ast }:X_1\to X_0$.

Nuclei. The category has two commuting Lawvere-Tierney topologies:

• $j_f$ (forward): the closure that stabilizes forward maps.
• $j_b$ (backward): the closure that stabilizes backward maps.

These produce sheafification functors $a_f,a_b$ and inclusion functors $i_f,i_b$.

Explicit formulas. For a presheaf $X=(X_0,X_1,u^{\ast })$: $(a_{f}X{)}_0=\mathrm{coeq}(X_1\rightrightarrows X_0),(a_{f}X{)}_1=X_1.$ The forward sheafification identifies elements of $X_0$ that are connected by elements of $X_1$.

The adjoint chain. Set ${\Pi }^{\to }:=a_f$, $\square :=i_f$, $◊:=i_b$, ${\nabla }^{\leftarrow }:={\Pi }_b$ (the right adjoint of $i_b$). Then:

Theorem 2.1. In $\mathrm{PSh}(\{0\to 1\})$, the chain ${\Pi }^{\to }⊣\square ⊣◊⊣{\nabla }^{\leftarrow }$ satisfies all five RITM axioms.

Proof sketch. The adjunctions follow from the general theory of essential geometric morphisms associated to Lawvere-Tierney topologies. Finite-limit preservation of ${\Pi }^{\to }=a_f$ holds because $a_f$ is computed by a coequalizer that commutes with finite products in $\mathsf{Set}$. Cohesion of the outer pair follows from the fact that $a_f$ surjects on connected components and ${\Pi }_b$ injects discrete structures. Commutation of the composites follows from $j_f{j}_b=j_b{j}_f$. $\square$

Significance

This is not merely an example. The presheaf cell is the minimal nontrivial realization of the RITM: it has exactly the directed structure of one arrow, and the modality captures exactly the distinction between forward-connected and backward-connected perspectives. Every RITM admits a comparison functor to this model (by restricting to the directed interval).

---

Part III: comonadic dynamics

The CoKleisli category

Definition 3.1. The CoKleisli category $\mathrm{CoKl}(C)$ has the same objects as $\mathcal{E}$ and morphisms $X⇝Y$ are maps $X\to CY$ in $\mathcal{E}$. Composition: $g\diamond f:={\epsilon }_{CZ}\circ Cg\circ f.$

This category represents the unfolded dynamics of reflexion: objects act through their reflected images.

Stabilization

Definition 3.2. A morphism $r:X\to CY$ stabilizes if $r\diamond r=r$. Equivalently, $Cr=r$ — the comonad has absorbed the morphism.

Theorem 3.3 (Coalgebra–stabilization equivalence). Every $C$-coalgebra $(Y,\gamma )$ produces a stabilizing CoKleisli endomorphism $\gamma :Y⇝Y$. Conversely, every counit-split stabilizing endomorphism produces a coalgebra.

Proof. Forward: $\gamma \diamond \gamma ={\epsilon }_{CY}\circ C\gamma \circ \gamma ={\epsilon }_{CY}\circ {\delta }_Y\circ \gamma =\gamma$ (using the coalgebra condition and comonad laws). Converse: if $s:Y\to CY$ with ${\epsilon }_Y\circ s=\mathrm{id}$ and $s\diamond s=s$, expanding gives ${\delta }_Y\circ s=Cs\circ s$ — the coalgebra condition. $\square$

In canonical terms: stabilized morphisms are States — recognitions fixed under Flow. The CoKleisli category is the arena of Evolution.

The defect

Definition 3.4 (Defect). For $r:X\to CY$, the defect is $\rho (r):=Cr-r$ (the residual of reflexion). The defect measures deviation from stabilization.

Proposition 3.5 (Monotone convergence). Under iteration $r^{(n+1)}:={\epsilon }_{CY}\circ C{r}^{(n)}\circ r$, the defect decreases: $\Vert \rho (r^{(n+1)})\Vert \le \Vert \rho (r^{(n)})\Vert$, with equality iff $r^{(n)}$ already stabilizes.

Proof. Functoriality of $C$ and naturality of $\delta$ ensure that postcomposition by ${\epsilon }_{CY}\circ C(-)$ preserves the equalizing condition. When $r$ stabilizes, $Cr=r$ so $\rho (r)=0$. $\square$

---

Part IV: geometric realization

Coalgebras as spaces

Definition 4.1 (Reflexive spaces). The category ${\mathsf{Spaces}}_R$ has $C$-coalgebras as objects and coalgebra morphisms (maps $h$ with $Ch\circ \gamma ={\gamma }^{\prime }\circ h$) as morphisms.

Proposition 4.2. The subcategory of stabilized objects in $\mathrm{CoKl}(C)$ is equivalent to ${\mathsf{Spaces}}_R$.

Proof. Direct from Theorem 3.3. $\square$

The reflexive site and sheaf topos

Definition 4.3 (Reflexive site). The site $\mathsf{R}$ has coalgebras as objects and coverings $\{h_i:Y_i\to Y\}$ such that the underlying maps jointly surject under ${\epsilon }_Y$.

Theorem 4.4. The sheaf topos $\mathsf{Shv}(\mathsf{R})$ admits an adjoint chain ${\Pi }_R^{\to }⊣{\square }_R⊣{◊}_R⊣{\nabla }_R^{\leftarrow }$ extending the original modality pointwise, with ${\square }_R{◊}_R=C_R$ and ${\nabla }_R^{\leftarrow }{\Pi }_R^{\to }=R$.

Proof sketch. The inclusion of stabilized coalgebras defines a dense subsite. Sheafification preserves the cohesive chain by pointwise extension. The unit–counit identities hold by naturality. $\square$

In canonical terms: Profiles are objects of this sheaf topos. The topos structure ensures they glue coherently — cf. sheaf semantics.

---

Part V: conservation and physics

The categorical Noether theorem

Definition 5.1 (Symmetry). A symmetry of the comonad $C$ is a natural transformation $\theta :FC\Rightarrow CF$ satisfying: $\epsilon \circ \theta =F\epsilon ,\delta \circ \theta =C\theta \circ {\theta }_C\circ F\delta .$

Theorem 5.2 (Noether). If $\theta$ is a symmetry of $C$ and $r$ is stabilized ($Cr=r$), then $\hat{F}(r):={\theta }_Y\circ Fr$ is also stabilized.

Proof. See The Forcing Argument, Theorem 17.4. $\square$

Reflexive energy and entropy

Definition 5.3 (Defect energy). For $r:X\to CY$, define: $S[r]:=\frac{1}{2}⟨\rho (r),\rho (r)⟩$ where $\rho (r)=Cr-r$ is the defect. The functional $S$ is minimized exactly when $r$ stabilizes.

Proposition 5.4 (Variational principle). Stabilization $Cr=r$ is equivalent to $\delta S[r]/\delta r=0$.

Proof. Variation of $S$ gives $\delta S=⟨\rho (r),C\delta r-\delta r⟩$. Stationarity requires $\rho (r)=0$. $\square$

Definition 5.5 (Reflexive entropy). $H(r):=\mathrm{Tr}(\rho (r{)}^{†}\rho (r))$.

Proposition 5.6 (Monotonicity). Under comonadic iteration, $H(r^{(n+1)})\le H(r^{(n)})$, with equality iff $r^{(n)}$ stabilizes.

In canonical terms: Evolution drives entropy down. Measurement (nucleus application) extracts the stabilized part. The interplay is governed by Residuation.

---

Part VI: internal recursion

The recursion theorem

Theorem 6.1 (Internal RITM). Every RITM canonically induces two internal sub-RITMs:

• $\mathrm{RD}$: the category of $\square$-stable endofunctors (relational dynamics).
• $\mathrm{RT}$: the category of $◊$-stable endofunctors (relational topology).

These form a biadjunction $\mathrm{RD}⊣\mathrm{RT}$ that reproduces the RITM axioms internally.

Proof sketch. The $\square$-stable endofunctors inherit the adjoint chain from the ambient category (by restriction). The $◊$-stable endofunctors do the same dually. The commutation axiom $\square ◊\cong ◊\square$ ensures compatibility between the two restrictions. The biadjunction follows from the induced comparison functors. $\square$

Self-containment

Theorem 6.2 (Grand closure). The total system $({\mathsf{R}}_{\ast },C,M,{\Pi }^{\to }⊣\square ⊣◊⊣{\nabla }^{\leftarrow })$ is closed under its own reflexion: ${\mathsf{R}}_{\ast \ast }\simeq {\mathsf{R}}_{\ast }.$

Proof. The internal adjoint chain ${\Pi }_{\ast \ast }^{\to }⊣{\square }_{\ast \ast }⊣{◊}_{\ast \ast }⊣{\nabla }_{\ast \ast }^{\leftarrow }$ is obtained by pointwise Kan extension along the Yoneda embedding $y:{\mathsf{R}}_{\ast }\hookrightarrow {\mathsf{R}}_{\ast \ast }$. Since ${\mathsf{R}}_{\ast }$ already satisfies the modal equations and $y$ is dense and fully faithful, the induced sheafification produces an equivalent category. The composites satisfy ${\square }_{\ast \ast }{◊}_{\ast \ast }\simeq C$ and ${\nabla }_{\ast \ast }^{\leftarrow }{\Pi }_{\ast \ast }^{\to }\simeq R$, so the hierarchy stabilizes after one iteration. $\square$

In canonical terms: Profiles reconstruct the tower. The tower produces Profiles. This is the fixed point — grand closure.

---

Correspondence to established mathematics

Relational structure	Standard mathematics
Adjoint quadruple ${\Pi }^{\to }⊣\square ⊣◊⊣{\nabla }^{\leftarrow }$	Cohesive modalities (Lawvere, Schreiber)
Comonad $C=\square ◊$	Jet comonad in SDG; flat modality
Monad $M=◊\square$	Shape modality
CoKleisli category	Category of directed motions
$C$-coalgebras	Geometric objects / spaces
$M$-algebras	Logical objects / propositions
Reflexive site	Cohesive site
Sheaf topos $\mathsf{Shv}(\mathsf{R})$	Cohesive $\infty$-topos (Schreiber)
Noether theorem (5.2)	Categorical Noether (no metric required)
Defect energy $S[r]$	Action functional
Self-containment ${\mathsf{R}}_{\ast \ast }\simeq {\mathsf{R}}_{\ast }$	Fixed point of the modality tower

What distinguishes the relational version: none of this structure is adopted or posited. The adjoint quadruple, the comonad, the sheaf topos, and the self-containment theorem are all derived from the minimal data of an involution on a set — the formal residue of the impossibility of nothing.