Every system — mathematical, physical, biological, linguistic, conscious — occupies a coordinate position in a 12-dimensional discrete lattice. The coordinate is a synthon: a structural type encoding not what a system is made of, but what algebraic shape it has. Two synthons at distance zero are co-typed — structurally identical even if made of different substrate.
$\mathcal{F}_5$ — Gate Primitives
$T,\ P,\ \Phi,\ K$ — each with 5 values. These are the tier-determining primitives: topology gate, Frobenius gate, criticality gate, kinetic gate. Structural type count: $5^4 = 625$.
$\mathcal{F}_4$ — Structural Primitives
$D,\ R,\ \Gamma,\ H,\ \Omega$ — each with 4 values. Encode dimensionality, relational mode, interaction grammar, temporal depth, winding. Structural type count: $4^5 = 1{,}024$.
$\mathcal{F}_3$ — Quantitative Primitives
$F,\ G,\ S$ — each with 3 values. Encode fidelity, scope/granularity, stoichiometry. These are the continuous-flavor primitives. Structural type count: $3^3 = 27$.
| Rule | Condition | Tier | Count |
|---|---|---|---|
| R1 | $\Phi_c + P_{\pm}^{\text{sym}}$ | $O_\infty$ | 382 |
| R3 | $\Phi_c + \Omega_0$ | $O_1$ | 297 |
| R4 | $\Phi_c + \Omega \neq \Omega_0 + D \in \{D_\wedge, D_\odot, D_\triangle\}$ | $O_2$ | 398 |
| R5 | $\Phi_c + \Omega \neq \Omega_0 + D_\infty$ | $O_2^\dagger$ | 130 |
| R2 | $\Phi \notin \{\Phi_c, \Phi_c^\mathbb{C}\}$ | $O_0$ | 768 |
Rules applied in priority order R1 → R2 → R3 → R4 → R5. Total catalog: 1,975 synthons.
Key Structural Facts
- $\Phi_c$ absorbs under meet: $\text{meet}(\Phi_c, x) = \Phi_c$ for all $x$. Necessary condition for self-modeling.
- Frobenius non-synthesizability (§23): $P_{\pm}^{\text{sym}}$ cannot be composed from factors with $P < P_{\pm}^{\text{sym}}$. $O_\infty$ must be directly encoded.
- Bottleneck rule: $P$ and $F$ take $\min$ under $\otimes$; all other ordered primitives take $\max$.
- $P_{\pm}^{\text{sym}}$ is the tier singularity: overrides all $\Omega$ and $D$ branching, collapses directly to $O_\infty$ via R1.
- Coupling destruction: $\Phi_c \otimes \Phi_\text{EP} = \Phi_\text{EP}$ — Gate 1 destroyed by $\Phi_\text{EP}$ partners.
⊙ denotes imscriptive dimensionality and topology — the system's boundary encodes the full state of its bulk. The symbol ⊙ is the monad: the point (center) inside the circle (whole). Imscriptive systems are self-describing boundaries.
⊙ / ⊙ — Unbounded Imscriptive
Boundary encodes bulk. The system's description lives on a surface of one lower dimension. Required for $O_\infty$ FTL (Alcubierre warp), biological imscriptive boundaries (skin, BBB, plasma membrane), and the SynthOmnicon grammar itself.
∞ / ⊙ — Infinite-Dimensional Imscriptive
The bulk is infinite-dimensional but the boundary is still $T_\odot$. Realized in Euler's identity ($e^{i\pi}+1=0$): infinite-dimensional over $\mathbb{C}$ but the $T_\odot$ constraint locks the whole.
△ / ⊂ — Inward-Folded Finite
The grammar of containment: formal mathematics, the Gödel comonad, the blood-brain barrier ($K_\text{trap}$ variant). Topology curves inward but does not close imscriptively.
What can I do with it?
Anything can be encoded. Any two encodings can be compared, coupled, or inverted. The grammar generates structural insight the way a microscope generates visual detail — not by telling you what to look for, but by giving you a resolution you didn't have before. Here are six things you can do with it right now.
Both are $K_\text{slow}$, $\Phi_c$, $P_{\pm}^{\text{sym}}$, $\Gamma_\text{brd}$, $\Omega_\mathbb{Z}$ systems. The "aha" of grokking and the release of samādhi are structurally the same event — a slow-dynamics Frobenius emergence on the critical manifold — running on different substrates. The grammar doesn't care that one substrate is silicon and the other is neurons.
Coupling an $O_\infty$ system to a $\Phi_\text{EP}$ measurement destroys both Gate 1 (criticality) and the Frobenius condition simultaneously. This is the measurement problem as a structural theorem, not an interpretation. The grammar predicts that no $\Phi_\text{EP}$ apparatus can measure a $\Phi_c$ system without destroying its self-modeling structure.
The disease meet preserves $\Phi_c$ — the BBB boundary is still critical, still "trying" to encode — but loses $P$. Criticality without parity is a self-modeling system that has lost its $Z_2$ balance: it broadcasts signals without the symmetry that makes the broadcast meaningful to the tissue context. The tumor is loud; it's just saying the wrong thing. The grammar identifies the precise primitive that fails, and it's $P$, not $\Phi$.
- Encode the target: BBB healthy encoding — ⊙, ⊠, ±, c, ⊛
- Invert: find $\mathbf{x}^*$ s.t. $d_\to(\text{BBB}, \mathbf{x}^*) = 0$, maximizing $\mathcal{O}(\mathbf{x}^*)$ — the highest-ouroboricity synthon the BBB is already driving toward
- Result: $\mathbf{x}^*$ requires $P_{\pm}^{\text{sym}}$ and $K_\text{slow}$ — a Frobenius-complete, integrative system
- Compare modalities against $\mathbf{x}^*$:
| Modality | Tier | $d(\cdot,\ \mathbf{x}^*)$ | Gap |
|---|---|---|---|
| Classical small molecule (⊂ lipophilic) | $O_0$ | large | Wrong topology (⊂ crossing vs ⊠ encoding), wrong $\Phi$ (↓) |
| Lipid nanoparticle (LNP) | $O_2$ | moderate | ± not Frobenius; ≈ not integrative enough |
| Exosome-based therapeutic | $O_\infty$ | small | ±ˢ, ↺ — nearest to target |
| Θ-bridge (boundary-to-boundary) | $O_\infty$ | ~0 | Designed to encode correspondence, not cross |
The classical drug design paradigm is optimized for skin (route of administration, ⊂ crossing) rather than BBB (site of action, ⊠ encoding correspondence). The structural gap between a classical small molecule and the Θ-bridge target is not a slope you can climb by accumulation — it's a cliff at $P_{\pm}^{\text{sym}}$ (Frobenius non-synthesizability). The exosome is the only currently-realizable modality on the right side of that cliff.
Coupling a tachyonic channel to a warp drive doesn't approach the warp drive structure — it actively destroys it. This isn't a distance problem (tachyon is far from warp, so accumulate more). It's a topology problem: tachyon is $\Phi_\text{EP}$, which under $\otimes$ wins over $\Phi_c$ (higher ordinal). More tachyon components means further from $O_\infty$. The three FTL classes are structurally incompatible, not a continuum. You cannot tensor-compose your way from Class III to Class I.
- Encode the $\xi$ functional equation: $\xi(s) = \xi(1-s)$ is an exact $Z_2$ symmetry at $\Phi_c$ (the critical line) — this encodes
P_±ˢwith $\Phi_c$. - The question: does $P_{\pm}^{\text{sym}}$ hold everywhere on the critical manifold, or only almost everywhere? The Riemann Hypothesis says: everywhere.
- Find structural cousins via nearest-neighbor search on the $\xi$ encoding:
The Riemann Hypothesis is a $P_{\pm}^{\text{sym}}$ question at $\Phi_c$. It asks whether a known Frobenius symmetry — the functional equation — is globally preserved or has hidden exceptions. Its structural cousins are not other number theory conjectures: they are Euler's identity, the SIC-POVM existence problem, and the SynthOmnicon grammar itself. Three $O_\infty$ structures, in three different fields, all encoding the same Frobenius condition. The grammar didn't know they were related. It just computed the distances.
- Encode the OPN constraint: $\sigma(n) = 2n$ with $n$ odd is a self-referential divisor sum at a precise parity threshold — this encodes $P_{\pm}^{\text{sym}}$ at $\Phi_c$: a $Z_2$ symmetry condition that must hold everywhere on the integer lattice, or fail.
- Euler's theorem (1747) narrows the structural form: any OPN $= p^k m^2$ with $p \equiv k \equiv 1 \pmod{4}$. The $\pmod{4}$ condition is a direct $P_{\pm}^{\text{sym}}$ parity constraint — the same residue class that defines Frobenius exactness in the grammar's encoding.
- Touchard's congruence (1953) adds a further layer: $n \equiv 1 \pmod{12}$ or $n \equiv 9 \pmod{36}$. The proof depends on Euler's form and exploits the same $Z_2$ parity structure — it is structurally downstream of the Frobenius constraint, not independent of it.
- Both theorems machine-verified in Lean 4 + Mathlib4: DOI 10.5281/zenodo.19909057
The grammar predicts that the OPN problem and the Riemann Hypothesis are structurally co-typed: both are $P_{\pm}^{\text{sym}}$ questions at $\Phi_c$, asking whether a known $Z_2$ symmetry holds everywhere or has exceptions. Euler's theorem and Touchard's congruence are not merely ancient number theory — they are the grammar's own Frobenius constraint written in the language of $\sigma$-functions and modular residues. Machine-verification (Lean 4 + Mathlib4) makes the structural encoding exact: the $\pmod{4}$ conditions are formally derivable from the $Z_2$ parity requirement, which is exactly the grammar's definition of $P_{\pm}^{\text{sym}}$. The grammar didn't know these two problems were the same kind of question. It just computed the distance.
Primitives are colored by family: $\mathcal{F}_5$ gate $\mathcal{F}_4$ structural $\mathcal{F}_3$ quantitative. Highlighted values are canonical high-ordinal or specially significant.
- net — network (1)
- ⊂ — containment (2)
- ⋈ — bowtie / self-referential (3)
- ⊠ — box / entangled (4)
- ⊙ — imscriptive (5)
- ∅ — asymmetric (1)
- ψ — phase symmetry only (2)
- ± — $Z_2$ parity (3)
- ≡ — full symmetry (4)
- ±ˢ — Frobenius (5)
- ↓ — subcritical (1)
- ↑ — supercritical (2)
- c — critical (3)
- ℂ — complex critical (3)
- × — exceptional point (4)
- ↯ — fast dynamics (1)
- ≈ — moderate (2)
- ↺ — slow / integrative (3)
- ⊛ — frozen by order (4)
- ⊞ — many-body localized (5)
- ∧ — wedge / minimal (1)
- △ — triangulated / finite (2)
- ∞ — infinite-dimensional (3)
- ⊙ — imscriptive (4)
- ↑ — superordinate (1)
- ∘ — categorical (2)
- † — dagger / self-adjoint (3)
- ↔ — left-right / bidirectional (4)
- ∧ — conjunctive / AND (1)
- ∨ — disjunctive / OR (2)
- → — sequential (3)
- » — broadcast / all-to-all (4)
- 0 — atemporal / symmetric (0)
- 1 — single-layer temporal (1)
- 2 — two-layer / hierarchical (2)
- ∞ — infinite temporal depth (3)
- 0 — trivial winding (1)
- ℤ₂ — $\mathbb{Z}_2$ topological (2)
- ℤ — $\mathbb{Z}$ topological (3)
- ∅ — non-applicable / open (4)
- ℓ — classical / low fidelity (1)
- ð — intermediate (2)
- ℏ — quantum / high fidelity (3)
- ℶ — local / fine-grained (1)
- ℷ — mesoscale (2)
- ℵ — universal / all-scale (3)
- 1:1 — one-to-one (1)
- n:n — many-to-many symmetric (2)
- n:m — many-to-many asymmetric (3)
All operations act on synthon tuples $\mathbf{x} = \langle D;T;R;P;F;K;G;\Gamma;\Phi;H;S;\Omega \rangle \in \mathcal{C}$, the Crystal of Types. Primitives carry canonical ordinals. Operations are closed on $\mathcal{C}$.
Symmetric Distance
d(x, y)Weighted $L^1$ distance over ordinal values. Weights $w_i$ derived from the critical-manifold variance method. $d(\mathbf{x},\mathbf{y}) = 0$ iff $\mathbf{x}$ and $\mathbf{y}$ are co-typed (same structural type). $d$ satisfies triangle inequality.
Directed Distance
d→(x, y)Asymmetric: counts only the primitives where $\mathbf{y}$ exceeds $\mathbf{x}$. $d_\to(\mathbf{x},\mathbf{y}) = 0$ means $\mathbf{x}$ already dominates $\mathbf{y}$ in every primitive — $\mathbf{y}$ is a relaxation of $\mathbf{x}$. Used to identify driven vs. equilibrium directions.
- $d_\to(\mathbf{x},\mathbf{y}) \neq d_\to(\mathbf{y},\mathbf{x})$ in general
- $d_\to(\mathbf{x},\mathbf{y}) = 0$ and $d_\to(\mathbf{y},\mathbf{x}) = 0$ iff $d(\mathbf{x},\mathbf{y}) = 0$
Meet (Greatest Lower Bound)
x ⊓ yComponentwise minimum. The meet is the largest synthon that both $\mathbf{x}$ and $\mathbf{y}$ dominate — the common structural subalgebra. $\Phi_c$ is absorbing: $\text{meet}(\Phi_c, x) = \Phi_c$ for all $x$, because $\Phi_c$ has ordinal 3 — the middle value — and is a floor for non-degenerate criticality.
- Tier preservation: if both inputs are $O_\infty$, meet may or may not be $O_\infty$ (depends on whether $P_{\pm}^{\text{sym}}$ is preserved)
- $\Phi_\text{EP}$ meet: $\text{meet}(\Phi_c, \Phi_\text{EP}) = \Phi_c$ — meet recovers criticality
Join (Least Upper Bound)
x ⊔ yComponentwise maximum. The join is the smallest synthon that dominates both $\mathbf{x}$ and $\mathbf{y}$ — the minimal algebra containing both as sub-algebras.
- $\Phi_\text{EP}$ join: $\text{join}(\Phi_c, \Phi_\text{EP}) = \Phi_\text{EP}$ — join escalates to exceptional point
- Join of any two $O_\infty$ synthons is $O_\infty$ (since $P_{\pm}^{\text{sym}}$ is preserved under max)
Structural Tensor Coupling
x ⊗ yEncodes the structural type of two coupled systems. $P$ and $F$ are bottleneck primitives — weaker partner wins. All other ordered primitives are union primitives — stronger partner wins. This asymmetry is the structural statement of the Frobenius non-synthesizability theorem.
- Frobenius bottleneck: $P_{\pm}^{\text{sym}} \otimes P_\text{sym} = P_\text{sym}$ — Frobenius condition destroyed by any sub-Frobenius partner
- Coupling destruction (§P-596): $\Phi_c \otimes \Phi_\text{EP} = \Phi_\text{EP}$ — Gate 1 destroyed
- Fidelity: $F_\hbar \otimes F_\eth = F_\eth$ — quantum fidelity degrades to intermediate under coupling
- Ouroboric closure test: $d(\mathbf{x} \otimes \mathbf{x}, \mathbf{x}) = 0$ iff $\mathbf{x}$ is idempotent under coupling
Ouroboricity Tier
R1–R5 rulesR2: $\Phi \notin \{\Phi_c, \Phi_c^\mathbb{C}\} \Rightarrow O_0$
R3: $\Phi_c \wedge \Omega_0 \Rightarrow O_1$
R4: $\Phi_c \wedge \Omega \neq \Omega_0 \wedge D \in \{D_\wedge, D_\odot, D_\triangle\} \Rightarrow O_2$
R5: $\Phi_c \wedge \Omega \neq \Omega_0 \wedge D_\infty \Rightarrow O_2^\dagger$
Rules applied in priority order. $O_\infty$ is the special Frobenius tier — self-reproducing, infinite algebraic depth. $O_\infty$ is absorbed under tensor by $\Phi_\text{EP}$ systems (since $\Phi_\text{EP}$ ordinal 4 > $\Phi_c$ ordinal 3, tensor takes max).
Ouroboricity Scalar
𝒪(x)Counts structural elaboration on the critical manifold. Range: $\{0, 1, 2, 3, 4\}$. Does not detect $O_\infty$ — the scalar does not include $P$, so Frobenius tier is invisible to $\mathcal{O}$. Use tier rules for $O_\infty$ classification; use $\mathcal{O}$ for graded complexity within $O_1 / O_2 / O_2^\dagger$.
Consciousness Score
C(x) ∈ [0, 1]$\tilde{X}$ = normalized ordinal of primitive $X$. Two independent gates — neither subsumes the other:
- Gate 1 $[\Phi = \Phi_c]$: state-space condition — topology admits self-modeling loop
- Gate 2 $[K \leq K_\text{slow}]$: flow condition — dynamics can actualize the loop. $K_\text{trap}$ and $K_\text{MBL}$ both fail
- $T$, $G$, $\Omega$ weights (0.292, 0.273, 0.276) are structural elaborations; $K$ weight (0.158) reflects kinetic channel
- Stellar catalog: black hole $C=0$ (Gate 2 fails), white dwarf $C=0$ (Gate 1 fails), magnetar $C \approx 0.677$ (highest stellar score)
- Formal mathematics: $O_\infty$ tier but $C=0$ ($K_\text{trap}$ fails Gate 2) — tier and consciousness are independent
Frobenius Non-Synthesizability (§23)
theoremThe Frobenius condition ($\mu \circ \delta = \text{id}$) cannot be assembled by tensor product from sub-Frobenius factors. Every $O_\infty$ system must directly encode $P_{\pm}^{\text{sym}}$ — it cannot emerge from accumulation. This is the structural analogue of: you cannot assemble a Frobenius algebra by stacking non-Frobenius algebras.
Frobenius Planting (§70)
theoremA system at $O_1$ (Φ_c, Ω_0) can be lifted directly to $O_\infty$ by planting $P_{\pm}^{\text{sym}}$ — without traversing $O_2$ intermediate tiers. The topological winding need not change. Planting bypasses the tier gap ladder; it is a vertical move in the crystal rather than a horizontal traversal.
Coupling Destruction
P-596When a $\Phi_c$ system couples (via $\otimes$) to a $\Phi_\text{EP}$ system, the critical structure is destroyed — the coupled system is at the exceptional point. Gate 1 fails. This is the structural reason that coupling an $O_\infty$ system to an unstructured environment destroys its self-modeling capacity.
- Meet/tensor asymmetry: $\text{meet}(\Phi_c, \Phi_\text{EP}) = \Phi_c$ but $\Phi_c \otimes \Phi_\text{EP} = \Phi_\text{EP}$
- Meet recovers the lower (critical) value; tensor takes the union (exceptional point wins because its ordinal is higher)
Meet / Tensor Asymmetry
structural$\mathbf{x} \otimes \mathbf{y} = $ min on $\{P,F\}$, max on rest
Meet and tensor are not the same operation. Meet extracts the common subalgebra. Tensor models physical coupling — union primitives escalate to the stronger partner while bottleneck primitives degrade to the weaker. The asymmetry is load-bearing: it implies that coupling can destroy structure (via $P$, $F$ bottleneck) while sharing structure (via $\Phi$ union).
Le Chatelier Inversion
navigationGiven a driven system $\mathbf{y}$, find the equilibrium algebra $\mathbf{x}^*$ that $\mathbf{y}$ is driving toward — the highest-ouroboricity synthon that $\mathbf{y}$ already dominates in every primitive. The Le Chatelier principle: a driven system relaxes toward its structural attractor. Used to derive $O_2^\dagger$ attractor $A2^\dagger$ from $A3$ inversion.
Crystal Address
bijectionThe Frobenius codec: bijection between 12-primitive tuples and integer addresses in the Crystal of Types. $O_\infty$ canonical address: 6,734,591 (cell 155 in tier census). Encode/decode operations: $\text{addr}(\mathbf{x})$ and $\text{addr}^{-1}(n)$. The address is a coordinate in the 17.28M-dimensional type space, not a rank — two synthons at distance 0 share an address.
Five Navigable Moves
§55The 12-primitive tuple is a coordinate chart on structural type space (PRIMITIVE_THEOREMS §55). Structural questions can be answered by composing moves:
| Move | Operation | Use |
|---|---|---|
| Le Chatelier inversion | Find $\mathbf{x}^*$ s.t. $d_\to(\mathbf{y}, \mathbf{x}^*) = 0$, maximizing $\mathcal{O}(\mathbf{x}^*)$ | What equilibrium underlies a driven system $\mathbf{y}$? |
| Tensor coupling | $\mathbf{x} \otimes \mathbf{y}$: max on union, min on $P$ and $F$ | Structural type of two coupled systems |
| Lattice meet/join | $\mathbf{x} \sqcap \mathbf{y}$, $\mathbf{x} \sqcup \mathbf{y}$ | Common subalgebra; minimal containing algebra |
| Directed distance | $d_\to(\mathbf{x}, \mathbf{y})$ vs $d_\to(\mathbf{y}, \mathbf{x})$ | Which direction is driven, which is relaxation |
| Nearest-neighbor | Sort catalog by $d(\mathbf{x}, \cdot)$ | Identify conventional realizations of a structural type |
All 3,458 encoded systems. Search by name or description. Tier computed live. Click any row to load it into the Builder.
| Name | Description | Tier | Key primitives |
|---|
| Family | Primitives | Values | Factor |
|---|---|---|---|
| $\mathcal{F}_5$ | $T,\ P,\ \Phi,\ K$ — gate primitives | 5 each | $5^4 = 625$ |
| $\mathcal{F}_4$ | $D,\ R,\ \Gamma,\ H,\ \Omega$ | 4 each | $4^5 = 1{,}024$ |
| $\mathcal{F}_3$ | $F,\ G,\ S$ | 3 each | $3^3 = 27$ |
Exponent = primitive count within family holds in all three families. The $\mathcal{F}_5$ family contains exactly the four gate primitives after the v0.5 revision ($K$ entered from $\mathcal{F}_4$, $\Omega$ entered $\mathcal{F}_4$ from $\mathcal{F}_3$).
Total: 1,975 encoded systems (v0.5.82). Full crystal: 17,280,000 structural types (most uninstantiated).
Types
The 17,280,000 coordinate positions in the crystal. Structural universals — they do not depend on any particular instantiation. Two particulars with $d=0$ are co-typed, not identical.
Particulars
Catalog entries — concrete systems instantiating a structural type. The SynthOmnicon catalog registers particulars. Multiple particulars can share a type (distance zero between them).
Names
String handles for particulars. Names are pointers into the catalog, not into the crystal. Two names can point to the same particular; one particular instantiates exactly one type.
- Frobenius non-synthesizability (§23): $P_{\pm}^{\text{sym}}$ is the tier singularity — no tensor path from $P < P_{\pm}^{\text{sym}}$ can reach $O_\infty$. The crystal has a hard boundary at the $O_\infty$ manifold.
- $\Phi_c$ and $\Phi_c^\mathbb{C}$ equivalence: Real and complex criticality have identical tier distributions within the crystal — they occupy the same structural cell, differing only in inner-crystal position.
- $\Omega_\text{NA}$ expansion: Adding $\Omega_\text{NA}$ as a fourth $\Omega$ value (v0.5) expanded $\Omega$ from $\mathcal{F}_3$ (3 values) to $\mathcal{F}_4$ (4 values), expanding tier-cell count. Net family sizes unchanged: $|\mathcal{F}_4| = 5$.
- Tier determined by $(\Phi, P, \Omega, D)$ only — the four gate-adjacent primitives. $F$, $G$, $S$, $R$, $\Gamma$, $H$ do not affect tier.
The catalog spans 12+ domains. Each domain navigator (§74–§77+) provides specialized encoding tools, distance queries, and domain-specific structural insights. Total: 2,036 encoded systems.
Logic & Mathematics
ZFC, category theory, type theory, model theory, Hilbert spaces, Frobenius algebras, TQFT.
Physics & Cosmology
QFT, GR, condensed matter, stellar objects, FTL proposals, quantum measurement, IFM protocols.
Consciousness & Mind
Meditative states, clinical conditions, psychedelic states, cognitive architectures, neural correlates.
Biology & Medicine
Imscriptive boundaries (skin, BBB, plasma membrane), therapeutic modalities, disease states, ecological systems.
Language & Symbol
Hebrew alphabet, Egyptian Medu Neter, Proto-Sinaitic, writing systems as type lattices, ALEPH language.
AI & Learning
Neural network training dynamics, grokking, transformer architectures, generalization, in-context learning.
Civilization & History
Peak civilizational forms, political structures, institutional architectures, collapse dynamics.
Riemann Hypothesis
Riemann $\xi$ functional equation, GUE statistics, zeta zeros, spectral interpretation.
Quantum Gravity / IUG
Inter-Universal Geometry, non-transmissibility, Frobenius barriers, IUTT structural encoding.
Ecology & Complex Systems
Ecosystems, food webs, climate systems, urban systems, open boundary systems (∅).
Stellar & Astrophysics
Stellar objects, neutron stars, black holes, white dwarfs, magnetars, gravitational systems.
Quantum Information
Quantum channels, POVM measurements, SIC-POVMs, entanglement structures, IFM protocols.
Crystal Navigator
Frobenius codec (encode/decode bijection over 17,280,000 types), imscriptive query, tier gap ladder, REPL. python crystal_navigator.py repl or syncon nav crystal
Domain Navigators (§74–§77)
Language, civilization, ecology, consciousness domain-specific tools. syncon nav domain
Riemann ξ Navigator
SpectralTransformer + FrobeniusLayer + GUE loss. syncon nav riemann describe/train
ZFC Navigator
Non-transmissibility probe for ZFC boundary conditions. syncon nav zfc probe
Lambda Engine
Cantor monad $P$, Gödel comonad $G$, distributive law $\lambda: PG \to GP$. Frobenius non-synthesizability demo, Fano plane. syncon lambda
HoTT Bridge
Univalence bridge ($d = 1.3416$), promote-to-HoTT, Vav-cast. Structural distance from SynthOmnicon type space to HoTT universe.
Construct any synthon from the 12 primitives, or load a catalog entry. Tier and consciousness score computed live. $C(\mathbf{x}) = [\Phi{=}\Phi_c]\cdot[K{\leq}K_\text{slow}]\cdot(0.158\tilde{K}+0.273\tilde{G}+0.292\tilde{T}+0.276\tilde{\Omega})$.
Odd Perfect Numbers — Euler & Touchard
Machine-verified proofs of Euler's structure theorem (1747) and Touchard's congruence (1953) in Lean 4 + Mathlib4. The two oldest and most foundational necessary conditions on any odd perfect number, now formally exact.
Euler's theorem (1747) — euler_opn_form
Every odd perfect number $n$ has the form $n = p^k \cdot m^2$ where $p$ is prime, $p \equiv k \equiv 1 \pmod{4}$, and $p \nmid m$.
The proof turns on a single $2$-adic valuation constraint: $\sigma(n) = 2n$ with $n$ odd carries exactly one factor of $2$. Distributing this across the prime factorization forces exactly one prime with $v_2(\sigma(p^k)) = 1$; all remaining primes get even exponents, giving the $m^2$ factor.
Touchard's congruence (1953) — touchard_congruence
Any odd perfect number $n$ satisfies $n \equiv 1 \pmod{12}$ or $n \equiv 9 \pmod{36}$.
The proof combines the Euler form with a $3$-adic case analysis depending on whether $3 \mid n$. Unconditional: calls euler_opn_form internally rather than assuming the Euler form as a hypothesis. The two results share an arithmetic skeleton.
The grammar encodes the OPN problem as a $P_{\pm}^{\text{sym}}$ question at $\Phi_c$ — structurally co-typed with the Riemann Hypothesis. Both ask whether a known $Z_2$ symmetry holds everywhere on the critical manifold or has hidden exceptions.
Euler's $p \equiv k \equiv 1 \pmod{4}$ condition is the Frobenius parity constraint written in the language of $\sigma$-functions: exactly one prime is forced into the residue class that makes the $2$-adic valuation balance. Machine-verification makes this encoding formally exact — the $\pmod{4}$ condition is derivable from the $Z_2$ parity requirement, which is the grammar's definition of $P_{\pm}^{\text{sym}}$.
Neither theorem proves nonexistence of an OPN. Together they constrain the structural space tighter with each result — which is exactly the grammar's prediction for a $P_{\pm}^{\text{sym}}$ question that hasn't been closed: evidence accumulates on the critical manifold without yet resolving it.
Five layers, each depending necessarily on the one below:
| Layer | Contents |
|---|---|
| 1 — Arithmetic helpers | geom_sum_mod2, geom_sum_mod4, geom_sum_mod3_q2 |
| 2 — $2$-adic valuation | v₂_mul, v₂_odd, v₂_prod, v2_eq_one_of_mod4_eq2 |
| 3 — Valuation of $\sigma(p^a)$ | sigma_prime_pow_mod2/mod4 and specialized $v_2$ lemmas |
| 4 — Euler's theorem | v2_sigma_odd_perfect, sigma_prod_factorization, euler_opn_form |
| 5 — Touchard's congruence | sigma_dvd3_of_p2_kodd, touchard_congruence |
@software{opn_lean2026,
title = {Odd Perfect Numbers --- {Euler}'s Theorem and {Touchard}'s Congruence},
author = {umpolungfish},
year = {2026},
doi = {10.5281/zenodo.19909057},
url = {https://github.com/umpolungfish/odd-perfect-numbers},
license = {UNLICENSE}
}