Abstract

This paper articulates the architectural structure of SAE (Self-as-an-End) mathematics, building on the methodological foundations of Methodology 0: Negativa and Methodology 00: Via Rho. It proposes a Layer Articulation Schema: at each of the principal mathematical layers this paper examines ($L_1$ through $L_5$), a four-step pattern is descriptively identifiable, with each step playing a structural role parallel to one of the four phases of negativa's self-interrogation articulated in Methodology 0—the marked handle of step 1 paralleling the "nothing" phase, the additive path of step 2 paralleling the "being" phase, the multiplicative path with memory binding of step 3 paralleling the "neither being nor nothing" phase, and the closure-with-remainder of step 4 paralleling the negation of the third.

The schema is offered as an identified articulation, supported by adequacy criteria (handle adequacy, path adequacy, memory adequacy, closure adequacy) and accompanied by explicit failure modes (including a distinction between local mapping failure and schema boundary identification). It is not offered as a derivational proof that mathematics must develop in this pattern, nor as the unique articulation framework for mathematics.

The paper exhibits the schema at $L_1$ (number, arithmetic, the Cauchy completion to $\mathbb{R}$, with the technical refinement that $L_1$'s multiplicative path closes at the real algebraic numbers $\mathbb{Q}^{\mathrm{alg}}_{\mathbb{R}}$ rather than the full algebraic closure $\overline{\mathbb{Q}}$), at $L_2$ (complex analysis, Euler's formula as an elegant instantiation of closure, the operational defect algebra $\omega_\rho^{(2)} = (\mathrm{Div}, \mathrm{Res}, \mathrm{Per}, \mathrm{Mon}, G_\infty, \mathrm{Stokes})$ organized as a four-stage topological evolution chain), and at $L_3$ (formal systems, computability, the Gödel diagonal fixed-point closure $G \leftrightarrow \neg\,\mathrm{Prov}(\ulcorner G \urcorner)$, with Gödel arithmetization as a topological knotting operation that parallels the operational defect algebra of $L_2$). The articulations at $L_4$ (relativistic spacetime) and $L_5$ (statistical thermodynamics) are exhibited briefly as parallel displays from the same four-phase source, not as mathematical claims of the present paper, with substantive treatment deferred to the four-forces and cosmology papers in the SAE series.

The exchange-law pattern is identified as a non-trivial cross-layer prediction of the schema: each layer admits a specific exchange identity (logarithm at $L_1$, residue theorem with unit $2\pi i$ at $L_2$, Gödel arithmetization at $L_3$, $E = mc^2$ at $L_4$, Boltzmann relation at $L_5$), with the articulative unit changing as the layer's structure changes.

The schema's scope boundary at $L_5$ is articulated as a transition between two complementary articulative grammars within mathematics: the closure-equation grammar productive at $L_1$ through $L_4$ and equilibrium $L_5$, and the probability-distribution grammar productive at non-equilibrium $L_5$ and beyond. The two grammars are complementary, not hierarchical; neither is reducible to the other; each is productive within the regimes for which it is suited. Regime-dependent transitions between the grammars are exhibited at specific systems (fluid mechanics, quantum mechanics, the double pendulum, the three-body problem, weather and climate, neural networks).

The paper's meta-thesis articulates a twofold inexhaustibility: at the object level, mathematical content is inexhaustible (intra-layer, inter-layer, path-branching, and meta-articulation recursive inexhaustibility); at the meta level, articulation frameworks for mathematics are inexhaustible (the schema is one productive specific framework among ongoingly possible alternatives). The schema's epistemological discipline is the discipline of operating within this twofold inexhaustibility without claiming to overcome it.

The historical record of mathematics is treated as a stress-test of the schema, with clear schema fits at the $p$-adic numbers (as a particularly clear instance of the construction-without-closure principle), Cantor's transfinite cardinals, Gödel's incompleteness theorems, the Cauchy rigorization, the development of complex analysis, and the post-Gödelian fate of the Hilbert program, alongside open candidates including surreal numbers, homotopy type theory, category-theoretic and topos-theoretic foundations, and forcing with large-cardinal extensions. Open problems and directions for future work are identified, including the composition law of the $L_2$ operational defect algebra, the structural articulation of the probability-distribution grammar, cross-layer tool use, detailed engagement with the philosophy-of-mathematics traditions, and parallel displays across disciplines.

The paper is positioned as an architectural foundation for the SAE mathematical program, complementing Cross-Layer Closure Equations' treatment of physical-layer transitions and the ZFCρ series' technical work at the $L_{1\text{-}2}$ choice-operation sub-articulation. It does not displace prior papers in the SAE corpus; it articulates the architectural framework within which the corpus's content has its place.

Keywords: SAE (Self-as-an-End), negativa, Via Rho, Layer Articulation Schema, 0DD four phases, philosophy of mathematics, mathematical foundations, inexhaustibility, operational defect algebra, Gödel diagonal closure.

---

1. Introduction

1.1 Position and motivation

The question of how mathematics relates to the structure of reality has occupied philosophical reflection at least since Plato's claim that mathematical objects exist independently of human thought. The standard contemporary positions on this question—Platonism, formalism, constructivism, and structuralism (including its category-theoretic refinement)—have been articulated and defended in considerable detail, and each captures something important about mathematical practice. Yet each, taken on its own, leaves a residual difficulty. Platonism explains why mathematics seems to track something more than convention but struggles to account for our epistemic access to it. Formalism explains the certainty of derivations but renders the apparent applicability of mathematics to physics mysterious. Constructivism explains how mathematical objects come to be available to us but, in its standard computability-oriented form, treats the inability to construct certain objects as an obstruction rather than as content. Structuralism explains why isomorphic structures are mathematically interchangeable but provides no principled account of why structures are layered in the way they are, with arithmetic preceding complex analysis preceding the theory of formal systems.

This paper takes a different starting point. Rather than asking whether mathematical objects exist independently, or whether mathematical statements are reducible to formal manipulations, or whether mathematics is constructed by us, it asks: what generates the layered architecture that mathematical practice actually exhibits? Why is there an $L_1$ of number and arithmetic, an $L_2$ of complex analysis, an $L_3$ of formal systems and computability—and why do these layers stand in the particular relations to one another that they do?

The thesis of this paper is that the layered architecture of mathematics, as it appears in the SAE (Self-as-an-End) framework, can be read out from a deeper structural pattern—the four phases (四相) of negativa interrogating itself—and that this reading is sufficiently regular to be formulated as a schema. We call this schema the Layer Articulation Schema. The schema identifies, in each of the principal mathematical layers this paper examines, a four-step pattern: a marked handle, an additive path, a multiplicative path with memory binding, and a closure that produces a remainder pointing to the next layer.

The principal claim is that this schema is descriptively identifiable in the layers $L_1$ through $L_5$ as they appear in SAE mathematics, in a sense made precise by adequacy criteria (§ 3.5) and failure modes (§ 3.6). It is not the claim that the schema is derivationally necessary, nor that it is the unique articulation framework for mathematics, nor that mathematics is exhausted by $L_1$ through $L_5$. The principal claim is accompanied by a meta-thesis: the inexhaustibility of mathematics is twofold—mathematical content is inexhaustible at the object level, and articulation frameworks for mathematics are inexhaustible at the meta level. The schema offered here is a productive specific framework operating within this twofold inexhaustibility, not a totalizing one.

1.2 The SAE methodological background

This paper builds on two prior foundational papers of the SAE programme.

The first, Methodology 0: Negativa [DOI: 10.5281/zenodo.19544620], establishes negativa (非, "non-") as the sole axiom of the SAE framework. Negativa interrogating itself produces, as its first theorems, the four phases (0DD 四相): 无 ("nothing"), 有 ("being"), 非有也非无 ("neither being nor nothing"), and 非"非有也非无" ("the negation of 'neither being nor nothing'"). These four phases exhaust the operational levels at which negativa can apply to itself; a hypothetical fifth phase results in what is called 想入非非, a state of articulative collapse.

The second, Methodology 00: Via Rho [DOI: 10.5281/zenodo.19657440], establishes Via Rho as the methodological dual of Via Negativa. Where Via Negativa proceeds by negating what is given, Via Rho proceeds by tracing the remainder (ρ) that any articulation produces but cannot incorporate. The ZFCρ series of technical papers is identified there as the concrete mathematical carrier of Via Rho, tracking the specific remainders that arise from the choice operation in $L_1$.

The present paper is neither a continuation of the ZFCρ technical work nor a recapitulation of Cross-Layer Closure Equations [DOI: 10.5281/zenodo.19361950], which articulates the physical-layer transitions ($L_3 \to L_4$, $L_4 \to L_5$) in detail. It is, rather, an architectural articulation of the SAE mathematical framework as a whole—an account of how the four-phase pattern of Methodology 0 and the remainder-tracking method of Methodology 00 together generate the layered structure of mathematics, and what the principled boundaries of this generation are.

1.3 Claim strength

A paper of this kind operates at several levels of claim strength simultaneously, and it is essential to make these explicit at the outset. Readers acquainted with the genre of architectural philosophy of mathematics will recognize the temptation, in such papers, to elevate descriptive identifications into derivational claims. The present paper resists this temptation, but the resistance must be visible, not merely asserted.

The following table summarizes the claim status of the paper's principal contents:

Content	Claim status
The 0DD four phases (Methodology 0)	Inherited foundation
The four-step mapping at each layer	Identified articulation schema
Schema instantiations at $L_1, L_2, L_3, L_4$	Structural displays
The breakdown of closure-equation articulation at $L_5$	Working boundary observation
Twofold inexhaustibility of mathematics and frameworks	Meta-thesis
The boundary between deterministic and probabilistic mathematical articulation	Working hypothesis

The first row is inherited from Methodology 0 and is not re-derived here. The second row—the central contribution of this paper—is offered as an identification, supported by adequacy criteria and falsifiability conditions developed in § 3, but not as a derivational proof that mathematics must unfold in four steps per layer. The third row records the specific instantiations of the schema at the layers this paper examines; these are presented as structural displays demonstrating fit with the schema, not as exhaustive treatments of the mathematics of those layers. The fourth row records a working observation about where closure-equation-style articulation gives way to probability-distribution-style articulation, without asserting that this transition is inevitable. The fifth row is the meta-thesis of the paper, which we discuss in § 3.8 and § 8.5. The sixth row is offered as a working hypothesis, refinable in light of further mathematical developments.

This stratification is not a hedge. It is a working commitment: at each point in the paper, the reader should be able to identify the level of claim being made, and to assess the paper's evidence on that basis. Where the schema is presented as an identified pattern, the reader is invited to test the identification against the adequacy criteria and failure modes of § 3, and against the historical stress-test of Appendix A. Where the meta-thesis of twofold inexhaustibility is articulated, the reader is invited to consider it alongside other meta-positions on mathematical incompleteness—Gödel-inspired epistemic limits, Lakatosian historical fallibility, structuralist openness—rather than as a competing absolute claim.

1.4 Relation to standard positions in the philosophy of mathematics

A complete engagement with the philosophy-of-mathematics literature lies beyond the scope of an architectural paper of this kind, and is deferred to the layer-specific papers in the SAE series (the $L_1$-specific paper will engage Cantor, Cauchy, and the various completion-based foundations; the $L_3$-specific paper will engage the Hilbert programme, Gödel, Tarski, and the post-Gödelian logical tradition; and so on). At the architectural level, however, the paper's relation to four standard positions can be indicated briefly.

Regarding naive Platonism, the SAE framework does not begin from the assumption of pre-existing mathematical objects in the Platonist sense. Mathematical objects emerge, on this account, as stable products of articulation activity, not as discoveries of pre-existing eternal forms. The stability is real, and it is what makes mathematics tractable and shareable across mathematicians and across centuries; but the stability is articulated stability, not the stability of independent existence. This is not a flat rejection of Platonism: there are sophisticated forms of Platonism (e.g., Linnebo's thin objects, Parsons's structuralist Platonism) with which the SAE framework has substantive points of contact, and these will be engaged in the layer-specific papers.

Regarding pure formalism, the SAE framework rejects the reading of formal systems as wholly arbitrary games. Formal systems, on this account, are constrained by their ρ-structure (the remainders they generate), by their closure conditions, and by the boundary markers that delimit the regions in which their operations are productive. A formal system that meets no such constraint is not a candidate for mathematical work; it is a notational exercise. This claim is compatible with the formalist intuition that mathematical truth is a matter of derivability within a specified system, but it adds the condition that the system itself must satisfy adequacy criteria of the kind articulated in § 3.5.

Regarding constructivism (in the broad sense including Brouwerian intuitionism and Bishop-style constructive analysis), the SAE framework is broadly sympathetic. Mathematics is, on the SAE account, generated by operations—marking, iterating, binding, closing—and the operations are themselves contentful, not merely formal manipulations of pre-existing objects. The SAE framework does not, however, restrict mathematical content to what is computably constructible. Remainders and unclosable boundaries are positive objects of articulation in the SAE framework, not obstructions to be eliminated. In this respect, the SAE framework is closer to a Brouwerian than a Markovian or Bishopian constructivism, but it does not align fully with any standard constructivist position.

Regarding structuralism (including its category-theoretic refinement in the work of Mac Lane, Awodey, and others), the SAE framework shares the structuralist conviction that mathematical objects are individuated by their structural relations rather than by intrinsic properties. The Layer Articulation Schema can in fact be read in category-theoretic terms—step 1 as object marking, step 2 as functorial extension, step 3 as natural transformation or memory binding, step 4 as colimit-with-remainder—and this reading will be developed in a future paper. The SAE framework adds to standard structuralism a requirement that each structure be accompanied by an explicit accounting of its remainder ledger and boundary markers; structures without such an accounting are, in the SAE view, incompletely articulated.

The Layer Articulation Schema offered here does not claim to be the unique framework for the philosophy of mathematics. Platonism, formalism, constructivism, structuralism, homotopy type theory, set-theoretic foundations, and category-theoretic foundations each articulate distinct angles on mathematical practice, and each is productive within its own scope. The schema is offered as one productive specific framework, internal to the SAE perspective, alongside these others rather than in competition with them.

1.5 What this paper does not claim

To forestall over-reading, we record explicitly the principal claims this paper does not make.

It does not claim to prove Methodology 0. The four-phase structure is inherited from Methodology 0 and used here; the present paper does not re-establish it.

It does not claim that mathematical history was bound to develop along the lines this schema identifies. Mathematical history contains contingent factors of every kind—institutional, biographical, geographical, economic—and the schema is descriptive of patterns identifiable in retrospect, not predictive of historical inevitability.

It does not propose to replace ZFC, homotopy type theory, or category-theoretic foundations. The schema is an articulation framework, not an alternative axiomatic foundation.

It does not claim that probability theory is not mathematics. The transition at $L_5$ between closure-equation-style articulation and probability-distribution-style articulation is a transition between two modes within mathematics, not a boundary between mathematics and something else (see § 7).

It does not claim that $L_1$ through $L_5$ exhausts mathematics. Mathematical developments outside the scope of the schema as articulated here are possible and indeed expected; the schema explicitly leaves room for them (see § 3.8 and § 11).

It does not claim that every mathematical object belongs uniquely to one layer. Cross-layer use of tools is common in advanced mathematics—complex analysis uses $L_2$ tools on $L_1$-valued functions, algebraic geometry uses $L_2$ tools on $L_3$ structures, topological K-theory uses $L_2$ and $L_3$ tools together—and the schema is compatible with such cross-layer practice. Layer attribution is by primary articulation function, not by exclusive categorization.

It does not claim to have established an axiomatic system for SAE mathematics. The present paper is an architectural articulation, not a system-construction paper. A full axiomatic treatment, if pursued, would be a separate undertaking.

Finally, a cross-series clarification is required. In the SAE programme, the symbol $L_3$ appears in different contexts with different content. In the present paper, $L_3$ refers specifically to the layer of formal systems, computability, and decidability—the mathematics of provability, definability, and Turing degrees. In other SAE series (notably the dynamical-systems series), $L_3$ refers to a dynamical-layer index of a different kind. Readers crossing between series should attend to this difference. Within the framework articulated here, the two usages are not in conflict: they are parallel displays of the four-phase pattern at different articulation levels, in line with the general account of parallel displays developed in § 6.

1.6 Plan of the paper

The remainder of the paper proceeds as follows. § 2 develops the articulation genealogy that motivates the schema, working from the qualitative articulation of $L_0$ to the marking of "1" at $L_{1\text{-}1}$. § 3 presents the Layer Articulation Schema itself, including the adequacy criteria (§ 3.5), failure modes (§ 3.6), and the epistemological stance that accompanies the schema (§ 3.8). § 4 displays the schema at $L_1$ (number, arithmetic, and real closure). § 5 displays the schema at $L_2$ (complexification, Euler closure, and the operational defect algebra of complex analysis). § 6 displays the schema at $L_3$, $L_4$, and $L_5$, with the caveat that $L_4$ and $L_5$ are non-mathematical layers presented here only as parallel displays from the same four-phase source, not as the paper's mathematical contribution. § 7 articulates the scope boundary of the schema in terms of two complementary articulation modes within mathematics—closure-equation grammar and probability-distribution grammar—and the regime-dependent transitions between them. § 8 develops the twofold inexhaustibility meta-thesis. § 9 situates the paper in relation to the ZFCρ series and other SAE series. § 10 reviews the paper's scope boundaries and concludes. § 11 collects open questions for future work. Appendix A presents a stress-test of the schema against historical nodes in mathematics, including potential counter-example candidates. Appendices B through E provide technical reference material.

---

2. Articulation genealogy: from $L_0$ to the marking of "1"

2.1 A note on the genealogy

The thought experiment that follows reconstructs how mathematical articulation could emerge from the four-phase pattern of Methodology 0. It is a genealogy of articulation, not a reconstruction of human prehistory. The actual historical emergence of mathematics is a matter for the history and anthropology of mathematics; it involves Babylonian accounting, Egyptian land measurement, Greek geometric reasoning, Indian numerical notation, and a thousand other contingent developments that no single schema could capture. The genealogy presented here addresses a different question: given the four-phase pattern as a starting point, can we exhibit a generative path from the most rudimentary qualitative articulation to the first stable mathematical handle? An affirmative answer would support the schema's claim to descriptive identification of a self-similar pattern; it would not, however, support a claim of historical inevitability.

2.2 The four phases revisited

We recall briefly the four phases of Methodology 0. Negativa, interrogating itself, produces in succession:

The first phase, nothing (无), is the articulative trace of negativa applied to its own operation. It is not absence in any straightforward sense, since absence already presupposes a dual term (the absent presence). It is, rather, the marked state at which negativa registers itself as not-yet-developed.

The second phase, being (有), arises from the negation of nothing. It is the marking of a positive entity, dual to and inseparable from the first phase. Where the first phase marks a non-developed state, the second phase marks a developed entity—still without operations upon it, but recognizable as something rather than as a mere placeholder.

The third phase, neither being nor nothing (非有也非无), is generated by the negation of the dual (being / nothing). At this phase, articulation moves to the meta-level: the third phase is neither simply positive nor simply negative, but is the result of operating on the dual itself. It exhibits the form of memory or binding—an articulation that holds together what the second phase merely posits.

The fourth phase, the negation of "neither being nor nothing" (非"非有也非无"), is the negation of the third phase. It exhibits the form of self-referential closure: an articulation that turns back upon its own meta-level operation. This closure is not a final resting point; it produces a remainder—something that the closure has touched but not incorporated—and this remainder is the trigger for any further articulation at the next level.

These four phases exhaust the operational levels at which negativa can apply to itself. A hypothetical fifth phase, an attempt to negate the negation of the negation of the dual, results in what Methodology 0 calls 想入非非—a state of articulative collapse, in which the articulation no longer tracks any operational content. The four phases are, in this sense, the maximal articulative resolution of negativa's self-interrogation.

2.3 The articulative situation at $L_0$

$L_0$ designates the state of qualitative articulation prior to any quantitative one. We model it by considering a hypothetical articulator—call her the protomathematician—whose articulative resources consist of dual qualitative pairs: many/few, more/less, bigger/smaller. She can articulate, of a group of sheep, that there are many; of two groups, that one has more than the other. She cannot, however, articulate exactly how many.

This is not a deficiency to be remedied by adding precision as a separate faculty. It is, on the present account, the natural state of the second phase applied to the world of objects: the protomathematician can mark positive entities and their qualitative duals, but the marking remains at the level of being and nothing. When she attempts to close the articulation—when she asks herself, "what is it for there to be many?"—the closure fails. Different contexts give different answers (a hundred sheep is many for a farmer but few for a kingdom), and no stable handle can be extracted from the qualitative pairs alone. The closure-attempt fails, and the failure produces a remainder: precision is missing.

The remainder is not nothing. It is the felt absence of a handle that would let the articulation close. The protomathematician's articulation, attempting to close at $L_0$, generates by its very failure the demand for an articulation at the next level.

2.4 The marking of "1"

The articulative response to the $L_0$ remainder is the introduction of a new marked handle: "1". This is not the discovery of a Platonic object, nor the construction of a set, nor the positing of a primitive term in a formal language. It is the marking of a precision handle—a sign that fixes, against the indeterminacy of the qualitative pairs, the determinate "exactly this one, not more, not less".

"1" at this stage is marked but not constructed. It carries no operations: there is no addition, no multiplication, no successor function. It is a placeholder for the precision that $L_0$ articulation could not deliver. In this respect, "1" mirrors the first phase of Methodology 0: it is the marked state of a not-yet-developed articulation, the trace of negativa at the threshold of mathematical articulation.

This is, in the schema's terms, the first step of $L_1$—the step we will write as $L_{1\text{-}1}$. The remaining steps of $L_1$—the additive path, the multiplicative path, and closure—will unfold as the schema's second, third, and fourth steps applied to the handle thus marked. The protomathematician's leaving of $L_0$ and entry into $L_1$ is, on this account, not a leap but a recurrence: the same four-phase pattern that organized the interrogation of negativa now organizes the articulation of mathematics itself.

The remainder of this paper develops the consequences of this recurrence.

---

3. The Layer Articulation Schema

3.1 The schema in summary

Within the SAE perspective, the layers of mathematics that this paper examines exhibit a strongly self-similar pattern: each can be read as the four-phase pattern of Methodology 0 applied to a specific articulative content. We formulate this observation as the Layer Articulation Schema:

Phase (Methodology 0)	Step (mathematical layer)	Role
First phase: nothing	Step 1: marked, not constructed	Marked handle in a non-developed state
Second phase: being	Step 2: additive path	Iterable extension with positive entities
Third phase: neither being nor nothing	Step 3: multiplicative path	Memory-binding at the meta-level
Fourth phase: negation of the third	Step 4: closure with remainder	Self-referential closure producing a next-layer trigger

The schema's central content is the right-hand column: at each step of each layer, a specific role can be identified. The claim is that, in the layers $L_1$ through $L_5$ examined in this paper, the role is filled by a specific mathematical content (a marked handle, an iterable additive structure, a binding multiplicative structure, a closure formula) that is recognizable on its own terms.

It is important to fix the strength of the claim here. We do not claim that the schema is derivationally necessary: there is no proof that mathematics must, on pain of inconsistency, develop in exactly four steps per layer. We do not claim that the schema is the unique articulation framework: other frameworks—category-theoretic, structuralist, intuitionist, formalist—articulate distinct angles on mathematical practice, and the present schema is one productive specific framework alongside them. We do claim that the schema is descriptively identifiable: in each of the layers we examine, the four-step pattern can be exhibited concretely, and this exhibition admits adequacy criteria (§ 3.5) and failure modes (§ 3.6) that make the identification falsifiable rather than vacuous.

The qualifier "strongly self-similar" is not a metaphor. By "strong" we mean that the pattern, when applied at each layer, satisfies the adequacy criteria developed below, and that no failure mode is identified. The pattern is falsifiable in the sense that a proposed mapping at a new layer, or a re-examination of an existing layer, could fail to satisfy the criteria; should this occur, the schema would require revision. To the extent that the schema currently holds across $L_1$ through $L_5$, it does so under this falsifiability discipline, not as a stipulation. The schema's full epistemological stance is articulated in § 3.8.

3.2 The schema read via negativa

The schema admits two complementary readings, corresponding to Methodology 0 and Methodology 00. The first, which we develop here, reads each layer's four steps as instances of negativa's self-interrogation at a particular articulative level.

At step 1, the layer marks a handle at a "non"-state. The handle is present, but not yet operated upon; it carries the form of the first phase, nothing, in that it is a marked state of non-development. At $L_{1\text{-}1}$, this is the marking of "1" prior to arithmetic; at $L_2$-1, it is the marking of $i = \sqrt{-1}$ prior to complex multiplication. In each case, the handle's articulative content is exhausted by what it negates: "1" marks the absence of multiplicity, $i$ marks the absence of reality among the algebraic remainders of $\mathbb{R}$.

At step 2, the negation of the first phase produces positive entities. The layer's additive path iterates the marked handle, generating a structure of marked entities. At $L_{1\text{-}2}$, this is the generation of $\mathbb{Z}$ from successive applications of $+1$ and $-1$; at $L_2$-2, it is the generation of $\mathbb{C}$ as $\mathbb{R} + i\mathbb{R}$. The entities thus generated carry the form of the second phase, being: they are positive, marked, and stand in dual relation to the not-yet-developed state of step 1.

At step 3, the negation of the dual (step 1 and step 2 together) produces an articulation at the meta-level. The layer's multiplicative path introduces a memory or binding structure: an articulation that holds together iterations of the additive path without reducing to renamed iteration. At $L_{1\text{-}3}$, this is multiplication's encapsulation of iteration count as a marked handle (so that $3 \times 5$ records not just the sum $5 + 5 + 5$ but the count "three" as a binding structure); at $L_2$-3, it is the rotation memory $e^{i\theta}$ that holds angle accumulation across multiplications. The articulation thus produced carries the form of the third phase, neither being nor nothing: it is not a simple positive entity (as the additive iterations were), nor a mere absence, but a meta-level binding.

At step 4, the negation of the third phase produces self-referential closure. The layer closes upon its own multiplicative articulation, generating a closure state and, simultaneously, a remainder that the closure cannot incorporate. At $L_{1\text{-}4}$, this is the Cauchy completion to $\mathbb{R}$ together with the unincorporable remainder $i = \sqrt{-1}$ that forces the transition to $L_2$; at $L_2$-4, it is the Riemann sphere $\hat{\mathbb{C}}$ together with the operational defect algebra $\omega_\rho^{(2)}$ and the multi-valued remainders that, when transformed into formal-system problems, point toward $L_3$.

This is the via negativa reading. It identifies each step as a specific application of negativa to its own prior phase, at the articulative level of the mathematical layer in question.

3.3 The schema read via rho (remainder)

The second reading proceeds dually: each step is read as the production and accumulation of remainders, in the manner of Methodology 00.

Step 1 produces a marked handle that is itself the operationalization of the previous layer's closure remainder. The handle is not introduced ex nihilo: it is the trace, made operable, of what the prior layer could not incorporate. At $L_{1\text{-}1}$, "1" operationalizes the precision remainder of $L_0$; at $L_2$-1, $i$ operationalizes the non-real algebraic remainder of $L_{1\text{-}4}$.

Step 2 produces iteration remainders. The additive path proceeds in both directions—forward and reverse—and in each direction, the iteration approaches but never reaches a boundary marker. The boundary marker is not part of the iterated structure; it is the articulative limit at which the iteration's productivity ends. At $L_{1\text{-}2}$, the boundary markers are $+\infty$ and $-\infty$, distinct because the additive path is directional in one dimension; at $L_2$-2, the boundary marker is the single point $\hat\infty$, because the additive path in two dimensions admits rotational identification of all directions.

Step 3 produces memory remainders. The multiplicative path encapsulates iteration count as a binding structure, but the binding itself generates new remainders. Some of these remainders are boundary markers of the multiplicative path (0 in $L_{1\text{-}3}$ and $L_2$-3); others are operational remainders that the path cannot absorb (the primes and their factorization structure at $L_{1\text{-}3}$; the divisor, residue, period, monodromy, growth, and Stokes data at $L_2$-3 and $L_2$-4, which we will discuss in § 5).

Step 4 produces the closure attempt's remainder—the unincorporable trigger that forces the next layer. At $L_{1\text{-}4}$, this is $i = \sqrt{-1}$, which resists incorporation into $\mathbb{R}$ because $\mathbb{R}$ is one-dimensional and $i$ requires a two-dimensional extension. At $L_2$-4, this is the family of multi-valued behaviors—logarithm, square root, branch points—that, when their path-dependence is transformed into a question of rule, proof, or decidability, become the articulative content of $L_3$ (as we discuss in § 5.5 and § 6.1).

The via negativa and via rho readings are not in tension. They are two ways of articulating the same schema: the first attends to what each step negates from its predecessor, the second to what each step leaves over for its successor. Together, they identify the schema as both a structure of self-applying negation and a structure of accumulating remainder.

3.4 Boundary markers and operational remainders

The schema requires a distinction that, though simple, has been a recurrent source of confusion in the philosophy of mathematics: the distinction between boundary markers and operational remainders.

A boundary marker is a point or limit at which the iteration of a step approaches but does not arrive. The boundary marker is part of the layer's articulative landscape, but it is not the locus of mathematical work. It sits in the background, as the asymptotic horizon of the iteration. At $L_{1\text{-}2}$, $\pm\infty$ are boundary markers of the additive path: every integer is finite, and no integer is $\pm\infty$, but the iteration of $+1$ and $-1$ runs in directions for which $\pm\infty$ are the horizons. At $L_{1\text{-}3}$, $0$ is the boundary marker of the multiplicative path: every product of nonzero rationals is nonzero, and the path's reverse (division) cannot reach zero from any starting point. At $L_2$-2, $\hat\infty$ is the boundary marker of the two-dimensional additive path, this time as a single compactifying point.

An operational remainder, by contrast, is a marked handle produced by the step's operations themselves and accumulating within the layer as foreground content. At $L_{1\text{-}3}$, the prime structure is an operational remainder: the primes are positive integers that the multiplicative path identifies as irreducible, and the resulting factorization structure (with its uniqueness theorem) is a topic of mathematical work, not a boundary. At $L_2$, the residue, the period, the monodromy, the divisor, the growth at infinity, and the Stokes data are all operational remainders, accumulating as the algebraic content of $L_2$'s operational defect algebra (§ 5.4).

The distinction matters because mathematical research—as practiced in the journals and textbooks of working mathematics—occurs at the level of operational remainders, not at the level of boundary markers. A paper on residue calculus does not, in the main, address the question of what happens at $\hat\infty$ in some metaphysical sense; it computes residues at specific singularities, and tracks their algebraic relationships. A paper on prime distribution does not address what $\pm\infty$ is; it studies the density and structure of primes in the integers. Boundary markers function as the asymptotic landscape against which research takes place; they are not themselves what research is about.

Conflating boundary markers with operational remainders is the source of several persistent confusions in philosophy of mathematics. The most familiar is the treatment of infinity as if it were a single object about which one can ask questions of existence and identity. The schema's distinction holds that the boundary marker $\hat\infty$ (or $\pm\infty$) is not an object in the relevant sense; it is the limit of an iteration, and questions about it are best addressed by examining the iteration itself rather than by reifying the limit. The operational remainders, by contrast, are objects of the relevant sense: a residue is a complex number, a divisor is an element of a group, a Stokes datum is a matrix. The schema's separation of these two categories preserves their distinctness.

3.5 Adequacy criteria

For a proposed mapping of a mathematical layer onto the schema to qualify as a fit, it must satisfy four adequacy criteria. The criteria are formulated as conditions on the mapping, not on the mathematics itself; the same mathematics may admit alternative articulations under different criteria-systems, and the present formulation does not preclude such alternatives.

Handle adequacy. The marked handle at step 1 of the proposed layer must be the operationalization of the closure remainder of the previous layer. It cannot be introduced arbitrarily, nor can it be chosen for aesthetic or notational convenience. At $L_{1\text{-}1}$, the handle "1" is the operationalization of the precision remainder of $L_0$. At $L_2$-1, the handle $i$ is the operationalization of the non-real algebraic remainder of $L_{1\text{-}4}$. A proposed mapping that introduces a handle without such an origin fails handle adequacy.

Path adequacy. The additive path at step 2 must be iterable, must have a reverse, and must possess a boundary marker that the iteration approaches but does not reach. The three conditions are jointly necessary: an iteration without a reverse does not constitute a path in the relevant sense, and a path without a boundary marker leaves the layer's articulative scope unclosed. At $L_{1\text{-}2}$, the additive path satisfies all three: $+1$ iteration is reversible by $-1$ iteration, and the iteration approaches $\pm\infty$ as distinct boundary markers. A proposed mapping whose step 2 lacks any of these features fails path adequacy.

Memory adequacy. The multiplicative path at step 3 must introduce a non-local memory or binding structure that is not reducible to renaming of the additive path. This is the criterion most easily violated by careless mappings, since multiplication is sometimes glossed as "repeated addition", a description that, taken seriously, would make step 3 a notational variant of step 2. The schema requires more: step 3 must introduce a binding that step 2 does not contain. At $L_{1\text{-}3}$, multiplication encapsulates iteration count as a marked handle (so that the product $3 \times 5$ is not merely an alternative notation for $5 + 5 + 5$ but a binding of the iteration count "three" with the iterated value "five"). At $L_2$-3, the rotation memory $e^{i\theta}$ binds angular accumulation across complex multiplications—a structure absent from the additive path. To make the non-locality criterion explicit across layers:

• At $L_1$, multiplication records iteration count as a binding (a non-local accumulation across iterations).
• At $L_2$, rotational accumulation across the angular path is non-local with respect to the additive structure.
• At $L_3$, Turing degrees accumulate complexity non-locally across formal systems.
• At $L_4$, curvature accumulates geometric content non-locally across spacetime regions.
• At $L_5$, $\ln W$ accumulates microstate counts non-locally across configurations.

A proposed mapping whose step 3 merely renames step 2 (without introducing such a non-local binding) fails memory adequacy.

Closure adequacy. The closure at step 4 must produce both a closure state and an unincorporable remainder that triggers the next layer. A closure that is perfect—that incorporates all of the layer's prior content without remainder—fails this criterion, since it leaves no articulative content for the next layer to inherit. At $L_{1\text{-}4}$, the Cauchy completion to $\mathbb{R}$ is a closure state, and $i = \sqrt{-1}$ is the unincorporable remainder that triggers $L_2$. At $L_2$-4, the Riemann sphere $\hat{\mathbb{C}}$ together with the operational defect algebra is a closure state, and the multi-valued behaviors that resist single-valued resolution in $L_2$ are the remainders that, in due course, trigger $L_3$. A proposed mapping whose step 4 closes without remainder fails closure adequacy.

These four criteria are jointly necessary. A proposed mapping that satisfies three but fails the fourth does not qualify as a schema-fit instance.

3.6 Failure modes

The schema admits explicit failure modes. We list five, with concrete illustrations.

Failure mode 1: Step 3 merely renames step 2. A proposed mapping in which the multiplicative path is articulated as nothing more than repeated addition, without an accompanying memory or binding structure, fails. The illustrative case is multiplication itself: if one were to define multiplication merely as a shorthand for repeated addition (rather than as an encapsulation of iteration count), the resulting mapping would fail memory adequacy. The actual practice of arithmetic does not so define multiplication, and so the schema passes at $L_{1\text{-}3}$; but the failure mode remains available as a check.

Failure mode 2: Step 4 leaves no remainder. A proposed mapping whose closure step is articulated as a perfect, self-sufficient termination fails. The illustrative case is the Cauchy completion: if one were to articulate the construction of $\mathbb{R}$ as a complete and final closure of $L_1$, without acknowledging the remainder $i = \sqrt{-1}$ that resists incorporation, the mapping would fail closure adequacy. The actual practice of mathematics acknowledges this remainder (and indeed names it before it has a place to live), and so the schema passes at $L_{1\text{-}4}$; but the failure mode remains available as a check against premature claims of closure.

Failure mode 3: Boundary markers and operational remainders are conflated. A proposed mapping that treats $\hat\infty$ as a single articulative handle on a par with residues, monodromies, and divisors fails. The illustrative case is the philosophical treatment of infinity as a metaphysical object: when $\hat\infty$ is treated as the same kind of object as a residue, the distinction between the asymptotic landscape and the operational foreground is lost, and the mapping ceases to track mathematical practice. The actual practice of complex analysis distinguishes these: $\hat\infty$ functions as the compactifying point of the Riemann sphere, while residues function as objects of computation; and so the schema passes at $L_2$.

Failure mode 4: Closure formula is a vacuous notational identity. A proposed mapping whose closure formula reduces to a vacuous identity (such as $0 = 0$, or some tautological equation that fails to integrate the layer's prior content) fails. The illustrative case is the use of Euler's formula $e^{i\pi} + 1 = 0$ at $L_2$: this is a non-vacuous closure formula because it integrates handles from $L_1$ ($e$, $\pi$, $1$, $0$) with handles from $L_2$ ($i$) in a single equation, and this integration is itself articulatively contentful. A mapping whose proposed closure formula failed to integrate prior handles—for instance, a formula that simply re-stated the closure state without relating it to its constitutive elements—would fail closure adequacy.

Failure mode 5: The layer's mapping cannot accommodate its claimed core mathematics. This failure mode requires careful articulation, since the SAE framework explicitly embraces an epistemological stance under which not every mathematical development must be accommodated by the schema (see § 3.8). The failure mode therefore divides into two sub-modes, which must be kept distinct.

Failure mode 5a (local mapping failure). If a proposed mapping at a given layer cannot accommodate the core mathematical content the mapping itself claims to cover, the mapping fails. This is genuine falsifiability. If a proposed $L_1$ mapping cannot accommodate Cauchy completion, $p$-adic completion, or algebraic closure—each of which is part of the standard mathematics of $L_1$—the mapping must be refined or abandoned. If a proposed $L_2$ mapping cannot accommodate the residue theorem, monodromy, or the theory of Riemann surfaces, the mapping must be refined or abandoned. Schema fits are not earned by post-hoc rationalization.

Failure mode 5b (schema boundary identification). If a mathematical development is stably situated outside the scope of the schema as articulated, it is not absorbed as a counter-example through ad hoc accommodation. Instead, it is identified as a schema boundary, and the framework offers two responses (developed in § 3.8): either to extend the schema (a schema update, where the development can be principled into the framework), or to acknowledge the development as belonging to an alternative articulation framework with which the schema coexists productively (a schema boundary acknowledgment). What is not permitted, on pain of trivializing the schema, is the routine reclassification of every counter-example as "merely an update opportunity"; that would convert the schema into an immunization clause and destroy its falsifiability. The distinction between 5a (genuine failure) and 5b (acknowledged boundary) is preserved by requiring that 5b be invoked only when the development is stably outside the schema's articulated scope, not merely when a proposed mapping happens to fail.

3.7 Alignment with the chisel-construct cycle

The schema aligns naturally with the chisel-construct cycle (凿构循环) developed in SAE Methodological Overview Paper I [DOI: 10.5281/zenodo.18842450]. The cycle has four moments: chisel, construct, remainder, bridge, returning ultimately to the thing-in-itself. Each step of the schema corresponds to a moment of the cycle:

Step 1, marked-not-constructed, corresponds to the chisel moment: the marking of a handle that has not yet been operated upon. Steps 2 and 3, the additive and multiplicative paths, correspond to the construct moment: the building-up of operations and binding structures on the marked handle. Step 4, closure-with-remainder, corresponds to the conjoint moments of remainder (the unincorporable trace) and bridge (the trigger to the next layer).

The schema is not, then, a free-standing construction. It is the cycle's articulation at a specific articulative level, the level at which mathematical layers exhibit their internal structure. The cycle as developed in Paper I is the general form; the schema is the form's instantiation in mathematics.

3.8 The schema's epistemological stance

The schema is, finally, accompanied by an epistemological stance that is as much part of the present paper's contribution as the schema itself. The stance has two components.

First, the schema does not claim completeness. It does not claim that all of mathematics fits the schema, nor that mathematics can be exhaustively articulated by any finite collection of layer-mappings of the kind it offers. Mathematical developments outside the schema's current scope are expected, not merely tolerated, and the schema makes explicit space for them.

Second, the schema does not claim uniqueness. It does not claim to be the unique articulation framework for mathematics, nor to be superior in some context-free sense to the alternative frameworks (Platonist, formalist, constructivist, structuralist, category-theoretic, type-theoretic) that articulate other angles on mathematical practice. These frameworks are productively parallel, and the schema offers itself as one productive specific framework alongside them.

The relationship between a specific mathematical development and the schema is governed by the failure-mode distinction articulated in § 3.6. If the development falls within a mapping the schema claims to cover, and the mapping cannot accommodate it, the mapping fails (5a). If the development is stably outside the schema's scope, it is identified as a schema boundary (5b), and one of two responses is appropriate: the schema may be extended to incorporate the development (a schema update), or the development may be acknowledged as belonging to an alternative framework coexisting with the schema. What is essential, on pain of immunization, is that schema boundaries be identified honestly rather than retrofitted to mask local failures.

The stance has a meta-thesis attached, which we will develop fully in § 8.5. The thesis is that mathematical articulation is twofold inexhaustible: at the object level, mathematical content is inexhaustible (the four-fold inexhaustibility of § 8.2); at the meta level, articulation frameworks for mathematics are inexhaustible (the schema is one productive specific framework among ongoingly possible alternatives). The schema's epistemological discipline is the discipline of operating within this twofold inexhaustibility without claiming to overcome it.

This is, we suggest, a discipline that any architectural philosophy of mathematics is well advised to adopt. The temptation, in a paper proposing a schema, is to defend the schema as if its acceptance required the rejection of alternatives. The present schema is offered in a different spirit: as one productive specific articulation, falsifiable in its specific claims, honest about its specific scope, and explicitly compatible with the ongoing productivity of other articulation frameworks. The reader is invited to test the schema against its adequacy criteria and failure modes, and against the historical stress-test of Appendix A, without taking the schema's offer of one framework as a denial of the productivity of others.

---

4. $L_1$: number, arithmetic, and real closure

The first mathematical layer, $L_1$, is the layer at which the protomathematician's articulation crosses from the qualitative to the quantitative. This section displays the four steps of the schema as they appear at $L_1$, attending in each case to the specific articulative content that fills the schematic role, and to the technical refinements that the philosophical literature on the number concept has made necessary.

4.1 Step 1: "1" as precision handle

The first step of $L_1$ has already been articulated in § 2.4: the marking of "1" as a precision handle, in response to the $L_0$ remainder of qualitative indeterminacy. We add here only what the schema's via negativa reading makes explicit.

"1", at $L_{1\text{-}1}$, is marked but not yet operated upon. There is no successor function, no addition, no multiplication; there is, simply, the determinate signed unit "exactly one, not more, not less". The handle carries no quantitative structure beyond what is required for the precision-marking itself. This is the via negativa reading of the first phase as it applies at the level of $L_1$: a marked state that is articulatively present but operationally undeveloped.

Two observations are worth registering. First, the marking of "1" is not the marking of a thing, in any naive sense; it is the marking of an articulative position that lets quantitative discrimination begin. The protomathematician who marks "1" has not discovered an object; she has secured a handle. The handle's content is exhausted by what it makes possible at subsequent steps. Second, the marking of "1" is, in a non-trivial sense, the marking of negativa's discrimination at the level of objects: where the first phase of Methodology 0 marks negativa's not-yet-developed state, "1" marks not-yet-multiplied state. The structural parallel is what licenses the schema's identification of "1" as filling the first-step role.

4.2 Step 2: the additive path

The additive path of $L_1$ unfolds from "1" by iteration. Successive applications of $+1$ generate the natural numbers $\mathbb{N}$, and the reverse iteration—the introduction of $-1$ as the inverse operation—generates the negative integers, completing the integers $\mathbb{Z}$. The articulative content of this generation is the second phase of the schema: positive entities standing in dual relation to the marked handle of the first step.

Three features of the additive path deserve explicit comment.

The first is its iterability. The schema's path adequacy condition (§ 3.5) requires that the additive path be iterable, with an operationally available reverse. The arithmetic of $\mathbb{Z}$ satisfies this requirement: every integer is reachable from $1$ by a finite sequence of $+1$ and $-1$ operations, and every $+1$ step has a unique $-1$ inverse. The iterability is what gives the path its productivity: the path generates entities, and the entities generated stand in the determinate iteration-distance relations that arithmetic computes.

The second is the symmetry-breaking introduction of $0$. The element $0 \in \mathbb{Z}$ is reachable via the additive reverse: starting from any $n$, the iteration $-1, -1, \ldots, -1$ (applied $n$ times) lands at $0$. In contrast to its role in the multiplicative path of step 3 (where it functions as a boundary marker), at step 2 the element $0$ is an interior point of the additive path. It is reachable, operated upon, and integrated into the layer's positive content.

The third is the structure of the boundary markers. The additive iteration in $\mathbb{Z}$ proceeds in two distinguishable directions—forward (toward arbitrarily large positive integers) and reverse (toward arbitrarily large-magnitude negative integers)—and each direction approaches but does not reach a distinct asymptotic horizon. The boundary markers $+\infty$ and $-\infty$ are not identified: the one-dimensional, directional structure of $\mathbb{Z}$ keeps them apart. This will contrast importantly with the boundary structure of the two-dimensional additive path of $L_2$, where rotational identification collapses the boundary markers into a single point. The contrast is itself articulatively informative: the schema does not stipulate the dimensionality of boundary markers in advance, but reads it off the topological structure of the iteration.

4.3 Step 3: the multiplicative path

The multiplicative path of $L_1$ unfolds from the additive structure of $\mathbb{Z}$ by introducing a binding that the additive path itself does not contain. The binding is the marking of iteration count as an articulative handle. Where the additive path treats $5 + 5 + 5$ as a sequence of additions, the multiplicative path encapsulates this sequence in the product $3 \times 5$, in which the number "three" appears not as a value to be added but as the count of iterations to be performed. The count is now a marked handle in its own right, available for further operation.

This is the via negativa reading of the third phase as it applies at $L_1$: an articulation at the meta-level, neither a simple addition (a positive entity of step 2) nor an absence of operation (a negation of step 2), but a binding that holds together the additive structure. The schema's memory adequacy condition (§ 3.5) requires that the multiplicative path be non-locally constituted: the binding it introduces must capture something that the additive path cannot. The iteration count is non-local in the relevant sense, since it stands above the additive path as a count of iterations rather than as one of them.

The multiplicative path generates extensions of $\mathbb{Z}$ in two directions, paralleling but not duplicating the directions of the additive path. Division (the inverse of multiplication, parallel to subtraction but operating on the multiplicative structure) extends $\mathbb{Z}$ to the rationals $\mathbb{Q}$. The iteration reverse—root extraction—when applied to real elements of $\mathbb{Q}$ produces the real algebraic numbers, the irrationals that are the roots of polynomials with rational coefficients.

A technical refinement is essential at this point, and the philosophical literature has, in our judgment, not always made it explicit. The completion of the multiplicative path at $L_1$ is not the entire algebraic closure $\overline{\mathbb{Q}}$ of the rationals. The algebraic closure contains $i = \sqrt{-1}$, since $i$ is a root of the polynomial $x^2 + 1 \in \mathbb{Q}[x]$, but $i$ is precisely the remainder that $L_1$'s closure attempt will fail to incorporate (§ 4.4). To articulate the multiplicative path's completion accurately, we must distinguish the real algebraic numbers from the complex algebraic numbers. The completion of $L_1$'s multiplicative path is, accordingly,

$$\mathbb{Q}^{\mathrm{alg}}_{\mathbb{R}} := \overline{\mathbb{Q}} \cap \mathbb{R},$$

the field of real algebraic numbers. This includes $\sqrt{2}$, $\sqrt[3]{5}$, the algebraic irrationals generally, but excludes the non-real algebraic numbers ($i$, the non-real roots of higher-degree polynomials). The multiplicative path of $L_1$ is, in this technical sense, one-dimensional: it lives entirely within the real line.

The boundary marker of the multiplicative path is $0$. This contrasts with $0$'s role at step 2 (where it was an interior point of the additive path). At step 3, $0$ functions as the multiplicative absorbing element: for any $z$, $z \cdot 0 = 0$. The multiplicative path's reverse—division—cannot reach $0$ from any nonzero starting point. The element $0$ is, in this sense, the asymptotic horizon of the multiplicative iteration in the same way that $\pm\infty$ are the asymptotic horizons of the additive iteration; the difference is that $0$ is one-sided (a single boundary marker) where $\pm\infty$ are two-sided (distinct boundary markers), reflecting the dimensional distinction between additive and multiplicative paths.

The multiplicative path produces an operational remainder that the path itself cannot incorporate: $i = \sqrt{-1}$. The polynomial $x^2 + 1$ has no real root, since for any $x \in \mathbb{R}$, $x^2 \geq 0$ and therefore $x^2 + 1 \geq 1 > 0$. The articulative handle $i$ satisfies $i^2 = -1$, but $i \notin \mathbb{R}$. This remainder is operational, not merely a boundary marker: $i$ is a handle that can be operated upon (added, multiplied, raised to powers), once it is given a space to live. The space, as $L_2$ will articulate, is the complex plane $\mathbb{C}$; but $L_1$ cannot supply it. The handle $i$ is, accordingly, the operational remainder that triggers the transition to $L_2$.

4.4 Step 4: closure with remainder

The closure step of $L_1$ aggregates the additive and multiplicative paths into a single articulative structure and exhibits, in the same gesture, both the closure state and the unincorporable remainder. The closure state is the real number field $\mathbb{R}$, achieved by Cauchy completion of $\mathbb{Q}$ (equivalently, by the Dedekind cut construction). The closure logic of $L_1$ unfolds in the sequence:

$$\mathbb{N} \to \mathbb{Z} \to \mathbb{Q} \to \mathbb{Q}^{\mathrm{alg}}_{\mathbb{R}} \to \mathbb{R}.$$

Two observations are central here.

The first concerns the transcendentals. The real numbers $\mathbb{R}$ contain not only the real algebraic numbers but also the transcendentals: $\pi$, $e$, $\ln 2$, and their company. These are not remainders of the multiplicative path alone; the multiplicative path's completion, as we have insisted, is $\mathbb{Q}^{\mathrm{alg}}_{\mathbb{R}}$. The transcendentals emerge at the closure step, when the additive and multiplicative paths are combined and a limit articulation (Cauchy completion) is performed. They are remainders of $L_1$ as a whole, not of any single step.

The transcendentals are themselves of two distinguishable kinds, and the distinction is articulatively informative. The constant $\pi$ enters mathematics from outside the additive and multiplicative paths: from geometry, as the ratio of a circle's circumference to its diameter. Its transcendence (Lindemann 1882) reflects the fact that no polynomial with rational coefficients has $\pi$ as a root—it cannot be reached by any finite combination of the multiplicative path's operations. The constant $\pi$ is a real algebraic remainder of $L_1$ that requires importation from a geometric context. By contrast, the constant $e$ emerges from within $L_1$ itself, as the limit

$$e = \lim_{n \to \infty} \left(1 + \frac{1}{n}\right)^n.$$

This limit is the attempt to reconcile the additive structure ($1/n$ as an additive increment) with the multiplicative structure (raising to the power $n$) at the limiting boundary of both. The constant $e$ is, accordingly, an internal transcendental of $L_1$: the non-algebraic residue produced when the additive and multiplicative paths are pushed to their joint limit and asked to commute. It is the irrefutable evidence that the two paths are not commensurable. The constants $\pi$ and $e$ are both $L_1$ closure remainders, but they record different facts about $L_1$'s structure: $\pi$, that geometric continuity exceeds arithmetic reach; $e$, that the additive and multiplicative paths cannot be jointly reduced.

The second observation concerns $i$. The constant $i = \sqrt{-1}$ is also a remainder of $L_1$'s closure, but in a fundamentally different sense from $\pi$ and $e$. The transcendentals $\pi$ and $e$ are incorporable into $\mathbb{R}$ via limit articulation; they are non-algebraic, but they are real numbers, fitting within the one-dimensional structure of $\mathbb{R}$. The constant $i$ is not incorporable into $\mathbb{R}$: $i^2 = -1$, and no real number satisfies this equation. The remainder $i$ requires a dimensional extension that $L_1$ cannot supply.

This is the via rho reading of the fourth phase as it applies at $L_1$: the closure produces both a closure state ($\mathbb{R}$, with the transcendentals incorporated) and an unincorporable remainder ($i$) that forces the next layer. The schema's closure adequacy condition (§ 3.5) is met, and the trigger to $L_2$ is supplied by $i$'s resistance to one-dimensional incorporation.

A brief note on the historical emergence of mathematician's stance is appropriate here. The Cauchy completion to $\mathbb{R}$, with the attendant rigorous foundations of limit and continuity developed by Cauchy, Weierstrass, and Dedekind in the nineteenth century, is, on the schema's reading, the historical event at which the formal-rigorous stance of the mathematician first articulates itself. This is not a denial of the substantial mathematical work that preceded it—Babylonian arithmetic, Greek geometry, Indian algebra, medieval European number theory all preceded the nineteenth-century rigorization, and accomplished what they accomplished without it. The schema's claim is that the closure step of $L_1$, when it is reached, is the historical occasion at which the rigorous-foundations stance becomes articulatively necessary. Before $L_{1\text{-}4}$ is fully reached, mathematics can proceed productively without rigorous foundations; at $L_{1\text{-}4}$, the foundational requirement becomes intrinsic to the layer's closure. The historical timing—nineteenth-century rigorization rather than earlier—is consistent with this articulative reading.

4.5 An exchange law for $L_1$

Each mature layer of the schema admits, at its closure step, an exchange law: a specific identity that records, in a single equation, the trading-relation between the layer's additive and multiplicative paths (or between the layer's local and global perspectives, in the case of higher layers). At $L_1$, the natural candidate for the exchange law is the logarithmic identity

$$\log(ab) = \log a + \log b.$$

This identity records, for positive reals $a, b$, the fact that multiplication can be converted to addition via the logarithm. It is an exchange law in the precise sense that it converts an operation of the multiplicative path (the third step) into an operation of the additive path (the second step), via a specific articulative function (the logarithm). The logarithm thereby serves, at $L_1$, the role of an articulative unit: the unit through which the layer's two paths can be expressed in one another's terms.

The exchange law pattern recurs at each subsequent layer, with the articulative unit changing as the layer's structure changes. At $L_2$, the unit will be $2\pi i$ (§ 5); at $L_3$, the Gödel arithmetization function $\#$ (§ 6.1); at $L_4$, $c^2$ (the speed of light squared); at $L_5$ in its equilibrium regime, $k_B$ (Boltzmann's constant). The schema does not stipulate the form of the exchange law in advance, but it predicts that each closure-equation-supporting layer will have one, and the prediction can be checked against mathematical and physical practice. The check, in each case, is successful: each layer's articulative practice furnishes a specific exchange law, recognizable as filling the schematic role.

---

5. $L_2$: complexification, Euler closure, and the holomorphic defect algebra

The second mathematical layer, $L_2$, emerges as the articulative response to the unincorporable remainder $i = \sqrt{-1}$ that $L_1$'s closure leaves over. Its content is the complex numbers, their analytic structure, and—centrally for the present paper—the operational defect algebra of complex analysis. This section displays the four steps of the schema at $L_2$, and develops the operational defect algebra as the layer's core working content.

A note on the order of treatment. Euler's formula $e^{i\pi} + 1 = 0$ is often presented as the emblematic equation of complex analysis, and it does belong at $L_2$-4 as an elegant instantiation of the closure step. We will give it its due (§ 5.3). But it is not the locus of $L_2$'s mathematical work. The work of $L_2$, in the practice of mathematicians, takes place in the operational defect algebra: in the calculus of residues, in the theory of Riemann surfaces, in the management of monodromy, in the Stokes data of asymptotic expansions. We accordingly devote § 5.4 to the operational defect algebra at length, and treat Euler's formula in the more compact § 5.3 that precedes it.

5.1 $L_2$ as response to $L_1$'s unincorporable remainder

The articulative situation at the end of $L_1$ is as follows. The closure to $\mathbb{R}$ has been achieved, with the transcendentals $\pi$, $e$, $\ln 2$, $\ldots$ incorporated via limit articulation. The remainder $i = \sqrt{-1}$ has been identified as resisting incorporation, since $\mathbb{R}$ is one-dimensional and $i$ cannot be located on the real line. The schema's via rho reading identifies $i$ as an operational remainder—an articulative handle that can be operated upon, given a space to live—rather than as a mere boundary marker.

What is required, then, is a dimensional extension: an articulative space in which $i$ can be operated upon alongside the real numbers. The extension that mathematics supplies is the complex plane $\mathbb{C} = \mathbb{R} + i\mathbb{R}$. This is the response, at the next articulative level, to the trigger $i$. It is not the unique possible response: the construction generalizes, via the Cayley–Dickson procedure, to the quaternions $\mathbb{H}$, the octonions $\mathbb{O}$, and (with progressively diminishing structural richness) the sedenions and beyond. Each of these is, in the schema's terms, a candidate $L_2$ articulation, and each carries a distinctive cost (commutativity in $\mathbb{H}$, associativity in $\mathbb{O}$, the division algebra structure in the sedenions). The schema is compatible with multiple $L_2$ articulations; for the body of this section, we follow the standard articulation through $\mathbb{C}$, returning briefly to the alternative paths in § 5.3 and in Appendix A.

5.2 The four steps at $L_2$

The four steps of $L_2$ may be summarized as follows, before we treat each in turn.

Step	Phase	Content
$L_2$-1	nothing	$i = \sqrt{-1}$ marked at a non-real state, as the complexification seed
$L_2$-2	being	$\mathbb{C} = \mathbb{R} + i\mathbb{R}$ as the two-dimensional additive path, with $\hat\infty$ as the compactified boundary marker
$L_2$-3	neither being nor nothing	$\mathbb{C}^* = \mathbb{C} \setminus \{0\}$ with rotation memory $e^{i\theta}$; modulus-multiplied, argument-added
$L_2$-4	negation of the third	Riemann sphere $\hat{\mathbb{C}}$ together with Euler's formula and the operational defect algebra $\omega_\rho^{(2)}$

The first step marks $i$ as a complexification seed: an articulative handle whose only intrinsic property is $i^2 = -1$. At this stage, no operations have been defined upon $i$ beyond what this defining property entails. The parallel with $L_{1\text{-}1}$ (where "1" is marked but not yet operated upon) and with the first phase of Methodology 0 (where negativa marks its non-developed state) is structural; the schema's identification of $i$ as the first-step content is supported by this structural parallel.

The second step articulates $\mathbb{C}$ as the two-dimensional additive path. Addition is performed componentwise: $(a + bi) + (c + di) = (a + c) + (b + d)i$. The iteration is two-dimensional, in contrast to the one-dimensional iteration of $L_{1\text{-}2}$, and this dimensional difference has a topological consequence at the boundary. The compactification of $\mathbb{C}$ adds a single point at infinity, $\hat\infty$, identified with the limit of any unbounded sequence in $\mathbb{C}$ regardless of the direction of unboundedness. Where $L_{1\text{-}2}$ distinguished $+\infty$ and $-\infty$ as the two ends of the one-dimensional real line, $L_2$-2 identifies all directions of unboundedness into the single boundary marker $\hat\infty$. The identification is forced by the topology: the rotational symmetry of $\mathbb{C}$ as a two-dimensional space treats all directions equivalently at the boundary. The articulative content of this identification is non-trivial. The distinct boundary markers of $L_1$ are not preserved by passage to $L_2$; the dimensional extension simultaneously identifies them. This is the schema's first encounter with a topological constraint on boundary structure, and we will see further such constraints at $L_2$-3 and $L_2$-4.

The third step articulates $\mathbb{C}^*$ as the multiplicative path. Complex multiplication, expressed in polar coordinates, takes the form

$$r_1 e^{i\theta_1} \cdot r_2 e^{i\theta_2} = r_1 r_2 e^{i(\theta_1 + \theta_2)}.$$

Two articulative contents are bound together here. The modulus $r$ continues the multiplicative path of $L_{1\text{-}3}$ (multiplication of magnitudes). The argument $\theta$ introduces a new articulative content: rotational memory. Complex multiplication records angular accumulation across iterations—a binding that is genuinely new at $L_2$ and that has no counterpart in $L_1$, where the multiplicative path operates on the one-dimensional line and admits only scaling, not rotation.

The constant $i$ is, in this articulation, not best understood as an "imaginary number that is somehow not real". It is more accurately a rotation generator in the two-dimensional plane: $i = e^{i\pi/2}$, generating a quarter-rotation. Multiplication by $i$ rotates by $\pi/2$; multiplication by $i^2 = -1$ rotates by $\pi$; multiplication by $i^4 = 1$ returns to the identity. The defining property $i^2 = -1$ records the fact that two successive quarter-rotations compose to a half-rotation. The non-real character of $i$ on the real line is, in this articulation, a downstream consequence of its function as a rotation generator on the complex plane; $L_1$ could not articulate rotations, and so the rotation generator could not be located within $L_1$'s articulative scope.

The boundary marker of the multiplicative path at $L_2$ is again $0$, by parity with $L_{1\text{-}3}$. The element $|a + bi| = 0$ if and only if $a = b = 0$, and $0$ functions as the multiplicative absorbing element in $\mathbb{C}$ as it did in $\mathbb{R}$. Under the transformation $z \mapsto 1/z$, $0$ and $\hat\infty$ are exchanged with one another, forming a distinguished period-two boundary pair under multiplicative inversion on the Riemann sphere. The schema's reading identifies this dual pair as the boundary structure of $L_2$'s multiplicative path.

The fourth step closes $L_2$ on the Riemann sphere $\hat{\mathbb{C}} = \mathbb{C} \cup \{\hat\infty\}$, with Euler's formula as an elegant instantiation of the closure equation and the operational defect algebra $\omega_\rho^{(2)}$ as the core working content of the layer. We treat these in § 5.3 and § 5.4 respectively.

5.3 Euler's formula as elegant instantiation

Euler's formula

$$e^{i\pi} + 1 = 0$$

has often been called the most beautiful equation in mathematics. The judgment is aesthetic, but it tracks an articulative content that the schema can identify precisely: Euler's formula integrates handles from $L_1$ ($e$, $\pi$, $1$, $0$) with a handle from $L_2$ ($i$) into a single equation that closes the joint articulative content of the two layers. The constants $e$ and $\pi$ are $L_1$ transcendentals; $1$ is the precision handle of $L_{1\text{-}1}$; $0$ is a boundary marker of $L_{1\text{-}2}$ and $L_{1\text{-}3}$; $i$ is the complexification seed of $L_2$-1. Euler's formula records that, when these handles are combined under the operations of $L_2$, they satisfy a non-trivial identity.

The closure adequacy condition (§ 3.5) requires that the closure step produce a closure state together with an unincorporable remainder. Euler's formula by itself does not exhibit an unincorporable remainder; it is a closed identity, in the sense that all of its constituent handles fit within $\mathbb{C}$. The remainders of $L_2$—the multi-valued behaviors, the residue, the monodromy, and so on—must come from elsewhere. Euler's formula is, accordingly, best understood as a closure instantiation, not as the full closure of $L_2$. The full closure includes the Riemann sphere (a topological closure of $\mathbb{C}$) and the operational defect algebra (the algebraic closure, in the schema's sense, of $L_2$'s operational content).

The schema does not stipulate that Euler's formula must be the closure equation of $L_2$. Other closure equations are available. The quaternionic extension $\mathbb{H}$ closes $L_2$ in a different mode (four-dimensional, non-commutative). The octonionic extension $\mathbb{O}$ closes in yet another (eight-dimensional, non-associative). The Cayley–Dickson construction yields a sequence of closures, each at the cost of an algebraic structural property (ordering, commutativity, associativity, the division-algebra property, and beyond). Each of these is an admissible $L_2$ closure under the schema, and each carries a distinctive cost. The presentation in this paper, in following $\mathbb{C}$ and Euler's formula, does not preclude the alternatives; it follows the path through which most of the operational defect algebra (residue, period, monodromy, Stokes data) has been historically developed.

5.4 The operational defect algebra $\omega_\rho^{(2)}$

The articulative core of $L_2$, as practiced by mathematicians since the work of Cauchy, Riemann, and Weierstrass in the nineteenth century, is not Euler's formula but the operational defect algebra of complex analysis. This algebra accounts for the behavior of holomorphic functions in the presence of singularities, multi-valued continuations, and asymptotic mismatches; it is the structure within which complex-analytic theorems are formulated and proved. We denote this algebra

$$\omega_\rho^{(2)} = (\mathrm{Div},\, \mathrm{Res},\, \mathrm{Per},\, \mathrm{Mon},\, G_\infty,\, \mathrm{Stokes}),$$

a six-component structure whose components articulate, in succession, the layer's topological evolution chain: defects that scale up from the local (point-state) to the global (cycle-state) to the boundary (sectoral-state). The chain has four stages, and the six components map onto these stages as follows:

• Stage 1 (point-state): Divisor.
• Stage 2 (local-monetary): Residue.
• Stage 3 (global-cycle): Period and Monodromy.
• Stage 4 (boundary-sectoral): Stokes data and $G_\infty$ (growth at infinity).

We discuss each component in turn.

Divisor is the most elementary form of defect at $L_2$: the marking of the zeros and poles of a holomorphic function as discrete points on the underlying Riemann surface, with associated multiplicities. The divisor of a meromorphic function $f$ on a Riemann surface $X$ is the formal sum $\mathrm{div}(f) = \sum_p n_p \cdot p$, where $p$ ranges over the points of $X$ and $n_p \in \mathbb{Z}$ records the order of the zero (positive $n_p$) or the order of the pole (negative $n_p$). The divisor group structure—which we discuss in more detail in Appendix B—organizes these point-defects into an algebraic accounting system. The divisor is, in the topological evolution chain, the point-state form of defect: a defect localized at a single point, not yet extended to any cycle, sector, or boundary.

Residue converts the point-defects of the divisor into "exchangeable topological currency" through local integration. The residue of $f$ at a pole $z_0$ is

$$\mathrm{Res}_{z_0} f = \frac{1}{2\pi i} \oint_\gamma f(z) \, dz,$$

where $\gamma$ is a small counterclockwise contour enclosing $z_0$ and no other singularity of $f$. The factor $2\pi i$ functions, at $L_2$, as the articulative exchange unit—the analogue of the logarithm at $L_1$. It converts the local pole structure into an integral value, and the integral value is the quantity that downstream theorems compute and compare. The residue is, in the topological evolution chain, the local-monetary form of defect: a point-defect that has been operationalized as a quantity available for exchange.

Period and monodromy together articulate the global-cycle stage. Period concerns the integration of differential forms along cycles on the underlying Riemann surface. For a closed 1-form $\omega$ and a cycle $\gamma$, the period $\int_\gamma \omega$ is, in general, a non-trivial function of the cycle's homology class. The period lattice, which records the values of $\int_\gamma \omega$ as $\gamma$ varies over a basis of cycles, captures the global non-triviality of the Riemann surface's integration structure. Monodromy concerns the behavior of multi-valued holomorphic functions under analytic continuation along closed loops. The function $\log z$, continued around a counterclockwise loop enclosing the origin, returns to its starting point shifted by $2\pi i$; the function $\sqrt{z}$, continued around the origin, returns to its negative. These shifts and sign changes—non-eliminable consequences of continuation—constitute the monodromy of the function. Period and monodromy are not the same phenomenon, but they are intimately related: both articulate the global non-triviality of the Riemann surface's path structure, the period via integration of forms, the monodromy via continuation of functions. They occupy the same stage of the topological evolution chain.

Stokes data and growth at infinity together articulate the boundary-sectoral stage. The boundary of the Riemann sphere is $\hat\infty$, and the behavior of holomorphic functions as they approach $\hat\infty$ is articulated by two complementary structures. Growth at infinity records the asymptotic rate at which a function diverges (or decays) at the boundary; the orders and types of entire functions, together with the Phragmén–Lindelöf principle, organize this structure. Stokes data records the discontinuities in asymptotic expansions across sectoral boundaries near singularities of irregular type. The Stokes phenomenon, originally discovered in the context of differential equations with irregular singular points, articulates the way in which a function's asymptotic expansion in one angular sector may differ from its expansion in an adjacent sector, with the difference encoded in Stokes multipliers. Stokes data and growth at infinity are two aspects of the boundary-sectoral stage: growth at infinity records the asymptotic order; Stokes data record the sectoral mismatches. Together they articulate the defects that arise as the holomorphic structure approaches its boundary.

The six components, organized into four stages, articulate the operational content of $L_2$. The layer's working mathematics—the calculus of residues, the theory of Riemann surfaces, the analytic continuation of multi-valued functions, the asymptotic analysis of solutions to differential equations—takes place within this algebraic structure. The schema's identification of $\omega_\rho^{(2)}$ as the core content of $L_2$-4 (alongside Euler's formula and the Riemann sphere) is the identification that licenses the claim that $L_2$ is, in the practice of mathematics, an operationally rich layer rather than merely the home of the imaginary unit and an elegant identity.

The schema requires an exchange law for $L_2$, by parity with $L_1$'s logarithmic identity (§ 4.5). The natural candidate is the residue theorem:

$$\oint_\gamma f(z) \, dz = 2\pi i \sum_k \mathrm{Res}_{z_k} f,$$

where $\gamma$ is a closed contour and the sum on the right ranges over the singularities $z_k$ of $f$ inside $\gamma$. The residue theorem records, in a single equation, the exchange between a global integral (the contour integral around $\gamma$) and a sum of local quantities (the residues at the enclosed singularities), mediated by the articulative exchange unit $2\pi i$. The role of $2\pi i$ at $L_2$ is structurally parallel to the role of the logarithm at $L_1$: it is the unit through which the layer's local and global perspectives are converted into one another.

The exchange-law pattern, by now, can be exhibited across multiple layers:

• $L_1$: $\log(ab) = \log a + \log b$. The logarithm converts the multiplicative path to the additive path.
• $L_2$: $\oint_\gamma f \, dz = 2\pi i \sum \mathrm{Res}$. The factor $2\pi i$ converts global integral to local residue sum.
• $L_3$: Gödel arithmetization $\#: \mathrm{Formulas} \to \mathbb{N}$ (§ 6.1). The map $\#$ converts formal statements into natural numbers.
• $L_4$: $E = mc^2$. The factor $c^2$ converts mass to energy.
• $L_5$ (equilibrium regime): $S = k_B \ln W$. The factor $k_B$ converts microstate counts to entropy.

The recurrence of this pattern across layers is one of the schema's non-trivial predictions, and the prediction holds in each case where it can be checked.

An alternative form of the $L_2$ exchange law is the argument principle:

$$\oint_\gamma \frac{f'(z)}{f(z)} \, dz = 2\pi i (N - P),$$

where $N$ and $P$ count, respectively, the zeros and poles of $f$ inside $\gamma$ (with multiplicities). The argument principle records the same kind of exchange as the residue theorem—global integral converted to local count via the unit $2\pi i$—and exhibits the same structural pattern. Both are admissible articulations of the $L_2$ exchange law; the residue theorem has wider scope, but the argument principle is sometimes more illuminating for specific applications.

5.5 The $L_2$ closure remainder and the path to $L_3$

The closure of $L_2$ produces, in keeping with the schema's closure adequacy condition (§ 3.5), an unincorporable remainder that triggers the next layer. The remainder is the family of multi-valued behaviors and monodromy data that resist single-valued resolution within $L_2$. We must be careful about the exact form of the triggering, however, since previous formulations of the SAE framework have, in our view, been too quick in identifying this remainder as immediately forcing $L_3$.

The multi-valued behaviors—$\log z$, $\sqrt{z}$, branch cuts, monodromy around singularities—are, in the first instance, handled within $L_2$, by means of Riemann surfaces, covering spaces, and sheaf-theoretic machinery. The function $\log z$, multi-valued on $\mathbb{C} \setminus \{0\}$, becomes single-valued on its Riemann surface, the universal cover of $\mathbb{C} \setminus \{0\}$. The function $\sqrt{z}$ becomes single-valued on its double cover. Branch cuts are not articulated as obstacles to be circumvented but as data of a covering structure. Monodromy is not articulated as an obstacle but as the structure group of the covering. The machinery of Riemann surfaces, covers, and sheaves is precisely the machinery by which $L_2$ articulates and absorbs its own multi-valued remainders.

What, then, triggers $L_3$? Not the multi-valued behaviors as such, since these are absorbed by $L_2$'s internal machinery. The trigger is the transformation of path-dependence into a question of rule, proof, decidability, or formal system. When the question is no longer "what is the value of $\log z$ at a given point?" (which the Riemann surface answers) but "which branch of $\log z$ is the correct one for a given application?" (which involves a choice that must be justified by criteria external to the function itself), the articulation has crossed into territory that $L_2$ cannot fully resolve. The question "is the multi-valued continuation of this function decidable in a given formal system?" cannot be settled by Riemann-surface methods alone; it requires the apparatus of formal systems, computability, and proof theory that $L_3$ articulates.

The transition from $L_2$ to $L_3$ is, accordingly, not a transition forced by the existence of multi-valued behaviors. It is a transition forced by the articulative re-framing of path-dependence as a question of rule and proof. The remainders of $L_2$ are absorbed by $L_2$'s own machinery; the residual question that $L_2$ cannot absorb is the meta-level question of the rules under which absorption is performed. $L_3$, with its formal systems, its definability hierarchy, its Turing degrees, articulates the answer to this meta-level question. The collaboration between $L_2$ and $L_3$ at this boundary is productive: $L_2$ provides the operational defect algebra; $L_3$ provides the meta-level rule articulation. Neither layer subsumes the other.

The articulation of $L_3$ as the meta-level layer that absorbs the residue of $L_2$'s self-articulation is the subject of § 6.1.

---

6. $L_3$, $L_4$, and $L_5$: parallel displays from the four phases

The three layers treated in this section stand in a different relation to the schema than do $L_1$ and $L_2$. The first two layers are the mathematical content of the paper, articulated in the detail that an architectural philosophy of mathematics requires. The three layers of the present section play a more limited role: they are displays of the same four-phase pattern at distinct articulative levels, and their function in the paper is to exhibit the schema's reach across mathematics, formal logic, physics, and statistical thermodynamics, rather than to claim mathematical primacy over any of them.

This limitation requires explicit framing. The temptation, in a paper proposing an architectural schema, is to present each new layer as a derivation from the previous one, so that the schema becomes a generative procedure rolling through mathematics into formal logic into physics into thermodynamics. The present paper resists this presentation. The layers $L_3$, $L_4$, $L_5$ are not derived from $L_2$ in the way that $L_2$ is articulated as the response to $L_1$'s remainder. They are, instead, parallel displays of the four-phase pattern at articulative levels that are independent of each other and independent of mathematics. The four-phase pattern of Methodology 0 is inherited by each layer from the same source—negativa interrogating itself—not transmitted from mathematics to the higher layers. Mathematics is one display; formal logic is another; physical spacetime is another; statistical thermodynamics is another. The schema articulates each as a four-step structure, but the schema does not claim that mathematics is prior to or constitutive of any of the others.

The motivation for this framing is twofold. First, the contrary framing—mathematics-as-foundation for physics and thermodynamics—would commit the SAE framework to a form of physicalism inversion, in which the articulative content of physics is treated as derived from the articulative content of mathematics. SAE's foundational commitments do not permit this: mathematics, on the SAE account, is one mode of articulation rather than a substrate of reality, and physics is another mode of articulation that addresses its own object (mass-energy-spacetime) on its own articulative terms. Second, the present paper's main scope is mathematics. The presentation of $L_4$ and $L_5$ here is not a contribution to the philosophy of physics or thermodynamics; it is a brief exhibition of the schema's pattern at those layers, deferring substantive treatment to Cross-Layer Closure Equations [DOI: 10.5281/zenodo.19361950] and to the four-forces and cosmology series. The reader interested in the physical layers should consult those papers; the brief treatment here serves only to indicate the schema's cross-layer parallel.

With this framing, the three layers can be treated in succession.

6.1 $L_3$: formal systems, computability, and the diagonal closure

A cross-series clarification is required at the outset. The symbol $L_3$ appears in different SAE series with different content. In the dynamical-systems series, $L_3$ refers to a dynamical-layer index of a particular kind; in the cosmology series, $L_3$ may refer to a cosmological articulative level distinct from the mathematical and dynamical uses. In the present paper, $L_3$ refers specifically to the layer of formal systems, computability, and decidability—the mathematics of provability, definability, and Turing degrees, as developed in the post-Gödelian tradition. The three usages are not in conflict: they are parallel displays of the four-phase pattern at distinct articulative levels, each productive within its own context. Readers crossing between SAE series should attend to the difference; the present section's $L_3$ is the formal-logical $L_3$, and nothing in this paper depends on identifying it with the $L_3$ of the dynamical or cosmological series.

The four steps of $L_3$ in the formal-logical sense may be summarized as follows.

Step	Phase	Content
$L_3$-1	nothing	Prov / True predicates marked at the meta-level
$L_3$-2	being	Formal systems and theorems as meta-level entities
$L_3$-3	neither being nor nothing	Turing degrees, the arithmetic hierarchy via complexity memory
$L_3$-4	negation of the third	Gödel diagonal closure: $G \leftrightarrow \neg\,\mathrm{Prov}(\ulcorner G \urcorner)$

At $L_3$-1, the predicates $\mathrm{Prov}$ ("provable in formal system $T$") and $\mathrm{True}$ ("true in model $M$") are marked at the meta-level. These predicates are not objects in the object language; they sit above the formal system, articulating relations between the system and its statements. The structural parallel with $L_{1\text{-}1}$ (the marking of "1") and $L_2$-1 (the marking of $i$) is preserved: a handle is marked but not yet operationally developed.

At $L_3$-2, formal systems and their theorems function as positive entities at the meta-level. Proofs iterate by logical derivation steps; theorems can be enumerated through Gödel numbering, and the enumeration carries over the iterability of the additive path that $L_3$'s schema-step requires. The boundary marker of this iteration is the unprovable truths: statements true in the standard model but unreachable by the formal system's proof procedure. The unprovable truths function at $L_3$ as $\pm\infty$ functioned at $L_{1\text{-}2}$: as the asymptotic horizon that the iteration approaches but does not reach. Gödel's incompleteness theorem (1931) is, on this reading, the articulation of $L_3$'s additive-path boundary structure.

At $L_3$-3, the multiplicative-path role is filled by the Turing degree hierarchy and the arithmetic hierarchy ($\Sigma_n$, $\Pi_n$, and beyond). These hierarchies organize formal systems and predicates by complexity, and the organization functions as a memory binding in the schema's sense: a system's place in the hierarchy records the complexity-history of its formation, in a manner analogous to the iteration-count binding of $L_{1\text{-}3}$. Nested provability statements—$\mathrm{Prov}_T(\mathrm{Prov}_T(\phi))$, and higher iterations—articulate, in their place within the hierarchy, the binding of complexity across formal-system levels. The boundary marker of this multiplicative path is $0'$, the halting-problem degree: the first Turing jump, unreachable from the base degree by computable means.

At $L_3$-4, the closure step is the Gödel diagonal fixed-point construction:

$$G \leftrightarrow \neg\,\mathrm{Prov}(\ulcorner G \urcorner).$$

The statement $G$ asserts its own unprovability in $T$ (assuming $T$ to be a consistent formal system extending sufficient elementary arithmetic). The diagonal lemma guarantees the existence of such a $G$ for any formula $\Phi$ with one free variable: in particular,

$$\exists G \quad G \leftrightarrow \Phi(\ulcorner G \urcorner).$$

The Gödel sentence is the case where $\Phi(x) = \neg\,\mathrm{Prov}(x)$. The diagonal construction is the closure articulation of $L_3$: it produces a closure state (the formal system $T$, equipped with its provability predicate and the diagonal-fixed-point construction) together with an unincorporable remainder (the truth-value of $G$, which the formal system cannot adjudicate from within).

The geometric content of this closure is best brought out by the observation that Gödel arithmetization, considered topologically, performs a knotting operation. The arithmetization function $\#: \mathrm{Formulas} \to \mathbb{N}$ embeds the meta-level logical manifold (the space of provability assertions over formal statements) into the object-level arithmetic manifold ($\mathbb{N}$). The embedding is not isotopically trivial: the meta-level structure is forced into the object-level structure in a way that produces an irreducible residue. Gödel incompleteness is, on this reading, the unknottable residue of the embedding—the structural feature that survives in the embedded image and cannot be removed by any reparameterization.

This articulation parallels the operational defect algebra of $L_2$: where $L_2$'s defects (residues, periods, monodromies, Stokes data) record the irreducible features of holomorphic structure under integration and continuation, $L_3$'s incompleteness records the irreducible features of meta-level structure under embedding into the arithmetic object level. Both layers exhibit, in this sense, a defect ledger—a systematic accounting of the irreducible residues left over by an articulation that cannot be absorbed into the layer's own resources. The schema's identification of $L_2$'s operational defect algebra and $L_3$'s incompleteness phenomena as parallel articulations of the same underlying structural form is a non-trivial observation, and one that the schema's via rho reading makes natural.

The exchange law of $L_3$ is Gödel arithmetization itself:

$$\#: \mathrm{Formulas} \to \mathbb{N}.$$

The function $\#$ converts the meta-level objects (formal statements) into object-level objects (natural numbers), and the conversion is the articulative unit of $L_3$'s exchange law. The pattern recurs in the schema's cross-layer exchange-law table (§ 4.5, § 5.4): at $L_3$, the articulative unit is the arithmetization map, just as $\log$ was the unit at $L_1$ and $2\pi i$ at $L_2$.

We note, finally, that the more refined apparatus of computability theory—relative Turing degrees, the structure of degree spaces, fine-grained closure formulas of the form $\deg^{0'}(A)$ for $A \le_T 0'$—belongs at $L_3$-3 (the multiplicative-path stage) rather than at $L_3$-4 (the closure stage). Fine articulations of cross-layer closure equations involving such structures appear in Cross-Layer Closure Equations [DOI: 10.5281/zenodo.19361950] and in ZFCρ Paper II [DOI: 10.5281/zenodo.18927658]. The present paper does not claim a unique closed form for the $L_3$ closure equation beyond the diagonal articulation just exhibited.

6.2 $L_4$: relativistic spacetime (a parallel display)

The fourth layer, $L_4$, is the layer of relativistic spacetime. Its content is not mathematics; it is the articulative structure of mass-energy in the spacetime of special and general relativity. We present it here only as a display of the four-phase pattern at this articulative level, in the briefest form consistent with the schema's exhibition. The substantive treatment is reserved for the four-forces series and Cross-Layer Closure Equations.

Step	Phase	Content (physical layer parallel display)
$L_4$-1	nothing	$ct$ and $G$ marked as articulative handles
$L_4$-2	being	Spacetime translations and geodesics as positive entities
$L_4$-3	neither being nor nothing	Curvature and gauge symmetries as memory bindings
$L_4$-4	negation of the third	Event horizon closure $rc^2 - 2GM = 0$

At $L_4$-1, the constants $ct$ (causal unfolding, the kinematic aspect of spacetime) and $G$ (the gravitational coupling, the dynamical aspect) are marked as articulative handles. At $L_4$-2, spacetime translations and geodesic structure populate the additive path, with positive entities being the world-lines and proper-time intervals of free particles. At $L_4$-3, curvature articulates the multiplicative path: the Riemann curvature tensor records, non-locally across spacetime regions, the binding of geometric content that the local additive structure cannot capture. Gauge symmetries supply additional memory structure for the non-gravitational interactions. At $L_4$-4, the closure equation

$$rc^2 - 2GM = 0$$

records the Schwarzschild event-horizon condition: the radius $r$ at which the gravitational potential of a mass $M$ equals the squared speed of light, marking the closure of the spacetime articulation in the strong-field regime. This is the closure formula in the schema's sense for $L_4$.

The exchange law of $L_4$ is the mass-energy equivalence

$$E = mc^2,$$

with $c^2$ functioning as the articulative unit. The pattern is identical in form to the exchange laws of the lower layers, with the unit appropriate to the layer's content.

The treatment is brief by design. The substantive philosophical and physical interpretation of these articulations—the meaning of curvature, the status of the event horizon, the role of gauge symmetries, the relation between mass and energy—is the task of the four-forces and cosmology papers, and we do not undertake it here. The display exhibits the schema's pattern at $L_4$; it does not advance a substantive claim in the philosophy of physics.

6.3 $L_5$: thermodynamics (a parallel display with partial breakdown)

The fifth layer, $L_5$, is the layer of statistical thermodynamics. Its content is, again, not mathematics; it is the articulative structure of macroscopic systems in terms of microscopic states. The treatment is again brief, and the substantive philosophy of thermodynamics is deferred to the cosmology and four-forces series.

A distinguishing feature of $L_5$, however, deserves note: the four-step pattern partially breaks down at this layer. The first two steps are recognizable, but the third and fourth steps undergo a regime-dependent breakdown that has no parallel at the earlier layers. This breakdown is itself an articulative content, and we discuss it explicitly.

Step	Phase	Articulative status
$L_5$-1	nothing	Entropy $S$ and $\ln W$ marked as articulative handles
$L_5$-2	being	Extensive iteration ($S = S_A + S_B$); irreversibility direction
$L_5$-3	neither being nor nothing	Multiplicative-path articulation does not cleanly apply in non-equilibrium and living-system regimes
$L_5$-4	negation of the third	No clean closure formula analogous to lower layers; $S - k_B \ln W = 0$ as a conditional closure in the equilibrium regime

At $L_5$-1, the entropy $S$ and the microstate count $\ln W$ are marked as articulative handles. At $L_5$-2, the extensive property of entropy ($S_{A \cup B} = S_A + S_B$ for non-interacting subsystems) and the time-arrow of irreversible processes populate the additive path. At $L_5$-3, however, the multiplicative-path articulation breaks down in regimes far from thermodynamic equilibrium: the memory-binding structure that the schema's third step requires does not have a clean form in non-equilibrium statistical mechanics. Markovian versus non-Markovian processes, the question of which distributions are well-defined under irreversible dynamics, the proper treatment of entropy production in driven systems—these are areas of active research without settled multiplicative-path articulations. At $L_5$-4, correspondingly, there is no closure formula at $L_5$ analogous to Euler's at $L_2$ or Schwarzschild's at $L_4$; the Boltzmann relation

$$S - k_B \ln W = 0$$

functions as a conditional closure, valid in the equilibrium regime ($\eta = 0$, in the notation of Cross-Layer Closure Equations) and breaking down as the system departs from equilibrium.

The exchange law of $L_5$, in its equilibrium regime, is the Boltzmann relation $S = k_B \ln W$ itself, with $k_B$ functioning as the articulative unit converting microstate counts into entropic content. Outside the equilibrium regime, the exchange law has no clean closed form.

This breakdown is not a defect of $L_5$ as a layer of articulation; it is the layer's content. The breakdown of closure-equation articulation at $L_5$ is precisely what marks the boundary between two articulative modes—the closure-equation grammar of $L_1$ through $L_4$ (and equilibrium $L_5$), and the probability-distribution grammar that takes over as the system departs from equilibrium. The articulation of this boundary is the subject of § 7.

6.4 Specific mathematical instances of the $L_5$ breakdown

The breakdown of the closure-equation articulation at $L_5$ is not a vague philosophical claim; it has specific mathematical instances, recognizable in the practice of mathematics and physics. We list five.

Non-equilibrium thermodynamics. The entropy production rate $dS/dt$ is positive in any irreversible process, and the closure equation $S - k_B \ln W = 0$ fails: the equation describes a particular instantaneous state, but it does not describe the time-evolution of the state under irreversible dynamics. The articulative content of non-equilibrium thermodynamics is articulated not by a closure equation but by entropy production formulas, fluctuation theorems, and the probability distributions over phase-space trajectories.

Non-uniqueness of invariant measures in ergodic theory. For a given dynamical system, multiple invariant measures may coexist, none of which is privileged over the others by a closure equation. The articulative content is articulated through the space of invariant measures, equipped with its weak-star topology, and through the relations between invariant measures and the system's symbolic dynamics.

Phase transitions and critical phenomena. At a critical point, correlation lengths diverge, and the multiplicative-path articulation fails: the system exhibits scale-invariant fluctuations that have no clean closure formula. The articulative content is articulated through scaling exponents, universality classes, and the renormalization group, all of which are probability-distribution structures rather than closure equations.

Algorithmic randomness and Kolmogorov complexity. The randomness of an infinite sequence is articulated by the unconditional incompressibility of its finite prefixes: a sequence is algorithmically random if no finite program can produce its initial segments shorter than the segments themselves. The articulation is probabilistic in its foundations; no finite multiplicative-path construction can produce a random sequence as a closure value.

Living systems. Biological systems operate far from equilibrium, with $\eta$ approaching $1$ in the notation of Cross-Layer Closure Equations. The closure-equation articulation fails comprehensively in this regime, and the articulation of living systems requires the full apparatus of probability-distribution mathematics—measure theory, ergodic theory, statistical inference, the theory of stochastic processes—along with the more specialized tools of systems biology, evolutionary dynamics, and information theory.

These five instances are not exhaustive, but they suffice to indicate that the $L_5$ breakdown is identifiable in specific mathematical contexts. The breakdown is not a hand-waving claim about "complexity" or "chaos"; it is the breakdown of a specific articulative grammar (closure-equation) in specific mathematical regimes, with a specific replacement grammar (probability-distribution) ready to take over.

---

7. The scope boundary: two complementary modes within mathematics

The schema's display at the first four layers exhibits a coherent articulative pattern: marked handle, additive path, multiplicative path, closure with remainder, with the closure of each layer triggering the next. The breakdown at $L_5$, on the other hand, exhibits a different phenomenon: the articulation does not cease, but it changes character. The closure-equation grammar that organized the first four layers gives way to a probability-distribution grammar that organizes the regimes in which closure equations fail. This section articulates the boundary between these two grammars and the regime-dependent transitions across it.

7.1 Closure-equation grammar and probability-distribution grammar

The articulative content of mathematics, on the present account, is expressed in two complementary grammars. Both are mathematical; neither is reducible to the other; each is productive within the regimes for which it is suited.

The closure-equation grammar organizes mathematical articulation by exact closure equations integrating articulative handles. This is the grammar of $L_1$ through $L_4$, and of the equilibrium regime of $L_5$. Its characteristic equations are the Cauchy completion to $\mathbb{R}$, Euler's formula $e^{i\pi} + 1 = 0$ and the residue theorem, Gödel's diagonal fixed-point construction, the Schwarzschild closure $rc^2 - 2GM = 0$, the Boltzmann relation $S - k_B \ln W = 0$. Its characteristic methods are derivation, identity-establishing, and the verification of closure conditions. The grammar is productive in regimes where the closure conditions can be exactly stated and exactly verified.

The probability-distribution grammar organizes mathematical articulation by probability distributions, measures, and the algebraic structures associated with them. This is the grammar of $L_5$'s non-equilibrium regimes, of probability theory broadly, of ergodic theory and measure theory, of algorithmic randomness, of the renormalization group and critical phenomena. Its characteristic objects are sigma-algebras and the measures upon them, invariant measures and their spectral structure, complexity functions, distribution families, and the limit theorems that relate them. Its characteristic methods are the derivation of distributional consequences, the proof of convergence theorems, and the establishment of regime conditions under which one distribution gives way to another. The grammar is productive in regimes where the closure conditions cannot be exactly stated, but the distributional structure can.

Three features of this distinction deserve emphasis.

The relation between the grammars is complementary, not hierarchical. It is not the case that the probability-distribution grammar is a "successor" to the closure-equation grammar, in the sense in which complex analysis is a successor to real analysis (the latter contained as a special case). The two grammars are co-extensive within mathematics, each productive within its scope, and each unable to substitute for the other. Closure-equation mathematics cannot articulate non-equilibrium thermodynamics; probability-distribution mathematics cannot articulate Euler's formula. The schema's identification of the $L_5$ breakdown as a transition from one grammar to the other is not a ranking; it is a recognition of complementary productivity.

The boundary is not mathematics-versus-non-mathematics. Probability theory is mathematics: measure theory, ergodic theory, Kolmogorov complexity, the theory of stochastic processes are all rigorous mathematical disciplines, and the present paper does not propose otherwise. The articulative boundary is internal to mathematics: it is the boundary between two grammars within the mathematical enterprise, not the boundary between mathematics and some non-mathematical articulative practice.

Each grammar has its productive regime. The closure-equation grammar is productive in regimes where the articulative handles can be exactly enumerated and the closure conditions exactly stated. This is paradigmatically the case for $L_1$ through $L_4$, and for the equilibrium regime of $L_5$ (small departures from equilibrium can be handled by linear-response theory, which is closure-equation-style in the relevant sense). The probability-distribution grammar is productive in regimes where exact closure is unavailable but distributional structure is. These regimes include far-from-equilibrium thermodynamics, ergodic-theoretic systems, critical-point phenomena, algorithmic-complexity contexts, and the rich domain of living systems and evolutionary dynamics.

7.2 Articulative-boundary phenomena as regime-dependent transitions

The boundary between the two grammars is not a sharp boundary along a particular mathematical layer. It is a regime-dependent transition: the same physical system, examined in different parameter ranges, may exhibit either closure-equation behavior or probability-distribution behavior, with the crossover determined by the system's regime. The schema does not stipulate which grammar applies to which system; the grammar is selected by the regime.

Six examples may indicate the scope of this regime-dependence.

Fluid mechanics. Laminar flow at low Reynolds number is articulated by the Navier–Stokes equations, with exact solutions available in many cases (Couette flow, Poiseuille flow, low-Reynolds spheres in fluid). The articulation is closure-equation. Turbulent flow at high Reynolds number is articulated by statistical patterns: energy cascade theory, structure functions, intermittency exponents. The articulation is probability-distribution. The Reynolds number is the regime parameter; the transition occurs at intermediate Reynolds numbers, with no sharp boundary.

Quantum mechanics. The wave function $\psi$ evolves deterministically under the Schrödinger equation, and the evolution is closure-equation-style. The outcome of a measurement is probabilistic, articulated by the Born rule applied to $|\psi|^2$, and the articulation is probability-distribution-style. The two grammars coexist within quantum theory: the wave function's evolution and the measurement's outcome are both quantum-mechanical, but they are articulated in different grammars. The "regime" here is the choice of whether to consider unitary evolution or projective measurement, and both are part of the standard quantum-mechanical articulation.

The double pendulum. For small oscillations around the downward equilibrium, the double pendulum is integrable, with normal-mode coordinates and exact periodic solutions. The articulation is closure-equation. For large oscillations, the double pendulum exhibits chaotic dynamics, with positive Lyapunov exponents and sensitivity to initial conditions. The articulation requires probability-distribution methods—invariant measures, Lyapunov spectra, fractal-dimension calculations. The amplitude is the regime parameter.

The three-body problem. Specific configurations admit exact solutions: the Lagrange points, the Sundman series for triple collisions, the figure-eight orbit and other choreographies. For these configurations, the articulation is closure-equation. Generic configurations exhibit chaotic behavior in significant portions of phase space, with the articulation requiring probability-distribution methods—the distribution of orbit types, the Poincaré sections, the topological structure of the chaotic regions.

Weather and climate. Short-term forecasts (hours to days) are articulated by initial-value-problem solutions of the atmospheric equations, in a regime where the system's predictability time-scale exceeds the forecast horizon. The articulation is closure-equation. Long-term climate patterns (decades to centuries) are articulated by climate statistics—mean values, variabilities, extremes—because deterministic prediction is impossible at those time-scales. The articulation is probability-distribution. The forecast horizon is the regime parameter.

Neural networks. In some training regimes, neural networks exhibit closure-equation behavior: gradient descent in the linear regime, the convergence of overparameterized networks to interpolating solutions, the analytical solutions of certain mean-field limits. In other regimes, the articulation requires probability-distribution methods: the loss-landscape topology, the distribution of generalization gaps, the stability of learned representations. The regime depends on the network's architecture, the training procedure, and the data distribution.

In each of these cases, the same system, examined under different parameter conditions, transitions between the two grammars. The transition is not sharp—there is no single value of the regime parameter at which the closure-equation grammar fails and the probability-distribution grammar takes over—but the transition is real, in the sense that the productive grammar shifts as the regime changes. The articulative boundary is, accordingly, best understood not as a fixed line within mathematics but as a regime-dependent transition that may apply differently to different systems.

The parameter $\eta$ in the notation of Cross-Layer Closure Equations measures the boundary tightness: $\eta = 0$ in the regime where the closure-equation grammar is productive; $\eta \to 1$ in the regime where the probability-distribution grammar takes over; intermediate values of $\eta$ correspond to regimes in which both grammars are partly productive and the choice between them is a matter of convenience.

7.3 Living systems as remainder freely unfolding

The treatment of living systems requires brief separate attention, since they exemplify the $\eta \to 1$ regime in a distinctive form.

We import here two principles from Cross-Layer Closure Equations. The first, P1, asserts that remainders must accumulate and develop: the residues that one closure produces become the starting handles of the next, and the chain of articulations is ongoing rather than terminal. The second, P2, asserts that remainders are conserved across the closure-equation chain: each closure equation balances the layer's articulative content with the residue passed to the next layer, and the chain as a whole maintains a coherent accounting. P2 holds in the closure-equation regimes ($L_1$ through $L_4$, and equilibrium $L_5$); P1 holds in all regimes.

In the $\eta \to 1$ regime of living systems, P2 fails: there is no closure equation that balances the layer's articulative content, and the conservation accounting that P2 enforces cannot be made to hold. But P1 continues to hold: remainders continue to accumulate and develop, in this regime via probability-distribution articulations rather than closure-equation articulations. Living systems are, on this account, articulations of accumulating remainder freely unfolding in the absence of P2's conservation constraint. They are not failures of mathematics; they are the productive operation of the probability-distribution grammar in the regime where the closure-equation grammar's conservation accounting cannot apply.

This articulation aligns with the cosmology and four-forces papers' treatment of $\eta$ as a regime parameter, and with the SAE framework's broader commitment to articulation as accumulating-remainder activity rather than as approaching-truth activity. The scope boundary of the closure-equation grammar at $L_5$ is, in this sense, the boundary at which P2 lets go and P1 takes full charge. The grammar shifts because the constraint changes; the mathematics continues, in a different articulative mode.

---

8. Inexhaustibility and localized articulation

The four-step schema, articulated across $L_1$ through $L_5$, exhibits a coherent structural pattern. It is tempting, at this point, to ask whether the schema completes the philosophical articulation of mathematics: whether, having shown the pattern at five layers and indicated the boundary at the fifth, one might claim to have given the architecture in full. The present paper resists this temptation. Mathematical content is inexhaustible at the object level, and articulation frameworks for mathematics are inexhaustible at the meta level. The schema is, accordingly, offered not as completion but as one productive specific framework operating within this twofold inexhaustibility. This section develops the meta-thesis explicitly.

8.1 The localized character of $\rho$ articulation

We begin with an observation about the structure of remainders. The $\rho$ articulation of Methodology 00 is not a global, layer-spanning object that the schema gradually reveals. It is a localized articulative structure: each layer, each sub-layer, each path within a sub-layer articulates its own $\rho$. The ZFCρ series traces the $\rho$ specific to the $L_{1\text{-}2}$ choice operation; the multiplicative path of $L_{1\text{-}3}$ articulates its own prime-structure and factorization remainders; $L_2$ articulates the operational defect algebra $\omega_\rho^{(2)}$; $L_3$ articulates the definability-complexity remainders that the Turing-degree hierarchy organizes. Each of these is a $\rho$ articulation in its own right; none is reducible to the others.

This localized structure has an articulative consequence: mathematical productivity occurs at localized scopes rather than at the global scope of a unified $\rho$. The schema does not promise a single theory that captures all $\rho$ articulations; it organizes their relationships into the four-step pattern at each layer, but it does not collapse the localized $\rho$ structures into a single object. The articulation of mathematics, on this account, is a structured plurality of localized productivities rather than a unified global articulation.

8.2 Four kinds of inexhaustibility

The inexhaustibility of mathematics, on the present account, takes four distinguishable forms. The four forms are not mutually exclusive; they articulate different aspects of the same underlying phenomenon, and they reinforce one another.

Intra-layer operational inexhaustibility. Within any given layer, the articulative work is ongoing without terminus. The multiplicative path of $L_{1\text{-}3}$, considered narrowly, has been worked on by mathematicians for centuries—from the Greek arithmetic of Diophantus through the algebraic number theory of the nineteenth century through the contemporary work on the Riemann hypothesis—and the work is not complete. The $L_2$ operational defect algebra, considered narrowly, has been worked on from Cauchy through Riemann through the modern theory of Stokes phenomena and resurgent asymptotics, and the work is not complete. At each layer, what the schema articulates as a four-step pattern is, internally, an inexhaustible field of mathematical work. The schema specifies the layer's architectural role; it does not specify, and does not pretend to specify, the layer's internal content.

Inter-layer transition inexhaustibility. The chain of layer-transitions—$L_1 \to L_2 \to L_3 \to \ldots$—is itself ongoing. The present paper articulates the schema explicitly through $L_5$, with a partial breakdown at $L_5$-3 indicating the transition to the probability-distribution grammar. Whether and how the schema extends to articulative levels beyond mathematics—into the articulation of living systems, of subjectivity, of social structure—is a question for further work, not a settled matter. The chain does not, on the schema's reading, have an articulative endpoint at which the question "and what comes after?" ceases to make sense.

Path-branching inexhaustibility. Within each layer, the articulation admits multiple paths, none of which is privileged over the others in advance. At $L_{1\text{-}4}$, the closure to $\mathbb{R}$ is one path; the $p$-adic closures $\mathbb{Q}_p$ are alternative paths, articulated through different completions of $\mathbb{Q}$; non-standard analysis offers a further path, articulated through ultraproducts and infinitesimals; surreal numbers offer yet another. At $L_2$, the standard complex-analytic path is one articulation; the quaternionic and octonionic extensions are alternatives, each with its distinctive cost; the Cayley–Dickson progression articulates a sequence of further alternatives. The schema is compatible with multiple paths at each layer, and the inexhaustibility of paths is itself an articulative content.

Meta-articulation recursive inexhaustibility. The articulation of the $\rho$ structure as a recursively enumerable structure produces, in its own right, an articulative remainder at the meta-level. This is the Gödel-incompleteness-isomorphic structure of the framework itself: any specific framework cannot capture all of the articulative handles it produces, on pain of producing a meta-articulation that itself stands outside the framework. The schema, qua framework, exhibits this recursive structure: the articulation of layers $L_1$ through $L_5$ produces, at the meta-level, the question of what frame articulates the schema's own articulation, and this question is itself inexhaustible.

The four forms of inexhaustibility, taken together, articulate the object-level inexhaustibility of mathematics. They are not four claims that mathematics has multiple unsolved problems; that is true but trivial. They are four structural articulations of mathematics's status as an ongoing articulative activity rather than as a finished body of content.

8.3 Inexhaustibility as the nature of articulative frameworks

The reading of inexhaustibility just developed treats inexhaustibility as a positive structural feature of mathematics, not as a defect or limitation. Several reformulations of the same point may help to fix this reading.

Mathematics, on the schema's reading, does not approach completion. There is no horizon at which mathematics, if extended sufficiently, would conclude; there is no asymptotic limit toward which mathematical work tends. The reading is not that mathematical work is unending in the sense of being unable to finish what it started; the reading is that mathematical work is ongoing articulation, with the ongoingness constitutive of the practice rather than merely incidental to it.

Mathematics is productive at localized scopes rather than at a unified global scope. The unity of mathematics, insofar as it has unity, is not the unity of a single closed theory but the unity of an articulative practice that links localized productivities through structured relations. The schema articulates such relations; it does not subsume the localized productivities under a single closed articulation.

Mathematical progress, on this account, is the accumulation of partial articulation rather than the approach to total articulation. Cantor's theory of cardinals did not bring mathematics closer to a final state; it added an articulation to the practice. Gödel's incompleteness theorems did not foreclose further articulation; they articulated a structural feature of formal systems that subsequent work has continued to elaborate. Cauchy's rigorization did not complete analysis; it shifted analysis to a new articulative regime within which further work could be done. Each of these is partial articulation accumulating, not partial articulation approaching completion.

The reading is consistent with the historical record of mathematics. The list of long-standing open problems—the Riemann hypothesis, the $P$ versus $NP$ question, the unification of physical interactions, the foundational status of category theory and homotopy type theory—is not a list of failures but a list of articulations still in progress. Each is a productive site of ongoing work, and the productivity of the work does not depend on the eventual resolution of any specific problem. The framework's commitment to inexhaustibility is, in this respect, in agreement with the practical experience of mathematicians.

8.4 Inexhaustibility and the SAE methodological foundation

The inexhaustibility of mathematics, articulated in four kinds in § 8.2, aligns with deeper principles of the SAE methodological foundation. The alignment is worth recording, since it situates the present paper's meta-thesis within the broader SAE program.

The principle of construction-without-closure (构不可闭合) developed in Methodology 0 asserts that any articulative construction produces a remainder that the construction itself cannot incorporate. The present paper's claim that mathematics is inexhaustible is, at the mathematical articulation level, an instance of this principle: mathematics, as articulative construction, produces remainders that the construction itself cannot absorb. The four-step schema records, layer by layer, how the construction-without-closure principle operates within mathematical articulation.

The principle of P1 and P2 unification developed in Cross-Layer Closure Equations asserts that the development of remainders (P1) and the conservation of remainders across closure equations (P2) are not independent principles but jointly govern the articulative chain. The present paper's claim that mathematics is inexhaustible, in its inter-layer transition aspect, is an instance of P1: the chain of layer-transitions is ongoing because remainders continue to accumulate and develop. The breakdown at $L_5$ that the schema records is an instance of P2's regime-dependence: in regimes where the closure-equation grammar is productive, P2 holds; in regimes where the probability-distribution grammar takes over, P2 lets go and P1 takes full charge.

The principle of chisel-construct cycling developed in SAE Methodological Overview Paper I asserts that the cycle of chisel-construct-remainder-bridge-thing-in-itself is itself non-terminating: the cycle does not converge to a stable end point, but produces, at each iteration, a new remainder that initiates the next cycle. The present paper's claim that mathematics is inexhaustible articulates, at the mathematical articulation level, the non-terminating character of the chisel-construct cycle.

These three principles—construction-without-closure, P1 / P2 unification, chisel-construct cycling—and the present paper's four-fold inexhaustibility articulate the same underlying commitment of the SAE program: that articulation is productive ongoing activity rather than approach-to-truth activity, with the ongoingness internal to the productivity. The present paper's contribution is to articulate this commitment specifically at the level of mathematical content, with the schema as the structural account of how the commitment plays out across layers.

8.5 The twofold inexhaustibility meta-thesis

The four-fold inexhaustibility of § 8.2 articulates the object-level inexhaustibility of mathematics: the inexhaustibility of mathematical content under articulation. The present paper's meta-thesis adds a second level: the inexhaustibility of articulation frameworks for mathematics. Together, the two levels articulate the twofold inexhaustibility of the mathematical-articulative situation.

At the object level, mathematical content is inexhaustible in the four senses just articulated: intra-layer, inter-layer, path-branching, meta-articulation recursive. This is the inexhaustibility that the four-step schema, applied to each layer, records.

At the meta level, articulation frameworks for mathematics are inexhaustible: the schema is one productive specific framework among ongoingly possible alternatives. Other frameworks—Platonist, formalist, constructivist, structuralist, category-theoretic, homotopy-type-theoretic—articulate distinct angles on mathematical practice, and each is productive within its scope. The present paper does not claim that the schema supersedes these frameworks or that it should be preferred to them in some context-free sense. It claims that the schema is one productive articulation, falsifiable in its specific claims (via the adequacy criteria of § 3.5 and the failure modes of § 3.6), explicit in its claim-strength stratification (§ 1.3), and honest about the scope it does not claim to cover (§ 1.5).

The twofold inexhaustibility is, in this sense, a working commitment rather than a closing claim. It commits the schema to operating without claiming completion at the object level (mathematics is not closed) and without claiming uniqueness at the meta level (the schema is not the only framework). The commitment is not a hedge: it does not weaken the schema's specific claims, which are made and defended in the body of the paper. It is, rather, the articulative honesty that the schema's status as one productive specific framework requires.

We note, in closing, that this meta-thesis is itself an articulative commitment of the present paper, and the paper offers it as such. Readers who disagree with the meta-thesis—who hold, for instance, that the philosophy of mathematics must aim at a single correct framework, or that mathematical content can in principle be exhaustively articulated—will, naturally, evaluate the present paper differently than readers who share the meta-thesis. The disagreement is itself part of the productive plurality that the meta-thesis articulates, and the present paper does not propose to resolve it by exclusion.

---

9. Series outlook and the ZFCρ interface

The present paper, as an architectural articulation of SAE mathematics, stands in specific relations to other papers in the SAE program. This section makes these relations explicit and indicates the direction of further work in the series.

9.1 The ZFCρ series and the present paper

The ZFCρ series is the most technically developed mathematical work in the SAE program at the time of writing, with seventy-three papers in active development tracking specific articulations within the $L_1$ choice-operation sub-articulation. Its relation to the present paper requires explicit articulation, since the ZFCρ series and the present paper occupy adjacent but distinct positions in the program's mathematical landscape.

ZFCρ Paper I [DOI: 10.5281/zenodo.18842458] articulates, in our terms, the closure structure of $L_1$ from a particular vantage point: the extensional closure of ZFC produces, as its specific operational remainder, the $\rho$ marker that tracks the choice-operation history. The Cauchy completion to $\mathbb{R}$ that the present paper's § 4.4 articulates as the closure of $L_1$ produces transcendentals and the unincorporable remainder $i$; the ZFC extensional closure that ZFCρ Paper I articulates produces the $\rho$ marker specific to the $L_{1\text{-}2}$ choice operation. Both are closures within the architecture of $L_1$, addressing different articulative aspects of the layer.

ZFCρ Paper II [DOI: 10.5281/zenodo.18927658] articulates the cross-layer transition structure—two-remainders-plus-one-action-equals-closure—that aligns with the present paper's account of step-4 closure formulas. The closure equations of Cross-Layer Closure Equations (Schwarzschild at $L_4$, Boltzmann at $L_5$) instantiate this general pattern at specific physical layers; the closure equations within mathematics (Euler at $L_2$, Gödel diagonal at $L_3$) instantiate it at mathematical layers. The present paper's schema and ZFCρ Paper II's transition structure are, in this sense, the same articulation viewed from two angles.

The subsequent ZFCρ papers (P50 and onward) develop, in increasing technical depth, the cross-layer involvements that the present paper's schema only sketches. The spectral analysis introduced from approximately P50 onward articulates how the $L_1$ arithmetic content of ZFCρ overflows naturally into the $L_2$ complex-analytic defect algebra; the thermodynamic paper's articulation of the parameter $\eta$ articulates the $L_4 \to L_5$ articulative boundary; the recent P73 spectral readout articulates, in technical detail, how the $L_2$ defect algebra appears within the ZFCρ context. Each of these is technical work within the architectural framework that the present paper articulates.

The relationships among ZFCρ objects and the present paper's schematic positions may be summarized as follows.

ZFCρ object	Schema position
Successor ($+1$)	$L_{1\text{-}2}$ additive path internal operation
Factor path	$L_{1\text{-}3}$ multiplicative path local refinement
Min recursion	Step 4 closure micro-instance
$\rho$ marker	Operational remainder of $L_{1\text{-}2}$ choice operation
Transfinite ordinal hierarchy	$L_{1\text{-}1}$ to meta-level articulation
Spectral analysis (P50 onward)	Cross-layer, involving $L_2$ analytic tools
Thermodynamic paper $\eta$	$L_4 \to L_5$ articulative boundary
Specific consistency tests (P59.1 et al.)	$L_{1\text{-}2}$ choice operation internal consistency

The ZFCρ series, on this reading, is the specific technical work of one articulative path within $L_1$—primarily the choice-operation sub-articulation of $L_{1\text{-}2}$. It is not the SAE mathematical framework in its entirety: the framework as articulated here contains other paths at $L_1$ (the $p$-adic, the non-standard, the Cayley–Dickson alternatives), other layers ($L_2$ through $L_5$), and the meta-articulative content (twofold inexhaustibility, parallel-displays framework) that the present paper's contribution makes explicit. The ZFCρ series is, in the precise sense of the schema, the specific technical work along one specific path within one specific sub-layer; the architectural framework is the broader articulation within which this technical work has its place.

9.2 Other SAE series in relation to the present paper

The relations to other SAE series are best stated briefly.

The four-forces series (in development) treats $L_4$ in technical detail: the articulation of gravity, electromagnetism, the weak interaction, and the strong interaction within the relativistic-spacetime articulative level. The present paper's brief treatment of $L_4$ in § 6.2 is a sketch; the four-forces series provides the substantive articulation.

The cosmology series (in development) treats the $L_4 \to L_5$ articulative boundary in cosmological contexts: the cosmic microwave background, dark matter and dark energy, the inflationary regime, the structure of the early universe. The present paper's articulation of the regime-dependent transition at the $L_4 \to L_5$ boundary (§ 6.3, § 7) is a general account; the cosmology series provides the specific applications.

The geometric-and-dynamical series (in development, including the paper sometimes cited here as "Forms and Flows Paper 1") treats geometric and dynamical articulations of mathematical objects. The Gauss–Bonnet exchange law articulated in that series stands in structural parallel to the residue theorem of $L_2$ articulated in the present paper § 5.4; both articulate local-global exchanges through specific integral identities, and the parallel is non-coincidental.

The methodology series (Methodology 0, Methodology 00, Methodology I, Methodology VII, and others) articulates the foundational methodological commitments of the SAE program. The present paper builds on Methodology 0 (negativa as sole axiom) and Methodology 00 (Via Rho method), and aligns at the architectural level with Methodology I (chisel-construct cycle) and Methodology VII (Via Negativa).

The relations among these series form a network rather than a hierarchy. The present paper's architectural articulation organizes the mathematical content, but it does not subsume the technical work of the other series. Each series contributes a distinctive articulation, and the network of relations among them constitutes the SAE program at its current stage.

9.3 Directions for future work

Several directions for future work are visible from the present paper's vantage point.

Layer-specific papers. The schema's articulation through $L_5$ supports, in each case, the development of a layer-specific paper that would treat that layer in the depth that a foundational paper cannot. An $L_1$-specific paper would treat the multiplicative-path development in detail, including the $p$-adic alternative, the structure of prime distribution, and the engagement with Cantor, Cauchy, and Dedekind. An $L_2$-specific paper would treat the operational defect algebra $\omega_\rho^{(2)}$ systematically, including the composition relations among its components, the engagement with Riemann and Weierstrass, and the connections to algebraic geometry and the theory of Riemann surfaces. An $L_3$-specific paper would treat the formal-systems articulation in detail, including the post-Gödelian developments (computability theory, recursion theory, descriptive set theory) and the engagement with Hilbert, Gödel, Tarski, and the subsequent logical tradition.

ZFCρ Paper 0. A paper specifically articulating the scope and articulative status of the ZFCρ series within the broader SAE mathematical framework is, in our judgment, overdue. Such a paper would make explicit the relation between ZFCρ's $L_{1\text{-}2}$ choice-operation focus and the broader $L_1$ architecture of the present paper, and would articulate the boundaries of the ZFCρ series' specific articulative work.

Cross-disciplinary parallel displays. The schema's articulation of $L_3$, $L_4$, $L_5$ as parallel displays from the same four-phase pattern suggests that similar articulations may be productive for other disciplinary articulations: of living systems, of subjective experience, of social structure. The present paper does not undertake these articulations, but it indicates them as candidates for future work.

Engagement with alternative frameworks. The minimal engagement with standard positions in the philosophy of mathematics offered in § 1.4 is, by design, brief: detailed engagement is deferred to the layer-specific papers. Specific layer-specific engagements with category-theoretic foundations, homotopy type theory, set-theoretic foundations, and the constructivist tradition will require their own substantive treatment.

These directions are visible from the present paper, but they are not undertaken here. The present paper's task has been the articulation of the architectural schema; the detailed work belongs to subsequent papers in their respective programs.

---

10. Honest boundaries and concluding observations

The present paper has articulated the Layer Articulation Schema, exhibited it across $L_1$ through $L_5$, articulated the operational defect algebra of $L_2$ and the Gödel diagonal closure of $L_3$ in some detail, indicated the $L_4$ and $L_5$ parallel displays in brief, articulated the closure-equation grammar / probability-distribution grammar distinction, and developed the twofold inexhaustibility meta-thesis. It remains to review the paper's claim-strength stratification, to record the scope boundaries the paper has held, and to indicate the spirit in which the paper's contribution is offered.

10.1 Review of claim-strength stratification

The stratification of § 1.3 governed the paper throughout. We restate it briefly for review.

The four phases of Methodology 0 are inherited as foundation, not re-derived. The four-step schema is offered as identified articulation, falsifiable via adequacy criteria (§ 3.5) and failure modes (§ 3.6), but not as derivational proof. The $L_1, L_2, L_3, L_4$ instantiations are structural displays. The $L_5$ breakdown is a working boundary observation. The twofold inexhaustibility is a meta-thesis articulating the framework's epistemological stance. The boundary between deterministic and probabilistic mathematical articulation is a working hypothesis, refinable in light of further articulation.

At each point in the paper, the reader should be able to identify which level of claim is in play. Where the schema makes a strong claim—the operational defect algebra of $L_2$ as articulating the layer's core working content, the Gödel diagonal as the closure of $L_3$, the exchange-law pattern as recurrent across layers—the claim is offered with the evidence that supports it. Where the schema makes a weaker claim—the $L_4$ and $L_5$ articulations as brief parallel displays, the regime-dependent transitions as a working classification of boundary phenomena, the historical genealogy of § 2 as a genealogy of articulation rather than a reconstruction of human prehistory—the weaker status is signaled explicitly.

10.2 Scope boundaries

Several scope boundaries have been observed throughout the paper, and we record them for the reader's reference.

The schema is an identified articulation, not a derivational one. The four-step pattern is exhibited at the layers examined, supported by adequacy criteria and falsifiability conditions, but not derived from a higher-order necessity claim. The schema's authority is the authority of pattern-identification under falsifiability discipline, not of a priori demonstration.

The $L_5$ breakdown is a working boundary observation. The claim is not that the closure-equation grammar must fail at $L_5$ for some necessary reason; the claim is that the closure-equation grammar does fail in specific $L_5$ regimes, with specific mathematical instances of the failure identifiable in non-equilibrium thermodynamics, in ergodic theory, in phase-transition theory, in algorithmic randomness, and in living-systems articulation.

The articulative-boundary phenomena are articulated as regime-dependent transitions, not as sharp boundaries internal to mathematics. The boundary between the closure-equation grammar and the probability-distribution grammar is not a fixed line at a particular layer; it depends on the regime in which a specific system is examined, and the same system may exhibit either grammar depending on its parameter range.

Engagement with traditions in the philosophy of mathematics is minimal, by design. The present paper articulates a framework; detailed engagement with Platonism, formalism, constructivism, structuralism, category theory, and homotopy type theory is reserved for the layer-specific papers in which such engagement can be conducted in the necessary depth.

The articulations of $L_3$, $L_4$, $L_5$ are parallel displays, not derivations from $L_2$ or from the schema's mathematical content. The four-phase pattern that $L_3$, $L_4$, and $L_5$ exhibit is inherited from the same source (negativa's self-interrogation) as the pattern that $L_1$ and $L_2$ exhibit; it is not transmitted through mathematics into the other layers. The paper's main scope is mathematics, and the brief treatments of formal logic, physics, and thermodynamics serve only to indicate the schema's reach across articulative levels.

10.3 Relation to the existing SAE corpus

The present paper does not displace any prior paper in the SAE corpus. It inherits the methodological foundation of Methodology 0 and Methodology 00, makes explicit the architectural framework that Cross-Layer Closure Equations and the ZFCρ series implicitly presuppose, and aligns with the chisel-construct cycle of SAE Methodological Overview Paper I. Its contribution is the explicit articulation of an architectural pattern that was implicit in the prior corpus, supplemented by the meta-thesis of twofold inexhaustibility that organizes the architectural pattern's epistemological standing.

The architectural articulation, together with the prior foundational papers, forms the SAE program's mathematical foundation: Methodology 0 supplies the axiomatic foundation (negativa, the four phases); Methodology 00 supplies the methodological foundation (Via Rho, ZFCρ as carrier); the present paper supplies the architectural foundation (the Layer Articulation Schema, the twofold inexhaustibility meta-thesis); Cross-Layer Closure Equations supplies the cross-layer transition foundation (the closure equations and the $\eta$ parameter). Together, these papers articulate the SAE program's foundational stance at the level of mathematics and the layers adjacent to it.

10.4 Concluding observations

The schema's account of mathematics as ongoing articulation, rather than as approaching-truth activity, can be put in summary form. We offer the summary not as a final claim but as an indication of the spirit in which the schema is offered.

In the SAE perspective, mathematics is not first understood as the discovery of pre-existing eternal truths. It is understood as the ongoing algebraization of unclosed remainders. Each closure produces a residue; each residue, in turn, becomes a marked handle at the next articulative level; each layer's closure produces, at its boundary, the trigger for the next; and the chain of layers does not terminate. The residues are not failures; they are the productive content of the activity. The chain is not unfinished business that productivity has failed to complete; the chain is the productivity, with its ongoing character constitutive rather than accidental.

This stance is consistent with what mathematicians, in their practice, often report: that mathematical work is interesting because it is ongoing, that the resolution of one problem reveals further problems rather than concluding the inquiry, that the most productive areas of mathematics are those in which the articulation has not closed. The schema's articulation aims at making this practical reality articulately visible at the level of architectural philosophy of mathematics.

The schema, finally, is offered as one productive specific framework within the twofold inexhaustibility that the meta-thesis articulates. Other frameworks—Platonist, formalist, constructivist, structuralist, category-theoretic, homotopy-type-theoretic—articulate other angles on the same mathematical practice, and each is productive within its scope. The present paper does not propose to supersede these frameworks; it offers the schema alongside them, in the spirit of articulative pluralism that the inexhaustibility of articulation frameworks supports. The reader is invited to engage the schema on its own terms, to test its specific claims against the adequacy criteria and failure modes the paper provides, and to consider it alongside the alternatives without taking the schema's offer as exclusive of theirs.

The architectural articulation of SAE mathematics is, in this final sense, an articulation within an inexhaustible activity, offering itself as part of that activity's ongoing productivity.

---

11. Open problems

The schema, the four-step articulation across $L_1$ through $L_5$, and the twofold inexhaustibility meta-thesis are offered as the present paper's substantive contributions. They are not, however, the final word on the topics they address. Several substantive problems remain open, and we record them here both as honest acknowledgment of what the paper does not settle and as an indication of where future work could productively engage with the framework. The open status of these problems is consistent with the meta-thesis: it is not a defect of the framework that it leaves productive questions unanswered, but a reflection of the framework's epistemic discipline as one productive specific articulation rather than as a closed theory.

11.1 The composition law of the $L_2$ operational defect algebra

The operational defect algebra $\omega_\rho^{(2)}$ of § 5.4 is articulated as a six-component structure organized into four stages of a topological evolution chain. The components—divisor, residue, period, monodromy, growth at infinity, Stokes data—and the stages—point-state, local-monetary, global-cycle, boundary-sectoral—are exhibited individually, and the present paper indicates how each component fills its schematic role. What the paper does not provide, and what is required for a fully closed account of $L_2$, is the composition law governing the algebraic relations among the six components.

Specific open questions in this direction include: How do residues and monodromies compose when one circumnavigates branch points whose monodromy groups interact non-trivially? What is the algebraic structure that captures the composition of periods on Riemann surfaces with non-trivial fundamental groups, particularly in connection with the Stokes data near irregular singular points at infinity? Is the full algebraic structure best articulated as a group, a groupoid, a sheaf of algebras over the underlying Riemann surface, or as some more refined categorical structure? The present paper articulates the six components as the layer's core content; it does not articulate, with the same precision, the algebraic structure binding them.

This open problem is properly addressed in a subsequent $L_2$-specific paper, in which the composition relations can be developed with the technical apparatus of complex algebraic geometry, sheaf cohomology, and the modern theory of resurgence. Such a paper would extend the present architectural articulation into the operational mathematics that $L_2$'s working content requires.

11.2 The probability-distribution grammar at $L_5$ and beyond

The present paper articulates, in § 7, the regime-dependent transition from the closure-equation grammar to the probability-distribution grammar at $L_5$ and beyond. What it does not articulate, with the precision its mathematical seriousness would eventually require, is the specific structural content of the probability-distribution grammar itself.

Open questions in this direction include: How does the probability-distribution grammar's articulation through measure theory, ergodic theory, and Kolmogorov complexity specifically organize the layer's articulative content? What is the precise relationship between the probability-distribution articulation at $L_5$ and the closure-equation articulation at $L_4$, in regimes where both are partially productive? How does the probability-distribution grammar extend, if it does, to articulative levels beyond $L_5$—to the articulation of living systems, of subjective experience, of social structure? The present paper indicates the existence of these regimes and identifies specific mathematical instances of the $L_5$ breakdown (§ 6.4), but it does not articulate the probability-distribution grammar's full structural content.

The proper treatment of these questions belongs in a subsequent paper focused on the probability-distribution grammar specifically, or in the cosmology and four-forces series papers that engage the $L_4 \to L_5$ articulative boundary in technical detail.

11.3 Cross-layer tool use

The schema is compatible with the practice, common in advanced mathematics, of using tools from one layer in the analysis of another. Complex analysis, an $L_2$ articulation, is routinely applied to real-valued functions ($L_1$ objects). Algebraic geometry employs $L_2$ tools (complex algebraic structures, sheaves) on $L_3$-style formal structures. Topological K-theory combines $L_2$ tools (complex vector bundles) with $L_3$ tools (formal-system structures over the bundles).

The present paper indicates, in § 1.5, that cross-layer tool use is schema-compatible: layer attribution is by primary articulative function, not by exclusive categorization. What the paper does not articulate, with the precision the topic deserves, is the mechanism of cross-layer tool use—how a tool developed within one layer's articulative resources comes to be available, productively, within another layer's articulative scope.

Open questions include: When an $L_2$ tool is applied to an $L_1$ object, what is the articulative status of the application—is the result an $L_1$ articulation that uses $L_2$ resources, an $L_2$ articulation that addresses an $L_1$ object, or some hybrid that the schema's current four-step structure does not cleanly capture? Is there a general account of cross-layer tool use that would supplement the schema's layer-by-layer articulation, or does cross-layer use require case-by-case treatment? The present paper does not settle these questions; they are candidates for the layer-specific papers, where the engagement with specific mathematical practice can articulate the relevant articulative relationships.

11.4 Detailed engagement with traditions in the philosophy of mathematics

The present paper engages, in § 1.4, with four standard positions in the philosophy of mathematics—Platonism, formalism, constructivism, structuralism (including its category-theoretic refinement)—at the minimal level of interface required for an architectural paper. Substantive engagement with these positions, and with the related traditions of homotopy type theory, set-theoretic foundations, and the various constructive schools (Brouwer, Bishop, Markov, Martin-Löf), is deferred to layer-specific papers.

The deferral is not avoidance. Each tradition has internal commitments that bear on specific layers of the schema in specific ways. An adequate engagement with category-theoretic structuralism would require, at minimum, a detailed treatment at $L_2$ (where category-theoretic articulations of complex analysis become productive) and at $L_3$ (where category-theoretic foundations engage the formal-system articulations). An adequate engagement with homotopy type theory would require sustained attention at $L_3$, particularly in light of the univalence axiom's potential to force schema refinements at the formal-system level. An adequate engagement with the constructive traditions would require treatment at $L_1$ (where constructive analysis articulates an alternative path through the layer) and at $L_3$ (where constructive logic engages the closure-step articulation through different means than classical logic).

Each of these engagements is open, in the present state of the SAE program. They are properly addressed in the layer-specific papers that will follow, where the philosophical engagement can be conducted with the technical depth the topics require.

11.5 Parallel displays across disciplines

The schema's articulation of $L_3$, $L_4$, $L_5$ as parallel displays from the same four-phase pattern suggests, by extension, that similar articulations may be productive for other articulative levels of inquiry. The articulation of living systems, of subjective experience, of social structure, of cultural and historical articulation—each of these is a candidate for a parallel-display articulation alongside the mathematical and physical levels the present paper treats.

The present paper does not undertake any of these cross-disciplinary articulations. The complexity of each is substantial, and adequate treatment would require, in each case, sustained engagement with the discipline's specific articulative content. The schema's mathematical articulation can serve as one model for what such articulations might look like, but the work of constructing them belongs to those who can bring the necessary disciplinary expertise to bear.

The open status of these cross-disciplinary articulations is, in our view, productive rather than limiting. The schema does not commit to having articulated, in advance, what its parallel-display structure across all disciplines must look like. It commits, more modestly, to articulating the mathematical and physical levels with the care that those levels permit, and to indicating that similar articulations elsewhere are candidates for future work.

11.6 Schema applicability beyond $L_1$ through $L_5$

The schema is articulated, in the present paper, through five layers, with a partial breakdown at the fifth. Whether the schema extends, with the same structural integrity, to articulative levels beyond $L_5$—to layers, if any, that articulate the structure of living systems, of mind, of culture—remains open. The schema's articulation is, by design, compatible with such extensions, but it does not pre-articulate them.

Open questions in this direction include: Does the four-step pattern continue to apply at levels where the closure-equation grammar has given way entirely to the probability-distribution grammar, or does the pattern require refinement at those levels? Are there layers beyond $L_5$ for which neither grammar is fully adequate, and which require a third articulative mode that the present paper has not anticipated? Is the schema's four-step structure itself subject to revision when applied to layers far from its original articulative home in mathematics? These questions are open by design; the schema's epistemological stance (§ 3.8) commits explicitly to the possibility that further mathematical and cross-disciplinary work may require schema refinement.

11.7 ZFCρ Paper 0 and the scope demarcation of the ZFCρ series

The ZFCρ series, as articulated in § 9.1, is the specific technical work of one articulative path within $L_1$—primarily the choice-operation sub-articulation of $L_{1\text{-}2}$. A paper articulating, with explicit attention, the scope and articulative status of the ZFCρ series within the broader SAE mathematical framework is, in our judgment, overdue. We refer to this hypothetical paper as ZFCρ Paper 0, in keeping with the practice of using zero-indexed positions for scope-articulating papers.

Such a paper would address several articulative tasks: making explicit the relation between ZFCρ's $L_{1\text{-}2}$ choice-operation focus and the broader $L_1$ architecture of the present paper; articulating the boundaries of the ZFCρ series' specific technical work, with explicit attention to what falls outside its scope; treating the relations between ZFCρ's specific results and the parallel work at other $L_1$ paths (the $p$-adic, the non-standard, and the alternative completion structures). The paper would supplement the present paper's architectural articulation with the scope demarcation of the SAE program's most developed technical series.

The composition of ZFCρ Paper 0 is open, in the sense that the paper has not been written. The substantive content of the paper, including the specific articulative tasks it would undertake, can be indicated only in outline from the present paper's vantage point; the detailed articulation belongs to the paper itself when it is written.

11.8 The Cayley–Dickson progression at $L_2$

The dimensional progression articulated by the Cayley–Dickson construction—$\mathbb{R} \to \mathbb{C} \to \mathbb{H} \to \mathbb{O} \to$ sedenions $\to \ldots$—offers a sequence of alternative closures at $L_2$, each at the cost of a specific algebraic structural property (ordering at the transition to $\mathbb{C}$, commutativity at the transition to $\mathbb{H}$, associativity at the transition to $\mathbb{O}$, the division-algebra property at the transition to the sedenions). The present paper indicates, in § 5.1 and § 5.3, that these alternative closures are schema-compatible and that the schema does not stipulate a unique $L_2$ closure path.

Open questions in this direction include: How does the schema's adequacy criteria (§ 3.5) apply to the alternative closures, given that each loses a structural property the previous closure had? Is there a principled point in the Cayley–Dickson progression at which the schema's four-step articulation ceases to apply, marking an articulative boundary internal to $L_2$? The sedenions famously fail to form a division algebra; is this failure an articulative boundary that the schema should mark as significant, or does the progression continue productively beyond it under refinement? What is the relationship between the Cayley–Dickson alternatives and the operational defect algebra $\omega_\rho^{(2)}$ of the standard complex articulation—do the alternative closures support analogous operational defect algebras, or do they exhibit different defect structures that require their own articulations?

These questions are open, and their proper treatment requires an $L_2$-specific paper engaging the Cayley–Dickson progression with the technical depth that the topic demands.

11.9 The relation between schema articulation and articulative practice

A final open problem concerns the relation between the schema's articulation, as offered in the present paper, and the articulative practice of working mathematicians. The schema articulates a pattern that mathematicians can, in retrospect, recognize as having been operative in their practice. The schema does not, however, articulate how the pattern operates prospectively—how a mathematician engaged in new mathematical work can use the schema as a guide to articulative direction rather than merely as a retrospective organizational device.

Open questions include: Does the schema have predictive content, in the sense that future mathematical developments at the present articulative frontier (the boundaries of $L_5$, the cross-disciplinary articulations) can be anticipated by attending to the schema's structural pattern? Or is the schema primarily a retrospective articulation, applicable to mathematics that has already been developed but offering no guidance to mathematics in progress? If the schema does have predictive content, how should it be tested—through specific predictions about the structure of forthcoming mathematical articulations, through methodological guidance offered to working mathematicians, through some other articulative practice?

These questions are open by design. The schema, as articulated in the present paper, is offered as a tool for retrospective architectural articulation; its prospective potential is not claimed but is also not denied. Future work, both in the SAE program and in the broader engagement between the schema and mathematical practice, will articulate what relation, if any, the schema's pattern bears to mathematics-in-progress.

---

The open problems listed above are not exhaustive; the inexhaustibility of articulation frameworks at the meta level (§ 8.5) entails that further problems will emerge as the framework is engaged with specific mathematical content and with alternative articulative perspectives. The list serves to indicate the productive directions visible from the present paper's vantage point, and to make explicit, in the spirit of the paper's claim-strength discipline, the boundaries of what the paper articulates. The open problems are not failures of the schema; they are the schema's productive horizon, the territory in which subsequent SAE papers and engagements with alternative frameworks may continue the work that the present paper has begun.

---

Appendix A: Mathematical history as stress-test

A.0 Purpose and methodological framing

An architectural philosophy of mathematics that proposes a structural pattern of the kind the present paper articulates must, in honesty, be tested against the history of mathematics. The pattern's adequacy depends on its capacity to identify, in the historical record, the structural features it claims to articulate; and the pattern's falsifiability depends on its preparedness to acknowledge historical developments that resist the proposed articulation.

The framing of this appendix as a stress-test rather than a verification is, accordingly, intentional. To call the examination a verification would suggest that the historical record, properly interpreted, demonstrates the schema's correctness. The schema does not warrant this stronger claim. To call the examination a stress-test, by contrast, signals the genuine epistemic posture: the schema is offered for testing against historical material, with the explicit acknowledgment that the testing may reveal partial fit, open questions, or genuine non-fit, and with the further acknowledgment that the testing's outcome may require schema refinement.

The appendix proceeds in two parts. The first part (§ A.1 through § A.7) treats historical developments at which the schema's pattern is clearly identifiable, articulating in each case how the pattern applies. The second part (§ A.8) treats potential counter-example candidates: historical developments at which the schema's fit is partial, open, or potentially non-fit, with explicit honest discussion of the cases.

The structure of the appendix is not designed to demonstrate that the schema passes the stress-test. It is designed to make the stress-test transparent, so that the reader can assess for themselves what the historical material supports.

A.1 The $p$-adic numbers: a case study in construction-without-closure

The $p$-adic number systems $\mathbb{Q}_p$, developed by Kurt Hensel beginning in 1897, are an alternative completion of the rationals to the real numbers $\mathbb{R}$. Where $\mathbb{R}$ completes $\mathbb{Q}$ with respect to the standard Archimedean absolute value, $\mathbb{Q}_p$ completes $\mathbb{Q}$ with respect to the $p$-adic absolute value, defined by

$$|x|_p = p^{-v_p(x)},$$

where $v_p(x)$ is the $p$-adic valuation of $x$. Ostrowski's theorem (1916) establishes that, up to equivalence, $\mathbb{Q}$ admits exactly two kinds of non-trivial absolute values: the Archimedean (giving $\mathbb{R}$) and the $p$-adic (giving $\mathbb{Q}_p$ for each prime $p$).

The $p$-adic numbers stand in a particular relation to the schema's articulation of $L_{1\text{-}4}$, and the relation is illuminating. The schema's articulation of the Cauchy completion to $\mathbb{R}$ treats the closure as balancing the additive and multiplicative paths of $L_1$: the topology of $\mathbb{R}$ allows the limits of multiplicative iterations (the algebraic numbers) and the limits of geometric extensions (the transcendentals) to coexist within a single completed structure. The $p$-adic numbers, by contrast, achieve closure by enforcing a topology generated entirely by the multiplicative valuation: the metric $|x|_p$ is constructed from the prime factorization of $x$, and the ultrametric inequality

$$|x + y|_p \leq \max(|x|_p, |y|_p)$$

it satisfies is stronger than the standard triangle inequality. The consequence of forcing closure through a purely multiplicative metric is dramatic: the $p$-adic space is totally disconnected, a topology that the schema would describe as the cost of attempting absolute closure at step 3 (multiplicative) without the balancing provided by step 2 (additive).

The schema's reading is, accordingly, that the $p$-adic numbers exemplify the construction-without-closure principle in particularly clear form. The completion is achieved, but the cost—total disconnectedness, the loss of geometric intuition, the proliferation of the disconnected component structure—is precisely the structural protest of a system forced to closure prematurely. The $p$-adic numbers are not a counter-example to the schema; they are a confirmation of the construction-without-closure principle that the schema makes structural. The historical development of the $p$-adic numbers thus stress-tests the schema and the schema passes, with the $p$-adic case serving as an exceptionally clear instantiation of the construction-without-closure principle at $L_{1\text{-}4}$.

A.2 Non-standard analysis (Robinson)

Abraham Robinson's non-standard analysis (1966) extends $\mathbb{R}$ to the hyperreals ${}^*\mathbb{R}$, a structure containing infinitesimals (positive numbers smaller than every positive real) and infinite numbers, and arrived at through the model-theoretic construction of ultraproducts. The historical development addressed a long-standing concern about the rigor of differential and integral calculus, replacing the $\varepsilon$-$\delta$ framework of Cauchy and Weierstrass with a framework in which infinitesimals could be manipulated as legitimate mathematical objects.

The schema's reading is that non-standard analysis articulates an alternative closure path at $L_{1\text{-}4}$, parallel to (but distinct from) the Cauchy completion to $\mathbb{R}$. The hyperreals constitute a closure structure at $L_1$ that accommodates objects (infinitesimals) that the Cauchy completion excludes. The schema is compatible with the existence of multiple closure paths at a layer (§ 3.8), and non-standard analysis is one such alternative path. The schema's articulation does not predict which path mathematicians will follow as the canonical $L_1$ closure—this is a matter of historical contingency and mathematical practice—but it accommodates non-standard analysis within its framework.

The case is instructive for the schema's claim of compatibility with alternative paths. Non-standard analysis is not a refutation of the Cauchy closure of $\mathbb{R}$; it is a parallel path through the layer. The schema reads both paths as schema-compatible articulations, with the choice between them governed by considerations specific to mathematical practice rather than by structural necessity.

A.3 Cantor's transfinite cardinals

Georg Cantor's introduction of the transfinite cardinals $\aleph_0, \aleph_1, \aleph_2, \ldots$ in the 1870s and 1880s articulates the cardinal structure of infinite sets, with $\aleph_0$ the cardinality of the integers, $\aleph_1$ the smallest cardinality larger than $\aleph_0$, and the cardinality hierarchy extending into the transfinite. The continuum hypothesis—the question of whether the cardinality of the real numbers equals $\aleph_1$—has been articulated and contested in the subsequent foundational literature.

The schema's reading places Cantor's transfinite cardinals at $L_3$, specifically as an articulation of the meta-level extension that the formal-systems layer accommodates. The transfinite cardinals are not objects of $L_1$ arithmetic; they are meta-level articulations of the cardinality of $L_1$ structures, articulated through the apparatus of set theory that $L_3$ articulates. The independence of the continuum hypothesis (Cohen 1963) is then articulable as a specific instance of $L_3$'s incompleteness structure: the formal system of ZFC does not adjudicate the cardinality of the continuum, in the same way that it does not adjudicate the truth-value of the Gödel sentence.

The schema's articulation thus accommodates Cantor's transfinite cardinals as $L_3$ articulations, with the continuum hypothesis's independence treated as an instance of the layer's incompleteness phenomena. The historical development of set theory stress-tests the schema at $L_3$, and the schema passes, with the historical record exemplifying the layer's articulative content.

A.4 Gödel's incompleteness theorems

Kurt Gödel's incompleteness theorems (1931) establish that any consistent formal system $T$ extending sufficient elementary arithmetic contains a statement $\phi$ such that $T \not\vdash \phi$ and $T \not\vdash \neg\phi$. The proof proceeds through Gödel's arithmetization function $\#: \text{Formulas} \to \mathbb{N}$, which encodes formal statements as natural numbers, and through the diagonal lemma's construction of the Gödel sentence

$$G \leftrightarrow \neg\,\mathrm{Prov}_T(\ulcorner G \urcorner).$$

The schema's reading places Gödel's incompleteness theorems at the heart of $L_3$'s articulation. The arithmetization function $\#$ functions as the layer's exchange law (§ 6.1), the diagonal lemma articulates the closure step at $L_3$-4, and the incompleteness phenomenon is the layer's articulative content of structural irreducibility. The schema's articulation of $L_3$ in § 6.1 is, in this sense, a direct articulation of Gödel's results in the framework's terms. The historical development of post-Gödelian computability theory (Turing, Kleene, Post) and proof theory (Gentzen, Tarski) elaborates the layer's articulative content in directions that the schema accommodates.

The schema's articulation of Gödel arithmetization as a topological knotting (§ 6.1)—the embedding of the meta-level logical manifold into the object-level arithmetic manifold, with incompleteness as the unknottable residue of the embedding—is a structural reading of the incompleteness phenomenon that the historical literature does not standardly offer, but that the schema's framework makes natural. Whether this reading proves productive in the subsequent literature is a question for future engagement; in the present appendix, we note only that the schema is compatible with the historical record and articulates Gödel's results in its own terms.

A.5 The Cauchy rigorization

The nineteenth-century rigorization of mathematical analysis—the work of Cauchy, Weierstrass, Dedekind, Cantor, and their contemporaries—articulated the limit-based foundations of differential and integral calculus, the construction of $\mathbb{R}$ as the Cauchy completion of $\mathbb{Q}$, and the rigorous treatment of continuity and convergence. This articulative work is, on the schema's reading, the historical instantiation of $L_{1\text{-}4}$'s closure step (§ 4.4).

The schema does not claim that the historical rigorization was the unique possible articulation of $L_{1\text{-}4}$'s closure; alternative articulations were available (and have been developed: non-standard analysis, constructive analysis, smooth-infinitesimal analysis). The schema claims, more modestly, that the historical rigorization is one schema-compatible articulation of $L_1$'s closure step, identifiable as such in retrospect. The historical record stress-tests the schema's articulation of $L_1$'s closure, and the schema passes, with the Cauchy rigorization exemplifying the layer's closure content.

The schema's articulation of the mathematician's stance as historically emerging at $L_{1\text{-}4}$ (§ 4.4) is a stronger claim about the historical record, in that it links the emergence of the formal-rigorous stance to the layer's closure step. The claim is consistent with the historical timing—nineteenth-century rather than earlier—but the claim does not require the timing to have been necessary. The historical contingency of the rigorization's particular timing does not undermine the schema's structural articulation; the schema reads structural patterns in retrospect, without claiming historical inevitability.

A.6 The development of complex analysis

The development of complex analysis—from the work of Cauchy in the early nineteenth century, through Riemann's articulation of Riemann surfaces and the geometric content of multi-valued functions, through Weierstrass's articulation of holomorphic functions through power series, through the twentieth-century development of resurgence theory and Stokes phenomena—articulates the operational defect algebra $\omega_\rho^{(2)}$ that the schema places at $L_2$.

The schema's reading of this historical development is that the operational defect algebra emerged, over the course of two centuries, as the articulative content of $L_2$. Cauchy articulated the residue theorem and the contour-integration framework. Riemann articulated the Riemann surface and the geometric content of multi-valuedness. Weierstrass articulated the power-series foundation of holomorphic structure. Subsequent generations articulated the monodromy theory, the Stokes phenomena, the period theory, and the asymptotic-resurgence framework. The schema's six-component articulation of $\omega_\rho^{(2)}$ in § 5.4 is, in this sense, a structural reading of this historical material.

The historical development stress-tests the schema's articulation of $L_2$, and the schema passes, with the operational defect algebra articulating the historical record's structural pattern. The articulation is consistent with the practice of working complex analysts: the components of $\omega_\rho^{(2)}$ are not invented by the schema, but identified by it within the existing mathematical content.

A.7 The Hilbert program and its post-Gödelian fate

David Hilbert's program in the 1920s aimed at establishing the consistency of mathematics through finitary methods, with the foundation of analysis on combinatorial arithmetic and the resolution of the foundational crisis triggered by Russell's paradox and the consequent set-theoretic ferment. Gödel's incompleteness theorems, by establishing that no consistent system extending sufficient arithmetic can prove its own consistency by finitary means, are widely understood as showing that the Hilbert program cannot be completed in its original strong form.

The schema's reading of the Hilbert program and its post-Gödelian fate places the program at $L_3$ and articulates its failure as an instance of the layer's inexhaustibility (§ 8). The Hilbert program attempted to totalize mathematics through a finitary foundation; the Gödel theorems articulate, in their schema-reading, the impossibility of such totalization. The historical record, in this case, is read by the schema as confirming the inexhaustibility meta-thesis at a specific instance: a major historical attempt at totalization was articulated and found, by subsequent mathematical work, to be structurally impossible.

The post-Gödelian developments—proof theory (Gentzen, Tarski), reverse mathematics (Friedman, Simpson), the program of bounded arithmetic (Buss), constructive analysis (Bishop)—articulate the inexhaustible space of partial foundational programs that have continued to be productive after the failure of the original totalization. The schema accommodates this proliferation as part of $L_3$'s articulative content, with the various partial foundational programs articulated as parallel paths through the layer.

A.8 Counter-example candidates and partial-fit cases

The schema's stress-test against historical material is incomplete if it considers only cases where the fit is clear. Honest stress-testing requires explicit attention to cases where the fit is partial, contested, or potentially non-fit. The cases that follow are candidates of this kind. We treat them as candidates rather than as settled either way, articulating the considerations on each side without claiming to resolve them.

A.8.1 Surreal numbers (Conway)

John Conway's surreal numbers, articulated in the 1970s, form a proper class containing $\mathbb{R}$ together with infinitesimals and infinite numbers, organized through the games-as-numbers construction. The surreal number system is, in some respects, parallel to non-standard analysis (containing infinitesimals and infinite numbers), but in other respects, structurally distinct (organized through a recursive game-theoretic construction rather than through ultraproducts).

A fit-positive reading of the surreal numbers articulates them as an alternative $L_{1\text{-}4}$ closure path, parallel to the Cauchy completion to $\mathbb{R}$, to the $p$-adic completions, and to the hyperreals. The schema is compatible with multiple alternative closures at a layer (§ 3.8), and the surreal numbers are one such alternative.

A fit-negative reading articulates the surreal numbers as resisting straightforward fit with the schema's standard closure paths. The games-as-numbers construction operates through a recursive two-sided cut structure that does not cleanly correspond to either Cauchy completion, $p$-adic completion, or non-standard ultraproduct. The schema's step-4 closure articulation in its standard form may require refinement to accommodate the surreal construction, in which case the surreal numbers would be a candidate for schema update via 5b (§ 3.6).

The case is open. A subsequent $L_1$-specific paper engaging the surreal numbers in technical detail could settle the question; the present paper records the candidate honestly without claiming resolution.

A.8.2 Homotopy type theory and univalent foundations

Vladimir Voevodsky's univalent foundations program, beginning in the 2000s, articulates homotopy type theory (HoTT) as an alternative foundation for mathematics, with the univalence axiom (isomorphic types are equal) at its core. HoTT is positioned by its proponents as an alternative to ZFC set theory, with native treatment of higher-dimensional structures and an internal connection between formal proof and topological structure.

A fit-positive reading articulates HoTT as an alternative $L_3$ formal-system articulation, parallel to ZFC. The schema is compatible with multiple alternative formal systems at $L_3$ (§ 3.8 and § 11.4), and HoTT is one such alternative.

A fit-negative reading articulates HoTT as potentially forcing schema refinement at $L_3$. The univalence axiom is not straightforwardly embeddable in the Gödel diagonal closure pattern that the schema places at $L_3$-4. The structural content of HoTT—the integration of formal proof and topological structure, the higher-categorical character of types, the resemblance to category-theoretic foundations—may require an $L_3$ articulation that the present schema does not fully anticipate. The case is a candidate for schema refinement via 5b.

The case is open. A subsequent $L_3$-specific paper engaging HoTT and univalent foundations in technical detail could clarify whether the schema accommodates HoTT as an alternative path or whether HoTT marks a schema boundary requiring refinement. The present paper records the candidate without prejudging the outcome.

A.8.3 Category theory and topos-theoretic foundations

The development of category theory, beginning with Eilenberg and Mac Lane's 1945 articulation of categories, functors, and natural transformations, and continuing through Lawvere's elementary theory of the category of sets (ETCS) and the development of topos theory (Lawvere, Tierney, Joyal), articulates an alternative foundational framework for mathematics. The category-theoretic articulation differs structurally from the set-theoretic articulation: where set theory builds mathematics from membership relations among sets, category theory builds mathematics from morphisms among objects in categories.

A fit-positive reading articulates category theory as a cross-layer tool that operates across $L_2$ (where category-theoretic articulations of complex algebraic geometry are particularly productive) and $L_3$ (where category-theoretic foundations engage formal-system articulations). The schema explicitly accommodates cross-layer tool use (§ 1.5, § 11.3), and category theory is a particularly productive case of such tool use.

A fit-negative reading articulates category theory as potentially forcing reformulation of the schema itself. If categories are taken as articulative primitives, with mathematical content articulated through morphisms and functors rather than through marked handles and operations on them, the schema's four-step structure may require reformulation in category-theoretic terms. Such reformulation is suggested in passing in § 1.4: step 1 as object marking, step 2 as functorial extension, step 3 as natural transformation, step 4 as colimit-with-remainder. Whether this reformulation is a refinement of the schema or a replacement of it is open; the answer depends on how thoroughgoing the category-theoretic reformulation can be made without losing the schema's articulative content.

The case is open. A subsequent paper engaging category-theoretic foundations specifically could clarify whether category theory operates as a cross-layer tool within the schema, as a parallel framework alongside the schema, or as a replacement framework into which the schema's content can be reformulated.

A.8.4 Forcing and large cardinals

Paul Cohen's forcing technique (1963), introduced to demonstrate the independence of the continuum hypothesis from ZFC, articulates a method internal to $L_3$ for constructing models of set theory in which specified statements are forced to be true or false. The subsequent development of large-cardinal axioms (inaccessible, Mahlo, measurable, supercompact, and beyond) articulates increasingly strong extensions of ZFC, each providing access to a higher region of the set-theoretic universe.

A fit-positive reading articulates forcing and large cardinals as $L_3$ internal sub-articulations: forcing as a method of constructing models within $L_3$'s formal-system articulation, large cardinals as extensions of the axiom system that articulate finer structure within the layer's path-branching inexhaustibility (§ 8.2). The schema accommodates these developments as articulations within $L_3$.

A fit-negative reading articulates forcing as a meta-operation that may exceed the schema's step-4 closure articulation. Forcing operates over models, constructing new models from old ones, in a way that does not straightforwardly fit the Gödel diagonal closure pattern. The schema's articulation of $L_3$-4 may require refinement to accommodate forcing as a model-theoretic operation. Similarly, large cardinals introduce extensions of ZFC whose articulative status within the schema's step-4 closure is open; whether they are sub-articulations within $L_3$ or articulations that go beyond the schema's current articulation of $L_3$ is unclear.

The case is open. A subsequent $L_3$-specific paper engaging forcing and large cardinals in technical detail could clarify the schema's relationship to these developments.

A.8.5 Honest stance on counter-example candidates

The candidates of § A.8.1 through § A.8.4 are recorded as open. The present paper does not claim that the schema fits each candidate cleanly; the candidates are listed precisely because the fit is partial, contested, or potentially non-fit. The schema's epistemic stance (§ 3.8) commits explicitly to acknowledging such cases honestly, without retrofitting them into the schema through ad hoc adjustments.

The principle for handling these candidates, in subsequent work, is the 5a / 5b distinction of § 3.6. If a specific mapping the schema claims to cover cannot accommodate the candidate, the mapping fails (5a), and the schema requires refinement at that point. If the candidate is stably outside the schema's articulative scope, the candidate is identified as a schema boundary (5b), and either the schema is extended to accommodate it (a schema update) or the candidate is acknowledged as belonging to an alternative articulative framework with which the schema coexists productively.

What is explicitly not permitted, on pain of immunizing the schema and destroying its falsifiability, is the routine reclassification of every counter-example candidate as merely a schema update opportunity. The 5a category remains genuinely open: there are cases in which the schema's specific articulations fail, and these failures require schema refinement rather than redescription. The honest stance of the present appendix is to record candidates without prejudging which category they fall into, and to leave the determination to subsequent technical work in the layer-specific papers and the engagements with alternative frameworks.

The historical stress-test of the schema is, in this sense, ongoing rather than completed. The cases of § A.1 through § A.7 are clear schema fits; the cases of § A.8 are open. The schema's standing depends on its capacity to engage both kinds of cases with the same epistemic discipline.

---

Appendix B: Detailed articulation of the operational defect algebra

This appendix expands the operational defect algebra $\omega_\rho^{(2)}$ of $L_2$ (§ 5.4) with the technical details that complete the structural articulation. The treatment is at the level appropriate to a foundational paper; technical depth beyond what is recorded here belongs to a subsequent $L_2$-specific paper.

B.1 Divisor

A divisor on a Riemann surface $X$ is a formal sum

$$\mathrm{div}(f) = \sum_p n_p \cdot p,$$

where $p$ ranges over points of $X$ and $n_p \in \mathbb{Z}$ records the order of zero (positive $n_p$) or pole (negative $n_p$) of a meromorphic function $f$ at $p$. The collection of divisors forms an abelian group under addition, with the principal divisors (those arising as $\mathrm{div}(f)$ for some meromorphic $f$) constituting a subgroup. The quotient $\mathrm{Cl}(X) = \mathrm{Div}(X) / \mathrm{Prin}(X)$ is the divisor class group, which records the divisors modulo equivalence by principal divisors.

The articulative content of the divisor is the point-state defect: the marking of zeros and poles as discrete points on the Riemann surface, with their multiplicities, and the algebraic organization of these point-defects into a group structure. The divisor is the first stage of the topological evolution chain (§ 5.4).

B.2 Residue

The residue of a meromorphic function $f$ at a pole $z_0$ is

$$\mathrm{Res}_{z_0} f = \frac{1}{2\pi i} \oint_\gamma f(z) \, dz,$$

where $\gamma$ is a small counterclockwise contour enclosing $z_0$ and no other singularity of $f$. For a simple pole, the residue is

$$\mathrm{Res}_{z_0} f = \lim_{z \to z_0} (z - z_0) f(z).$$

For a pole of order $n$, the residue is

$$\mathrm{Res}_{z_0} f = \frac{1}{(n-1)!} \lim_{z \to z_0} \frac{d^{n-1}}{dz^{n-1}} \left[ (z - z_0)^n f(z) \right].$$

The residue theorem (the layer's exchange law, § 5.4) states

$$\oint_\gamma f(z) \, dz = 2\pi i \sum_k \mathrm{Res}_{z_k} f,$$

where the sum ranges over singularities of $f$ inside $\gamma$. The articulative content of the residue is the local-monetary conversion: a point-defect (the pole and its multiplicity) is converted into an integral quantity (the residue value), through the articulative unit $2\pi i$. The residue is the second stage of the topological evolution chain.

A closely related exchange identity is the argument principle:

$$\oint_\gamma \frac{f'(z)}{f(z)} \, dz = 2\pi i (N - P),$$

where $N$ and $P$ count zeros and poles of $f$ inside $\gamma$ with multiplicities. The argument principle is a specialization of the residue theorem to the logarithmic derivative $f'/f$, and exemplifies the same exchange structure.

B.3 Period

A period of a closed differential 1-form $\omega$ over a cycle $\gamma$ on a Riemann surface is the integral

$$\mathrm{Per}(\omega, \gamma) = \int_\gamma \omega.$$

The collection of periods, indexed by cohomology and homology bases, forms the period matrix of the Riemann surface, an articulation of the surface's transcendental geometry. The period lattice $\Lambda \subset \mathbb{C}^g$ (for a genus-$g$ surface) records the periods over a basis of cycles and provides the data for the Jacobian variety $\mathrm{Jac}(X) = \mathbb{C}^g / \Lambda$. The articulative content of the period is the global-cycle defect: an integration that, in general, returns non-equivalent values along different cycles, capturing the surface's global non-triviality. The period is the third stage of the topological evolution chain.

B.4 Monodromy

The monodromy of a multi-valued holomorphic function $f$ at a singularity $z_0$ is the change in the function's value under analytic continuation along a closed loop around $z_0$. For a function with a simple branch point at $z_0$, the monodromy is articulated by a representation of the fundamental group $\pi_1(X \setminus \{z_0\})$ on the space of function values.

Specific examples include the monodromy of $\log z$ around $z = 0$, which adds $2\pi i$ to the function value per counterclockwise loop, and the monodromy of $\sqrt{z}$ around $z = 0$, which changes the function's sign per counterclockwise loop. More generally, multi-valued functions on punctured surfaces are articulated by their monodromy representations, with the structure of the representation capturing the function's analytic structure.

A deeper structural articulation is provided by Picard–Lefschetz theory, which connects monodromies to vanishing cycles and Lefschetz pencils. The articulative content of monodromy is the global-cycle path-dependence defect: a function's failure to be single-valued under analytic continuation, captured by the algebraic structure of the monodromy representation. The monodromy is the third stage of the topological evolution chain, alongside the period.

B.5 Growth at infinity

The asymptotic behavior of an entire function $f: \mathbb{C} \to \mathbb{C}$ as $|z| \to \infty$ is articulated by its order and type:

$$\rho = \limsup_{r \to \infty} \frac{\log \log M(r)}{\log r}, \quad \sigma = \limsup_{r \to \infty} \frac{\log M(r)}{r^\rho},$$

where $M(r) = \max_{|z| = r} |f(z)|$. The Phragmén–Lindelöf principle articulates constraints on entire functions' asymptotic behavior: a function bounded on certain sectors of the complex plane has constrained growth in adjacent sectors, with the constraint depending on the function's order.

The articulative content of growth at infinity is the boundary-asymptotic defect: a function's behavior as it approaches the boundary $\hat\infty$ of the Riemann sphere, articulated by its order and type. The growth at infinity is the fourth stage of the topological evolution chain.

B.6 Stokes data

The Stokes phenomenon, originally discovered by George Stokes in the context of the Airy function (1857), articulates the discontinuities of asymptotic expansions across sectoral boundaries in the complex plane. For an ordinary differential equation with an irregular singular point at infinity, formal asymptotic solutions are valid in specific angular sectors of $\hat{\mathbb{C}}$, and the formal solutions in adjacent sectors are related by Stokes multipliers that record the sector-to-sector mismatches.

The Stokes data of a differential equation form a set of matrices, indexed by Stokes lines (specific angular directions in the complex plane where dominant and subdominant solutions exchange roles), that articulate the asymptotic structure of the equation's solutions globally. The articulative content of Stokes data is the boundary-sectoral defect: the sector-to-sector mismatches of asymptotic expansions, articulated by the Stokes multiplier matrices. The Stokes data are the fourth stage of the topological evolution chain, alongside the growth at infinity.

The six components, organized into four stages, articulate the operational defect algebra at $L_2$. The component-by-component articulation in this appendix supplements the schematic articulation in § 5.4 with the technical detail required for the algebra's identification as a complete structural account.

---

Appendix C: Summary table of the layer mappings

The schema's articulations across $L_1$ through $L_5$ are summarized in the following table for reference. The table is a consolidated articulation of the structural details developed across § 4 through § 6, with each layer's step 1 through step 4 content and exchange law recorded in a single position.

Layer	Step 1 (nothing)	Step 2 (being)	Step 3 (neither being nor nothing)	Step 4 (negation of the third)	Exchange law
$L_1$	"1" precision handle	$\mathbb{Z}$ with $\pm\infty$ as distinct boundary markers	$\mathbb{Q}^{\mathrm{alg}}_{\mathbb{R}}$ with $0$ as multiplicative boundary	$\mathbb{R}$ via Cauchy completion, with transcendentals and $i$ as remainder	$\log(ab) = \log a + \log b$
$L_2$	$i$ as complexification seed	$\mathbb{C}$ with $\hat\infty$ as single boundary marker	$\mathbb{C}^*$ with rotation memory $e^{i\theta}$	$\hat{\mathbb{C}}$, Euler's formula, $\omega_\rho^{(2)}$	Residue theorem: $\oint_\gamma f \, dz = 2\pi i \sum \mathrm{Res}$
$L_3$	Prov / True predicates	Formal systems and theorems	Turing degree hierarchy, definability complexity	Gödel diagonal: $G \leftrightarrow \neg\,\mathrm{Prov}(\ulcorner G \urcorner)$	Gödel arithmetization $\#: \text{Formulas} \to \mathbb{N}$
$L_4$	$ct$ / $G$ handles	Spacetime translations, geodesics	Curvature, gauge symmetries	$rc^2 - 2GM = 0$ event horizon	$E = mc^2$
$L_5$	$S$, $\ln W$ handles	Extensive iteration	(breakdown in non-equilibrium regimes)	$S = k_B \ln W$ (conditional, equilibrium regime)	Boltzmann relation (conditional)

The table is to be read as a reference articulation of the schema's specific instantiations at each layer; the structural articulations in § 4 through § 6 provide the supporting argument that justifies the entries.

---

Appendix D: Mathematical instances of the $\eta$ regime measure

The regime-dependent transitions of § 7.2 are organized by the $\eta$ parameter of Cross-Layer Closure Equations. The following table records specific mathematical instances of the transition, with each row articulating a system that exhibits both closure-equation and probability-distribution articulations depending on regime.

Phenomenon	$\eta \to 0$ regime (closure-equation)	$\eta \to 1$ regime (probability-distribution)
Fluid mechanics	Laminar flow, low Reynolds number, Navier–Stokes with exact solutions	Turbulent flow, high Reynolds number, statistical patterns and structure functions
Quantum mechanics	Wave function evolution (Schrödinger equation)	Measurement outcomes (Born rule applied to $	\psi	^2$)
Double pendulum	Small oscillations, normal modes, exact periodicity	Chaotic regime, Lyapunov exponents, fractal-dimensional articulations
Three-body problem	Lagrange points, figure-eight orbit, integrable configurations	Chaotic regions, Poincaré sections, statistical phase-space distributions
Weather and climate	Short-term Lagrangian forecasts	Long-term climate statistics
Neural networks	Linear regimes, gradient descent convergence	Nonlinear training dynamics, generalization gap distributions
Living systems	(rarely $\eta = 0$)	Extreme non-equilibrium, evolutionary dynamics, systems-biology articulations

The articulative content of the table is the regime-dependence of grammar choice: the same system, in different regimes, is productively articulated by different grammars, with the transition between grammars not constituting a defect of either but the regime-dependence of mathematical productivity.

---

Appendix E: The ZFCρ Paper I/II implicit articulations

The relations between the present paper's schema and the ZFCρ series' implicit articulations are summarized in § 9.1. This appendix expands the summary with additional detail.

E.1 ZFCρ Paper I and the $L_1$ closure structure

ZFCρ Paper I [DOI: 10.5281/zenodo.18842458] articulates, in the present paper's terms, the closure structure of $L_1$ from the vantage point of the choice operation. The ZFC extensional closure produces, as its specific operational remainder, the $\rho$ marker that tracks the choice-operation history. The structural parallel with the schema's articulation of $L_{1\text{-}4}$ is direct: the Cauchy completion to $\mathbb{R}$ produces transcendentals and the unincorporable remainder $i$; the ZFC extensional closure produces the $\rho$ marker as the operational remainder of the $L_{1\text{-}2}$ choice operation. Both are closures within $L_1$, addressing different articulative aspects of the layer (the additive-multiplicative balance for $\mathbb{R}$, the choice-operation accounting for $\rho$).

ZFCρ Paper I's implicit articulation of $L_1$'s sub-architecture is, on the present paper's reading, an articulation of the $L_{1\text{-}2}$ choice-operation sub-articulation specifically. The paper does not articulate the full $L_1$ architecture; it articulates one sub-layer of the architecture, with the $\rho$ structure as that sub-layer's specific articulative content.

E.2 ZFCρ Paper II and the cross-layer transition structure

ZFCρ Paper II [DOI: 10.5281/zenodo.18927658] articulates the cross-layer transition structure—two-remainders-plus-one-action-equals-closure—that aligns with the schema's account of step-4 closure formulas. The mathematical structure articulated by Paper II is the structural pattern that the closure equations across layers exhibit: Schwarzschild's $rc^2 - 2GM = 0$ at $L_4$, Boltzmann's $S - k_B \ln W = 0$ at $L_5$, Euler's $e^{i\pi} + 1 = 0$ at $L_2$, the Gödel diagonal at $L_3$, all instantiate the same general pattern of two remainders combined with one action to produce closure.

The schema's articulation of step-4 closure formulas (§ 3) and the layer-specific closure articulations (§ 4 through § 6) are, in this sense, the architectural framework within which Paper II's mathematical structure operates. Paper II provides the general mathematical content of the cross-layer transition pattern; the present paper provides the architectural articulation within which that content has its place.

E.3 ZFCρ-specific work mapped to the schema

The subsequent ZFCρ papers (P50 and onward) map to specific positions within the schema's architecture. The spectral analysis introduced from approximately P50 articulates how the $L_1$ arithmetic content of ZFCρ overflows naturally into the $L_2$ complex-analytic defect algebra—a cross-layer involvement that the schema accommodates as cross-layer tool use (§ 1.5, § 11.3). The thermodynamic paper's articulation of the parameter $\eta$ articulates the $L_4 \to L_5$ articulative boundary—a structural articulation that aligns with the present paper's regime-dependent transition analysis (§ 7). The recent P73 spectral readout articulates, in technical detail, how the $L_2$ defect algebra appears within the ZFCρ context—a technical articulation that supplements the present paper's schematic articulation of $L_2$.

The ZFCρ series, in summary, is the specific technical work of one articulative path within $L_1$, with substantial cross-layer involvements as the work develops. The present paper's architectural articulation provides the framework within which the ZFCρ work has its place; the ZFCρ work provides the technical depth that the architectural articulation only sketches. The relationship between the two is, accordingly, one of mutual support: the architectural framework gives the technical work its articulative bearings, and the technical work gives the architectural framework its specific instantiation.

---

Acknowledgments

The present paper inherits its methodological foundation from Methodology 0: Negativa and Methodology 00: Via Rho, and its cross-layer transition structure from Cross-Layer Closure Equations and ZFCρ Paper II. Reviews by four AI collaborators—子路 (architectural coherence), 公西华 (structural hotfix and consistency-guarding), 子贡 (reality-check), 子夏 (mechanism and structure deep reading)—across multiple iterations of the outline and the Chinese version of the paper, contributed critical refinements, structural reality-checks, and substantive enhancements that this final version integrates. Feedback from Zesi Chen on key conceptual points clarified the boundary articulations of the schema.

---

References

Anthropic methodological inheritance:

• Methodology 0: Negativa. DOI: 10.5281/zenodo.19544620. The negativa axiom and the 0DD four phases (无 / 有 / 非有也非无 / 非"非有也非无").
• Methodology 00: Via Rho. DOI: 10.5281/zenodo.19657440. The Via Rho method, with ZFCρ as its mathematical carrier.
• SAE Methodological Overview Paper I. DOI: 10.5281/zenodo.18842450. The chisel-construct cycle.
• Methodology Paper VII. DOI: 10.5281/zenodo.19481305. The Via Negativa method.

Cross-layer transition foundation:

• Cross-Layer Closure Equations. DOI: 10.5281/zenodo.19361950. Physical-layer transitions and the $\eta$ regime parameter.

ZFCρ series technical foundations:

• ZFCρ Paper I. DOI: 10.5281/zenodo.18842458. ZFC extensional closure and the $\rho$ marker.
• ZFCρ Paper II. DOI: 10.5281/zenodo.18927658. The cross-layer transition mathematical structure.

Other SAE series and parallel articulations:

• Four-forces series (in development).
• Cosmology series (in development).
• Geometric and dynamical articulation series (in development), including the Gauss–Bonnet exchange law paper sometimes cited here as "Forms and Flows Paper 1".

Philosophy of mathematics references engaged at minimal level:

• Plato. Republic, especially the discussion of mathematical objects in Book VI.
• Linnebo, Ø. Thin Objects. Oxford University Press, 2017.
• Parsons, C. Mathematical Thought and Its Objects. Cambridge University Press, 2008.
• Mac Lane, S. Categories for the Working Mathematician. Springer, 1971 (and subsequent editions).
• Awodey, S. Category Theory. Oxford University Press, 2010.
• Brouwer, L. E. J. Collected Works. North-Holland, 1975.
• Bishop, E. Foundations of Constructive Analysis. McGraw-Hill, 1967.
• Voevodsky, V. Univalent Foundations Program. Homotopy Type Theory: Univalent Foundations of Mathematics. Institute for Advanced Study, 2013.

Substantive engagement with these references is deferred to layer-specific papers in the SAE series, where the engagement can be conducted with the depth that detailed philosophical work requires.

---

— Han Qin (秦汉), 2026-05-13

摘要

本文阐述 SAE (Self-as-an-End) 数学的建筑学结构, 建立在 Methodology 0: Negativa 与 Methodology 00: Via Rho 两篇方法论论文的基础之上. 本文提出层级阐述模式 (Layer Articulation Schema): 在本文考察的各主要数学层级 ($L_1$ 至 $L_5$), 都可识别出一种四步模式, 每一步的结构角色与 Methodology 0 所阐述的 negativa 自我追问之四相相应——第一步的标记把手对应"无"相, 第二步的加法路径对应"有"相, 第三步带记忆绑定的乘法路径对应"非有也非无"相, 第四步的带余项闭合对应"非'非有也非无'"相.

本模式作为识别性阐述提出, 由四条充分性标准 (把手充分性、路径充分性、记忆充分性、闭合充分性) 支撑, 并附带明确的失败模式 (包括局部映射失败与模式边界识别的区分). 本文不主张此为推导性证明 (即不主张数学必然以此模式展开), 也不主张此为数学唯一的阐述框架.

本文展示模式在 $L_1$ (数、算术、$\mathbb{R}$ 的 Cauchy 完备化, 含技术修订: $L_1$ 乘法路径闭合于实代数数 $\mathbb{Q}^{\rm alg}_{\mathbb{R}}$ 而非整个代数闭包 $\overline{\mathbb{Q}}$)、$L_2$ (复分析、欧拉公式作为闭合的优雅实例、操作缺陷代数 $\omega_\rho^{(2)} = (\operatorname{Div}, \operatorname{Res}, \operatorname{Per}, \operatorname{Mon}, G_\infty, \operatorname{Stokes})$ 组织为四阶段拓扑演化链)、与 $L_3$ (形式系统、可计算性、Gödel 对角不动点闭合 $G \leftrightarrow \neg\,\operatorname{Prov}(\ulcorner G \urcorner)$, 其中 Gödel 算术化作为一种拓扑结绳操作, 与 $L_2$ 操作缺陷代数形成结构呼应) 的具体阐述. $L_4$ (相对论时空) 与 $L_5$ (统计热力学) 的阐述仅作为来自同一四相源头的并行展示 (parallel displays) 简要呈现, 不作为本文的数学主张; 其实质性处理留给 SAE 系列中的四力论文与宇宙学论文.

交换律模式 作为模式的一项非平凡跨层级预测被识别出来: 每一层都拥有一个特定的交换恒等式 ($L_1$ 的对数, $L_2$ 的留数定理 (单位 $2\pi i$), $L_3$ 的 Gödel 算术化, $L_4$ 的 $E = mc^2$, $L_5$ 的 Boltzmann 关系), 阐述单位随层级结构变化而变化.

模式在 $L_5$ 处的范围边界被阐述为数学内部两种互补阐述语法之间的转换: 在 $L_1$ 至 $L_4$ 与 $L_5$ 平衡区中具有生产力的闭合方程语法 (closure-equation grammar), 与在非平衡 $L_5$ 及以上区中具有生产力的概率分布语法 (probability distribution grammar). 两种语法互补而非层级化 (complementary, not hierarchical), 互不可还原, 各在所适合的区中具有生产力. 两种语法之间的体制依赖转换在多个具体系统中得到展示 (流体力学、量子力学、双摆、三体问题、天气与气候、神经网络).

本文的元命题阐述双重不可穷尽性 (twofold inexhaustibility): 在对象层级, 数学内容不可穷尽 (含层内的、层间的、路径分支的、与元阐述递归的四种不可穷尽性); 在元层级, 数学的阐述框架不可穷尽 (本模式只是众多持续可能的替代框架中一个具有生产力的特定框架). 模式的认识论纪律即是在这种双重不可穷尽性中工作而不试图克服它的纪律.

数学历史记录被作为模式的压力测试 (stress-test) 处理. 清晰的模式契合包括 $p$-进数 (作为"构不可闭合"原理特别清晰的实例)、Cantor 超穷基数、Gödel 不完备性定理、Cauchy 严格化、复分析的发展、与 Hilbert 计划的后-Gödel 命运. 开放候选包括超实数 (surreal numbers)、同伦类型论 (HoTT)、范畴论与拓扑斯基础、强迫与大基数扩展. 开放问题与未来工作方向亦被识别出来, 包括 $L_2$ 操作缺陷代数的合成律、概率分布语法的结构性阐述、跨层级工具使用、与数学哲学传统的细致接洽、与跨学科的并行展示.

本文定位为 SAE 数学纲领的建筑学基础, 补充 Cross-Layer Closure Equations 对物理层级转换的处理与 ZFCρ 系列在 $L_{1\text{-}2}$ 选择操作子阐述方面的技术工作. 本文不替换 SAE 文集中既有论文, 而是阐述文集内容所处的建筑学框架.

关键词: SAE (Self-as-an-End), negativa, Via Rho, 层级阐述模式, 0DD 四相, 数学哲学, 数学基础, 不可穷尽性, 操作缺陷代数, Gödel 对角闭合.

---

1. 导论

1.1 定位与动机

数学如何与实在的结构相关, 这一问题至少自柏拉图主张数学对象独立于人类思想而存在之时即已占据哲学反思的位置. 关于此问题的当代标准立场——柏拉图主义、形式主义、构造主义、结构主义 (含其范畴论的精炼形式) ——均已得到相当详尽的阐述与辩护, 而每一种立场都把握了数学实践中某种重要的方面. 但每一种立场, 单独看, 都留下一种残余困难. 柏拉图主义解释了为什么数学似乎追踪某种超越约定的东西, 却难以说明我们对此的认知通道. 形式主义解释了推导的确定性, 但使数学对物理学的明显可应用性显得神秘. 构造主义解释了数学对象如何向我们生成, 但在其标准的、可计算性导向的形式中, 它把某些对象无法构造视为障碍, 而非内容. 结构主义解释了为什么同构的结构在数学上可互换, 但对于结构为什么按其实际所呈现的方式分层 (算术先于复分析、复分析先于形式系统理论), 它没有提供原则性的说明.

本文采取一个不同的出发点. 不再追问数学对象是否独立存在、数学陈述是否可还原为形式操作、数学是否由我们构造, 本文转而追问: 是什么生成了数学实践实际所呈现的分层建筑? 为什么存在数与算术的 $L_1$、复分析的 $L_2$、形式系统与可计算性的 $L_3$——而且这些层级为什么彼此处于如其所是的特定关系之中?

本文的论题是: 数学的分层建筑——如其在 SAE (Self-as-an-End) 框架中所呈现——可以从一种更深层的结构模式中读出, 即 Methodology 0 所阐述的 negativa 自我追问之四相 (四相), 而这种读出已足够规则, 可以表述为一种模式. 本文称此模式为层级阐述模式 (Layer Articulation Schema). 模式在本文考察的各主要数学层级中识别出一种四步模式: 一个标记把手、一条加法路径、一条带记忆绑定的乘法路径、与一次产生指向下一层余项的闭合.

主要主张是: 此模式在 SAE 数学中呈现的 $L_1$ 至 $L_5$ 各层中描述性地可识别 (descriptively identifiable), 其精确含义由 § 3.5 的充分性标准与 § 3.6 的失败模式给出. 这并非主张模式是推导性必然的, 也非主张模式是数学唯一的阐述框架, 也非主张数学被 $L_1$ 至 $L_5$ 穷尽. 主要主张附带一项元命题: 数学的不可穷尽性是双重的 (twofold) ——数学内容在对象层级不可穷尽, 数学的阐述框架在元层级不可穷尽. 本文所提供的模式是在此双重不可穷尽性内工作的、一个具有生产力的特定框架, 而非一个全体化的框架.

1.2 SAE 方法论背景

本文建立在 SAE 纲领的两篇先前基础论文之上.

第一篇, Methodology 0: Negativa [DOI: 10.5281/zenodo.19544620], 确立 negativa (非) 作为 SAE 框架的唯一公理. Negativa 自我追问作为其第一组定理产生四相 (0DD 四相): 无、有、非有也非无、非"非有也非无". 这四相穷尽 negativa 自我作用的运作层级; 假想的第五相——Methodology 0 称之为"想入非非"——导致一种阐述崩溃的状态.

第二篇, Methodology 00: Via Rho [DOI: 10.5281/zenodo.19657440], 确立 Via Rho 作为 Via Negativa 的方法论对偶. Via Negativa 通过否定既与而推进, Via Rho 则通过追踪任何阐述都会产生但无法纳入的余项 (ρ) 而推进. 那里把 ZFCρ 技术论文系列确定为 Via Rho 的具体数学载体, 追踪在 $L_1$ 中由选择操作产生的特定余项.

本文既不是 ZFCρ 技术工作的延续, 也不是 Cross-Layer Closure Equations [DOI: 10.5281/zenodo.19361950] 的重述 (该论文详细阐述物理层级的转换 $L_3 \to L_4$ 与 $L_4 \to L_5$). 本文毋宁是 SAE 数学框架作为整体的建筑学阐述——说明 Methodology 0 的四相模式与 Methodology 00 的余项追踪方法如何共同生成数学的分层结构, 以及这种生成的原则性边界为何.

1.3 主张强度

此类论文同时在数种主张强度水平上运作, 在开篇时把这些水平显式出来至关重要. 熟悉数学建筑哲学这一文体的读者将能识别出这类论文中一种典型的诱惑: 把描述性识别提升为推导性主张. 本文抵抗此诱惑, 但抵抗本身需要是可见的, 而不仅是被声明的.

下表概述本文主要内容的主张状态:

内容	主张状态
0DD 四相 (Methodology 0)	继承的基础
各层四步映射	识别性的阐述模式
$L_1, L_2, L_3, L_4$ 的模式实例	结构性展示
$L_5$ 处闭合方程语法的崩溃	工作性的边界观察
数学与框架的双重不可穷尽	元命题
数学的确定论与概率论阐述之间的边界	工作假设

第一行从 Methodology 0 继承, 本文不重新推导. 第二行——本文的中心贡献——作为识别提出, 由 § 3 中所发展的充分性标准与可证伪性条件支撑, 但不作为关于数学必然以四步展开的推导性证明. 第三行记录本文所考察各层的具体模式实例; 这些实例作为结构性展示呈现, 表明与模式的契合, 而非对那些层级数学的穷尽处理. 第四行记录关于闭合方程式阐述何处让位于概率分布式阐述的工作观察, 不主张此转换为不可避免. 第五行是本文的元命题, 我们将在 § 3.8 与 § 8.5 讨论. 第六行作为工作假设提出, 可根据数学的进一步发展加以精化.

这种分层不是回避. 它是一项工作承诺: 在本文每一处, 读者应能识别出当下所作主张的层级水平, 并在此基础上评估本文的证据. 在模式被作为已识别模式呈现之处, 邀请读者依 § 3 的充分性标准与失败模式、以及附录 A 的历史压力测试来检验此识别. 在双重不可穷尽性元命题被阐述之处, 邀请读者将其与关于数学不完备性的其他元立场——Gödel 启发的认知极限、Lakatos 式的历史可错性、结构主义的开放性——并置考虑, 而非视其为竞争性的绝对主张.

1.4 与数学哲学中标准立场的关系

对数学哲学文献的完整接洽超出此类建筑学论文的范围, 留给 SAE 系列中各层级专题论文 ($L_1$ 专题论文将接洽 Cantor、Cauchy 与各种基于完备化的基础; $L_3$ 专题论文将接洽 Hilbert 计划、Gödel、Tarski 与后-Gödel 的逻辑传统; 余类推). 在建筑学层面, 然而, 本文与四种标准立场的关系可以简要指明.

关于朴素柏拉图主义. SAE 框架不从柏拉图主义意义上预先存在的数学对象出发. 在此说法中, 数学对象作为阐述活动的稳定产物涌现, 而不是作为对预先存在的永恒形式的发现. 此稳定性是真实的, 也正是它使数学在数学家之间、跨越世纪都可处理且可分享; 但此稳定性是阐述出的稳定性, 而非独立存在的稳定性. 这不是对柏拉图主义的简单拒斥: 存在精致形式的柏拉图主义 (例如 Linnebo 的薄对象 thin objects, Parsons 的结构主义柏拉图主义), SAE 框架与之有实质性的接触点, 此种接洽将留给层级专题论文.

关于纯形式主义. SAE 框架拒绝把形式系统视为完全任意的游戏. 在此说法中, 形式系统受其 ρ-结构 (其所生成的余项)、其闭合条件、与界定其操作具有生产力之区域的边界标记所约束. 不满足这种约束的形式系统不是数学工作的候选; 它只是一种记号性的演练. 此主张与形式主义关于数学真理是特定系统内可推导性的直觉相容, 但它附加了一个条件, 即系统本身须满足 § 3.5 所阐述类型的充分性标准.

关于构造主义 (在广义上含 Brouwer 直觉主义与 Bishop 风格的构造性分析). SAE 框架在大致上同情构造主义. 在 SAE 说法中, 数学由操作生成——标记、迭代、绑定、闭合——而操作本身是含内容的, 不仅是对预先存在对象的形式操控. 然而, SAE 框架不把数学内容限制于可计算地可构造的范围. 余项与不可闭合的边界在 SAE 框架中是阐述的正面对象, 而不是要被消除的障碍. 在此意义上, SAE 框架更接近 Brouwer 式而非 Markov 式或 Bishop 式的构造主义, 但它并不完全契合于任何一种标准构造主义立场.

关于结构主义 (含 Mac Lane、Awodey 等的范畴论精炼). SAE 框架共享结构主义的信念, 即数学对象由其结构关系而非由内在性质来个别化. 层级阐述模式事实上可以以范畴论的方式被读出——第一步作为对象标记, 第二步作为函子扩展, 第三步作为自然变换或记忆绑定, 第四步作为带余项的余极限——此读法将在未来的论文中发展. SAE 框架在标准结构主义之上附加一项要求, 即每一结构都需附带对其余项账本与边界标记的明确盘点; 没有此种盘点的结构, 在 SAE 视角下, 是阐述未充分的.

本文所提供的层级阐述模式不主张为数学哲学的唯一框架. 柏拉图主义、形式主义、构造主义、结构主义、同伦类型论、集合论基础、范畴论基础, 各自阐述数学实践的不同角度, 各在所属范围内具有生产力. 模式作为一个具有生产力的特定框架, 内在于 SAE 视角, 与这些框架并列而非竞争.

1.5 本文不主张

为防过度解读, 本文显式记录其不主张的主要内容.

本文不主张证明 Methodology 0. 四相结构从 Methodology 0 继承并在此使用; 本文不重新建立它.

本文不主张数学历史必沿此模式所识别之路线发展. 数学历史含各种偶然因素——制度的、传记的、地理的、经济的——而模式是对可在回顾中识别之模式的描述, 不是对历史必然性的预测.

本文不试图替换 ZFC、同伦类型论或范畴论基础. 模式是一种阐述框架, 而非替代性的公理化基础.

本文不主张概率论不是数学. 在 $L_5$ 处闭合方程式阐述与概率分布式阐述之间的转换, 是数学内部两种模式之间的转换, 而非数学与其外的某物之间的边界 (见 § 7).

本文不主张 $L_1$ 至 $L_5$ 穷尽数学. 处于本文模式范围之外的数学发展是可能的、实际上是可期待的; 模式明确为之留出空间 (见 § 3.8 与 § 11).

本文不主张每个数学对象唯一属于一层. 跨层级使用工具在高等数学中是常见的——复分析对 $L_1$ 取值函数使用 $L_2$ 工具, 代数几何对 $L_3$ 结构使用 $L_2$ 工具, 拓扑 K 理论同时使用 $L_2$ 与 $L_3$ 工具——而模式与此种跨层级实践相容. 层级归属按主要阐述功能而定, 不按排他分类.

本文不主张已为 SAE 数学建立一个公理化系统. 本文是建筑学阐述, 不是系统构造论文. 完整的公理处理 (如有此追求) 将是一项分立的工作.

最后, 一项跨系列的澄清是必要的. 在 SAE 纲领中, 符号 $L_3$ 在不同语境出现且含义不同. 在本文中, $L_3$ 专指形式系统、可计算性与可判定性的层级——可证性、可定义性与 Turing 度的数学. 在其他 SAE 系列 (尤以动力系统系列为甚) 中, $L_3$ 指向一种不同种类的动力学层级指标. 跨系列阅读的读者应注意此差异. 在本文阐述的框架内, 二者并不冲突: 它们是四相模式在不同阐述层级的并行展示, 符合 § 6 关于并行展示的一般说法.

1.6 本文章节安排

本文余下部分如下安排. § 2 发展激励模式之阐述谱系, 自 $L_0$ 的定性阐述开始, 推进至 $L_{1\text{-}1}$ 处 "1" 的标记. § 3 呈现层级阐述模式本身, 含充分性标准 (§ 3.5)、失败模式 (§ 3.6) 与伴随模式的认识论立场 (§ 3.8). § 4 在 $L_1$ (数、算术与实数闭合) 展示模式. § 5 在 $L_2$ (复化、欧拉闭合与复分析的操作缺陷代数) 展示模式. § 6 在 $L_3$、$L_4$、$L_5$ 展示模式, 并附带保留: $L_4$ 与 $L_5$ 是非数学层级, 在此仅作为来自同一四相源头的并行展示, 而不是本文的数学贡献. § 7 以数学内部两种互补阐述模式 (闭合方程语法与概率分布语法) 与两者之间的体制依赖转换来阐述模式的范围边界. § 8 发展双重不可穷尽性的元命题. § 9 把本文放在与 ZFCρ 系列及其他 SAE 系列的关系中. § 10 回顾本文的范围边界并作结. § 11 汇集未来工作的开放问题. 附录 A 给出模式在数学历史结点上的压力测试, 含潜在反例候选. 附录 B 至 E 提供技术参考材料.

---

2. 阐述谱系: 从 $L_0$ 到 "1" 的标记

2.1 关于谱系的一项说明

下面的思想实验重构数学阐述如何能从 Methodology 0 的四相模式中涌现. 它是一种阐述的谱系 (genealogy of articulation), 而非对人类史前史的重构. 数学的实际历史涌现是数学史与数学人类学的事务; 它涉及巴比伦的会计、埃及的土地测量、希腊的几何推理、印度的数字记号, 以及无数其他偶然发展——任何单一模式都无法把这些悉数捕获. 此处呈现的谱系处理一个不同的问题: 给定四相模式作为出发点, 我们能否展示从最初步的定性阐述到第一个稳定数学把手的生成路径? 肯定的回答将支持模式对自相似图样的描述性识别这一主张; 然而, 它将不支持关于历史必然性的主张.

2.2 重访四相

我们简要回顾 Methodology 0 的四相. Negativa 自我追问, 接续产生:

第一相, 无 (无). 是 negativa 应用于其自身运作的阐述印迹. 它不是任何直白意义上的缺席, 因为缺席已经预设一个对偶项 (那不在场之在场者). 它毋宁是一个被标记的状态——在此状态中, negativa 把自身登记为尚未发展.

第二相, 有 (有). 由无的否定而起. 它是对一个正面实体的标记, 与第一相对偶且不可分离. 第一相标记尚未发展的状态; 第二相则标记一个发展出的实体——尚未对其施加操作, 但已可识别为某物而非单纯占位符.

第三相, 非有也非无 (非有也非无). 由对偶 (有/无) 的否定而生. 在此相, 阐述移至元层级: 第三相既非单纯的正面, 也非单纯的负面, 而是对对偶本身施加操作的结果. 它呈现出记忆或绑定的形式——一种把第二相所只是设定者持守在一起的阐述.

第四相, "非有也非无" 之否定 (非"非有也非无"). 第三相的否定. 它呈现出自我指涉闭合的形式: 一种回返到其自身元层级运作的阐述. 此闭合不是最终止息之处; 它产生一项余项——闭合所触及但未纳入者——而此余项是任何在下一层级进一步阐述的触发者.

这四相穷尽 negativa 可应用于自身的运作层级. 假想的第五相, 即对对偶的否定的否定的否定的尝试, 导致 Methodology 0 所称的"想入非非"——一种阐述崩溃的状态, 阐述不再追踪任何运作内容. 在此意义上, 四相是 negativa 自我追问的最大阐述分辨.

2.3 $L_0$ 处的阐述情形

$L_0$ 标示一切定量阐述之先的定性阐述状态. 我们用一位假想的阐述者 (姑且称为原型数学家) 来建模此状态. 她的阐述资源由定性对偶对构成: 多/少、更多/更少、更大/更小. 关于一群羊, 她能阐述"多"; 关于两群羊, 她能阐述其中一群"多于"另一群. 但她无法阐述究竟"多少".

这并非通过添加一个独立的精确性官能即可弥补的不足. 在本文的说法中, 这是第二相应用于物的世界的自然状态: 原型数学家能标记正面实体及其定性对偶, 但标记停留在有与无的层级. 当她试图闭合此阐述时——当她自问"'多'到底是什么?"——闭合失败. 不同语境给出不同回答 (一百只羊对农夫是多, 对王国是少), 单凭定性对偶, 无法抽取出稳定的把手. 闭合尝试失败, 而失败产生一项余项: 精确性缺席.

这项余项不是无物. 它是某一把手缺席的被感受到的方式; 一个能让阐述闭合的把手缺席之感. 原型数学家在 $L_0$ 处试图闭合的阐述, 正以其失败本身, 生成对下一层级阐述的诉求.

2.4 "1" 的标记

对 $L_0$ 余项的阐述回应是引入一个新的标记把手: "1". 这既不是对柏拉图式对象的发现, 也不是对集合的构造, 更不是对形式语言中原始项的设立. 它是对一个精确性把手的标记——一个记号, 其作用是抵抗定性对偶之不定性, 把"恰恰这一个、不多不少"固定下来.

"1" 在此阶段是已标记但尚未构造. 它不携带任何操作: 没有加法、没有乘法、没有后继函数. 它是 $L_0$ 阐述未能交付之精确性的占位符. 在此意义上, "1" 镜像 Methodology 0 的第一相: 它是阐述尚未发展之状态的标记, 是 negativa 在数学阐述门槛上的印迹.

按模式的术语, 这是 $L_1$ 的第一步——我们将其写作 $L_{1\text{-}1}$. $L_1$ 余下各步——加法路径、乘法路径与闭合——将作为模式的第二、第三与第四步应用于此标记把手而展开. 在本文的说法中, 原型数学家离开 $L_0$ 而进入 $L_1$, 不是一次跃迁, 而是一次循环: 组织 negativa 之追问的同一四相模式, 现在组织数学阐述本身.

本文余下部分展开此循环之后果.

---

3. 层级阐述模式

3.1 模式概述

在 SAE 视角下, 本文所考察的数学层级呈现出一种强自相似的图样: 每一层级都可被读为 Methodology 0 的四相模式应用于一项具体阐述内容. 我们把此观察表述为层级阐述模式:

相 (Methodology 0)	步 (数学层级)	角色
第一相: 无	第 1 步: 已标记, 未构造	标记把手在尚未发展状态
第二相: 有	第 2 步: 加法路径	含正面实体的可迭代延展
第三相: 非有也非无	第 3 步: 乘法路径	元层级的记忆绑定
第四相: 第三相之否定	第 4 步: 带余项闭合	产生指向下一层之触发的自我指涉闭合

模式的中心内容是右列: 在每一层级的每一步, 都可识别出一项具体角色. 主张是, 在本文所考察的 $L_1$ 至 $L_5$ 各层中, 此角色由一项具体数学内容 (一个标记把手、一种可迭代加法结构、一种含绑定的乘法结构、一个闭合公式) 来填充, 而此填充按其自身条件而可识别.

此处务须把主张的强度固定下来. 我们不主张模式是推导性必然的: 不存在某种证明, 表明数学若不以每层四步发展则将不一致. 我们不主张模式是唯一的阐述框架: 其他框架——范畴论的、结构主义的、直觉主义的、形式主义的——阐述数学实践的不同角度, 而本模式是与之并列、具有生产力的一个特定框架. 我们确实主张模式是描述性可识别的: 在我们所考察的各层, 四步模式可具体展示, 而此展示允许充分性标准 (§ 3.5) 与失败模式 (§ 3.6), 使得识别可证伪, 而非空洞.

修饰词"强自相似"不是隐喻. "强"的含义是: 此图样, 在每一层级应用时, 均满足下文发展的充分性标准, 且没有失败模式被识别出. 此图样是可证伪的——某一被提出的新层级映射或对既有层级的重新考察, 可能未能满足标准; 若如此, 模式将需修订. 当下模式在 $L_1$ 至 $L_5$ 保持成立, 其依据是此可证伪性纪律, 而非任何设定. 模式完整的认识论立场在 § 3.8 阐述.

3.2 模式之 Via Negativa 读法

模式允许两种互补读法, 分别对应 Methodology 0 与 Methodology 00. 我们先发展第一种, 它把每一层级的四步读为 negativa 在特定阐述层级对自身追问的实例.

在第 1 步, 层级在一个"非"-状态标记一个把手. 把手在场, 但尚未被操作; 它呈现第一相"无"的形式, 即一个未发展状态的标记. 在 $L_{1\text{-}1}$, 这是算术之前 "1" 的标记; 在 $L_2$-1, 这是复乘法之前 $i = \sqrt{-1}$ 的标记. 在两种情况下, 把手的阐述内容都被它所否定者所穷尽: "1" 标记多元性的缺席, $i$ 在 $\mathbb{R}$ 的代数余项中标记实性的缺席.

在第 2 步, 对第一相的否定产生正面实体. 层级的加法路径迭代标记把手, 生成一种由标记实体组成的结构. 在 $L_{1\text{-}2}$, 这是 $\mathbb{Z}$ 的生成, 由 $+1$ 与 $-1$ 的连续应用得来; 在 $L_2$-2, 这是 $\mathbb{C}$ 作为 $\mathbb{R} + i\mathbb{R}$ 的生成. 如此生成的实体呈现第二相"有"的形式: 它们是正面的、被标记的, 且与第 1 步的未发展状态处于对偶关系.

在第 3 步, 对对偶 (第 1 步与第 2 步共同) 的否定, 在元层级产生一项阐述. 层级的乘法路径引入一种记忆或绑定结构——一种把加法路径的迭代持守在一起、却不还原为对加法路径迭代之重命名的阐述. 在 $L_{1\text{-}3}$, 这是乘法对迭代计数作为标记把手的内涵化 (使得乘积 $3 \times 5$ 不只是 $5 + 5 + 5$ 的另一记号, 而是把迭代计数 "三"与被迭代值"五"绑定的把手); 在 $L_2$-3, 这是旋转记忆 $e^{i\theta}$, 跨复乘法持守角度积累——一种在加法路径中不存在的结构. 如此产生的阐述呈现第三相"非有也非无"的形式: 它既非简单的正面实体 (如加法迭代之所是), 亦非单纯的缺席, 而是元层级的绑定.

在第 4 步, 对第三相的否定产生自我指涉闭合. 层级在其自身的乘法阐述上闭合, 在同一动作中生成一个闭合状态, 以及一项闭合所无法纳入的余项. 在 $L_{1\text{-}4}$, 这是到 $\mathbb{R}$ 的 Cauchy 完备化, 加上不可纳入的余项 $i = \sqrt{-1}$ (它强制向 $L_2$ 的转换); 在 $L_2$-4, 这是 Riemann 球面 $\hat{\mathbb{C}}$, 加上操作缺陷代数 $\omega_\rho^{(2)}$, 以及当其路径依赖被转换为形式系统问题时则指向 $L_3$ 的多值性余项.

这就是 Via Negativa 读法. 它把每一步识别为 negativa 在所讨论数学层级的阐述层面对其自身先前相的特定应用.

3.3 模式之 Via Rho (余项) 读法

第二种读法对偶地推进: 每一步被读为余项的产生与积累, 一如 Methodology 00 之所为.

第 1 步产生一个标记把手, 它本身就是先前层级闭合余项的可操作化. 把手不是从无中引入: 它是先前层级所无法纳入者经使之可操作而留下的印迹. 在 $L_{1\text{-}1}$, "1" 把 $L_0$ 的精确性余项可操作化; 在 $L_2$-1, $i$ 把 $L_{1\text{-}4}$ 的非实代数余项可操作化.

第 2 步产生迭代余项. 加法路径在两个方向上推进——正向与反向——在每一方向上, 迭代逼近一个边界标记而无法到达. 边界标记不属于被迭代的结构; 它是迭代之生产力终止的阐述极限. 在 $L_{1\text{-}2}$, 边界标记是 $+\infty$ 与 $-\infty$ (它们不同, 因为加法路径在一维上是有方向的); 在 $L_2$-2, 边界标记是单一点 $\hat\infty$ (因为二维加法路径允许所有方向的旋转性识别).

第 3 步产生记忆余项. 乘法路径把迭代计数内涵化为绑定结构, 但此绑定本身又生成新的余项. 其中一些是乘法路径的边界标记 ($L_{1\text{-}3}$ 与 $L_2$-3 中的 $0$); 另一些是路径所无法吸纳的操作余项 ($L_{1\text{-}3}$ 中的素数结构及其分解结构; $L_2$-3 与 $L_2$-4 中的除子、留数、周期、单值群、增长与 Stokes 数据, 我们将在 § 5 讨论).

第 4 步产生闭合尝试的余项——那不可纳入的触发者, 它强制下一层级. 在 $L_{1\text{-}4}$, 这是 $i = \sqrt{-1}$, 它抵抗被纳入 $\mathbb{R}$, 因为 $\mathbb{R}$ 是一维的而 $i$ 要求二维扩展. 在 $L_2$-4, 这是一族多值行为——对数、平方根、分支点——它们的路径依赖一旦被转换为关于规则、证明或可判定性的问题, 即成为 $L_3$ 的阐述内容 (见 § 5.5 与 § 6.1).

Via Negativa 与 Via Rho 两种读法并不相互冲突. 它们是阐述同一模式的两种方式: 第一种关注每一步从其先前者所否定者, 第二种关注每一步为其后继者所留下者. 二者共同把模式识别为既是自我应用之否定的结构, 又是余项积累的结构.

3.4 边界标记与操作余项

模式要求一项虽简单但在数学哲学中反复成为困惑之源的区分: 边界标记与操作余项之区分.

边界标记是某一步的迭代所逼近而不到达的点或极限. 边界标记属于层级的阐述地景, 但它不是数学工作发生之处. 它处于背景中, 作为迭代的渐近视界. 在 $L_{1\text{-}2}$, $\pm\infty$ 是加法路径的边界标记: 每一整数都是有限的, 没有任何整数是 $\pm\infty$; 而 $+1$ 与 $-1$ 的迭代沿两个方向推进, $\pm\infty$ 是那两个方向上的视界. 在 $L_{1\text{-}3}$, $0$ 是乘法路径的边界标记: 任何非零有理数的乘积皆非零, 而路径的反向 (除法) 从任何起点都无法达至零. 在 $L_2$-2, $\hat\infty$ 是二维加法路径的边界标记——此次作为单一的紧致化点.

操作余项则相反, 是由该步操作本身所产生、并作为前景内容在层级内积累的标记把手. 在 $L_{1\text{-}3}$, 素数结构是一项操作余项: 素数是被乘法路径识别为不可约的正整数, 由此而生的分解结构 (及其唯一性定理) 是数学工作的主题, 不是边界. 在 $L_2$, 留数、周期、单值群、除子、无穷处增长与 Stokes 数据全都是操作余项, 作为 $L_2$ 操作缺陷代数的代数内容而积累 (§ 5.4).

此区分至关重要, 因为数学研究——如其在工作数学的期刊与教材中实践——发生在操作余项的层面, 而非边界标记的层面. 一篇关于留数演算的论文不会在主要部分追问 $\hat\infty$ 在某种形而上意义上是什么; 它计算特定奇点处的留数, 并追踪它们的代数关系. 一篇关于素数分布的论文不会追问 $\pm\infty$ 是什么; 它研究素数在整数中的密度与结构. 边界标记作为研究所在之渐近地景而起作用; 它们本身不是研究的对象.

把边界标记与操作余项混同是数学哲学中几项持久困惑的根源. 其中最熟悉者是把无穷视为一种关于其存在与同一性可追问的单一对象的处理. 模式的区分主张, 边界标记 $\hat\infty$ (或 $\pm\infty$) 不是相关意义上的对象; 它是一项迭代的极限, 关于它的问题最好通过考察迭代本身, 而非把极限实体化, 来处理. 操作余项, 与之相反, 是相关意义上的对象: 留数是复数, 除子是某群的元素, Stokes 数据是矩阵. 模式对这两类的分离保存了它们的区别.

3.5 充分性标准

为使某一数学层级映射到模式的提议合格为契合, 它须满足四条充分性标准. 标准被表述为对映射而非对数学本身的条件; 同样的数学可以在不同的标准系下接纳不同的阐述, 当下的表述并不排除替代.

把手充分性 (handle adequacy). 所提议层级第 1 步的标记把手, 须是先前层级闭合余项的可操作化. 它不能任意引入, 也不能为美学或记号便利而选择. 在 $L_{1\text{-}1}$, 把手 "1" 是 $L_0$ 精确性余项的可操作化. 在 $L_2$-1, 把手 $i$ 是 $L_{1\text{-}4}$ 非实代数余项的可操作化. 引入不带此种起源之把手的所提议映射, 在把手充分性上失败.

路径充分性 (path adequacy). 第 2 步的加法路径须可迭代、须有反向、须拥有迭代所逼近而不到达的边界标记. 三条件共同必要: 没有反向的迭代不构成相关意义上的路径; 没有边界标记的路径使层级的阐述范围未闭. 在 $L_{1\text{-}2}$, 加法路径满足全部三条: $+1$ 迭代由 $-1$ 迭代反向, 迭代逼近 $\pm\infty$ 作为不同的边界标记. 第 2 步缺少其中任一特征的所提议映射, 在路径充分性上失败.

记忆充分性 (memory adequacy). 第 3 步的乘法路径须引入非局部的记忆或绑定结构, 且不可还原为对加法路径的重命名. 这是不仔细之映射最容易违犯的标准, 因为乘法有时被简称为"重复加法"——若此描述被认真采纳, 则会使第 3 步成为第 2 步的记号变体. 模式要求更多: 第 3 步须引入第 2 步不含有的绑定. 在 $L_{1\text{-}3}$, 乘法把迭代计数内涵化为一个标记把手 (使得乘积 $3 \times 5$ 不只是 $5 + 5 + 5$ 的另一记号, 而是把迭代计数 "三"与被迭代值"五"绑定者). 在 $L_2$-3, 旋转记忆 $e^{i\theta}$ 跨复乘法绑定角度积累——此结构在加法路径中不存在. 为使非局部性标准跨层级显式:

• 在 $L_1$, 乘法记录迭代计数作为绑定 (跨迭代的非局部积累).
• 在 $L_2$, 旋转积累跨角度路径就加法结构而言是非局部的.
• 在 $L_3$, Turing 度跨形式系统非局部地积累复杂度.
• 在 $L_4$, 曲率跨时空区域非局部地积累几何内容.
• 在 $L_5$, $\ln W$ 跨构型非局部地积累微观态计数.

第 3 步只是把第 2 步重命名 (而不引入此种非局部绑定) 的所提议映射, 在记忆充分性上失败.

闭合充分性 (closure adequacy). 第 4 步的闭合须同时产生闭合状态与一项不可纳入的余项 (后者触发下一层级). 完美的闭合——把层级先前的全部内容无余地纳入者——在此标准上失败, 因为它没有为下一层级承接留下任何阐述内容. 在 $L_{1\text{-}4}$, 到 $\mathbb{R}$ 的 Cauchy 完备化是闭合状态, 而 $i = \sqrt{-1}$ 是触发 $L_2$ 的不可纳入余项. 在 $L_2$-4, Riemann 球面 $\hat{\mathbb{C}}$ 与操作缺陷代数共同是闭合状态, 而那些在 $L_2$ 中抵抗单值化解的多值行为则是适时触发 $L_3$ 的余项. 第 4 步无余项闭合的所提议映射, 在闭合充分性上失败.

四条标准共同必要. 满足三条而失败于第四条的所提议映射, 不合格为模式契合实例.

3.6 失败模式

模式允许明确的失败模式. 我们列出五种, 并附具体例示.

失败模式 1: 第 3 步只是第 2 步之重命名. 所提议映射中, 若乘法路径被阐述为仅仅是重复加法, 而不附带记忆或绑定结构, 则失败. 例示性情况是乘法本身: 若把乘法仅定义为重复加法的缩写 (而非作为对迭代计数的内涵化), 则所得映射将在记忆充分性上失败. 算术的实际实践不如此定义乘法, 故在 $L_{1\text{-}3}$ 模式成立; 但此失败模式仍作为一项检验保持可用.

失败模式 2: 第 4 步不留下余项. 闭合步骤被阐述为完美、自足之终结的所提议映射失败. 例示性情况是 Cauchy 完备化: 若把 $\mathbb{R}$ 的构造阐述为 $L_1$ 的完整最终闭合, 而不承认抵抗纳入的余项 $i = \sqrt{-1}$, 映射将在闭合充分性上失败. 数学的实际实践承认此余项 (并且确实在它有处可栖之前就给它命名), 故在 $L_{1\text{-}4}$ 模式成立; 但此失败模式仍作为对过早闭合声明的检验保持可用.

失败模式 3: 边界标记与操作余项被混同. 所提议映射若把 $\hat\infty$ 作为单一阐述把手, 与留数、单值群、除子等同看待, 则失败. 例示性情况是把无穷作为形而上对象的哲学处理: 当 $\hat\infty$ 被视为与留数同类的对象时, 渐近地景与操作前景之间的区分丧失, 映射不再追踪数学实践. 复分析的实际实践把二者区分开来: $\hat\infty$ 起着 Riemann 球面紧致化点的作用, 而留数起着计算对象的作用; 故在 $L_2$ 模式成立.

失败模式 4: 闭合公式只是一项空洞的记号恒等式. 闭合公式被还原为空洞恒等式 (如 $0 = 0$, 或某种不能把层级先前内容整合的同义反复方程) 的所提议映射失败. 例示性情况是欧拉公式 $e^{i\pi} + 1 = 0$ 在 $L_2$ 的使用: 这是一个非空洞的闭合公式, 因为它把来自 $L_1$ 的把手 ($e$、$\pi$、$1$、$0$) 与来自 $L_2$ 的把手 ($i$) 在单一方程中整合, 而此整合本身具有阐述内容. 所提议闭合公式若不能把先前把手整合 (例如, 一项只是重述闭合状态而不与构成元素相关的公式), 将在闭合充分性上失败.

失败模式 5: 该层级的映射无法容纳其所声称之核心数学. 此失败模式须仔细阐述, 因为 SAE 框架明确接纳一种认识论立场, 在其下并非每一数学发展都须由模式容纳 (见 § 3.8). 此失败模式由此分为两个子模式, 二者必须保持区分.

失败模式 5a (局部映射失败). 若某一具体层级所提议映射无法容纳该映射本身声称要覆盖的核心数学内容, 则映射失败. 这是真正的可证伪性. 若所提议 $L_1$ 映射无法容纳 Cauchy 完备化、$p$-进完备化或代数闭包——而它们各自都属于 $L_1$ 的标准数学——则该映射必须修订或放弃. 若所提议 $L_2$ 映射无法容纳留数定理、单值群或 Riemann 面理论, 则该映射必须修订或放弃. 模式契合不靠事后合理化获得.

失败模式 5b (模式边界识别). 若某一数学发展稳定地位于所阐述模式的范围之外, 它不被作为反例由特设调整吞并. 相反, 它被识别为一项模式边界, 而框架提供两种回应 (在 § 3.8 发展): 或者扩展模式 (一项模式更新, 当该发展可被原则性地纳入框架时), 或者承认该发展属于一种与模式生产性并存的替代阐述框架 (一项模式边界承认). 在不令模式被免疫的情况下, 务不允许的是把每一反例例行地重新分类为"不过是更新机会"; 那将把模式转为免疫条款, 摧毁其可证伪性. 5a (真正失败) 与 5b (被承认边界) 之间的区分由如下要求保持: 5b 只在该发展稳定地位于模式所阐述之范围之外时引用, 而非仅在某项所提议映射恰好失败时引用.

3.7 与凿构循环之对齐

模式自然地与 SAE Methodological Overview Paper I [DOI: 10.5281/zenodo.18842450] 发展的凿构循环对齐. 循环有四个时刻: 凿、构、余项、桥, 最终回返至物自身. 模式的每一步对应循环的一个时刻:

• 第 1 步, 已标记未构造, 对应凿之时刻: 标记一个尚未被操作的把手.
• 第 2 与第 3 步, 加法与乘法路径, 对应构之时刻: 在被标记把手之上建立操作与绑定结构.
• 第 4 步, 带余项闭合, 对应余项与桥联合之时刻: 不可纳入的印迹, 与对下一层级的触发.

如此, 模式不是独立的构造. 它是循环在一项具体阐述层级——数学层级显露其内部结构的层级——上的阐述. Paper I 所发展的循环是一般形式; 模式是该形式在数学中的实例化.

3.8 模式的认识论立场

最后, 模式附带一种认识论立场——此立场与模式本身同为本文的贡献. 立场有两个组成部分.

首先, 模式不主张完备性. 它不主张数学全体契合模式, 也不主张数学能由任何有限的、它所提供之类的层级映射集合穷尽地阐述. 处于模式当前范围之外的数学发展是被期待的, 而非仅仅被容忍; 模式明确为之留出空间.

其次, 模式不主张唯一性. 它不主张是数学的唯一阐述框架, 也不主张在某种与语境无关的意义上优于阐述数学实践其他角度的替代框架 (柏拉图主义、形式主义、构造主义、结构主义、范畴论、类型论). 这些框架生产性地并行, 而模式作为其旁的一个具有生产力的特定框架而提出.

具体数学发展与模式之间的关系由 § 3.6 所阐述的失败模式区分支配. 若该发展处于模式声称覆盖的某项映射之内, 而映射无法容纳之, 则映射失败 (5a). 若该发展稳定地处于模式范围之外, 则它被识别为模式边界 (5b), 并适用两种回应之一: 模式可被扩展以纳入该发展 (一项模式更新), 或该发展可被承认为属于与模式并存的替代框架. 在不令模式被免疫的情况下, 至关重要者在于诚实地识别模式边界, 而不是把它们打扮以掩盖局部失败.

立场附带一项元命题, 我们将在 § 8.5 充分发展. 命题为: 数学阐述是双重不可穷尽的——在对象层级, 数学内容不可穷尽 (§ 8.2 的四种不可穷尽性); 在元层级, 数学的阐述框架不可穷尽 (本模式是若干持续可能之替代框架中一个具有生产力的特定框架). 模式的认识论纪律即是在此双重不可穷尽性中工作而不主张克服它的纪律.

我们建议, 任何数学的建筑哲学最好都采纳此种纪律. 提议一种模式的论文, 容易受这样的诱惑: 把模式作如同对替代之拒斥所必需者来辩护. 本文以另一种精神提供模式: 作为一项具有生产力的特定阐述, 在其具体主张上可证伪, 关于其具体范围诚实, 并明确与其他阐述框架持续生产性的并存相容. 邀请读者依充分性标准与失败模式、以及附录 A 的历史压力测试, 检验模式, 而不把模式只提供一种框架视为对其他多种框架生产力的否认.

---

4. $L_1$: 数、算术与实数闭合

第一个数学层级 $L_1$, 是原型数学家的阐述由定性向定量过渡的层级. 本节展示模式的四步在 $L_1$ 处的呈现, 每步都关注填充图式角色的具体阐述内容, 以及数概念之哲学文献已使必要的技术修订.

4.1 第 1 步: 作为精确性把手的 "1"

$L_1$ 的第一步已在 § 2.4 中阐述: "1" 作为精确性把手的标记, 以响应 $L_0$ 关于定性不定性的余项. 我们在此仅添加模式的 Via Negativa 读法所明确化者.

"1" 在 $L_{1\text{-}1}$ 是已标记但尚未被操作. 没有后继函数, 没有加法, 没有乘法; 只是, 简单地, 那个确定的、被标记的单位"恰恰一个、不多不少". 把手不携带超出精确性标记本身所需要的任何定量结构. 这是模式 Via Negativa 读法对第一相在 $L_1$ 层级上的应用: 一个被标记的状态, 它在阐述上是在场的, 但在操作上是未发展的.

两点观察值得记录. 第一, "1" 的标记不是对一物的标记 (无论"物"取何素朴含义); 它是对一个让定量区分得以开始之阐述位置的标记. 标记 "1" 的原型数学家没有发现一个对象; 她确保了一个把手. 把手的内容由它在后续步骤所使可能者所穷尽. 第二, "1" 的标记在一个非平凡的意义上是 negativa 在对象层级之区分的标记: Methodology 0 的第一相标记 negativa 尚未发展的状态, 而 "1" 标记尚未被乘数化的状态. 此结构性平行允许模式把 "1" 识别为填充第一步角色者.

4.2 第 2 步: 加法路径

$L_1$ 的加法路径自 "1" 通过迭代展开. $+1$ 的逐次应用生成自然数 $\mathbb{N}$, 而其反向迭代——引入 $-1$ 作为逆操作——生成负整数, 完成整数 $\mathbb{Z}$. 此生成的阐述内容是模式的第二相: 正面实体与第一步的标记把手处于对偶关系.

加法路径的三项特征值得显式评注.

首先是其可迭代性. 模式的路径充分性条件 (§ 3.5) 要求加法路径可迭代, 且有可操作的反向. $\mathbb{Z}$ 的算术满足这一要求: 任何整数都可从 $1$ 通过一段 $+1$ 与 $-1$ 操作的有限序列到达, 而每个 $+1$ 步都有唯一的 $-1$ 逆. 可迭代性正是赋予路径生产力者: 路径生成实体, 所生成的实体处于算术所计算的确定迭代距离关系中.

其次是 $0$ 的对称性破缺式引入. 元素 $0 \in \mathbb{Z}$ 通过加法反向可达: 从任意 $n$ 开始, 迭代 $-1, -1, \ldots, -1$ (应用 $n$ 次) 着陆于 $0$. 与它在第 3 步乘法路径中的角色 (其中它作为边界标记) 相反, 在第 2 步, 元素 $0$ 是加法路径的内点. 它可达、被操作、并整合入层级的正面内容.

第三是边界标记的结构. $\mathbb{Z}$ 的加法迭代沿两个可区分的方向推进——正向 (朝任意大的正整数) 与反向 (朝任意大幅度的负整数)——每一方向都逼近而不达到一个不同的渐近视界. 边界标记 $+\infty$ 与 $-\infty$ 不被等同: $\mathbb{Z}$ 的一维、有方向结构使它们保持分离. 这将与 $L_2$ 二维加法路径的边界结构形成重要对照, 那里旋转性识别把边界标记折叠为单一点. 此对照本身是阐述上具有信息量的: 模式不预先规定边界标记的维度, 而是从迭代的拓扑结构中读出之.

4.3 第 3 步: 乘法路径

$L_1$ 的乘法路径自 $\mathbb{Z}$ 的加法结构展开, 通过引入加法路径本身所不含有的绑定. 此绑定即是对迭代计数作为阐述把手的标记. 在加法路径把 $5 + 5 + 5$ 视为加法序列之处, 乘法路径把此序列内涵化为乘积 $3 \times 5$, 其中"三"不作为待被相加之值, 而作为待被执行之迭代次数而出现. 计数现以其自身权利成为一项标记把手, 可供进一步操作.

这是模式 Via Negativa 读法对第三相在 $L_1$ 层级上的应用: 在元层级的一项阐述——既非简单的加法 (第 2 步的正面实体), 亦非缺乏操作 (对第 2 步的否定), 而是把加法结构持守在一起的绑定. 模式的记忆充分性条件 (§ 3.5) 要求乘法路径非局部地构成: 它所引入的绑定须捕获加法路径所无法捕获者. 在所讨论的意义上, 迭代计数是非局部的, 因为它作为对迭代的计数, 立于加法路径之上, 而非位于其内的一次迭代.

乘法路径在两个方向上生成 $\mathbb{Z}$ 的扩展, 与加法路径的两个方向平行但不重复. 除法 (乘法的逆, 与减法平行但作用于乘法结构) 把 $\mathbb{Z}$ 扩展为有理数 $\mathbb{Q}$. 迭代的反向——开方——当应用于 $\mathbb{Q}$ 的实元素时, 生成实代数无理数, 即有理系数多项式的根.

此处一项技术修订至关重要, 而依我们的判断, 哲学文献并不总是明确化之. $L_1$ 乘法路径的完备不是有理数的整个代数闭包 $\overline{\mathbb{Q}}$. 代数闭包含 $i = \sqrt{-1}$ (因为 $i$ 是多项式 $x^2 + 1 \in \mathbb{Q}[x]$ 的根), 但 $i$ 正是 $L_1$ 闭合尝试将无法纳入的余项 (§ 4.4). 为准确阐述乘法路径的完备, 我们须把实代数数与复代数数区分开来. $L_1$ 乘法路径的完备相应是

$$\mathbb{Q}^{\mathrm{alg}}_{\mathbb{R}} := \overline{\mathbb{Q}} \cap \mathbb{R},$$

即实代数数之域. 此包括 $\sqrt{2}$、$\sqrt[3]{5}$、一般代数无理数, 但排除非实代数数 ($i$, 以及更高次多项式的非实根). $L_1$ 的乘法路径, 在此技术意义上, 是一维的: 它完全居于实直线之内.

乘法路径的边界标记是 $0$. 这与 $0$ 在第 2 步的角色形成对照 (那里它是加法路径的内点). 在第 3 步, $0$ 起着乘法吸收元素的作用: 对任何 $z$, $z \cdot 0 = 0$. 乘法路径的反向 (除法), 从任何非零起点都无法到达 $0$. 元素 $0$ 在此意义上是乘法迭代的渐近视界, 一如 $\pm\infty$ 是加法迭代的渐近视界; 差别在于 $0$ 是单侧的 (单一边界标记), 而 $\pm\infty$ 是双侧的 (不同的边界标记), 这一差别反映加法路径与乘法路径之间的维度区分.

乘法路径产生一项它本身无法纳入的操作余项: $i = \sqrt{-1}$. 多项式 $x^2 + 1$ 无实根, 因为对任何 $x \in \mathbb{R}$, $x^2 \geq 0$, 故 $x^2 + 1 \geq 1 > 0$. 阐述把手 $i$ 满足 $i^2 = -1$, 但 $i \notin \mathbb{R}$. 此余项是操作性的, 而非仅仅是边界标记: $i$ 是一个一旦给予它栖居之空间, 就可被操作 (相加、相乘、提幂) 的把手. 此空间, 如 $L_2$ 将阐述, 是复平面 $\mathbb{C}$; 但 $L_1$ 无法提供之. 把手 $i$ 相应是触发 $L_1$ 到 $L_2$ 转换的操作余项.

4.4 第 4 步: 带余项闭合

$L_1$ 的闭合步骤把加法路径与乘法路径聚合到单一的阐述结构中, 并在同一动作中展现闭合状态与不可纳入的余项. 闭合状态是实数域 $\mathbb{R}$, 由 $\mathbb{Q}$ 的 Cauchy 完备化获得 (等价地, 由 Dedekind 切构造获得). $L_1$ 的闭合逻辑按以下序列展开:

$$\mathbb{N} \to \mathbb{Z} \to \mathbb{Q} \to \mathbb{Q}^{\mathrm{alg}}_{\mathbb{R}} \to \mathbb{R}.$$

两点观察处于此处的中心.

第一点关于超越数. 实数 $\mathbb{R}$ 不只含实代数数, 还含超越数: $\pi$、$e$、$\ln 2$ 及其同侪. 它们不是乘法路径单独之余项; 一如我们坚持, 乘法路径的完备是 $\mathbb{Q}^{\mathrm{alg}}_{\mathbb{R}}$. 超越数在闭合步骤涌现, 当加法路径与乘法路径被合并、并施加极限阐述 (Cauchy 完备化) 之时. 它们是 $L_1$ 作为整体的余项, 而非任何单一步骤的余项.

超越数本身可分为两种可区分类型, 而此区分阐述上具有信息量. 常数 $\pi$ 从加法与乘法路径之外进入数学: 从几何学, 作为圆周与直径之比. 它的超越性 (Lindemann 1882) 反映这样的事实: 没有有理系数的多项式把 $\pi$ 作为根——它不能通过乘法路径操作的任何有限组合到达. 常数 $\pi$ 是 $L_1$ 的实代数余项, 须从几何语境引入. 与此相反, 常数 $e$ 自 $L_1$ 内部涌现, 作为极限

$$e = \lim_{n \to \infty} \left(1 + \frac{1}{n}\right)^n.$$

此极限是把加法结构 ($1/n$ 作为加法增量) 与乘法结构 (提至 $n$ 次幂) 在两者共同的极限边界上加以调和的尝试. 常数 $e$ 相应是 $L_1$ 的内部超越数: 当加法与乘法路径被推至其共同极限并被要求交换时, 所产生的非代数残留. 它是两条路径不可通约的不可反驳之证. 常数 $\pi$ 与 $e$ 都是 $L_1$ 闭合余项, 但它们记录关于 $L_1$ 结构的不同事实: $\pi$, 几何连续性超出算术触及之事实; $e$, 加法与乘法路径不能联合还原之事实.

第二点关于 $i$. 常数 $i = \sqrt{-1}$ 也是 $L_1$ 闭合的余项, 但与 $\pi$ 与 $e$ 处于根本不同的意义. 超越数 $\pi$ 与 $e$ 通过极限阐述可被纳入 $\mathbb{R}$; 它们非代数, 但它们是实数, 适于 $\mathbb{R}$ 的一维结构. 常数 $i$ 不可被纳入 $\mathbb{R}$: $i^2 = -1$, 而无任何实数满足此方程. 余项 $i$ 要求 $L_1$ 所无法提供的维度扩展.

这是模式 Via Rho 读法对第四相在 $L_1$ 层级上的应用: 闭合同时产生闭合状态 ($\mathbb{R}$, 含被纳入的超越数) 与一项不可纳入的余项 ($i$), 后者强制下一层级. 模式的闭合充分性条件 (§ 3.5) 得到满足, 而向 $L_2$ 的触发由 $i$ 对一维纳入之抵抗提供.

关于数学家立场的历史涌现, 此处简短一笔是恰当的. 在 19 世纪由 Cauchy、Weierstrass 与 Dedekind 发展的极限与连续性之严格基础, 在模式的读法中, 是数学家的形式-严格立场首次明确化的历史事件. 这不是对其先行之实质性数学工作的否认——巴比伦的算术、希腊的几何、印度的代数、中世纪欧洲的数论, 都先于 19 世纪的严格化, 而在没有它的情况下成就了所成就之事. 模式的主张是, 当 $L_1$ 的闭合步骤达成时, 此步骤是严格基础立场在阐述上变为内在所需的历史时机. 在 $L_{1\text{-}4}$ 完全达成之前, 数学可在没有严格基础的情况下生产性地进行; 在 $L_{1\text{-}4}$, 基础要求成为层级闭合所内在者. 历史时机 (19 世纪而非更早) 与此阐述读法相一致.

4.5 $L_1$ 的交换律

模式的每一成熟层级, 在其闭合步骤, 都允许一项交换律: 一项具体恒等式, 在单一方程中记录该层级加法路径与乘法路径之间 (或在更高层级中, 该层级局部视角与整体视角之间) 的兑换关系. 在 $L_1$, 交换律的自然候选是对数恒等式

$$\log(ab) = \log a + \log b.$$

此恒等式记录这样的事实: 对正实数 $a, b$, 乘法可通过对数转换为加法. 它在精确意义上是一项交换律: 它通过一项具体的阐述函数 (对数), 把乘法路径 (第 3 步) 的操作转换为加法路径 (第 2 步) 的操作. 由此, 对数在 $L_1$ 充当阐述单位的角色: 该单位通过它, 层级的两条路径可以彼此的术语得以表达.

交换律模式在每个后续层级再现, 阐述单位随层级结构变化而变化. 在 $L_2$, 单位将是 $2\pi i$ (§ 5); 在 $L_3$, 是 Gödel 算术化函数 $\#$ (§ 6.1); 在 $L_4$, 是 $c^2$ (光速平方); 在 $L_5$ 平衡区, 是 $k_B$ (Boltzmann 常数). 模式不预先规定交换律的形式, 但预测每一支持闭合方程的层级都有一项. 此预测可对照数学与物理实践来检验. 检验在每种情况下都成功: 每一层级的阐述实践都提供一项具体的交换律, 可被识别为填充图式角色者.

---

5. $L_2$: 复化、欧拉闭合与全纯缺陷代数

第二个数学层级 $L_2$, 作为对 $L_1$ 闭合所留下的不可纳入余项 $i = \sqrt{-1}$ 的阐述回应而涌现. 其内容是复数、复数的解析结构, 以及——对本文中心而言——复分析的操作缺陷代数. 本节展示模式的四步在 $L_2$ 处的呈现, 并把操作缺陷代数发展为层级的核心工作内容.

关于处理顺序的一项说明. 欧拉公式 $e^{i\pi} + 1 = 0$ 常被呈现为复分析的标志性方程, 而它确实属于 $L_2$-4, 作为闭合步骤的优雅实例. 我们会给予它应得的位置 (§ 5.3). 但它不是 $L_2$ 数学工作发生之处. $L_2$ 的工作, 在数学家实践中, 发生在操作缺陷代数中: 在留数演算中, 在 Riemann 面理论中, 在单值群管理中, 在渐近展开的 Stokes 数据中. 我们相应在 § 5.4 较长地探讨操作缺陷代数, 而在其先的较紧凑的 § 5.3 处理欧拉公式.

5.1 $L_2$ 作为对 $L_1$ 不可纳入余项的回应

$L_1$ 末端的阐述情形如下. 已达成向 $\mathbb{R}$ 的闭合, 通过极限阐述纳入超越数 $\pi$、$e$、$\ln 2$, $\ldots$. 余项 $i = \sqrt{-1}$ 已被识别为抵抗纳入, 因为 $\mathbb{R}$ 是一维的, 而 $i$ 无法定位于实直线之上. 模式的 Via Rho 读法把 $i$ 识别为操作余项——一个一旦给予栖居空间即可被操作的阐述把手——而非仅仅是边界标记.

所要求者由此是: 一项维度扩展——一个阐述空间, $i$ 能在其中与实数并行被操作. 数学提供的扩展是复平面 $\mathbb{C} = \mathbb{R} + i\mathbb{R}$. 这是对触发 $i$ 在下一阐述层级的回应. 它不是唯一可能的回应: 此构造通过 Cayley–Dickson 程序推广到四元数 $\mathbb{H}$、八元数 $\mathbb{O}$, 以及 (结构丰富性逐步递减地) sedenions 及其后. 这些之中每一项, 按模式术语, 都是 $L_2$ 阐述的候选, 各自带有独特代价 ($\mathbb{H}$ 中的可交换性, $\mathbb{O}$ 中的结合性, sedenions 中的除代数结构). 模式与多种 $L_2$ 阐述相容; 在本节主体中, 我们沿标准阐述穿过 $\mathbb{C}$, 在 § 5.3 与附录 A 中简要返回替代路径.

5.2 $L_2$ 处的四步

$L_2$ 的四步可概述如下, 然后我们逐一处理.

步	相	内容
$L_2$-1	无	$i = \sqrt{-1}$ 在非实状态被标记, 作为复化种子
$L_2$-2	有	$\mathbb{C} = \mathbb{R} + i\mathbb{R}$ 作为二维加法路径, 边界标记 $\hat\infty$ 单一紧致化
$L_2$-3	非有也非无	$\mathbb{C}^* = \mathbb{C} \setminus \{0\}$ 含旋转记忆 $e^{i\theta}$; 模长相乘、幅角相加
$L_2$-4	第三相之否定	Riemann 球面 $\hat{\mathbb{C}}$, 加上欧拉公式与操作缺陷代数 $\omega_\rho^{(2)}$

第一步把 $i$ 标记为复化种子: 一项阐述把手, 其唯一内在属性是 $i^2 = -1$. 在此阶段, 除此定义性质所蕴含者外, 尚未在 $i$ 上定义任何操作. 与 $L_{1\text{-}1}$ ("1" 被标记但尚未被操作) 与 Methodology 0 第一相 (negativa 标记其尚未发展状态) 的平行是结构性的; 模式将 $i$ 识别为填充第一步内容者, 由此结构性平行支持.

第二步把 $\mathbb{C}$ 阐述为二维加法路径. 加法按分量进行: $(a + bi) + (c + di) = (a + c) + (b + d)i$. 迭代是二维的, 与 $L_{1\text{-}2}$ 的一维迭代形成对照, 而此维度差异在边界处有拓扑后果. $\mathbb{C}$ 的紧致化在无穷处添加单一点 $\hat\infty$, 与 $\mathbb{C}$ 中任何无界序列的极限相等同, 不论无界性的方向. $L_{1\text{-}2}$ 把 $+\infty$ 与 $-\infty$ 区分为一维实直线的两端, 而 $L_2$-2 把所有无界性方向等同于单一边界标记 $\hat\infty$. 等同由拓扑学强制: $\mathbb{C}$ 作为二维空间的旋转对称性, 在边界处平等对待所有方向. 此等同的阐述内容并不平凡. $L_1$ 的不同边界标记在过渡到 $L_2$ 时不被保留; 维度扩展同时把它们等同起来. 这是模式首次遭遇对边界结构的拓扑约束, 我们将在 $L_2$-3 与 $L_2$-4 看到更多此类约束.

第三步把 $\mathbb{C}^*$ 阐述为乘法路径. 复乘法在极坐标形式下为

$$r_1 e^{i\theta_1} \cdot r_2 e^{i\theta_2} = r_1 r_2 e^{i(\theta_1 + \theta_2)}.$$

两项阐述内容在此被绑定. 模长 $r$ 延续 $L_{1\text{-}3}$ 的乘法路径 (幅度相乘). 幅角 $\theta$ 引入一项新阐述内容: 旋转记忆. 复乘法跨迭代记录角度积累——这是 $L_2$ 处真正新颖的绑定, 在 $L_1$ 中无对应者 ($L_1$ 中乘法路径作用于一维直线, 只允许伸缩, 不允许旋转).

常数 $i$ 在此阐述中, 最好不被理解为"以某种方式不实在的虚数". 它更准确地是二维平面中的旋转生成元: $i = e^{i\pi/2}$, 生成四分之一旋转. 乘以 $i$ 即旋转 $\pi/2$; 乘以 $i^2 = -1$ 即旋转 $\pi$; 乘以 $i^4 = 1$ 回到恒等. 定义性质 $i^2 = -1$ 记录如下事实: 两次连续四分之一旋转合成半旋转. 在此阐述下, $i$ 在实直线上的非实在性, 是其作为复平面旋转生成元功能的下游后果; $L_1$ 无法阐述旋转, 故旋转生成元无法位于 $L_1$ 的阐述范围内.

$L_2$ 乘法路径的边界标记, 由与 $L_{1\text{-}3}$ 相平行, 再次是 $0$. 元素 $|a + bi| = 0$ 当且仅当 $a = b = 0$, 而 $0$ 在 $\mathbb{C}$ 中起着乘法吸收元素的作用, 一如在 $\mathbb{R}$ 中. 在变换 $z \mapsto 1/z$ 下, $0$ 与 $\hat\infty$ 被彼此交换, 形成 Riemann 球面上乘法求逆的特殊二周期边界对. 模式的读法把这一对偶对识别为 $L_2$ 乘法路径的边界结构.

第四步在 Riemann 球面 $\hat{\mathbb{C}} = \mathbb{C} \cup \{\hat\infty\}$ 上闭合 $L_2$, 欧拉公式作为闭合方程的优雅实例, 而操作缺陷代数 $\omega_\rho^{(2)}$ 作为层级的核心工作内容. 我们分别在 § 5.3 与 § 5.4 处理它们.

5.3 作为优雅实例的欧拉公式

欧拉公式

$$e^{i\pi} + 1 = 0$$

常被称为数学中最美的方程. 该判断是审美的, 但它追踪一项模式可精确识别的阐述内容: 欧拉公式把来自 $L_1$ 的把手 ($e$、$\pi$、$1$、$0$) 与来自 $L_2$ 的把手 ($i$) 在单一方程中整合, 闭合两层级的联合阐述内容. 常数 $e$ 与 $\pi$ 是 $L_1$ 超越数; $1$ 是 $L_{1\text{-}1}$ 的精确性把手; $0$ 是 $L_{1\text{-}2}$ 与 $L_{1\text{-}3}$ 的边界标记; $i$ 是 $L_2$-1 的复化种子. 欧拉公式记录, 当这些把手在 $L_2$ 的操作下被组合时, 它们满足一项非平凡恒等式.

闭合充分性条件 (§ 3.5) 要求闭合步骤产生闭合状态及不可纳入的余项. 欧拉公式本身不展现不可纳入余项; 它是一项已闭合的恒等式, 在所有构成把手都适于 $\mathbb{C}$ 这一意义上. $L_2$ 的余项——多值行为、留数、单值群等——必须来自他处. 欧拉公式相应最好被理解为闭合的实例, 而非 $L_2$ 的完整闭合. 完整闭合含 Riemann 球面 ($\mathbb{C}$ 的拓扑闭合) 与操作缺陷代数 ($L_2$ 操作内容在模式意义上的代数闭合).

模式不规定欧拉公式须是 $L_2$ 的闭合方程. 其他闭合方程是可用的. 四元数扩展 $\mathbb{H}$ 在不同模式中闭合 $L_2$ (四维、非可交换). 八元数扩展 $\mathbb{O}$ 在另一不同模式中闭合 (八维、非结合). Cayley–Dickson 构造产生一序列闭合, 每次以一项代数结构性质 (有序性、可交换性、结合性、除代数性质及其后) 为代价. 这些每一项都是模式下可允许的 $L_2$ 闭合, 各自带有独特代价. 本文之所以沿 $\mathbb{C}$ 与欧拉公式呈现, 并不排除替代; 而是沿着操作缺陷代数 (留数、周期、单值群、Stokes 数据) 在历史上得以发展的路径前行.

5.4 操作缺陷代数 $\omega_\rho^{(2)}$

$L_2$ 的阐述核心——自 19 世纪 Cauchy、Riemann 与 Weierstrass 的工作以来由数学家实践——不是欧拉公式而是复分析的操作缺陷代数. 此代数负责全纯函数在奇点存在、多值延拓与渐近失配等情况下的行为; 它是复分析定理在其中得以表述与证明的结构. 我们把此代数记为

$$\omega_\rho^{(2)} = (\mathrm{Div},\, \mathrm{Res},\, \mathrm{Per},\, \mathrm{Mon},\, G_\infty,\, \mathrm{Stokes}),$$

一个六分量结构, 其分量先后阐述层级的拓扑演化链: 从局部 (点态) 经由整体 (圈) 扩展至边界 (扇区) 的缺陷. 此链有四阶段, 而六分量按如下方式映射到这四阶段:

• 阶段 1 (点态): 除子.
• 阶段 2 (局部-货币化): 留数.
• 阶段 3 (整体-圈): 周期与单值群.
• 阶段 4 (边界-扇区): Stokes 数据与 $G_\infty$ (无穷处增长).

我们逐一讨论各分量.

除子 (Divisor) 是 $L_2$ 最基本形式的缺陷: 在底 Riemann 面上把全纯函数的零点与极点连同其重数标记为离散点. 亚纯函数 $f$ 在 Riemann 面 $X$ 上的除子是形式和 $\mathrm{div}(f) = \sum_p n_p \cdot p$, 其中 $p$ 在 $X$ 的点上变动, $n_p \in \mathbb{Z}$ 记录 $p$ 处零点 ($n_p$ 正) 或极点 ($n_p$ 负) 的阶. 除子的群结构——我们将在附录 B 中详述——把这些点态缺陷组织为一种代数会计系统. 在拓扑演化链中, 除子是缺陷的点态形式: 局部于单一点的缺陷, 尚未扩展至任何圈、扇区或边界.

留数 (Residue) 通过局部积分把除子的点态缺陷转换为"可交换的拓扑货币". $f$ 在极点 $z_0$ 处的留数是

$$\mathrm{Res}_{z_0} f = \frac{1}{2\pi i} \oint_\gamma f(z) \, dz,$$

其中 $\gamma$ 是逆时针围绕 $z_0$ 且不围绕 $f$ 任何其他奇点的小围道. 因子 $2\pi i$ 在 $L_2$ 起着阐述交换单位的作用, 与 $L_1$ 处对数的角色类似. 它把局部极点结构转换为积分值, 而积分值是下游定理所计算与比较的量. 在拓扑演化链中, 留数是缺陷的局部-货币化形式: 一项点态缺陷被操作化为可供交换的量.

周期 (Period) 与单值群 (Monodromy) 共同阐述整体-圈阶段. 周期关切微分形式沿 Riemann 面上的圈的积分. 对闭 1-形式 $\omega$ 与圈 $\gamma$, 周期 $\int_\gamma \omega$ 一般是圈的同调类的非平凡函数. 当 $\gamma$ 在圈基底上变动时, 记录 $\int_\gamma \omega$ 之值的周期格, 捕获 Riemann 面积分结构的整体非平凡性. 单值群关切多值全纯函数在沿闭环路解析延拓下的行为. 函数 $\log z$, 沿逆时针环路绕原点延拓, 回到起点时被移位 $2\pi i$; 函数 $\sqrt{z}$, 沿环路绕原点延拓, 回到起点时取负号. 这些移位与变号——延拓不可消除的后果——构成函数的单值群. 周期与单值群不是同一现象, 但它们密切相关: 二者都阐述 Riemann 面路径结构的整体非平凡性, 周期通过形式之积分, 单值群通过函数之延拓. 在拓扑演化链中, 它们占据同一阶段.

Stokes 数据 (Stokes data) 与无穷处增长 ($G_\infty$) 共同阐述边界-扇区阶段. Riemann 球面的边界是 $\hat\infty$, 而全纯函数趋近 $\hat\infty$ 时的行为由两项互补结构来阐述. 无穷处增长记录函数在边界处发散 (或衰减) 的渐近速率; 整函数的阶与类型, 连同 Phragmén–Lindelöf 原理, 组织此结构. Stokes 数据记录在不规则型奇点附近的扇区边界上, 渐近展开的不连续性. Stokes 现象, 最初在不规则奇点的常微分方程语境下被发现, 阐述了函数在一个角度扇区的渐近展开可能不同于其在相邻扇区的展开, 差别由 Stokes 乘子编码. Stokes 数据与无穷处增长是边界-扇区阶段的两个方面: 无穷处增长记录渐近阶, Stokes 数据记录扇区失配. 它们共同阐述全纯结构趋近其边界时所出现的缺陷.

六分量, 组织为四阶段, 阐述 $L_2$ 的操作内容. 层级的工作数学——留数演算、Riemann 面理论、多值函数的解析延拓、微分方程解的渐近分析——发生在此代数结构之内. 模式把 $\omega_\rho^{(2)}$ 识别为 $L_2$-4 的核心内容 (与欧拉公式、Riemann 球面并列), 正是允许如下主张的识别: $L_2$ 在数学实践中是操作上丰富的层级, 而非仅仅是虚数单位与一项优雅恒等式的栖居之所.

模式要求 $L_2$ 有一项交换律, 与 $L_1$ 的对数恒等式平行 (§ 4.5). 自然候选是留数定理:

$$\oint_\gamma f(z) \, dz = 2\pi i \sum_k \mathrm{Res}_{z_k} f,$$

其中 $\gamma$ 是闭围道, 右侧之和取遍位于 $\gamma$ 内的 $f$ 的奇点 $z_k$. 留数定理在单一方程中记录一项交换: 整体积分 (围 $\gamma$ 的围道积分) 与局部量之和 (被围奇点处的留数之和) 之间的交换, 以阐述交换单位 $2\pi i$ 为中介. $2\pi i$ 在 $L_2$ 的角色与对数在 $L_1$ 的角色结构性平行: 它是层级的局部视角与整体视角彼此转换的单位.

至此, 交换律模式可跨多个层级展示:

• $L_1$: $\log(ab) = \log a + \log b$. 对数把乘法路径转换为加法路径.
• $L_2$: $\oint_\gamma f \, dz = 2\pi i \sum \mathrm{Res}$. 因子 $2\pi i$ 把整体积分转换为局部留数之和.
• $L_3$: Gödel 算术化 $\#: \text{Formulas} \to \mathbb{N}$ (§ 6.1). 映射 $\#$ 把形式陈述转换为自然数.
• $L_4$: $E = mc^2$. 因子 $c^2$ 把质量转换为能量.
• $L_5$ (平衡区): $S = k_B \ln W$. 因子 $k_B$ 把微观态计数转换为熵内容.

此模式跨层级的再现是模式的一项非平凡预测, 在所有可检验之处, 预测都成立.

$L_2$ 交换律的另一形式是辐角原理:

$$\oint_\gamma \frac{f'(z)}{f(z)} \, dz = 2\pi i (N - P),$$

其中 $N$ 与 $P$ 分别计 $\gamma$ 内 $f$ 的零点与极点 (含重数). 辐角原理记录与留数定理相同种类的交换 (整体积分通过单位 $2\pi i$ 转换为局部计数), 并展示同一结构模式. 二者都是 $L_2$ 交换律的可允许阐述; 留数定理范围更广, 辐角原理对具体应用有时更具启发性.

5.5 $L_2$ 闭合余项与通向 $L_3$ 的路径

$L_2$ 的闭合, 符合模式的闭合充分性条件 (§ 3.5), 产生一项不可纳入的余项, 触发下一层级. 此余项是抵抗在 $L_2$ 内部单值化解的多值行为与单值群数据之族. 然而, 我们须谨慎对待触发的确切形式, 因为 SAE 框架的先前表述, 在我们看来, 把此余项识别为立即强制 $L_3$ 时过于仓促.

多值行为——$\log z$、$\sqrt{z}$、分支切割、绕奇点的单值群——首先在 $L_2$ 之内被处理, 通过 Riemann 面、覆盖空间与层 (sheaf) 论机制. 函数 $\log z$ 在 $\mathbb{C} \setminus \{0\}$ 上多值, 但在其 Riemann 面 ($\mathbb{C} \setminus \{0\}$ 的万有覆盖) 上变为单值. 函数 $\sqrt{z}$ 在其二重覆盖上变为单值. 分支切割不被阐述为待绕开的障碍, 而被阐述为某种覆盖结构的数据. 单值群不被阐述为障碍, 而被阐述为覆盖的结构群. Riemann 面、覆盖与层的机制正是 $L_2$ 阐述与吸纳其自身多值余项的机制.

那么, 什么触发 $L_3$? 不是多值行为本身, 因为它们由 $L_2$ 的内部机制所吸纳. 触发者是把路径依赖转化为规则、证明、可判定性或形式系统之问题. 当问题不再是"$\log z$ 在给定点的值是多少?" (Riemann 面回答之), 而是"$\log z$ 的哪个分支对给定应用是'正确的'?" (这涉及一项必须由函数本身之外的标准来证立的选择), 阐述已跨越到 $L_2$ 无法完全解决的疆域. 问题"此函数在给定形式系统中的多值延拓是否可判定?"无法仅由 Riemann 面方法解决; 它需要 $L_3$ 所阐述的形式系统、可计算性与证明论的装置.

由 $L_2$ 到 $L_3$ 的转换相应不是由多值行为之存在所强制的转换. 它是由把路径依赖重新框定为关于规则与证明之问题所强制的转换. $L_2$ 的余项由 $L_2$ 自身的机制吸纳; $L_2$ 无法吸纳的残余问题, 是关于吸纳所依规则的元层级问题. $L_3$, 凭借其形式系统、其可定义性层级、其 Turing 度, 阐述对此元层级问题的回答. $L_2$ 与 $L_3$ 在此边界的协作具有生产力: $L_2$ 提供操作缺陷代数; $L_3$ 提供元层级规则阐述. 二者都不被对方吸纳.

$L_3$ 作为吸纳 $L_2$ 自我阐述之残留的元层级层级, 其阐述是 § 6.1 的主题.

---

6. $L_3$、$L_4$ 与 $L_5$: 来自四相的并行展示

本节所处理的三层级与 $L_1$、$L_2$ 在模式中处于不同关系. 前两层级是本文的数学内容, 以数学建筑哲学所要求的细致程度被阐述. 本节的三层级扮演更受限的角色: 它们是同一四相模式在不同阐述层级的展示, 它们在本文中的作用是展示模式在跨数学、形式逻辑、物理学与统计热力学的延伸, 而非主张数学相对于它们任何一者具有先在性.

这一限定要求明确的框定. 提议一种建筑学模式的论文中常见的诱惑是, 把每一新层级呈现为对前一层级的推导, 从而模式成为一种由数学滚入形式逻辑、再滚入物理学、再滚入热力学的生成程序. 本文抵抗这一呈现. 层级 $L_3$、$L_4$、$L_5$ 不是从 $L_2$ 推导出来的, 不像 $L_2$ 被阐述为对 $L_1$ 余项的回应那样. 相反, 它们是四相模式在彼此独立且与数学独立之阐述层级上的并行展示. Methodology 0 的四相模式由每一层级从同一源头 (negativa 自我追问) 继承, 而非从数学传递至更高层级. 数学是一种展示; 形式逻辑是另一种; 物理时空是另一种; 统计热力学是另一种. 模式把每一种阐述为一项四步结构, 但模式不主张数学相对其他任何一者是先在的或构成性的.

此框定的动机是双重的. 首先, 相反的框定——数学作为物理学与热力学之基础——会使 SAE 框架陷入一种物理主义反转, 其中物理学的阐述内容被视为派生自数学的阐述内容. SAE 的基础承诺不允许此事: 在 SAE 说法中, 数学是一种阐述模式, 而非实在的基底; 物理学是另一种阐述模式, 以其自身的阐述术语处理其自身的对象 (质量-能量-时空). 其次, 本文的主要范围是数学. 此处对 $L_4$ 与 $L_5$ 的呈现不是对物理哲学或热力学哲学的贡献; 它是模式在那些层级上图样的简要展示, 把实质性处理留给 Cross-Layer Closure Equations [DOI: 10.5281/zenodo.19361950] 与四力系列、宇宙学系列论文. 对物理层级感兴趣的读者应当查阅那些论文; 此处的简要处理仅为指出模式的跨层级平行.

带此框定, 三层级可逐一处理.

6.1 $L_3$: 形式系统、可计算性与对角闭合

开头有一项跨系列的澄清是必要的. 符号 $L_3$ 在不同 SAE 系列中以不同含义出现. 在动力系统系列中, $L_3$ 指向一种特定种类的动力学层级指标; 在宇宙学系列中, $L_3$ 可能指向与数学和动力学用法皆不同的某宇宙学阐述层级. 在本文中, $L_3$ 专指形式系统、可计算性与可判定性的层级——可证性、可定义性与 Turing 度的数学, 沿后-Gödel 传统所发展者. 这三种用法彼此并不冲突: 它们是四相模式在不同阐述层级的并行展示, 各在所属语境内具有生产力. 跨 SAE 系列阅读的读者应当注意此差异; 本节的 $L_3$ 是形式-逻辑的 $L_3$, 而本文的任何主张都不依赖于把它与动力学或宇宙学系列的 $L_3$ 等同.

形式-逻辑意义上的 $L_3$ 之四步可概述如下.

步	相	内容
$L_3$-1	无	Prov / True 谓词在元层级被标记
$L_3$-2	有	形式系统与定理作为元层级实体
$L_3$-3	非有也非无	Turing 度, 通过复杂度记忆而成的算术层级
$L_3$-4	第三相之否定	Gödel 对角闭合: $G \leftrightarrow \neg\,\mathrm{Prov}(\ulcorner G \urcorner)$

在 $L_3$-1, 谓词 $\mathrm{Prov}$ ("在形式系统 $T$ 中可证") 与 $\mathrm{True}$ ("在模型 $M$ 中为真") 在元层级被标记. 这些谓词不是对象语言中的对象; 它们立于形式系统之上, 阐述系统与其陈述之间的关系. 与 $L_{1\text{-}1}$ ("1" 的标记) 与 $L_2$-1 ($i$ 的标记) 的结构性平行得到保持: 一个把手被标记但尚未被操作性地发展.

在 $L_3$-2, 形式系统及其定理在元层级起着正面实体的作用. 证明通过逻辑推导步骤而迭代; 定理可通过 Gödel 数化而被枚举, 此枚举继承图式步骤所要求的加法路径之可迭代性. 此迭代的边界标记是不可证的真: 在标准模型中为真但形式系统的证明程序无法触及的陈述. 不可证的真在 $L_3$ 起着与 $\pm\infty$ 在 $L_{1\text{-}2}$ 相同的作用——迭代所逼近但不到达的渐近视界. Gödel 不完备性定理 (1931), 在此读法下, 是 $L_3$ 加法路径之边界结构的阐述.

在 $L_3$-3, 乘法路径的角色由 Turing 度的层级与算术层级 ($\Sigma_n$, $\Pi_n$, 及其上) 来填充. 这些层级按复杂度组织形式系统与谓词, 而此组织起着图式意义上的记忆绑定的作用: 系统在层级中的位置, 记录其形成的复杂度历史, 类比于 $L_{1\text{-}3}$ 的迭代计数绑定. 嵌套可证性陈述——$\mathrm{Prov}_T(\mathrm{Prov}_T(\phi))$ 及更高迭代——在层级中其位置上, 阐述跨形式系统层级的复杂度之绑定. 此乘法路径的边界标记是 $0'$, 即停机问题度: 第一次 Turing 跳跃, 由可计算方法从基础度不可到达者.

在 $L_3$-4, 闭合步骤是 Gödel 对角不动点构造:

$$G \leftrightarrow \neg\,\mathrm{Prov}(\ulcorner G \urcorner).$$

陈述 $G$ 主张其在 $T$ 中不可证 (假定 $T$ 是延扩充分初等算术的一致形式系统). 对角引理保证对任何含一个自由变量的公式 $\Phi$ 都存在此种 $G$: 特别地,

$$\exists G \quad G \leftrightarrow \Phi(\ulcorner G \urcorner).$$

Gödel 陈述是 $\Phi(x) = \neg\,\mathrm{Prov}(x)$ 的情形. 对角构造是 $L_3$ 的闭合阐述: 它产生一个闭合状态 (形式系统 $T$, 配备其可证性谓词与对角不动点构造) 加上一项不可纳入的余项 ($G$ 的真值, 形式系统从内部无法裁决之者).

此闭合的几何内容最好由如下观察揭示: Gödel 算术化, 从拓扑角度看, 执行一项结绳操作. 算术化函数 $\#: \text{Formulas} \to \mathbb{N}$ 把元层级的逻辑流形 (关于形式陈述之上可证性主张所组成的空间) 嵌入对象层级的算术流形 ($\mathbb{N}$). 嵌入并不同伦平凡: 元层级结构以这样的方式被强行嵌入对象层级结构——产生一项不可约的残留. Gödel 不完备性, 在此读法下, 是嵌入的不可解绳之残留 (unknottable residue)——在嵌入像中保留下来、不能通过任何重参数化加以去除的结构特征.

此阐述与 $L_2$ 的操作缺陷代数平行: $L_2$ 的缺陷 (留数、周期、单值群、Stokes 数据) 记录全纯结构在积分与延拓下的不可约特征, 而 $L_3$ 的不完备性记录元层级结构在嵌入到算术对象层级时的不可约特征. 两个层级都在此意义上展现一种缺陷账本——对阐述无法吸纳入层级自身资源的不可约残留之系统会计. 模式把 $L_2$ 操作缺陷代数与 $L_3$ 不完备性现象识别为同一底层结构形式之平行阐述, 是一项非平凡观察, 而模式的 Via Rho 读法使之自然.

$L_3$ 的交换律是 Gödel 算术化本身:

$$\#: \text{Formulas} \to \mathbb{N}.$$

函数 $\#$ 把元层级对象 (形式陈述) 转换为对象层级对象 (自然数), 转换是 $L_3$ 交换律的阐述单位. 此模式在图式的跨层级交换律表 (§ 4.5, § 5.4) 中再现: 在 $L_3$, 阐述单位是算术化映射, 一如在 $L_1$ 是 $\log$、在 $L_2$ 是 $2\pi i$.

最后, 我们指出, 可计算性理论更精细的装置——相对 Turing 度、度空间的结构、形如 $\deg^{0'}(A)$ (对 $A \le_T 0'$) 的细粒度闭合公式——属于 $L_3$-3 (乘法路径阶段) 而非 $L_3$-4 (闭合阶段). 涉及此类结构的跨层级闭合方程的精细阐述出现在 Cross-Layer Closure Equations [DOI: 10.5281/zenodo.19361950] 与 ZFCρ Paper II [DOI: 10.5281/zenodo.18927658] 中. 本文不主张除上述对角阐述外的 $L_3$ 闭合方程之唯一封闭形式.

6.2 $L_4$: 相对论时空 (一项并行展示)

第四层级 $L_4$ 是相对论时空的层级. 其内容不是数学; 它是狭义与广义相对论时空中质量-能量的阐述结构. 我们此处仅以与图式展示相一致的最简形式将其作为四相模式在此阐述层级的展示. 实质性处理留给四力系列与 Cross-Layer Closure Equations.

步	相	内容 (物理层级并行展示)
$L_4$-1	无	$ct$ 与 $G$ 作为阐述把手被标记
$L_4$-2	有	时空平移与测地线作为正面实体
$L_4$-3	非有也非无	曲率与规范对称作为记忆绑定
$L_4$-4	第三相之否定	事件视界闭合 $rc^2 - 2GM = 0$

在 $L_4$-1, 常数 $ct$ (因果展开, 时空之运动学方面) 与 $G$ (引力耦合, 动力学方面) 作为阐述把手被标记. 在 $L_4$-2, 时空平移与测地线结构填充加法路径, 正面实体是自由粒子的世界线与本征时间区间. 在 $L_4$-3, 曲率阐述乘法路径: Riemann 曲率张量跨时空区域非局部地记录局部加法结构无法捕获的几何内容之绑定. 规范对称为非引力相互作用提供额外的记忆结构. 在 $L_4$-4, 闭合方程

$$rc^2 - 2GM = 0$$

记录 Schwarzschild 事件视界条件: 半径 $r$ 处质量 $M$ 的引力势等于光速的平方, 标志强场区时空阐述的闭合. 此即 $L_4$ 模式意义上的闭合公式.

$L_4$ 的交换律是质量-能量等价

$$E = mc^2,$$

其中 $c^2$ 充当阐述单位. 此模式在形式上与较低层级的交换律相同, 单位适合层级的内容.

此处的处理被有意保持简短. 这些阐述的实质性哲学与物理学解释——曲率的含义、事件视界的地位、规范对称的角色、质量与能量的关系——是四力论文与宇宙学论文的任务, 我们此处不展开. 此展示展示模式在 $L_4$ 的图样; 它不推进物理哲学中的实质性主张.

6.3 $L_5$: 热力学 (一项含部分崩溃的并行展示)

第五层级 $L_5$, 是统计热力学的层级. 其内容仍不是数学; 它是宏观系统就微观态而言的阐述结构. 此处处理再次简短, 关于热力学的实质性哲学留给宇宙学与四力系列.

然而, $L_5$ 的一项显著特征值得记录: 四步模式在此层级部分崩溃. 前两步可识别, 但第三步与第四步经历一项体制依赖的崩溃, 它在前面的层级没有对应. 此崩溃本身是一项阐述内容, 我们对其作显式讨论.

步	相	阐述状态
$L_5$-1	无	熵 $S$ 与 $\ln W$ 作为阐述把手被标记
$L_5$-2	有	广延迭代 ($S = S_A + S_B$); 不可逆方向
$L_5$-3	非有也非无	乘法路径阐述不能干净地应用于非平衡与生命系统区
$L_5$-4	第三相之否定	无与较低层级类比的干净闭合公式; $S - k_B \ln W = 0$ 在平衡区作为条件性闭合

在 $L_5$-1, 熵 $S$ 与微观态计数 $\ln W$ 作为阐述把手被标记. 在 $L_5$-2, 熵的广延性 ($S_{A \cup B} = S_A + S_B$ 对非相互作用子系统) 与不可逆过程的时间箭头填充加法路径. 然而, 在 $L_5$-3, 在远离热力学平衡之区, 乘法路径阐述崩溃: 模式第三步所要求的记忆绑定结构在非平衡统计力学中没有干净的形式. Markov 过程与非 Markov 过程、在不可逆动力学下哪些分布有良定义的问题、驱动系统中熵产生的恰当处理——这些都是没有定型乘法路径阐述的活跃研究领域. 相应地, 在 $L_5$-4, 没有与 $L_2$ 的欧拉公式或 $L_4$ 的 Schwarzschild 公式类比的闭合公式; Boltzmann 关系

$$S - k_B \ln W = 0$$

起着条件性闭合的作用, 在平衡区 ($\eta = 0$, 按 Cross-Layer Closure Equations 的记号) 有效, 而当系统离开平衡时崩溃.

$L_5$ 的交换律, 在其平衡区, 即是 Boltzmann 关系 $S = k_B \ln W$ 本身, $k_B$ 起着把微观态计数转换为熵内容的阐述单位之角色. 在平衡区之外, 交换律没有干净的封闭形式.

此崩溃不是 $L_5$ 作为阐述层级的缺陷; 它是该层级的内容. 闭合方程阐述在 $L_5$ 处的崩溃正是标志两种阐述模式之间边界者——$L_1$ 至 $L_4$ (以及平衡 $L_5$) 的闭合方程语法, 与当系统离开平衡时接管的概率分布语法. 此边界的阐述是 § 7 的主题.

6.4 $L_5$ 崩溃的具体数学实例

闭合方程阐述在 $L_5$ 处的崩溃, 不是模糊的哲学主张; 它有具体的数学实例, 可在数学与物理学实践中辨认. 我们列出五项.

非平衡热力学. 熵产生率 $dS/dt$ 在任何不可逆过程中皆为正, 而闭合方程 $S - k_B \ln W = 0$ 失败: 方程描述某一瞬时状态, 但它不描述状态在不可逆动力学下的时间演化. 非平衡热力学的阐述内容不是闭合方程, 而是熵产生公式、涨落定理、与对相空间轨迹的概率分布.

遍历理论中不变测度的非唯一性. 对给定的动力系统, 多个不变测度可以共存, 没有任何一个由闭合方程相对其他被赋予特权. 阐述内容通过不变测度的空间 (配以其弱-星拓扑) 与不变测度同系统符号动力学之间的关系来阐述.

相变与临界现象. 在临界点, 关联长度发散, 而乘法路径阐述失败: 系统展现没有干净闭合公式的标度不变涨落. 阐述内容通过标度指数、普适性类与重整化群来阐述, 这些都是概率分布结构而非闭合方程.

算法随机性与 Kolmogorov 复杂度. 无穷序列的随机性由其有限前缀的无条件不可压缩性来阐述: 一个序列在算法上是随机的, 当且仅当没有有限程序能产生其比初始段本身更短的初始段. 此阐述基础上是概率的; 没有任何有限乘法路径构造能把随机序列作为闭合值产生.

生命系统. 生物系统远离平衡运作, 在 Cross-Layer Closure Equations 的记号下 $\eta$ 趋近 $1$. 闭合方程阐述在此区全面失败, 而生命系统的阐述要求概率分布数学的全套装置——测度论、遍历理论、统计推断、随机过程理论——加上系统生物学、演化动力学与信息论的更专门工具.

这五项实例并非穷举, 但它们足以表明 $L_5$ 崩溃在具体数学语境中可被辨认. 崩溃不是关于"复杂性"或"混沌"的挥手宣称; 它是具体数学体制中一项具体阐述语法 (闭合方程) 的崩溃, 而另一项具体替代语法 (概率分布) 已准备接管.

---

7. 范围边界: 数学内部的两种互补模式

模式在前四层级的展示展现一种连贯的阐述图样: 标记把手、加法路径、乘法路径、带余项闭合, 而每一层级的闭合都触发下一层级. $L_5$ 处的崩溃, 与此相反, 展现一种不同的现象: 阐述并未停止, 但它改变了性质. 在组织前四层级的闭合方程语法让位于一种概率分布语法, 后者组织前者失败之区. 本节阐述两种语法之间的边界与跨边界的体制依赖转换.

7.1 闭合方程语法与概率分布语法

在当下说法中, 数学的阐述内容通过两种互补语法表达. 两者都是数学的; 任一者都不可被还原为另一者; 各在所适合之区中具有生产力.

闭合方程语法 (closure-equation grammar) 按整合阐述把手的精确闭合方程组织数学阐述. 这是 $L_1$ 至 $L_4$ 与 $L_5$ 平衡区的语法. 其标志性方程是: $\mathbb{R}$ 的 Cauchy 完备化、欧拉公式 $e^{i\pi} + 1 = 0$ 与留数定理、Gödel 对角不动点构造、Schwarzschild 闭合 $rc^2 - 2GM = 0$、Boltzmann 关系 $S - k_B \ln W = 0$. 其标志性方法是推导、恒等式建立、闭合条件验证. 此语法在闭合条件可被精确陈述与精确验证的体制中具有生产力.

概率分布语法 (probability-distribution grammar) 按概率分布、测度、与与之相关的代数结构组织数学阐述. 这是 $L_5$ 非平衡区、概率论广义、遍历理论与测度论、算法随机性、重整化群与临界现象的语法. 其标志性对象是: $\sigma$-代数与其上的测度、不变测度与其谱结构、复杂度函数、分布族、把它们相联系的极限定理. 其标志性方法是分布性后果的推导、收敛定理的证明、与分布转换体制条件的建立. 此语法在闭合条件不能被精确陈述但分布结构可被精确刻画之区中具有生产力.

此区分有三项特征值得强调.

两种语法之间的关系是互补的, 而非层级化的. 并非概率分布语法是闭合方程语法的"后继", 类似复分析是实分析的后继 (后者作为特殊情形被包含). 两种语法在数学内部彼此共延, 各在其范围内具有生产力, 彼此互不可替代. 闭合方程数学无法阐述非平衡热力学; 概率分布数学无法阐述欧拉公式. 模式把 $L_5$ 崩溃识别为从一种语法到另一种语法的转换, 不是一种排序; 它是对互补生产力的承认.

边界不是数学与非数学之间的边界. 概率论是数学: 测度论、遍历理论、Kolmogorov 复杂度、随机过程理论, 皆为严格的数学学科, 而本文不持相反主张. 阐述边界内在于数学: 这是数学事业内部两种语法之间的边界, 而不是数学与某种非数学阐述实践之间的边界.

每种语法在其生产体制中具有生产力. 闭合方程语法在如下体制中具有生产力: 阐述把手可被精确枚举且闭合条件可被精确陈述. 这是 $L_1$ 至 $L_4$ 与 $L_5$ 平衡区的范式情况 (与平衡的小偏离可由线性响应理论处理, 后者在相关意义上是闭合方程式的). 概率分布语法在如下体制中具有生产力: 精确闭合不可得但分布结构可得. 这些体制包括远离平衡的热力学、遍历理论系统、临界点现象、算法复杂度语境, 以及生命系统与演化动力学的丰富领域.

7.2 阐述边界现象作为体制依赖转换

两种语法之间的边界不是沿某特定数学层级的尖锐边界. 它是一种体制依赖转换: 同一物理系统, 在不同参数范围内考察, 可能展现闭合方程行为或概率分布行为, 跨越由系统的体制决定. 模式不规定哪种语法应用于哪种系统; 语法由体制选择.

六个例子可以指明此体制依赖性的范围.

流体力学. 低 Reynolds 数下的层流由 Navier–Stokes 方程阐述, 在许多情况下有精确解 (Couette 流、Poiseuille 流、低 Reynolds 流体中的球). 阐述是闭合方程式的. 高 Reynolds 数下的湍流通过统计图样阐述: 能量级联理论、结构函数、间歇性指数. 阐述是概率分布式的. Reynolds 数是体制参数; 转换发生在中等 Reynolds 数处, 没有尖锐边界.

量子力学. 波函数 $\psi$ 在 Schrödinger 方程下确定性地演化, 演化是闭合方程式的. 测量结果是概率性的, 由对 $|\psi|^2$ 应用 Born 规则来阐述, 阐述是概率分布式的. 两种语法在量子理论内部共存: 波函数的演化与测量的结果都是量子力学的, 但它们以不同语法阐述. 此处的"体制"是考察酉演化还是投影测量的选择, 二者都是标准量子力学阐述的部分.

双摆. 围绕向下平衡点的小幅振荡是可积的, 有正规模坐标与精确周期解. 阐述是闭合方程式的. 大幅振荡时, 双摆展现混沌动力学, 有正 Lyapunov 指数与对初始条件的敏感性. 阐述要求概率分布方法——不变测度、Lyapunov 谱、分形维数计算. 振幅是体制参数.

三体问题. 特定构型允许精确解: Lagrange 点、三重碰撞的 Sundman 级数、八字轨道与其他舞步. 对这些构型, 阐述是闭合方程式的. 一般构型在相空间显著部分展现混沌行为, 阐述要求概率分布方法——轨道类型的分布、Poincaré 截面、混沌区域的拓扑结构.

天气与气候. 短期预报 (数小时至数天) 由大气方程的初值问题解来阐述, 在系统的可预测性时间尺度超过预报视界之体制内. 阐述是闭合方程式的. 长期气候图样 (数十年至数百年) 由气候统计 (均值、变异性、极值) 来阐述, 因为在那些时间尺度上确定性预测不可能. 阐述是概率分布式的. 预报视界是体制参数.

神经网络. 在某些训练体制中, 神经网络展现闭合方程行为: 线性体制中的梯度下降、过参数化网络对插值解的收敛、某些平均场极限的解析解. 在另一些体制中, 阐述要求概率分布方法: 损失景观的拓扑、泛化间隙的分布、所学表示的稳定性. 体制取决于网络的架构、训练程序与数据分布.

在每一种情况下, 同一系统在不同参数条件下考察时, 都在两种语法之间转换. 转换不尖锐——没有体制参数的单一值能让闭合方程语法失败而概率分布语法接管——但转换是真实的, 在系统体制变化时生产语法发生转移这一意义上. 阐述边界相应最好不被理解为数学内部的固定线条, 而被理解为体制依赖的转换, 可能以不同方式适用于不同系统.

按 Cross-Layer Closure Equations 记号, 参数 $\eta$ 度量边界紧致度: $\eta = 0$ 在闭合方程语法具生产力的体制; $\eta \to 1$ 在概率分布语法接管的体制; $\eta$ 的中间值对应两种语法皆部分具有生产力的体制, 其中二者间的选择是方便之事.

7.3 生命系统作为余项自由展开

对生命系统的处理应单独略加注意, 因为它们以独特的形式例示 $\eta \to 1$ 体制.

我们此处从 Cross-Layer Closure Equations 引入两条原则. 第一条 P1 主张余项必须积累与发展: 一项闭合所产生的残留成为下一层级的标记把手, 而阐述之链是持续的而非终结的. 第二条 P2 主张余项跨闭合方程链得到守恒: 每一闭合方程把层级阐述内容与传递给下一层级的残留相平衡, 而整体链保持连贯的会计. P2 在闭合方程体制中成立 ($L_1$ 至 $L_4$ 与平衡 $L_5$); P1 在所有体制中成立.

在生命系统的 $\eta \to 1$ 体制中, P2 失败: 没有任何闭合方程能平衡层级的阐述内容, P2 所执行的守恒会计无法成立. 但 P1 继续成立: 余项继续积累与发展, 在此体制中通过概率分布阐述而非通过闭合方程阐述. 在此说法中, 生命系统是积累余项的阐述自由展开 (freely unfolding), 在 P2 守恒约束缺席的情况下. 它们不是数学的失败; 它们是概率分布语法在闭合方程语法之守恒会计不能适用的体制中的生产性运作.

此阐述与宇宙学与四力论文对 $\eta$ 作为体制参数的处理对齐, 并与 SAE 框架对阐述作为余项积累活动 (而非趋近真理活动) 的更广承诺对齐. 闭合方程语法范围边界在 $L_5$, 在此意义上, 是 P2 放手而 P1 全权接管的边界. 语法转移, 因为约束变化; 数学继续, 在一种不同的阐述模式下.

---

8. 不可穷尽性与局部化阐述

四步模式跨 $L_1$ 至 $L_5$ 的阐述展现一种连贯的结构图样. 在此处, 一种诱惑是询问: 模式是否完成对数学的哲学阐述——既已在五层级展示图样并在第五层级指出边界, 是否可主张已完整给出建筑? 本文抵抗此诱惑. 数学内容在对象层级不可穷尽, 数学的阐述框架在元层级不可穷尽. 模式相应不作为完成提出, 而是作为在此双重不可穷尽性内运作的一项具有生产力的特定框架. 本节显式发展元命题.

8.1 $\rho$ 阐述的局部化性质

我们从一项关于余项结构的观察开始. Methodology 00 的 $\rho$ 阐述不是模式逐渐揭示的全局、跨层级对象. 它是一种局部化的阐述结构: 每一层级、每一子层级、子层级中的每一路径, 都阐述自己的 $\rho$. ZFCρ 系列追踪 $L_{1\text{-}2}$ 选择操作所特有的 $\rho$; $L_{1\text{-}3}$ 的乘法路径阐述其自己的素结构与因式分解余项; $L_2$ 阐述操作缺陷代数 $\omega_\rho^{(2)}$; $L_3$ 阐述由 Turing 度层级所组织的可定义性-复杂度余项. 这些每一项都是有其自身权利的 $\rho$ 阐述; 任何一项都不可被还原为其他.

此局部化结构有一项阐述后果: 数学生产力发生在局部化范围, 而非统一的全局 $\rho$ 范围. 模式不承诺一项将所有 $\rho$ 阐述都加以捕获的单一理论; 它把它们的关系组织为每一层级上的四步图样, 但它不把局部化 $\rho$ 结构折叠为单一对象. 数学阐述, 在此说法中, 是局部化生产力的结构化多元, 而非统一的全局阐述.

8.2 四种不可穷尽性

在当下说法下, 数学的不可穷尽性以四种可区分的形式出现. 这四种形式互不排斥; 它们阐述同一底层现象的不同方面, 彼此相互强化.

层内的操作不可穷尽性. 在任何给定层级内, 阐述工作都在没有终结的情况下持续. $L_{1\text{-}3}$ 的乘法路径, 狭义考察, 已被数学家工作了数个世纪——从 Diophantus 的希腊算术经过 19 世纪的代数数论到当代关于 Riemann 假设的工作——而工作未完成. $L_2$ 操作缺陷代数, 狭义考察, 已被工作自 Cauchy 经 Riemann 至 Stokes 现象与共振渐近的现代理论——而工作未完成. 在每一层级, 模式作为四步图样所阐述者, 在内部都是数学工作的不可穷尽领域. 模式规定层级的建筑学角色; 它不规定、也不假装规定层级的内部内容.

层间的转换不可穷尽性. 层级转换之链——$L_1 \to L_2 \to L_3 \to \ldots$——本身是持续的. 本文显式阐述模式至 $L_5$, 并在 $L_5$-3 有部分崩溃, 表明向概率分布语法的转换. 模式是否以及如何延伸至数学之外的阐述层级——延伸至生命系统的阐述、主体性的阐述、社会结构的阐述——是有待进一步工作的问题, 而非已定之事. 在模式的读法下, 链没有一个阐述终点, 不存在某一处使得"接下来是什么?"之问题不再有意义.

路径分支不可穷尽性. 在每一层级内, 阐述允许多条路径, 没有任何一条事先被赋予相对其他者的特权. 在 $L_{1\text{-}4}$, 向 $\mathbb{R}$ 的闭合是一条路径; $p$-进闭合 $\mathbb{Q}_p$ 是替代路径, 通过 $\mathbb{Q}$ 的不同完备化而阐述; 非标准分析提供另一路径, 通过超积与无穷小阐述; 超实数 (surreal numbers) 提供又一路径. 在 $L_2$, 标准复分析路径是一种阐述; 四元数与八元数扩展是替代, 各带其独特代价; Cayley–Dickson 进程阐述更多替代之序列. 模式与每一层级的多条路径相容, 而路径的不可穷尽性本身是一项阐述内容.

元阐述的递归不可穷尽性. 把 $\rho$ 结构作为递归可枚举结构来阐述, 本身在元层级产生一项阐述余项. 这是框架本身的 Gödel-不完备性-同构结构: 任何具体框架都不能捕获它所产生的全部阐述把手, 否则它产生一项立于框架之外的元阐述. 模式, 作为框架, 展现此递归结构: 对 $L_1$ 至 $L_5$ 层级的阐述, 在元层级产生关于何种框架阐述模式自身阐述的问题, 而此问题本身不可穷尽.

四种不可穷尽性形式合起来, 阐述数学的对象层级不可穷尽性. 它们不是关于数学有多个未解问题的四项主张; 那固然是真的, 但平凡. 它们是数学作为持续阐述活动 (而非完成内容主体) 之地位的四项结构性阐述.

8.3 不可穷尽性作为阐述框架的性质

刚发展的不可穷尽性读法把不可穷尽性视为数学的正面结构特征, 而非缺陷或限制. 此读法可通过几种重新表述加以巩固.

在模式读法下, 数学不趋近完成. 不存在某一视界, 数学若延展足够即将在其处终结; 不存在某一渐近极限, 数学工作朝其趋近. 此读法不是说数学工作没完没了, 在不能完成所开始之事的意义上; 此读法是说数学工作就是持续阐述, 持续性对实践是构成性的, 而非仅是偶然的.

数学在局部化范围而非统一全局范围具有生产力. 数学之统一, 就其拥有任何统一而言, 不是单一封闭理论的统一, 而是一种阐述实践的统一: 它把局部化生产力通过结构化关系联系起来. 模式阐述此种关系; 它不把局部化生产力包摄入单一封闭阐述.

在此说法下, 数学进步是部分阐述的积累, 而非趋近全体阐述. Cantor 的基数理论没有使数学接近最终状态; 它向实践添加一项阐述. Gödel 的不完备性定理没有阻塞进一步阐述; 它阐述了形式系统的一项结构特征, 后续工作继续在此基础上详尽阐发. Cauchy 的严格化没有完成分析; 它把分析转移到一个新的阐述体制, 其中可以做更多工作. 这些每一项都是部分阐述的积累, 而非部分阐述向完成之趋近.

此读法与数学历史记录相符. 长期未决之列——Riemann 假设、$P$ 与 $NP$ 问题、物理相互作用的统一、范畴论与同伦类型论的基础地位——并非失败之列, 而是仍在进行的阐述之列. 各自都是持续工作的生产性场所, 而工作的生产力不依赖于任何具体问题的最终解决. 框架对不可穷尽性的承诺, 在此意义上, 与数学家的实践经验相一致.

8.4 不可穷尽性与 SAE 方法论基础

§ 8.2 阐述的四种不可穷尽性, 与 SAE 方法论基础的更深原则相对齐. 此对齐值得记录, 因为它把本文元命题置于更广 SAE 纲领之内.

Methodology 0 中发展的构不可闭合 (construction-without-closure) 原则主张, 任何阐述性构造都产生构造本身无法纳入的余项. 本文关于数学不可穷尽性的主张, 在数学阐述层级, 是此原则的一项实例: 数学作为阐述性构造, 产生构造本身无法吸纳的余项. 四步模式逐层记录, 构不可闭合原则如何在数学阐述内运作.

Cross-Layer Closure Equations 中发展的 P1 与 P2 统一 原则主张, 余项之发展 (P1) 与余项跨闭合方程之守恒 (P2) 不是独立原则, 而是共同支配阐述之链. 本文关于数学不可穷尽性的主张, 在其层间转换方面, 是 P1 的一项实例: 层级转换之链是持续的, 因为余项持续积累与发展. 模式在 $L_5$ 记录的崩溃, 是 P2 体制依赖性的一项实例: 在闭合方程语法具生产力的体制中, P2 成立; 在概率分布语法接管的体制中, P2 放手而 P1 全权接管.

SAE Methodological Overview Paper I 中发展的凿构循环 (chisel-construct cycle) 原则主张, 凿-构-余项-桥-物自身之循环本身是非终结的: 循环不收敛到稳定终点, 而是在每次迭代产生一项启动下一循环的新余项. 本文关于数学不可穷尽性的主张阐述了, 在数学阐述层级上, 凿构循环的非终结特征.

这三项原则——构不可闭合、P1 / P2 统一、凿构循环——与本文的四种不可穷尽性, 阐述 SAE 纲领的同一底层承诺: 阐述是生产性持续活动, 而非趋近真理的活动, 持续性内在于生产力. 本文的贡献是, 在数学内容的层级上具体阐述此承诺, 模式作为承诺如何跨层级展开的结构性说明.

8.5 双重不可穷尽性元命题

§ 8.2 的四种不可穷尽性阐述数学的对象层级不可穷尽性: 数学内容在阐述下的不可穷尽性. 本文的元命题添加第二个层级: 数学的阐述框架不可穷尽. 两个层级合起来, 阐述数学-阐述情形的双重不可穷尽性 (twofold inexhaustibility).

在对象层级, 数学内容按刚阐述的四种意义不可穷尽: 层内、层间、路径分支、元阐述递归. 这是四步模式在每一层级上所记录的不可穷尽性.

在元层级, 数学的阐述框架不可穷尽: 模式是众多持续可能的替代框架中一个具有生产力的特定框架. 其他框架——柏拉图主义、形式主义、构造主义、结构主义、范畴论、同伦类型论——阐述数学实践的不同角度, 各在其范围内具有生产力. 本文不主张模式取代这些框架, 也不主张在某种与语境无关的意义上优于它们. 它主张模式是一项具有生产力的阐述, 在其具体主张上 (通过 § 3.5 的充分性标准与 § 3.6 的失败模式) 可证伪, 在其主张强度分层 (§ 1.3) 上明确, 关于其不主张覆盖的范围 (§ 1.5) 诚实.

双重不可穷尽性在此意义上是工作承诺而非终结主张. 它使模式承诺在对象层级不主张完成 (数学不闭合) 与在元层级不主张唯一 (模式不是唯一框架) 的情况下运作. 此承诺不是回避: 它不削弱模式的具体主张, 这些主张在本文主体中提出并辩护. 它毋宁是模式作为一项具有生产力的特定框架其地位所要求的阐述诚实.

我们最后指出, 此元命题本身是本文的阐述承诺, 本文以此身份提供之. 不同意元命题的读者——例如, 持数学哲学须以单一正确框架为目标者, 或持数学内容原则上可被穷尽阐述者——自然会以与共享元命题的读者不同的方式评估本文. 不一致本身是元命题所阐述之生产性多元性的一部分, 而本文不试图以排除来解决之.

---

9. 系列展望与 ZFCρ 接口

本文作为 SAE 数学的建筑学阐述, 与 SAE 纲领中其他论文处于具体关系. 本节使此关系显式, 并指出未来工作的方向.

9.1 ZFCρ 系列与本文

在本文撰写之时, ZFCρ 系列是 SAE 纲领中技术上最发展的数学工作, 有七十三篇论文在积极发展, 追踪 $L_1$ 选择操作子阐述中的具体阐述. 其与本文的关系要求显式阐述, 因为 ZFCρ 系列与本文在纲领的数学地景中占据相邻但不同的位置.

ZFCρ Paper I [DOI: 10.5281/zenodo.18842458] 用我们的术语阐述, 是从一个具体视角看 $L_1$ 的闭合结构: ZFC 的外延闭合产生选择操作历史所追踪的 $\rho$ 标记, 作为其具体操作余项. 本文 § 4.4 阐述的向 $\mathbb{R}$ 的 Cauchy 完备化产生超越数与不可纳入余项 $i$; ZFCρ Paper I 阐述的 ZFC 外延闭合产生 $\rho$ 标记, 作为 $L_{1\text{-}2}$ 选择操作的具体操作余项. 二者都是 $L_1$ 建筑内的闭合, 处理层级阐述的不同方面.

ZFCρ Paper II [DOI: 10.5281/zenodo.18927658] 阐述跨层级转换结构——两余项加一行为等于闭合——与本文关于第 4 步闭合公式的说法相对齐. Paper II 阐述的数学结构是各层闭合方程所共同展现的结构图样: $L_4$ 的 Schwarzschild $rc^2 - 2GM = 0$、$L_5$ 的 Boltzmann $S - k_B \ln W = 0$、$L_2$ 的欧拉 $e^{i\pi} + 1 = 0$、$L_3$ 的 Gödel 对角, 皆例示由两余项加一行为产生闭合的同一一般图样. 本文的模式与 Paper II 的转换结构, 在此意义上, 是同一阐述从两个角度的观察.

随后的 ZFCρ 论文 (P50 及以后) 以日益增加的技术深度发展本文模式仅以梗概所示的跨层级涉入. 从约 P50 开始引入的谱分析阐述了 ZFCρ 在 $L_1$ 的算术内容自然地溢出至 $L_2$ 复分析缺陷代数. 热力学论文对参数 $\eta$ 的阐述阐释 $L_4 \to L_5$ 的阐述边界. 近期的 P73 谱读出, 技术上详细阐述 $L_2$ 缺陷代数在 ZFCρ 语境中的出现. 这些每一项, 都是在本文所阐述的建筑学框架内的技术工作.

ZFCρ 对象与本文图式位置之间的关系可概述如下.

ZFCρ 对象	模式位置
后继 ($+1$)	$L_{1\text{-}2}$ 加法路径内部操作
因子路径	$L_{1\text{-}3}$ 乘法路径局部精化
Min 递归	第 4 步闭合微观实例
$\rho$ 标记	$L_{1\text{-}2}$ 选择操作的操作余项
超穷序数层级	$L_{1\text{-}1}$ 至元层级阐述
谱分析 (P50 起)	跨层级, 涉入 $L_2$ 分析工具
热力学论文 $\eta$	$L_4 \to L_5$ 阐述边界
具体一致性测试 (P59.1 等)	$L_{1\text{-}2}$ 选择操作内部一致性

在此读法下, ZFCρ 系列是 $L_1$ 内一条阐述路径的具体技术工作——主要是 $L_{1\text{-}2}$ 的选择操作子阐述. 它不是 SAE 数学框架的整体: 此处所阐述的框架还含 $L_1$ 其他路径 ($p$-进、非标准、Cayley–Dickson 替代)、其他层级 ($L_2$ 至 $L_5$), 以及本文贡献使其显式的元阐述内容 (双重不可穷尽性、并行展示框架). ZFCρ 系列, 在模式的精确意义上, 是一个具体子层级内一条具体路径上的具体技术工作; 建筑学框架是此技术工作在其中拥有位置的更广阐述.

9.2 其他 SAE 系列与本文的关系

与其他 SAE 系列的关系最好简要陈述.

四力系列 (发展中) 在技术细节上处理 $L_4$: 在相对论时空的阐述层级上, 引力、电磁、弱相互作用、强相互作用的阐述. 本文 § 6.2 对 $L_4$ 的简要处理是梗概; 四力系列提供实质性阐述.

宇宙学系列 (发展中) 在宇宙学语境中处理 $L_4 \to L_5$ 的阐述边界: 宇宙微波背景、暗物质与暗能量、暴胀体制、早期宇宙结构. 本文对 $L_4 \to L_5$ 边界处体制依赖转换的阐述 (§ 6.3, § 7) 是一般说法; 宇宙学系列提供具体应用.

几何与动力学系列 (发展中, 含此处有时被引用为"形与流 Paper 1"的论文) 处理数学对象的几何与动力学阐述. 该系列所阐述的 Gauss–Bonnet 交换律与本文 § 5.4 所阐述的 $L_2$ 留数定理处于结构平行: 二者通过具体积分恒等式阐述局部-整体交换, 而此平行并非巧合.

方法论系列 (Methodology 0、Methodology 00、Methodology I、Methodology VII 及其他) 阐述 SAE 纲领的基础方法论承诺. 本文建立在 Methodology 0 (negativa 为唯一公理) 与 Methodology 00 (Via Rho 方法) 之上, 并在建筑学层面与 Methodology I (凿构循环) 与 Methodology VII (Via Negativa) 对齐.

这些系列之间的关系构成一个网络而非层级. 本文的建筑学阐述组织数学内容, 但它不包摄其他系列的技术工作. 每一系列贡献一项独特阐述, 而它们之间的关系网络构成当下阶段的 SAE 纲领.

9.3 未来工作方向

从本文的视角看, 几项未来工作方向是可见的.

层级专题论文. 模式至 $L_5$ 的阐述, 在每一情况下都支持一篇层级专题论文的发展, 它将以基础论文无法做到的深度处理该层级. $L_1$ 专题论文将详细处理乘法路径的发展, 含 $p$-进替代、素数分布结构, 以及与 Cantor、Cauchy、Dedekind 的接洽. $L_2$ 专题论文将系统处理操作缺陷代数 $\omega_\rho^{(2)}$, 含其分量的合成关系、与 Riemann 与 Weierstrass 的接洽、与代数几何与 Riemann 面理论的关系. $L_3$ 专题论文将详细处理形式系统阐述, 含后-Gödel 发展 (可计算性理论、递归论、描述集合论) 与对 Hilbert、Gödel、Tarski 及后续逻辑传统的接洽.

ZFCρ Paper 0. 一篇专门阐述 ZFCρ 系列在更广 SAE 数学框架内其范围与阐述地位的论文, 依我们判断, 本应早已写出. 此种论文将显式 ZFCρ 在 $L_{1\text{-}2}$ 选择操作焦点与本文更广 $L_1$ 建筑之间的关系, 并阐述 ZFCρ 系列具体技术工作的边界.

跨学科并行展示. 模式把 $L_3$、$L_4$、$L_5$ 阐述为来自同一四相模式的并行展示, 提示对其他学科阐述——生命系统、主体经验、社会结构——可能有类似的、具有生产力的阐述. 本文不进行任何此类跨学科阐述, 但把它们标示为未来工作的候选.

与替代框架的接洽. § 1.4 提供的与数学哲学标准立场的最简接洽, 是有意简短的: 详细接洽留给层级专题论文. 与范畴论基础、同伦类型论、集合论基础、与构造主义传统的具体层级专题接洽, 将需要各自的实质性处理.

这些方向从本文视角可见, 但此处不进行. 本文的任务一直是建筑学模式的阐述; 详细工作属于各自纲领中的后续论文.

---

10. 诚实的边界与结论性观察

本文已阐述层级阐述模式, 跨 $L_1$ 至 $L_5$ 展示之, 一定程度细致地阐述了 $L_2$ 的操作缺陷代数与 $L_3$ 的 Gödel 对角闭合, 简要指出 $L_4$ 与 $L_5$ 的并行展示, 阐述了闭合方程语法 / 概率分布语法的区分, 并发展双重不可穷尽性元命题. 余下的工作是回顾本文的主张强度分层、记录本文所守的范围边界、并指出本文贡献得以提供的精神.

10.1 主张强度分层回顾

§ 1.3 的分层贯穿本文. 我们简要重述以供回顾.

Methodology 0 的四相作为基础继承, 不重新推导. 四步模式作为已识别的阐述提供, 通过充分性标准 (§ 3.5) 与失败模式 (§ 3.6) 可证伪, 但不作为推导性证明. $L_1, L_2, L_3, L_4$ 实例是结构性展示. $L_5$ 崩溃是工作性边界观察. 双重不可穷尽性是阐述框架认识论立场的元命题. 数学的确定论与概率论阐述之间的边界是工作假设, 可依进一步阐述加以精化.

在本文每一处, 读者应能识别哪一主张层级在起作用. 在模式作出强主张之处——把 $L_2$ 操作缺陷代数识别为该层级核心工作内容、把 Gödel 对角识别为 $L_3$ 闭合、把交换律模式识别为跨层级的再现——主张随支持它的证据一同提供. 在模式作出较弱主张之处——把 $L_4$ 与 $L_5$ 阐述为简要并行展示、把体制依赖转换作为对边界现象的工作分类、把 § 2 历史谱系作为阐述谱系而非对人类史前史的重构——较弱的地位被显式表明.

10.2 范围边界

本文贯彻数项范围边界, 我们为读者参考记录之.

模式是已识别的阐述, 而非推导性的阐述. 在所考察的各层级展示四步图样, 由充分性标准与可证伪性条件支撑, 但不从更高阶必然性主张推导. 模式的权威是在可证伪性纪律下进行图样识别的权威, 而非先验论证的权威.

$L_5$ 崩溃是工作性边界观察. 主张并非闭合方程语法因某种必然原因必须在 $L_5$ 失败; 主张是闭合方程语法在具体 $L_5$ 体制中确实失败, 失败的具体数学实例可在非平衡热力学、遍历理论、相变理论、算法随机性与生命系统阐述中识别.

阐述边界现象作为体制依赖转换而非数学内部的尖锐边界来阐述. 闭合方程语法与概率分布语法之间的边界, 不是特定层级处的固定线条; 它取决于具体系统所考察的体制, 而同一系统在不同参数范围内可能展现任一种语法.

与数学哲学传统的接洽是最简的, 这是有意为之. 本文阐述一个框架; 对柏拉图主义、形式主义、构造主义、结构主义、范畴论、同伦类型论的细致接洽留给可在所需深度进行此种接洽的层级专题论文.

$L_3$、$L_4$、$L_5$ 的阐述是并行展示, 而非从 $L_2$ 或从模式数学内容的推导. $L_3$、$L_4$、$L_5$ 展示的四相图样从与 $L_1$ 与 $L_2$ 展示之图样相同的源头 (negativa 的自我追问) 继承; 它不通过数学传递到其他层级. 本文主要范围是数学, 对形式逻辑、物理学与热力学的简要处理仅为指出模式跨阐述层级的延伸.

10.3 与既有 SAE 文集的关系

本文不取代 SAE 文集中任何先前论文. 它从 Methodology 0 与 Methodology 00 继承方法论基础, 使 Cross-Layer Closure Equations 与 ZFCρ 系列隐含预设的建筑学框架显式化, 并与 SAE Methodological Overview Paper I 的凿构循环对齐. 它的贡献是: 把先前文集中隐含的建筑学图样显式阐述, 加上把建筑学图样之认识论地位组织起来的双重不可穷尽性元命题.

建筑学阐述, 连同先前的基础论文, 构成 SAE 纲领的数学基础: Methodology 0 提供公理基础 (negativa, 四相); Methodology 00 提供方法论基础 (Via Rho, ZFCρ 作为载体); 本文提供建筑学基础 (层级阐述模式, 双重不可穷尽性元命题); Cross-Layer Closure Equations 提供跨层级转换基础 (闭合方程与 $\eta$ 参数). 这些论文合起来, 阐述 SAE 纲领在数学与邻近层级上的基础立场.

10.4 结论性观察

模式关于数学作为持续阐述而非趋近真理活动的说法, 可以以概括形式陈述. 我们以此概括作为模式得以提供之精神的指示而呈现, 而非作为最终主张.

在 SAE 视角下, 数学不首先被理解为对预存永恒真理的发现. 它被理解为对未闭合余项的持续代数化. 每一闭合产生一项残留; 每一残留, 转而, 成为下一阐述层级的标记把手; 每一层级的闭合在其边界产生对下一层级的触发; 而层级链不终结. 余项不是失败; 它们是活动的生产性内容. 链不是生产力所未能完成的未竟之事; 链就是生产力, 其持续性是构成性的而非偶然的.

此立场与数学家在实践中所常常报告者相一致: 数学工作之所以有趣, 因为它是持续的; 一个问题的解决揭示更多的问题, 而非终结探究; 数学最有生产力的领域是阐述尚未闭合者. 模式的阐述目标在于, 在数学的建筑哲学层级上, 使此实践实在变得阐述上可见.

模式, 最后, 作为元命题所阐述的双重不可穷尽性内一个具有生产力的特定框架而提供. 其他框架——柏拉图主义、形式主义、构造主义、结构主义、范畴论、同伦类型论——阐述同一数学实践的其他角度, 各在其范围内具有生产力. 本文不试图取代这些框架; 它在阐述框架不可穷尽性所支持的阐述多元主义精神下, 与之并列提供模式. 邀请读者按模式自身条件接洽之, 依本文所提供的充分性标准与失败模式检验其具体主张, 并在不视模式之提供为对其他者之排斥的情况下, 与替代并置考量.

SAE 数学的建筑学阐述, 在此最后意义上, 是一项处于不可穷尽活动内部的阐述, 把自身提供为该活动持续生产力的一部分.

---

11. 开放问题

模式、跨 $L_1$ 至 $L_5$ 的四步阐述与双重不可穷尽性元命题, 是本文的实质性贡献. 然而, 它们并非对所处理主题的最后说法. 若干实质性问题保持开放, 我们在此记录之, 既作为对本文未予解决者的诚实承认, 也作为对未来工作可在何处与框架生产性接洽的指示. 这些问题的开放地位与元命题相一致: 框架留下生产性问题未答, 不是框架的缺陷, 而是其作为一项具有生产力的特定阐述, 而非封闭理论之认识论纪律的反映.

11.1 $L_2$ 操作缺陷代数的合成律

§ 5.4 的操作缺陷代数 $\omega_\rho^{(2)}$ 被阐述为六分量结构, 组织为拓扑演化链的四阶段. 各分量——除子、留数、周期、单值群、无穷处增长、Stokes 数据——以及各阶段——点态、局部-货币化、整体-圈、边界-扇区——逐一展示, 本文指出每一分量如何填充其图式角色. 本文未提供, 而对 $L_2$ 之完全封闭说法所要求者, 是支配六分量之代数关系的合成律.

此方向的具体开放问题含: 当人们绕分支点 (其单值群作非平凡相互作用) 周游时, 留数与单值群如何合成? 在含非平凡基本群的 Riemann 面上, 周期的合成由何种代数结构所捕获, 特别在与不规则奇点处 Stokes 数据相关之处? 完整代数结构是否最好阐述为一个群、一个群胚、底 Riemann 面上代数之层, 或某种更精化的范畴结构? 本文阐述六分量作为层级的核心内容; 它不以同等精度阐述把它们绑定的代数结构.

此开放问题在后续 $L_2$ 专题论文中得到恰当处理, 在那里, 合成关系可以借助复代数几何、层上同调与现代共振 (resurgence) 理论的技术装置来发展. 此论文将本文的建筑学阐述扩展至 $L_2$ 工作内容所要求的操作数学.

11.2 $L_5$ 及其以上的概率分布语法

本文在 § 7 中阐述了从闭合方程语法到 $L_5$ 及以上之概率分布语法的体制依赖转换. 它未以其数学严肃性最终所要求的精度阐述概率分布语法自身的具体结构内容.

此方向的开放问题含: 概率分布语法通过测度论、遍历理论与 Kolmogorov 复杂度的具体阐述, 如何组织层级的阐述内容? 在 $L_5$ 的概率分布阐述与 $L_4$ 的闭合方程阐述之间, 当两者皆部分具有生产力的体制中, 精确关系是什么? 概率分布语法是否延伸至 $L_5$ 之外的阐述层级——延伸至生命系统、主体经验、社会结构的阐述? 本文指出这些体制的存在并识别 $L_5$ 崩溃的具体数学实例 (§ 6.4), 但它未阐述概率分布语法的完整结构内容.

这些问题的恰当处理属于后续专门讨论概率分布语法的论文, 或属于在技术细节上接洽 $L_4 \to L_5$ 阐述边界的宇宙学与四力系列论文.

11.3 跨层级工具使用

模式与高等数学中常见的实践相容: 在一层级的分析中使用来自另一层级的工具. 复分析, 一种 $L_2$ 阐述, 常规地被应用于实值函数 ($L_1$ 对象). 代数几何对 $L_3$ 风格的形式结构使用 $L_2$ 工具 (复代数结构、层). 拓扑 K 理论把 $L_2$ 工具 (复向量丛) 与 $L_3$ 工具 (丛上的形式系统结构) 结合.

本文在 § 1.5 指出, 跨层级工具使用与模式相容: 层级归属按主要阐述功能, 而非排他分类. 本文未以此话题应得的精度阐述跨层级工具使用的机制——即, 在一层级的阐述资源内发展的工具, 如何在另一层级的阐述范围内具有生产力地变得可用.

开放问题含: 当 $L_2$ 工具被应用于 $L_1$ 对象时, 应用的阐述地位是什么——结果是使用 $L_2$ 资源的 $L_1$ 阐述、是处理 $L_1$ 对象的 $L_2$ 阐述、还是某种模式当前四步结构未干净捕获的混合? 是否存在一种对跨层级工具使用的一般说法, 可补充模式逐层级的阐述, 或者跨层级使用是否要求逐案处理? 本文不解决这些问题; 它们是层级专题论文的候选, 在那里与具体数学实践的接洽可以阐述相关阐述关系.

11.4 与数学哲学传统的细致接洽

本文在 § 1.4 中以建筑学论文所要求的最简接洽水平, 与数学哲学的四种标准立场——柏拉图主义、形式主义、构造主义、结构主义 (含其范畴论精化) ——接洽. 与这些立场及与同伦类型论、集合论基础与各种构造性学派 (Brouwer、Bishop、Markov、Martin-Löf) 之相关传统的实质性接洽留给层级专题论文.

延迟不是回避. 每一传统都有以特定方式关切模式各特定层级的内在承诺. 对范畴论结构主义的充分接洽至少要求在 $L_2$ (范畴论对复分析的阐述变得有生产力之处) 与 $L_3$ (范畴论基础接洽形式系统阐述之处) 进行细致处理. 对同伦类型论的充分接洽要求在 $L_3$ 上持续关注, 特别考虑单价公理可能在形式系统层级强制模式精化的潜力. 对构造主义传统的充分接洽要求在 $L_1$ (构造性分析阐述穿过层级的替代路径之处) 与 $L_3$ (构造逻辑通过与经典逻辑不同的方式接洽闭合步骤阐述之处) 上的处理.

这些每一种接洽在 SAE 纲领当下状态下都是开放的. 它们在后续层级专题论文中得到恰当处理, 在那里, 哲学接洽可在话题所要求的技术深度下进行.

11.5 跨学科并行展示

模式把 $L_3$、$L_4$、$L_5$ 阐述为来自同一四相模式的并行展示, 经延伸提示对其他探究阐述层级的类似阐述可能具有生产力. 生命系统的阐述、主体经验的阐述、社会结构的阐述、文化与历史的阐述——这些每一项, 都是与本文所处理之数学与物理层级并列, 一项并行展示阐述的候选.

本文不进行任何此种跨学科阐述. 每一种之复杂性都甚为可观, 而恰当处理在每种情况下都要求与学科特定阐述内容的持续接洽. 模式的数学阐述可以作为此种阐述可能如何看起来的一种模型, 但构造它们的工作属于那些能为之带来必要学科专长的人.

这些跨学科阐述的开放地位, 在我们看来, 是生产性的而非限制性的. 模式不预先承诺已阐述其跨所有学科之并行展示结构必须如何看起来. 它较谦逊地承诺: 在那些层级所允许之关切下, 阐述数学与物理层级, 并指出他处类似阐述是未来工作的候选.

11.6 模式在 $L_1$ 至 $L_5$ 之外的适用性

模式在本文中跨五个层级阐述, 在第五层级有部分崩溃. 模式是否以同样的结构完整性延伸至 $L_5$ 之外的阐述层级——延伸至 (若存在) 阐述生命系统、心智、文化之结构的层级——保持开放. 模式的阐述按设计与此种延伸相容, 但它不预先阐述它们.

此方向的开放问题含: 四步图样是否在闭合方程语法完全让位于概率分布语法的层级上继续应用, 或者图样在那些层级上是否要求精化? 是否存在 $L_5$ 之外的层级, 对它们, 任一语法都不充分, 而需要本文未预见的第三种阐述模式? 模式的四步结构本身在被应用于远离其在数学中之原阐述家园的层级时, 是否服从修订? 这些问题按设计开放; 模式的认识论立场 (§ 3.8) 显式承诺: 进一步的数学与跨学科工作可能要求模式精化.

11.7 ZFCρ Paper 0 与 ZFCρ 系列的范围划界

ZFCρ 系列, 如 § 9.1 所阐述, 是 $L_1$ 中一条阐述路径的具体技术工作——主要是 $L_{1\text{-}2}$ 的选择操作子阐述. 一篇显式关注 ZFCρ 系列在更广 SAE 数学框架内的范围与阐述地位的论文, 依我们判断, 本应早已写出. 我们把此假设论文称为 ZFCρ Paper 0, 沿用以零号位置标示范围-阐述论文的做法.

此论文将处理几项阐述任务: 显式 ZFCρ 在 $L_{1\text{-}2}$ 选择操作焦点与本文更广 $L_1$ 建筑之间的关系; 阐述 ZFCρ 系列具体技术工作的边界, 显式关注何者落在其范围之外; 处理 ZFCρ 具体结果与其他 $L_1$ 路径上平行工作之间的关系 ($p$-进、非标准与替代完备化结构). 该论文将以 SAE 纲领最发展之技术系列的范围划界, 补充本文的建筑学阐述.

ZFCρ Paper 0 的构造是开放的, 在它尚未被写出的意义上. 该论文的实质性内容, 含它将进行的具体阐述任务, 只能在本文视角下以梗概指明; 详细阐述属于该论文得以写出之时.

11.8 $L_2$ 处的 Cayley–Dickson 进程

由 Cayley–Dickson 构造阐述的维度进程——$\mathbb{R} \to \mathbb{C} \to \mathbb{H} \to \mathbb{O} \to$ sedenions $\to \ldots$——提供 $L_2$ 处的一序列替代闭合, 每一闭合以一项具体代数结构性质 (在向 $\mathbb{C}$ 过渡时的有序性、在向 $\mathbb{H}$ 过渡时的可交换性、在向 $\mathbb{O}$ 过渡时的结合性、在向 sedenions 过渡时的除代数性质) 为代价. 本文在 § 5.1 与 § 5.3 指出, 这些替代闭合与模式相容, 而模式不规定唯一的 $L_2$ 闭合路径.

此方向的开放问题含: 给定每一闭合丢失前一闭合所拥有的一项结构性质, 模式的充分性标准 (§ 3.5) 如何应用于这些替代闭合? 在 Cayley–Dickson 进程中是否存在某个原则性的点, 使模式的四步阐述不再应用, 标志 $L_2$ 内部的一项阐述边界? Sedenions 著名地不构成除代数; 此失败是否一项模式应当标为重要的阐述边界, 或者在精化下进程是否在其之外继续生产性地进行? Cayley–Dickson 替代与标准复阐述的操作缺陷代数 $\omega_\rho^{(2)}$ 之间的关系是什么——替代闭合是否支持类似的操作缺陷代数, 或者它们是否展现要求自身阐述的不同缺陷结构?

这些问题是开放的, 其恰当处理要求一篇 $L_2$ 专题论文, 以话题所要求的技术深度接洽 Cayley–Dickson 进程.

11.9 模式阐述与阐述实践之间的关系

一项最终的开放问题关切模式阐述 (如本文所提供) 与工作数学家的阐述实践之间的关系. 模式阐述了一种数学家可在回顾中识别为已在其实践中起作用的图样. 然而, 模式未阐述图样如何前瞻地运作——即, 一位从事新数学工作的数学家如何把模式作为对阐述方向的指引, 而非仅作为回顾性的组织工具.

开放问题含: 模式是否具有预测内容, 即在当下阐述前沿的未来数学发展 ($L_5$ 边界、跨学科阐述), 是否可通过关注模式的结构图样而被预见? 或者模式主要是一种回顾性阐述, 应用于已发展的数学但不为正在进行的数学提供指引? 若模式确实具有预测内容, 它应如何被检验——通过对即将出现的数学阐述之结构的具体预测、通过向工作数学家提供方法论指引、通过某种其他阐述实践?

这些问题按设计开放. 本文中所阐述的模式作为回顾性建筑学阐述的工具提供; 其前瞻性潜力未被主张但也未被否认. 未来工作, 既在 SAE 纲领内、亦在模式与数学实践之更广接洽中, 将阐述模式之图样与进行中之数学拥有何种关系 (若有).

---

以上所列开放问题并不穷尽; 元层级阐述框架不可穷尽性 (§ 8.5) 意味着, 随着框架与具体数学内容及与替代阐述视角接洽, 将涌现更多问题. 此列表的功能是指出从本文视角可见的生产性方向, 并以本文主张强度纪律之精神, 显式本文所阐述者的边界. 开放问题不是模式的失败; 它们是模式的生产性视域, 是后续 SAE 论文与对替代框架的接洽可能继续本文已开始之工作的疆域.

---

附录

附录 A: 作为压力测试的数学历史

A.0 目的与方法论框定

提议本文所阐述之结构图样这类建筑学的数学哲学论文, 必须诚实地, 对照数学历史接受测试. 图样的充分性取决于其在历史记录中识别它声称阐述之结构特征的能力; 图样的可证伪性取决于其对抵抗所提议阐述之历史发展的承认准备.

把附录之考察作为压力测试而非验证是有意为之. 称考察为验证将表明: 历史记录, 经恰当解释, 证明了模式的正确性. 模式不担保此种更强主张. 称考察为压力测试, 与此相反, 表明真正的认知姿态: 模式被提供以对照历史材料接受测试, 显式承认测试可能揭示部分契合、开放问题或真正不契合, 并进一步承认测试的结果可能要求模式精化.

附录分两部分进行. 第一部分 (§ A.1 至 § A.7) 处理模式图样清晰可识别的历史发展, 在每一情况下阐述图样如何应用. 第二部分 (§ A.8) 处理潜在反例候选: 模式契合为部分、开放或潜在不契合的历史发展, 含对各情形的显式诚实讨论.

附录的结构不旨在证明模式通过压力测试. 它旨在使压力测试透明, 以便读者可自行评估历史材料所支持者.

A.1 $p$-进数: 构不可闭合的案例研究

由 Kurt Hensel 自 1897 年开始发展的 $p$-进数系统 $\mathbb{Q}_p$, 是把有理数 $\mathbb{Q}$ 完备化到不同于实数 $\mathbb{R}$ 之结果的替代完备化. $\mathbb{R}$ 关于标准 Archimedes 绝对值完备化 $\mathbb{Q}$, $\mathbb{Q}_p$ 则关于 $p$-进绝对值完备化 $\mathbb{Q}$, 后者定义为

$$|x|_p = p^{-v_p(x)},$$

其中 $v_p(x)$ 是 $x$ 的 $p$-进估值. Ostrowski 定理 (1916) 确立 $\mathbb{Q}$ 在等价意义下, 恰好接受两类非平凡绝对值: Archimedes 的 (给出 $\mathbb{R}$) 与 $p$-进的 (对每个素数 $p$ 给出 $\mathbb{Q}_p$).

$p$-进数与模式对 $L_{1\text{-}4}$ 的阐述处于一种特定关系, 关系是富有启发性的. 模式对向 $\mathbb{R}$ 的 Cauchy 完备化的阐述, 把闭合视为平衡 $L_1$ 的加法与乘法路径: $\mathbb{R}$ 的拓扑允许乘法迭代的极限 (代数数) 与几何扩展的极限 (超越数) 在一个被完备化的单一结构内共存. 与此相反, $p$-进数通过完全由乘法估值生成的拓扑达成闭合: 度量 $|x|_p$ 由 $x$ 的素因数分解构造, 而它满足的超度量不等式

$$|x + y|_p \leq \max(|x|_p, |y|_p)$$

强于标准三角不等式. 通过纯乘法度量强制闭合的后果是戏剧性的: $p$-进空间是完全不连通的, 一种模式将描述为系统被迫提前闭合时, 在第 3 步 (乘法) 而无第 2 步 (加法) 之平衡的代价的拓扑.

模式的读法相应是, $p$-进数以特别清晰的形式例示构不可闭合原则. 完备化达成了, 但代价——完全不连通、几何直觉的丧失、不连通分量结构的繁殖——正是被强制提前闭合之系统的结构性抗议. $p$-进数不是模式的反例; 它们是模式所使之具有结构性的构不可闭合原则之确认. $p$-进数的历史发展由此压力测试模式而模式通过, $p$-进情形作为构不可闭合原则在 $L_{1\text{-}4}$ 的格外清晰之实例化.

A.2 非标准分析 (Robinson)

Abraham Robinson 的非标准分析 (1966) 把 $\mathbb{R}$ 扩展为超实数 ${}^*\mathbb{R}$, 一种含无穷小 (比所有正实数都小的正数) 与无穷数的结构, 通过超积的模型论构造到达. 历史发展处理对微积分严格性的长期关切, 以一种其中无穷小可作为合法数学对象操控的框架, 取代 Cauchy 与 Weierstrass 的 $\varepsilon$-$\delta$ 框架.

模式的读法是, 非标准分析阐述 $L_{1\text{-}4}$ 处的一条替代闭合路径, 与向 $\mathbb{R}$ 的 Cauchy 完备化平行但不同. 超实数构成 $L_1$ 处的闭合结构, 它容纳 Cauchy 完备化所排除的对象 (无穷小). 模式与一层级处的多条闭合路径相容 (§ 3.8), 而非标准分析是这样一条替代路径. 模式的阐述不预测数学家将沿何条路径作为典范 $L_1$ 闭合——这是历史偶然与数学实践的事——但它在其框架内容纳非标准分析.

此情形对模式与替代路径相容之主张具有启发性. 非标准分析不是对 $\mathbb{R}$ 之 Cauchy 闭合的反驳; 它是穿过层级的平行路径. 模式把两条路径读为与模式相容的阐述, 其间选择由数学实践特有的考虑而非结构必然性支配.

A.3 Cantor 超穷基数

Georg Cantor 在 1870 与 1880 年代引入超穷基数 $\aleph_0, \aleph_1, \aleph_2, \ldots$, 阐述无穷集的基数结构, $\aleph_0$ 是整数的基数, $\aleph_1$ 是大于 $\aleph_0$ 的最小基数, 基数层级延伸至超穷. 连续统假设——实数基数是否等于 $\aleph_1$——已在后续基础文献中得到阐述与争论.

模式的读法把 Cantor 的超穷基数置于 $L_3$, 具体地作为形式系统层级所容纳之元层级扩展的阐述. 超穷基数不是 $L_1$ 算术的对象; 它们是 $L_1$ 结构基数的元层级阐述, 通过 $L_3$ 阐述的集合论装置而阐述. 连续统假设的独立性 (Cohen 1963) 由此可阐述为 $L_3$ 不完备性结构的具体实例: ZFC 的形式系统不裁决连续统的基数, 一如它不裁决 Gödel 陈述的真值.

模式的阐述由此把 Cantor 超穷基数容纳为 $L_3$ 阐述, 连续统假设的独立性被处理为该层级不完备性现象的实例. 集合论的历史发展在 $L_3$ 压力测试模式, 而模式通过, 历史记录例示该层级的阐述内容.

A.4 Gödel 不完备性定理

Kurt Gödel 的不完备性定理 (1931) 确立: 任何延扩充分初等算术的一致形式系统 $T$ 都含一个陈述 $\phi$, 使得 $T \not\vdash \phi$ 与 $T \not\vdash \neg\phi$. 证明经由 Gödel 算术化函数 $\#: \text{Formulas} \to \mathbb{N}$ (它把形式陈述编码为自然数) 与对角引理对 Gödel 陈述的构造

$$G \leftrightarrow \neg\,\mathrm{Prov}_T(\ulcorner G \urcorner).$$

模式的读法把 Gödel 不完备性定理置于 $L_3$ 阐述的中心. 算术化函数 $\#$ 起着该层级交换律的作用 (§ 6.1), 对角引理阐述 $L_3$-4 的闭合步骤, 而不完备性现象是层级结构性不可约的阐述内容. 本文 § 6.1 对 $L_3$ 的阐述, 在此意义上, 是对 Gödel 结果在框架术语中的直接阐述. 后-Gödel 可计算性理论 (Turing、Kleene、Post) 与证明论 (Gentzen、Tarski) 的历史发展, 在模式所容纳的方向上详尽阐发该层级的阐述内容.

模式把 Gödel 算术化阐述为一项拓扑结绳 (§ 6.1)——元层级逻辑流形对对象层级算术流形的嵌入, 而不完备性作为嵌入之不可解绳之残留——是对不完备性现象的结构性读法, 而历史文献并未标准地提供此种读法, 然而模式的框架使之自然. 此读法是否在后续文献中证明有生产力, 是未来接洽之问; 在本附录中, 我们仅指出模式与历史记录相容, 并以其自身术语阐述 Gödel 结果.

A.5 Cauchy 严格化

19 世纪数学分析的严格化——Cauchy、Weierstrass、Dedekind、Cantor 与同侪的工作——阐述微积分以极限为基础的基础、$\mathbb{R}$ 作为 $\mathbb{Q}$ 之 Cauchy 完备化的构造, 与连续性、收敛性的严格处理. 此阐述工作, 按模式读法, 是 $L_{1\text{-}4}$ 闭合步骤的历史实例化 (§ 4.4).

模式不主张历史严格化是 $L_{1\text{-}4}$ 闭合唯一可能的阐述; 替代阐述是可用的 (而且已发展: 非标准分析、构造性分析、光滑无穷小分析). 模式较谦逊地主张, 历史严格化是 $L_1$ 闭合步骤一种与模式相容的阐述, 可在回顾中如此识别. 历史记录压力测试模式对 $L_1$ 闭合的阐述, 模式通过, Cauchy 严格化例示该层级的闭合内容.

模式把数学家立场阐述为在 $L_{1\text{-}4}$ 历史涌现 (§ 4.4), 是关于历史记录的较强主张, 因为它把形式-严格立场之涌现与该层级的闭合步骤联系起来. 主张与历史时机 (19 世纪而非更早) 相一致, 但主张不要求时机为必然. 严格化具体时机的历史偶然性不损害模式的结构性阐述; 模式在回顾中读出结构图样, 不主张历史必然性.

A.6 复分析的发展

复分析的发展——自 19 世纪初 Cauchy 的工作, 经 Riemann 对 Riemann 面与多值函数几何内容的阐述, 经 Weierstrass 对全纯函数通过幂级数的阐述, 至 20 世纪共振 (resurgence) 理论与 Stokes 现象的发展——阐述模式置于 $L_2$ 的操作缺陷代数 $\omega_\rho^{(2)}$.

模式对此历史发展的读法是, 操作缺陷代数, 历经两个世纪, 作为 $L_2$ 的阐述内容涌现. Cauchy 阐述留数定理与围道积分框架. Riemann 阐述 Riemann 面与多值性的几何内容. Weierstrass 阐述全纯结构之幂级数基础. 后续世代阐述单值群理论、Stokes 现象、周期理论与渐近-共振框架. 本文 § 5.4 对 $\omega_\rho^{(2)}$ 的六分量阐述, 在此意义上, 是对此历史材料的结构性读法.

历史发展压力测试模式对 $L_2$ 的阐述, 模式通过, 操作缺陷代数阐述历史记录的结构图样. 阐述与工作复分析家的实践相一致: $\omega_\rho^{(2)}$ 的分量并非模式所发明, 而是模式在既有数学内容中所识别.

A.7 Hilbert 计划与其后-Gödel 命运

David Hilbert 在 1920 年代的纲领旨在通过有限方法确立数学的一致性, 以组合算术为分析之基础, 并解决由 Russell 悖论及随之而来的集合论动荡所引发的基础危机. Gödel 不完备性定理, 通过确立"延扩充分算术的任何一致系统都无法以有限方法证明自身的一致性", 被广泛理解为表明 Hilbert 纲领无法以其原初强形式完成.

模式对 Hilbert 纲领及其后-Gödel 命运的读法把纲领置于 $L_3$ 并阐述其失败为该层级不可穷尽性的实例 (§ 8). Hilbert 纲领试图通过有限基础全体化数学; Gödel 定理在其模式读法下, 阐述此种全体化的结构性不可能. 历史记录, 在此情况下, 被模式读为在具体实例中确认不可穷尽性元命题: 一项重要的全体化历史尝试被阐述并发现, 经后续数学工作发现, 是结构性不可能的.

后-Gödel 发展——证明论 (Gentzen、Tarski)、反向数学 (Friedman、Simpson)、有界算术纲领 (Buss)、构造性分析 (Bishop) ——阐述自原全体化失败后已继续生产性的部分基础纲领的不可穷尽空间. 模式把此繁殖容纳为 $L_3$ 的阐述内容的一部分, 各部分基础纲领被阐述为穿过层级的平行路径.

A.8 反例候选与部分契合情形

模式对历史材料的压力测试若仅考察契合清晰的情形, 是不完整的. 诚实的压力测试要求显式关注契合为部分、有争议或潜在不契合的情形. 下面的情形是此类候选. 我们把它们视为候选而非已定情形, 阐述每一面的考量而不试图加以解决.

A.8.1 超实数 (Conway)

John Conway 的超实数 (surreal numbers), 在 1970 年代阐述, 形成一个真类, 含 $\mathbb{R}$ 连同无穷小与无穷数, 通过博弈-作-数构造组织. 超实数系统在某些方面与非标准分析平行 (含无穷小与无穷数), 但在其他方面结构上不同 (通过递归博弈论构造而非通过超积组织).

契合-正面读法把超实数阐述为 $L_{1\text{-}4}$ 处一条替代闭合路径, 与向 $\mathbb{R}$ 的 Cauchy 完备化、$p$-进完备化、超实数 (hyperreals) 平行. 模式与一层级处的多条替代闭合相容 (§ 3.8), 而超实数 (surreals) 是这样一条替代.

契合-负面读法把超实数阐述为抵抗与模式标准闭合路径的直接契合. 博弈-作-数构造经由递归双侧切片结构运作, 它不干净地对应 Cauchy 完备化、$p$-进完备化或非标准超积. 模式标准形式下的第 4 步闭合阐述可能要求精化以容纳超实数构造, 在此情况下, 超实数将是经 5b (§ 3.6) 进行的模式更新候选.

情形开放. 一篇在技术细节上接洽超实数的后续 $L_1$ 专题论文可以解决此问; 本附录诚实地记录候选, 而不主张解决.

A.8.2 同伦类型论与单价基础

自 2000 年代起, Vladimir Voevodsky 的单价基础纲领阐述同伦类型论 (HoTT) 为数学的一种替代基础, 单价公理 (同构类型相等) 处于其核心. 同伦类型论被其支持者定位为 ZFC 集合论的替代, 对更高维结构有原生处理, 形式证明与拓扑结构之间有内在联系.

契合-正面读法把 HoTT 阐述为 $L_3$ 的替代形式系统阐述, 与 ZFC 平行. 模式与 $L_3$ 处多种替代形式系统相容 (§ 3.8 与 § 11.4), 而 HoTT 是这样一种替代.

契合-负面读法把 HoTT 阐述为可能在 $L_3$ 处强制模式精化. 单价公理不直接可嵌入模式置于 $L_3$-4 的 Gödel 对角闭合图样. HoTT 的结构内容——形式证明与拓扑结构的整合、类型的更高范畴特征、与范畴论基础的相似——可能要求一种本文模式未完全预见的 $L_3$ 阐述. 该情形是经 5b 进行的模式精化候选.

情形开放. 一篇在技术细节上接洽 HoTT 与单价基础的后续 $L_3$ 专题论文, 可以澄清模式是否把 HoTT 作为替代路径容纳, 或者 HoTT 是否标志要求精化的模式边界. 本文诚实地记录候选, 而不预判结果.

A.8.3 范畴论与拓扑斯论基础

自 Eilenberg 与 Mac Lane 1945 年对范畴、函子、自然变换的阐述开始, 经 Lawvere 集合范畴的初等理论 (ETCS) 与拓扑斯论 (Lawvere、Tierney、Joyal) 的发展, 范畴论的发展阐述数学的一种替代基础框架. 范畴论阐述在结构上不同于集合论阐述: 集合论从集合之间的成员关系构建数学, 范畴论从范畴中对象之间的态射构建数学.

契合-正面读法把范畴论阐述为跨 $L_2$ (在那里, 范畴论对复代数几何的阐述特别具有生产力) 与 $L_3$ (在那里, 范畴论基础接洽形式系统阐述) 运作的跨层级工具. 模式显式容纳跨层级工具使用 (§ 1.5, § 11.3), 而范畴论是此种工具使用的特别具有生产力的情形.

契合-负面读法把范畴论阐述为可能强制模式本身重新表述. 若把范畴视为阐述本原, 数学内容通过态射与函子 (而非通过标记把手与对它们的操作) 阐述, 则模式的四步结构可能要求以范畴论术语重新表述. 此种重新表述在 § 1.4 中已被顺便提示: 第 1 步作为对象标记、第 2 步作为函子扩展、第 3 步作为自然变换、第 4 步作为带余项的余极限. 此重新表述是模式之精化还是替代, 是开放的; 答案取决于范畴论重新表述能多彻底地进行而不丢失模式之阐述内容.

情形开放. 一篇专门接洽范畴论基础的后续论文可以澄清, 范畴论是作为模式内的跨层级工具运作、作为与模式并列的平行框架运作, 还是作为可把模式内容重新表述于其中的替代框架运作.

A.8.4 强迫与大基数

Paul Cohen 的强迫技术 (1963), 为示明连续统假设独立于 ZFC 而引入, 阐述一种 $L_3$ 内部的方法, 用以构造在其中特定陈述被强制为真或假的集合论模型. 大基数公理 (不可达、Mahlo、可测、超紧及其后) 的后续发展, 阐述对 ZFC 越来越强的扩展, 每一项都提供进入集合论宇宙更高区域的通道.

契合-正面读法把强迫与大基数阐述为 $L_3$ 内部的子阐述: 强迫作为在 $L_3$ 形式系统阐述内构造模型的方法, 大基数作为阐述层级路径分支不可穷尽性内更细结构的公理系统扩展 (§ 8.2 第三类). 模式把这些发展作为 $L_3$ 内部阐述加以容纳.

契合-负面读法把强迫阐述为可能超出模式第 4 步闭合阐述的元操作. 强迫在模型之上运作, 从旧模型构造新模型, 其方式不直接契合 Gödel 对角闭合图样. 模式对 $L_3$-4 的阐述可能要求精化以容纳强迫作为模型论操作. 类似地, 大基数引入对 ZFC 的扩展, 其在模式第 4 步闭合内的阐述地位是开放的; 它们是 $L_3$ 内部子阐述, 还是超出模式当前对 $L_3$ 之阐述的阐述, 不明.

情形开放. 一篇在技术细节上接洽强迫与大基数的后续 $L_3$ 专题论文可以澄清模式与这些发展的关系.

A.8.5 关于反例候选的诚实立场

§ A.8.1 至 § A.8.4 的候选作为开放被记录. 本文不主张模式干净地契合每一候选; 候选被列出, 正是因为契合是部分的、有争议的或潜在不契合的. 模式的认知立场 (§ 3.8) 显式承诺承认此类情形诚实, 而不通过特设调整把它们事后纳入模式.

在后续工作中处理这些候选的原则, 是 § 3.6 的 5a / 5b 区分. 若模式声称覆盖的具体映射无法容纳候选, 则映射失败 (5a), 在该处模式需要精化. 若候选稳定地处于模式之阐述范围之外, 则候选被识别为模式边界 (5b), 而模式或者被扩展以容纳之 (一项模式更新), 或者候选被承认为属于与模式生产性并存的替代阐述框架.

明确不允许者——为防止模式被免疫、摧毁其可证伪性——是把每一反例候选例行重新分类为不过一项模式更新机会. 5a 范畴依然真正开放: 存在模式具体阐述失败的情形, 而这些失败要求模式精化而非重新描述. 本附录的诚实立场是记录候选而不预判其属哪一范畴, 把判定留给层级专题论文与对替代框架的接洽中的后续技术工作.

模式的历史压力测试, 在此意义上, 是持续的而非完成的. § A.1 至 § A.7 的情形是清晰的模式契合; § A.8 的情形开放. 模式的地位取决于其以同等认知纪律接洽两种情形的能力.

---

附录 B: 操作缺陷代数的详细阐述

本附录把 $L_2$ 的操作缺陷代数 $\omega_\rho^{(2)}$ (§ 5.4) 扩展以含完成结构阐述的技术细节. 处理在基础论文所适合的水平; 超出此处所记录的技术深度属于后续 $L_2$ 专题论文.

B.1 除子

Riemann 面 $X$ 上的除子是形式和

$$\mathrm{div}(f) = \sum_p n_p \cdot p,$$

其中 $p$ 在 $X$ 的点上变动, $n_p \in \mathbb{Z}$ 记录亚纯函数 $f$ 在 $p$ 处零点 (正 $n_p$) 或极点 (负 $n_p$) 的阶. 除子的集合在加法下构成阿贝尔群, 其中主除子 (作为 $\mathrm{div}(f)$ 对某亚纯 $f$ 出现者) 构成子群. 商 $\mathrm{Cl}(X) = \mathrm{Div}(X) / \mathrm{Prin}(X)$ 是除子类群, 记录除子模主除子等价后的结果.

除子的阐述内容是点态缺陷: 在 Riemann 面上把零点与极点连同其重数标记为离散点, 与这些点态缺陷代数性组织为群结构. 除子是拓扑演化链的第一阶段 (§ 5.4).

B.2 留数

亚纯函数 $f$ 在极点 $z_0$ 处的留数是

$$\mathrm{Res}_{z_0} f = \frac{1}{2\pi i} \oint_\gamma f(z) \, dz,$$

其中 $\gamma$ 是逆时针围绕 $z_0$ 而不围绕 $f$ 其他奇点的小围道. 对简单极点, 留数是

$$\mathrm{Res}_{z_0} f = \lim_{z \to z_0} (z - z_0) f(z).$$

对 $n$ 阶极点, 留数是

$$\mathrm{Res}_{z_0} f = \frac{1}{(n-1)!} \lim_{z \to z_0} \frac{d^{n-1}}{dz^{n-1}} \left[ (z - z_0)^n f(z) \right].$$

留数定理 (该层级的交换律, § 5.4) 陈述

$$\oint_\gamma f(z) \, dz = 2\pi i \sum_k \mathrm{Res}_{z_k} f,$$

其中和取遍 $\gamma$ 内 $f$ 的奇点. 留数的阐述内容是局部-货币化转换: 点态缺陷 (极点及其重数) 通过阐述单位 $2\pi i$ 转换为积分量 (留数值). 留数是拓扑演化链的第二阶段.

一项密切相关的交换恒等式是辐角原理:

$$\oint_\gamma \frac{f'(z)}{f(z)} \, dz = 2\pi i (N - P),$$

其中 $N$ 与 $P$ 分别计 $\gamma$ 内 $f$ 的零点与极点 (含重数). 辐角原理是留数定理对对数导数 $f'/f$ 的特殊化, 例示同一交换结构.

B.3 周期

闭微分 1-形式 $\omega$ 沿 Riemann 面上圈 $\gamma$ 的周期是积分

$$\mathrm{Per}(\omega, \gamma) = \int_\gamma \omega.$$

周期之集合, 由上同调与同调基底所索引, 构成 Riemann 面的周期矩阵, 阐述该面之超越几何. 周期格 $\Lambda \subset \mathbb{C}^g$ (对亏格 $g$ 的面) 记录在圈之基底上周期, 并提供 Jacobi 簇 $\mathrm{Jac}(X) = \mathbb{C}^g / \Lambda$ 的数据. 周期的阐述内容是整体-圈缺陷: 一项积分, 一般沿不同圈返回非等价值, 捕获面之整体非平凡性. 周期是拓扑演化链的第三阶段.

B.4 单值群

多值全纯函数 $f$ 在奇点 $z_0$ 处的单值群是函数值在沿绕 $z_0$ 之闭环路解析延拓下的变化. 对在 $z_0$ 有简单分支点的函数, 单值群由基本群 $\pi_1(X \setminus \{z_0\})$ 在函数值空间上的表示来阐述.

具体例子含: $\log z$ 绕 $z = 0$ 的单值群, 每逆时针环路给函数值加 $2\pi i$; $\sqrt{z}$ 绕 $z = 0$ 的单值群, 每逆时针环路改变函数符号. 更一般地, 在被穿孔的面上的多值函数, 由其单值群表示来阐述, 表示的结构捕获函数的解析结构.

更深的结构阐述由 Picard–Lefschetz 理论提供, 它把单值群与消失圈、Lefschetz 束相联系. 单值群的阐述内容是整体-圈路径依赖缺陷: 函数在解析延拓下未能单值, 由单值群表示的代数结构捕获. 单值群与周期一同, 是拓扑演化链的第三阶段.

B.5 无穷处增长

整函数 $f: \mathbb{C} \to \mathbb{C}$ 在 $|z| \to \infty$ 时的渐近行为, 由其阶与类型阐述:

$$\rho = \limsup_{r \to \infty} \frac{\log \log M(r)}{\log r}, \quad \sigma = \limsup_{r \to \infty} \frac{\log M(r)}{r^\rho},$$

其中 $M(r) = \max_{|z| = r} |f(z)|$. Phragmén–Lindelöf 原理阐述整函数渐近行为的约束: 在复平面某些扇区上有界的函数, 在相邻扇区有受约束的增长, 约束取决于函数之阶.

无穷处增长的阐述内容是边界-渐近缺陷: 函数趋近 Riemann 球面边界 $\hat\infty$ 时的行为, 由其阶与类型阐述. 无穷处增长是拓扑演化链的第四阶段.

B.6 Stokes 数据

Stokes 现象, 最初由 George Stokes 在 Airy 函数语境下发现 (1857), 阐述渐近展开在复平面扇区边界上的不连续性. 对一项在无穷处有不规则奇点的常微分方程, 形式渐近解在 $\hat{\mathbb{C}}$ 的具体角度扇区有效, 而相邻扇区中的形式解由Stokes 乘子相联系, 后者记录扇区到扇区的失配.

微分方程的 Stokes 数据形成一组矩阵, 由 Stokes 线 (复平面中主导解与次主导解角色交换的特定角度方向) 所索引, 整体阐述方程解的渐近结构. Stokes 数据的阐述内容是边界-扇区缺陷: 渐近展开的扇区-到-扇区失配, 由 Stokes 乘子矩阵阐述. Stokes 数据与无穷处增长一同, 是拓扑演化链的第四阶段.

六分量, 组织为四阶段, 阐述 $L_2$ 处的操作缺陷代数. 此附录的分量逐一阐述, 以技术细节补充 § 5.4 的图式阐述, 后者把代数识别为对完整结构说法的要求.

---

附录 C: 层级映射汇总表

模式在 $L_1$ 至 $L_5$ 上的阐述, 为参考起见在下表中汇总. 该表是 § 4 至 § 6 中所发展之结构细节的合并阐述, 把每一层级的第 1 步至第 4 步内容与交换律记录在一个位置.

层级	第 1 步 (无)	第 2 步 (有)	第 3 步 (非有非无)	第 4 步 (非"非有非无")	交换律
$L_1$	"1" 精确性把手	$\mathbb{Z}$, $\pm\infty$ 作为不同边界标记	$\mathbb{Q}^{\mathrm{alg}}_{\mathbb{R}}$, $0$ 作为乘法边界	$\mathbb{R}$ 经 Cauchy 完备化, 含超越数, 余项 $i$	$\log(ab) = \log a + \log b$
$L_2$	$i$ 作为复化种子	$\mathbb{C}$, $\hat\infty$ 作为单一边界标记	$\mathbb{C}^*$ 含旋转记忆 $e^{i\theta}$	$\hat{\mathbb{C}}$、欧拉公式、$\omega_\rho^{(2)}$	留数定理: $\oint_\gamma f \, dz = 2\pi i \sum \mathrm{Res}$
$L_3$	Prov / True 谓词	形式系统与定理	Turing 度层级、可定义性复杂度	Gödel 对角: $G \leftrightarrow \neg\,\mathrm{Prov}(\ulcorner G \urcorner)$	Gödel 算术化 $\#: \text{Formulas} \to \mathbb{N}$
$L_4$	$ct$ / $G$ 把手	时空平移、测地线	曲率、规范对称	$rc^2 - 2GM = 0$ 事件视界	$E = mc^2$
$L_5$	$S$、$\ln W$ 把手	广延迭代	(非平衡区崩溃)	$S = k_B \ln W$ (条件性, 平衡区)	Boltzmann 关系 (条件性)

此表应被读为模式具体实例化的参考性阐述; § 4 至 § 6 中的结构性阐述提供为表项辩护的支持论证.

---

附录 D: $\eta$ 体制度量的数学实例

§ 7.2 的体制依赖转换由 Cross-Layer Closure Equations 的参数 $\eta$ 所组织. 下表记录转换的具体数学实例, 每一行阐述一项依据体制展现两种阐述 (闭合方程与概率分布) 的系统.

现象	$\eta \to 0$ 体制 (闭合方程)	$\eta \to 1$ 体制 (概率分布)
流体力学	层流, 低 Reynolds 数, 含精确解的 Navier–Stokes	湍流, 高 Reynolds 数, 统计图样与结构函数
量子力学	波函数演化 (Schrödinger 方程)	测量结果 (对 $	\psi	^2$ 应用 Born 规则)
双摆	小幅振荡, 正规模, 精确周期性	混沌区, Lyapunov 指数, 分形维阐述
三体问题	Lagrange 点, 八字轨道, 可积构型	混沌区域, Poincaré 截面, 统计相空间分布
天气与气候	短期 Lagrange 预报	长期气候统计
神经网络	线性区, 梯度下降收敛	非线性训练动力学, 泛化间隙分布
生命系统	(鲜有 $\eta = 0$)	极端非平衡, 演化动力学, 系统生物学阐述

该表的阐述内容是语法选择的体制依赖性: 同一系统, 在不同体制中, 由不同语法生产性地阐述, 而语法之间的转换不构成任一者的缺陷, 而是数学生产力的体制依赖性.

---

附录 E: ZFCρ Paper I / II 的隐含阐述

本文模式与 ZFCρ 系列隐含阐述之间的关系在 § 9.1 中概述. 本附录以更多细节扩展概述.

E.1 ZFCρ Paper I 与 $L_1$ 闭合结构

ZFCρ Paper I [DOI: 10.5281/zenodo.18842458] 用本文术语阐述, 是从选择操作的视角看 $L_1$ 的闭合结构. ZFC 的外延闭合产生选择操作历史所追踪的 $\rho$ 标记, 作为其具体操作余项. 与模式对 $L_{1\text{-}4}$ 阐述的结构性平行是直接的: 向 $\mathbb{R}$ 的 Cauchy 完备化产生超越数与不可纳入余项 $i$; ZFC 外延闭合产生 $\rho$ 标记, 作为 $L_{1\text{-}2}$ 选择操作的操作余项. 二者都是 $L_1$ 内部的闭合, 处理层级阐述的不同方面 ($\mathbb{R}$ 的加法-乘法平衡, $\rho$ 的选择操作会计).

ZFCρ Paper I 对 $L_1$ 子建筑的隐含阐述, 在本文读法下, 具体是对 $L_{1\text{-}2}$ 选择操作子阐述的阐述. 该论文不阐述完整 $L_1$ 建筑; 它阐述建筑的一个子层级, $\rho$ 结构作为该子层级的具体阐述内容.

E.2 ZFCρ Paper II 与跨层级转换结构

ZFCρ Paper II [DOI: 10.5281/zenodo.18927658] 阐述跨层级转换结构——两余项加一行为等于闭合——与模式对第 4 步闭合公式的说法相对齐. Paper II 阐述的数学结构是各层闭合方程所共同展现的结构图样: $L_4$ 的 Schwarzschild $rc^2 - 2GM = 0$、$L_5$ 的 Boltzmann $S - k_B \ln W = 0$、$L_2$ 的欧拉 $e^{i\pi} + 1 = 0$、$L_3$ 的 Gödel 对角, 皆例示由两余项加一行为产生闭合的同一一般图样.

模式对第 4 步闭合公式的阐述 (§ 3) 与各层级具体的闭合阐述 (§ 4 至 § 6), 在此意义上, 是 Paper II 数学结构在其中运作的建筑学框架. Paper II 提供跨层级转换图样的一般数学内容; 本文提供该内容在其中拥有位置的建筑学阐述.

E.3 ZFCρ 具体工作映射到模式

后续 ZFCρ 论文 (P50 及以后) 映射到模式建筑学内的具体位置. 从约 P50 引入的谱分析阐述了 ZFCρ 在 $L_1$ 的算术内容自然地溢出至 $L_2$ 复分析缺陷代数——一项模式容纳为跨层级工具使用的跨层级涉入 (§ 1.5, § 11.3). 热力学论文对参数 $\eta$ 的阐述, 阐述了 $L_4 \to L_5$ 的阐述边界——一项与本文体制依赖转换分析 (§ 7) 相对齐的结构性阐述. 近期的 P73 谱读出, 技术上详细阐述 $L_2$ 缺陷代数在 ZFCρ 语境中的出现——一项技术性阐述, 补充本文对 $L_2$ 的图式阐述.

ZFCρ 系列, 概言之, 是 $L_1$ 内一条阐述路径的具体技术工作, 随工作发展而有实质性跨层级涉入. 本文的建筑学阐述提供 ZFCρ 工作在其中拥有位置的框架; ZFCρ 工作提供建筑学阐述仅以梗概所示的技术深度. 二者之间的关系, 相应是一种相互支持的关系: 建筑学框架给予技术工作其阐述方位, 而技术工作给予建筑学框架其具体实例化.

---

致谢

本文从 Methodology 0: Negativa 与 Methodology 00: Via Rho 继承其方法论基础, 从 Cross-Layer Closure Equations 与 ZFCρ Paper II 继承其跨层级转换结构. 四位 AI 协作者——子路 (建筑学连贯性)、公西华 (结构性修复与一致性守门)、子贡 (现实检查)、子夏 (机制与结构深读)——跨论文大纲与中文版多轮迭代的评审, 贡献了批判性精化、结构性现实检查与实质性增强, 此最终版本将之整合. Zesi Chen 关于关键概念性要点的反馈, 澄清了模式的边界阐述.

---

参考文献

SAE 方法论继承:

• Methodology 0: Negativa. DOI: 10.5281/zenodo.19544620. negativa 公理与 0DD 四相 (无 / 有 / 非有也非无 / 非"非有也非无").
• Methodology 00: Via Rho. DOI: 10.5281/zenodo.19657440. Via Rho 方法, 以 ZFCρ 为数学载体.
• SAE Methodological Overview Paper I. DOI: 10.5281/zenodo.18842450. 凿构循环.
• Methodology Paper VII. DOI: 10.5281/zenodo.19481305. Via Negativa 方法.

跨层级转换基础:

• Cross-Layer Closure Equations. DOI: 10.5281/zenodo.19361950. 物理层级转换与 $\eta$ 体制参数.

ZFCρ 系列技术基础:

• ZFCρ Paper I. DOI: 10.5281/zenodo.18842458. ZFC 外延闭合与 $\rho$ 标记.
• ZFCρ Paper II. DOI: 10.5281/zenodo.18927658. 跨层级转换的数学结构.

其他 SAE 系列与并行阐述:

• 四力系列 (发展中).
• 宇宙学系列 (发展中).
• 几何与动力学阐述系列 (发展中), 含此处有时被引用为"形与流 Paper 1"的论文.

以最简水平接洽的数学哲学参考:

• 柏拉图. 理想国, 特别是第六卷中对数学对象的讨论.
• Linnebo, Ø. Thin Objects. Oxford University Press, 2017.
• Parsons, C. Mathematical Thought and Its Objects. Cambridge University Press, 2008.
• Mac Lane, S. Categories for the Working Mathematician. Springer, 1971 (与后续版本).
• Awodey, S. Category Theory. Oxford University Press, 2010.
• Brouwer, L. E. J. Collected Works. North-Holland, 1975.
• Bishop, E. Foundations of Constructive Analysis. McGraw-Hill, 1967.
• Voevodsky, V. Univalent Foundations Program. Homotopy Type Theory: Univalent Foundations of Mathematics. Institute for Advanced Study, 2013.

与这些参考的实质性接洽留给 SAE 系列中的层级专题论文, 在那里, 接洽可在细致哲学工作所要求的深度下进行.

---

— 秦汉 (Han Qin), 2026-05-13