The First Actuality: Why Absolute Undefinedness Necessarily Co-Arises with PR

Jia Baolong · 2026-07-29 · GitHub Markdown 原文 · Zenodo record · DOI

A Logical and Mathematical Proof Beyond Nothing, Time, and Probabilistic Choice

Jia, Baolong
Independent Researcher
Version 1.0 — July 2026

Abstract

This paper asks a deliberately pre-physical question: if inquiry selects actual first occurrence as its target while admitting no prior actual event, material substrate, physical time, probability space, external executor, or positive determination, what is the minimal form of actuality at the absolute-undefinedness boundary?

Here PR abbreviates Paradoxical Re-entry (formerly paradoxical self-reference), specifically the minimal negative self-revision normal form defined in Section 3. It does not mean a pre-existing physical process.

The argument distinguishes ordinary nothing from absolute undefinedness. Ordinary nothing negates a prior determination stock while exempting the present description; it therefore admits a stable valuation. Absolute undefinedness is stronger: it is not an empty object, an empty domain, a truth value, or a determinate state called “nothing.” A faithful ontic presentation of it cannot exempt its own occurring presentation, because no external actual medium is available at the root. This yields a retrospective status conflict between enacted determination $$A$$ and its absence $$N$$ . The direction of revision is not assumed here; it is classified by the finite theorem below.

The strict finite theorem is elementary but exact. Let a root process admit a retrospective quotient $D=\{A,N\}$ , where $$A$$ records enacted determination and $$N$$ records its absence. If every full configuration has an autonomous successor and every successor changes its quotient status, then the quotient dynamics is automatically well-defined and only one map is possible:

\sigma(A)=N,\qquad \sigma(N)=A.

It is fixed-point-free, involutive, and has a single period-two orbit up to phase. This is the minimal PR normal form. No exchange law is inserted among the premises.

The theorem does not claim that undefinedness causes actuality, that a formula executes itself, that every logic must use revision semantics, or that PR alone generates chaos, matter, life, or our observable universe. Its necessity is indexed to a visible model class: actual, rooted, self-contained, non-self-exempting, minimally quotiented, continuing, and non-fixating first occurrence. Within that class, PR is not selected after undefinedness in time or probability. It is the normal form of the actual face of the absolute-undefinedness boundary.

Keywords: absolute undefinedness; first actuality; PR; negative self-reference; fixed point; revision semantics; primordial actualization; foundational ontology

Proof-status statement

This paper contains three different kinds of claims.

Constitutive scope and model conditions. These specify the origin question being studied. They are not presented as neutral theorems of pure logic.
Derived mathematical results. The no-bivalent-fixed-point result and the finite exchange theorem follow from explicitly listed premises.
Ontological interpretation. The phrase “first actuality” applies the finite normal form to the selected root model. It is not an empirical identification of our observable universe.

The central result is therefore:

\boxed{ \mathcal C_{\mathrm{S0\text{--}S7}} \models \operatorname{ActualFace}(U_*)\cong (D,\sigma) \cong \mathrm{PR} }

It is not:

U_*\vdash\mathrm{PR}, \qquad U_*\to\mathrm{PR}, \qquad P(\mathrm{PR}\mid U_*).

The first expression wrongly treats $$U_*$$ as a proposition; the second treats it as a cause or earlier state; the third presupposes a probability space. Here $\mathcal C_{\mathrm{S0\text{--}S7}}$ is the explicitly defined class of root-actualization models below. “Necessarily” means truth in every member of that class. It does not mean derivability from an object called $$U_*$$ in an otherwise premise-free calculus.

1. The corrected origin question

The question is not “What object existed first?” Any proposed atom, number, set, law, graph, field, bit, or material already imports a positive determination. Nor is the question “Which member of a pre-existing possibility space was selected?” That imports a space of alternatives and a selection mechanism.

The selected question is:

What is the minimal normal form of actual first occurrence when no prior actuality or positive root structure is admitted?

This question contains a scope selection. It investigates actual occurrence. A static formula, complete trajectory, or member of an abstract space may describe an evolution without enacting it:

\operatorname{Encodes}(S,H) \not\Rightarrow \operatorname{Occurs}(H).

Accordingly, static availability alone is not a counterexample to a theory of actual first occurrence.

The word “first” is also corrected. Before an actual temporal order exists, firstness cannot mean the least value of an already actual time coordinate. It means minimality in a dependency order:

x\prec y \quad\Longleftrightarrow\quad y\text{ constitutively presupposes }x.

The root has no prior actual predecessor under $\prec$ .

2. Ordinary nothing and absolute undefinedness

2.1 Ordinary nothing

Let $\Phi_0$ be the stock of prior determinate sentences. At the root:

\Phi_0=\varnothing.

An ordinary-nothing sentence $$n$$ may be specified by:

n\;\Longleftrightarrow\; \bigwedge_{\varphi\in\Phi_0}\neg\varphi.

Using the standard empty-conjunction convention:

\bigwedge_{\varphi\in\varnothing}\neg\varphi=\top,

we obtain:

n\Longleftrightarrow\top.

Thus ordinary nothing is stably describable. The present description $$n$$ is not itself included in the range it negates. Its structure is:

\text{no prior determination} + \text{one present external determination describing that absence}.

This is a meaningful and stable notion of nothing, but it is not absolute undefinedness.

2.2 Absolute undefinedness

Write:

\[ U_* \]

only as a metalanguage boundary marker. It is not:

the empty set;
an empty first-order domain;
falsity;
a bottom element;
a categorical initial object;
a state whose property is “having no properties”;
a substance that produces something else.

To place $$U_*$$ inside an object domain would already determine it. Even the categorical initial object $$0$$ has an identity arrow and a universal property; it is therefore too structured:

U_*\neq 0_{\mathcal C}.

The paper does not reason from $$U_*$$ as a premise. It reasons about the conditions under which an actual root occurrence could faithfully present the absolute absence of object-level determination without an external actual medium.

3. Primitives and type discipline

Let $$a$$ denote a candidate first actual occurrence.

Definition 1 — Actual occurrence

\operatorname{Act}(a)

means that $$a$$ belongs to the selected actual side. This is primitive in the model; it is not reduced to membership in a static graph or set of encoded events.

Definition 2 — Enacted determination

\operatorname{Det}(a)

means that the occurrence enacts a distinguishable determination. A purported occurrence with no possible difference between occurrence and non-occurrence does not fall within the selected actual domain:

\neg\operatorname{Diff}\bigl(\operatorname{Act}(a), \neg\operatorname{Act}(a)\bigr) \Longrightarrow \neg\operatorname{Act}(a).

This is a constitutive criterion of the selected use of “actual,” not a theorem about every metaphysics.

Definition 3 — Ontic enactment

\operatorname{Enacts}(e,a)

means that actual occurrence $$e$$ is the carrier, evaluator, or act by which $$a$$ is enacted. Both argument places are typed as candidate actual occurrences; this avoids treating a support relation as set membership.

Definition 4 — Self-containment

\operatorname{Enacts}(a,a)

and no prior actual $$e$$ satisfies:

e\prec a\land\operatorname{Enacts}(e,a).

Thus the first act is not executed by an earlier actual carrier. The formula is a constitutive root condition, not a claim that ordinary physical events literally cause themselves.

Definition 5 — Self-exemption

A presentation self-exempts when the presenting act remains a positive determination outside the scope of the non-determination it presents.

Definition 6 — PR normal form

Let:

D=\{A,N\}

be the retrospective quotient of the root conflict into enacted determination $$A$$ and its negation $$N$$ . A PR normal form is a map:

\sigma:D\to D

such that:

\sigma(A)=N,\qquad \sigma(N)=A.

Equivalently:

\operatorname{Fix}(\sigma)=\varnothing, \qquad \sigma^2=\operatorname{id}_D.

The symbols $$A,N$$ are status labels, not prior physical objects or branches.

Definition 7 — Actual-face notation

\operatorname{ActualFace}(U_*)

does not denote a function applied to an object $$U_*$$ . It abbreviates the isomorphism class of the minimal quotient dynamics of an actual root model that satisfies S0--S4 at the absolute-undefinedness boundary.

4. Constitutive conditions S0–S7

S0 — Actual-target selection

The inquiry concerns actual occurrence. Static descriptions do not become actual merely by encoding a history.

S1 — Absolute-undefinedness boundary

$$U_*$$ contributes no positive object-level determination and is not itself an object.

S2 — Rootedness

No prior actual event, substrate, physical time, probability space, or external actual executor is admitted.

S3 — Ontic self-containment

The presenting first act enacts its own root presentation; no earlier actual carrier performs it.

S4 — No self-exemption

A faithful actual presentation of absolute undefinedness cannot exclude its own occurrence from the total absence it presents. Such exclusion would leave:

\text{ordinary nothing} + \text{one positive external marker}.

S5 — Retrospective binary quotient

Let $$X$$ be the nonempty configuration domain used by a root model. Whatever additional internal description the model supplies, its root determination conflict admits a surjective retrospective classification:

q:X\twoheadrightarrow D=\{A,N\},

where $$A$$ records enacted determination and $$N$$ its negation. The quotient is retrospective: it does not assert two already actual alternatives before occurrence. No quotient update law is assumed.

S6 — Continuing actual revision

A permanent truth-value gap, stable glut, or terminating contradictory flash is not counted as continuing actual motion in the selected domain. Reapplication of the same root constraint is represented by a total autonomous operator:

F:X\to X.

S7 — Non-fixation

The root conflict does not stabilize at either quotient pole:

\forall x\in X,\qquad q(F(x))\neq q(x).

S5--S7 are the strongest model restrictions. S5 imposes a classical determination/non-determination status quotient; S6 rules out an external executor and a terminating flash; S7 says that the root conflict itself, not merely hidden detail inside one status, remains non-stabilizing. They make the transition from semantic non-closure to enacted continuation. The paper defends their relevance to the selected actual-motion question, but does not present them as mandatory rules of every logical semantics.

Definition 8 — Root-actualization model class

A root-actualization model is a tuple:

\mathcal M=(a,X,F,q)

together with an interpretation of Definitions 1--5. Let $\mathcal C_{\mathrm{S0\text{--}S7}}$ be the class of such models satisfying S0--S7. S0--S4 fix the ontological interpretation; S5--S7 supply the finite dynamical data used by the mathematical classification. This separation prevents the finite theorem from being mistaken for a premise-free proof of the ontological bridge.

The tuple is a metalanguage representation constructed by the theorist. S2 does not forbid such retrospective mathematics; it forbids $$X$$ , $$F$$ , or $$q$$ from being reified as a previously actual machine that executes the root event. Likewise, $$F$$ represents reapplication of the minimal root constraint. It is not the still-unknown concrete Rule that would generate ER structure, chaos, or physics.

5. Formal derivation

Lemma 1 — Ordinary nothing admits a stable bivalent valuation

For:

n\Longleftrightarrow \bigwedge_{\varphi\in\Phi_0}\neg\varphi \quad\text{and}\quad \Phi_0=\varnothing,

there exists a valuation $$v$$ such that:

\[ v(n)=1. \]

Proof

The right-hand side is the empty conjunction $\top$ . Hence:

v(n)=v(\top)=1.

\square

Lemma 2 — Self-exemption fails absolute scope

If a presenting act $$a$$ is excluded from the absence of determination it presents, the resulting structure contains at least one positive enacted determination, namely $$a$$ . It therefore represents ordinary absence relative to a prior stock, not absolute undefinedness.

Proof

Assume $$a$$ presents “no determination applies,” while the scope of “no determination” excludes $$a$$ . Then:

\operatorname{Act}(a)\land\operatorname{Det}(a)

is retained outside the negative scope. Consequently the total structure is not free of positive enacted determination. This contradicts the stipulated absolute scope in S4. Therefore any faithful ontic presentation in the selected root model is non-self-exempting.

\square

Lemma 3 — The self-inclusive presentation has no stable bivalent model

Let the minimal determination stock at the actual root be:

\Phi_1=\{u\}.

Under non-self-exemption, the circular semantic constraint is:

u\Longleftrightarrow \bigwedge_{\varphi\in\Phi_1}\neg\varphi.

Then no valuation:

v:\Phi_1\to\{0,1\}

satisfies the constraint.

Proof

Since $\Phi_1=\{u\}$ :

u\Longleftrightarrow\neg u.

A satisfying valuation would require:

\[ v(u)=1-v(u). \]

If $$v(u)=0$$ , the right-hand side is $$1$$ . If $$v(u)=1$$ , the right-hand side is $$0$$ . Both possibilities fail. Hence no stable bivalent valuation exists.

\square

This is a no-model result. It does not assert $u\land\neg u$ as a theorem of classical object logic and does not invoke explosion.

Theorem 1 — Finite fixed-point-free exchange theorem

Let:

D=\{A,N\}

and let $f:D\to D$ be total. If:

\operatorname{Fix}(f)=\varnothing,

then:

f(A)=N,\qquad f(N)=A.

Proof

Since $$A$$ is not a fixed point, $f(A)\neq A$ . Totality and $D=\{A,N\}$ force $$f(A)=N$$ . Likewise, since $$N$$ is not a fixed point, $f(N)\neq N$ , and totality forces $$f(N)=A$$ . These two values determine $$f$$ uniquely.

\square

Corollary 1 — Fixed-point-free involution

For the unique total fixed-point-free map:

\operatorname{Fix}(f)=\varnothing

and:

f^2=\operatorname{id}_D.

Therefore every orbit is:

A,N,A,N,\ldots

or its phase shift:

N,A,N,A,\ldots.

There is one period-two orbit up to phase.

Theorem 2 — PR normal-form theorem

Every root model satisfying S5–S7 induces, at the retrospective actuality quotient, the unique PR normal form:

(D,f)\cong(D,\sigma),

where:

\sigma(A)=N,\qquad\sigma(N)=A.

Proof

S5 supplies a surjection $q:X\twoheadrightarrow D$ , and S6 supplies a total map $F:X\to X$ . Define a candidate quotient update by choosing any $x\in q^{-1}(d)$ and setting:

\[ f(d):=q(F(x)). \]

This definition is independent of the chosen representative. Indeed, S7 gives $q(F(x))\neq d$ ; because $$D$$ has exactly two members, $$q(F(x))$$ must be the unique member of $D\setminus\{d\}$ . Thus $$f$$ is well-defined, total, and satisfies $q\circ F=f\circ q$ . It also has no fixed point. Theorem 1 uniquely gives $f=\sigma$ , and Corollary 1 supplies involution and the period-two orbit.

\square

Proposition 1 — Sharpness of the finite assumptions

The mathematical PR conclusion fails if any of the following finite restrictions is removed:

Binary quotient. On $D_3=\{0,1,2\}$ , the total fixed-point-free map $r(i)=i+1\pmod 3$ is a three-cycle, not PR.
Total continuation. The partial map $$p(A)=N$$ , with $$p(N)$$ undefined, is not an involution and represents a terminating update.
Statewise quotient non-fixation. Let $X=\{a_0,a_1,n_0,n_1\}$ , let $$q(a_i)=A$$ , $$q(n_i)=N$$ , and let $$F$$ swap $$a_0,a_1$$ and separately swap $$n_0,n_1$$ . Then $$F$$ is genuine internal motion, but $$q(F(x))=q(x)$$ for every $$x$$ ; the induced quotient map is identity, not PR.

Proof

Each construction is explicit. Direct evaluation verifies the stated properties.

\square

Proposition 1 is important for interpretation: “there is motion” alone does not prove PR. The argument needs the stronger claim that the root determination/non-determination conflict itself remains non-fixing. That claim is S7, and its ontological defense cannot be replaced by the elementary finite theorem.

Theorem 3 — Atemporal co-arising theorem

For every:

\mathcal M\in\mathcal C_{\mathrm{S0\text{--}S7}},

the induced minimal quotient satisfies:

\operatorname{ActualFace}_{\mathcal M}(U_*)\cong\mathrm{PR}.

PR is not a later selection from alternatives but the minimal enacted normal form of the absolute-undefinedness boundary.

Proof

By S1 and S2, $$U_*$$ is neither an earlier state nor an object capable of causing an event. By S3 and Lemma 2, an actual root presentation cannot rely on an external self-exempting marker. By Lemma 3, its self-inclusive bivalent constraint has no stable valuation. S5–S7 state, without presupposing an exchange rule, how that semantic non-closure counts as an autonomous, continuing, non-stabilizing actuality at the minimal quotient. Theorem 2 then uniquely classifies the induced quotient dynamics as PR.

No temporal parameter or probability measure occurs in the derivation. Therefore the relation is structural:

U_*\mid\mathrm{PR},

not temporal, causal, or probabilistic. The vertical bar is a delimiter for two aspects of one root specification; it is not conditional probability, divisibility, or temporal succession.

\square

6. Why this is not merely a sentence about a sentence

A linguistic inscription can remain outside its referent. The word “nothing” is ink, sound, or data even when it describes an empty domain. Consequently, linguistic self-exemption is ordinary and non-paradoxical.

The root problem considered here removes that option. If the first actual occurrence were enacted by an external actual inscription, carrier, evaluator, or executor, that carrier—not the alleged event—would be prior in the actuality order. S2 would be violated. Hence the root presentation is ontic rather than merely descriptive:

\text{presenting act} = \text{first enacted distinction}.

The semantic formula:

u\Longleftrightarrow\neg u

is therefore not proposed as a linguistic cause of the universe. It is a representation of the same fixed-point-free form seen under semantic projection. The paper's bridge claim is structural:

\mathrm{PR}_{\mathrm{semantic}} \cong \mathrm{PR}_{\mathrm{ontic}}

at the minimal quotient—not causal:

\mathrm{sentence} \to \mathrm{universe}.

7. Alternative semantics and countermodels

7.1 Kripke-style truth-value gap

In a partial semantics, one may assign:

v(u)=\uparrow, \qquad \neg\uparrow=\uparrow.

This supplies a non-bivalent fixed point. It refutes any unconditional claim that negative self-reference must oscillate in every semantics. It does not refute Lemma 3, which is explicitly bivalent, or Theorem 2, which explicitly includes continuing actual revision. In the selected interpretation, permanent gappiness remains on the unactualized side rather than constituting continuing actual motion [3].

7.2 Stable paraconsistent glut

A paraconsistent semantics may assign both true and false without explosion. Such a stable glut is logically legitimate. It lies outside S7 if it is taken as a fixed status rather than enacted non-fixation. Therefore the paper does not claim that all paraconsistent logics collapse into PR revision [1,5].

7.3 A single terminating flash

A model may posit one brute actual event and no continuation. This does not contradict the finite theorem; it rejects S6. Such a model is a genuine rival to any universal theory of actuality, but it cannot contain an extended universe, observer, or origin inquiry. The present target is continuing actual existence.

7.4 Co-emergent relata

A first relation may constitute two roles at once. This is not dismissed. The claim is not that one event has only one describable role. The claim is that its determination conflict admits the retrospective quotient $$A/N$$ . The root roles need not be independently actual objects prior to the relation.

7.5 Higher-arity or many-valued roots

A root model may contain more than two internal statuses. Theorem 2 does not reduce all of its content to two states. It classifies only the minimal determination/non-determination quotient. If a proposed model denies that this quotient exists—for example, by rejecting every determinate distinction between enacted and unenacted status—it rejects S0 or S5 and remains outside the theorem.

7.6 Positive successor, rotation, and shift

Maps such as:

n\mapsto n+1,

a fixed-point-free rotation on $$S^1$$ , or a shift on an infinite sequence can continue without PR-shaped two-cycles. They are valid mathematical counterexamples to:

\operatorname{Fix}(f)=\varnothing \Longrightarrow f=\mathrm{PR}.

The paper makes no such inference. These models presuppose numbers, successor, a circle, a group action, a sequence space, or an update rule. They may be downstream Rules but do not satisfy S2 as primitive first actuality.

7.7 Stochastic first transition

Probability requires at least a measurable or otherwise structured outcome space:

(\Omega,\mathcal F,P).

At the absolute root this structure is unavailable under S2. Randomness may appear as a later Rule or resolution mode, but it is not a primitive alternative before alternatives exist.

7.8 Static complete history

A complete history:

H=(X_0,X_1,X_2,\ldots)

can be represented as one static mathematical object. This representation does not supply actual traversal:

\operatorname{ExistsAsDescription}(H) \not\Rightarrow \operatorname{Occurs}(X_n\to X_{n+1}).

An external finger that traverses the sequence transfers the actuality question to that finger. An internal traversal belongs to the actuality core.

7.9 Rootless or bi-infinite order

A bi-infinite history:

(\ldots,X_{-1},X_0,X_1,\ldots)

may contain motion while having no first member. It is a coherent rival ontology, but it rejects the selected rooted question rather than answering it: there is no $\prec$ -minimal actual occurrence. The theorem therefore does not exclude eternal or rootless actuality.

7.10 Internal motion with a fixed actuality quotient

Proposition 1 gives a model in which $$F$$ continuously exchanges hidden configurations while $$q(F(x))=q(x)$$ . This directly refutes the unrestricted slogan “motion implies PR.” The present theorem requires non-fixation of the root determination conflict itself. A theory that identifies actuality with any internal change, while allowing the $$A/N$$ status to remain fixed, rejects S7.

7.11 Static PR diagrams and arbitrary snapshot walks

A static graph containing arrows $A\leftrightarrows N$ encodes the PR orbit but does not, by that fact alone, enact traversal. Conversely, an arbitrary walk through a library of pre-existing snapshots can imitate any finite history, including a chaotic one. If the walk is selected by an external actual rule, the origin question moves to that selector. If no selection is actual, the walk remains a mathematical record. Thus neither static PR notation nor an ALL-like snapshot library supplies first actuality by representation alone.

8. Why time and probability do not mediate the result

The theorem does not say:

U_*\text{ lasts for zero seconds and then PR begins}.

Duration already presupposes temporal order. Nor does it say PR wins a lottery among candidate roots. Probability already presupposes distinguishable outcomes.

Instead:

\Delta t(U_*,\mathrm{PR}) \quad\text{is undefined},

and:

P(\mathrm{PR}\mid U_*) \quad\text{is undefined}.

The revision index:

k=0,1,2,\ldots

is a logical update rank. Physical time, if it emerges, would be a downstream interpretation of ordered enacted updates, not an input to the proof.

“Co-arising” therefore means:

\boxed{ \begin{gathered} \text{No model in the selected class has an actual root presentation}\\ \text{at the absolute-undefinedness boundary while lacking the PR normal form.} \end{gathered} }

It does not mean two entities appear simultaneously at an already existing instant.

9. Relation to universe generation

The term “universe” is used minimally here: an internally continuing actual domain, not necessarily our physical cosmos. PR supplies neither particles nor physical law. It supplies the minimal distinction between:

\text{a static possible description}

and:

\text{an internally enacted continuation}.

The architecture proposed for further work is:

\mathrm{PR} \rightleftarrows \mathrm{ER} \rightleftarrows \mathrm{LE} \xrightarrow{\mathrm{Rule}} \text{continuing pregeometric dynamics}.

PR names the self-contained actuality/non-fixation core.
ER names the enacted relational configuration or current situation.
LE names local resolution or lazy evaluation that prevents an unresolved global loop from being treated as a completed global value.
Rule specifies concrete updates. It is not derived in this paper.

PR is therefore not an engine added to an already existing universe. It is the minimal actuality normal form. Rule determines what that actuality does.

10. Chaos and upward emergence

PR does not by itself imply chaos:

\mathrm{PR}\not\Rightarrow\mathrm{Chaos}.

A Rule-dependent pregeometric dynamics would require additional properties, potentially including:

sensitivity or damage spreading;
growth of distinguishable futures;
nontrivial recurrence;
stretching-and-folding analogues in state or topology space;
bounded or metastable regimes;
multiscale temporal irregularity;
persistent localized motifs.

Even chaos does not imply matter:

\mathrm{Chaos}\not\Rightarrow\mathrm{Matterlike}.

A conditional upward ladder is:

\begin{aligned} \mathrm{PR\ actuality} &\to \mathrm{continuing\ ER/LE\ dynamics}\\ &\to \mathrm{Rule\!-\!dependent\ chaos\ or\ criticality}\\ &\to \mathrm{persistent\ localized\ motifs}\\ &\to \mathrm{reproducible\ interactions}\\ &\to \mathrm{proto\!-\!chemistry}\\ &\to \mathrm{life\!-\!like\ organization}\\ &\to \mathrm{agency}\\ &\to \mathrm{reflexive\ origin\ inquiry}. \end{aligned}

Every arrow can fail. A Rule may generate motion without chaos; chaos may disperse without stable motifs; motifs may fail to interact reproducibly; interaction networks may fail to replicate; replication may fail to develop agency or reflexive intelligence.

The concrete Rule and the empirical bridge to our universe remain open.

11. Relation to established logical results

The no-bivalent-model structure resembles the Liar and other negative self-reference constructions. Revision theories of truth rigorously study circular definitions whose hypotheses are repeatedly revised [2]. Kripke-style fixed-point semantics instead permits truth-value gaps [3]. Paraconsistent approaches permit non-explosive gluts [1,5]. These alternatives are not errors; they clarify the exact work done by S6 and S7.

Lawvere's fixed-point theorem [4] gives a representation-independent categorical form of diagonal reasoning for systems with the relevant products, internal-hom structure, and weak point-surjectivity. The present paper does not place $$U_*$$ inside a category. Category theory begins after objects and arrows are available. Lawvere's result is therefore supporting evidence for the structural recurrence of negative diagonalization, not a proof that undefinedness actualizes or that the universe begins with PR.

The mathematical novelty claimed here is limited: the finite exchange theorem is elementary. The proposed contribution is the explicit separation of:

ordinary nothing;
absolute undefinedness;
self-exempting description;
ontically self-contained presentation;
stable semantic non-closure;
continuing PR actuality.

12. Dependency ledger

Result	Dependencies	Status
Ordinary nothing is stable	Empty-conjunction convention	Derived finite result
Self-exemption is not absolute	Definition of absolute scope, S4	Constitutive lemma
No stable bivalent valuation	Self-inclusion, classical bivalent negation	Derived finite result
Exchange is unique	two-element totality and statewise non-fixation	Derived finite result
PR is the minimal normal form	S5–S7, exchange theorem	Derived model-class theorem
PR co-arises with the actual face of $$U_*$$	S0–S7	Ontological theorem in selected model class
Revision rank is physical time	Additional interpretation required	Conditional bridge
PR produces chaos	Concrete Rule required	Open construction
Chaos produces matter/life	Persistence and organization conditions required	Open construction
Our universe instantiates the model	Empirical identification required	Open empirical bridge

13. Exact non-claims

This paper does not establish:

that absolute undefinedness must actualize;
that $$U_*$$ is a cause, state, substance, object, or earlier instant;
that a static formula executes itself;
that every logic must reject gaps or gluts;
that every dynamics reduces to a binary oscillator;
that PR alone guarantees continuation without S6;
that PR alone guarantees chaos;
that chaos guarantees matter, chemistry, life, or intelligence;
that the concrete universe-generating Rule has been found;
that the observable universe has been derived or empirically identified with the model.

14. Conclusion

Ordinary nothing is stable because it may be described from outside the range of what it negates. Absolute undefinedness is different. At a root with no external actual medium, a faithful actual presentation cannot exempt its own occurrence. This yields a self-inclusive negative constraint with no stable classical bivalent valuation.

Pure logic alone establishes no stable classical bivalent valuation for the self-inclusive negative constraint. The finite mathematical theorem then shows that, on a retrospective quotient $D=\{A,N\}$ , total statewise non-fixation both makes the quotient dynamics well-defined and uniquely forces exchange. The resulting structure is involutive, fixed-point-free, and period two: the minimal PR normal form.

Thus, within the explicitly selected model class:

\boxed{ \operatorname{ActualFace}(U_*) \cong \mathrm{PR} }

PR is not a probabilistic choice made after undefinedness and not an event occurring later in time. It is the structural form of the actual side of a boundary that is not itself an actual state.

The proof's deepest remaining question is no longer the elementary exchange theorem. It is whether every adequate concept of continuing first actuality must satisfy ontic self-containment, non-self-exemption, the retrospective determination/non-determination quotient, and non-fixating revision. That question is stated openly rather than hidden in the notation.

Declarations

Authorship. Jia, Baolong is the sole named author and is responsible for the framework, argument, terminology, and final text.

AI assistance. AI assistance was used for structural organization, bilingual drafting, formal notation, typesetting preparation, and internal adversarial review. These activities do not constitute external peer review.

External peer review. No.

Internal review. Four documented adversarial review rounds were completed for argument architecture, countermodels, bilingual parity, and release boundaries.

Data and code. No empirical dataset or analysis code underlies the theorem in this version.

Funding, competing interests, and licence. To be confirmed by the author before public release.

References

Belnap, N. D. (1977). A useful four-valued logic. In J. M. Dunn & G. Epstein (Eds.), Modern Uses of Multiple-Valued Logic (pp. 8–37). Reidel.
Gupta, A., & Belnap, N. D. (1993). The Revision Theory of Truth. MIT Press.
Kripke, S. (1975). Outline of a theory of truth. The Journal of Philosophy, 72(19), 690–716. https://doi.org/10.2307/2024634
Lawvere, F. W. (1969). Diagonal arguments and cartesian closed categories. In Category Theory, Homology Theory and Their Applications II, Lecture Notes in Mathematics 92, 134–145. https://doi.org/10.1007/BFb0080769
Priest, G. (2006). In Contradiction: A Study of the Transconsistent (2nd ed.). Oxford University Press. https://doi.org/10.1093/acprof:oso/9780199263301.001.0001

第一实际性：为何绝对未定义必然与PR伴生

一个超越“无”、时间与概率选择的逻辑—数学证明

贾宝龙（Jia, Baolong）
独立研究者
版本 1.0 — 2026年7月

摘要

本文提出一个有意先于物理学的问题：如果研究对象被限定为实际的第一发生，并且不允许先置的实际事件、物质基底、物理时间、概率空间、外部执行器或正面规定，那么绝对未定义边界的实际侧具有怎样的最小形式？

本文中，PR 是 Paradoxical Re-entry（悖论回入）的缩写，旧称“悖论自指”；它特指第3节定义的最小否定式自我修正规范形，不表示某个先已存在的物理过程。

论证首先区分普通的“无”与绝对未定义。普通的“无”否定先前的规定集合，却允许当前描述自身留在否定范围之外，因而可以具有稳定赋值。绝对未定义更彻底：它不是空对象、空定义域、真值，也不是一个名为“无”的确定状态。对它的忠实本体表示不能豁免正在发生的表示行为本身，因为在根部不存在外部实际介质。这形成已实施规定 $$A$$ 与其缺失 $$N$$ 之间的回顾性状态冲突。此处并不预设修正方向；其方向由下文有限定理分类。

严格的有限定理非常初等，但结论精确。设根过程允许一个回顾性二元商 $D=\{A,N\}$ ，其中 $$A$$ 记录已实施规定， $$N$$ 记录其缺失。若每个完整构形都有自主后继，且每个后继都改变其商状态，则商动力自动良定义，并且只可能存在一个映射：

\sigma(A)=N,\qquad\sigma(N)=A.

该映射无不动点、是对合，并且除相位外只有一个周期二轨道。本文称之为最小PR正规形。

本文不主张未定义必然导致实际化，不主张公式可以自行执行，不主张所有逻辑都必须采用修正语义，也不主张PR单独保证混沌、物质、生命或本可观测宇宙。其必然性明确限定于一个可见的模型类：实际的、有根的、自包含的、不自我豁免的、具有最小商结构的、持续的、非固定的第一发生。在这个模型类中，PR不是在时间或概率上从undefined之后被选中；它就是绝对未定义边界实际侧的正规形。

关键词： 绝对未定义；第一实际性；PR；悖论回入；不动点；修正语义；原初实际化；基础本体论

证明状态声明

本文包含三种性质不同的主张：

构成性范围与模型条件。 它们规定本文研究的本源问题，不被伪装成纯逻辑的中立定理。
派生的数学结论。 无二值不动点结论与有限交换定理由明确列出的前提推出。
本体论解释。 “第一实际性”把有限正规形应用于选定的根模型，并不构成对本可观测宇宙的经验识别。

中心结果因此是：

\boxed{ \mathcal C_{\mathrm{S0\text{--}S7}} \models \operatorname{ActualFace}(U_*)\cong(D,\sigma) \cong\mathrm{PR} }

而不是：

U_*\vdash\mathrm{PR}, \qquad U_*\to\mathrm{PR}, \qquad P(\mathrm{PR}\mid U_*).

第一种写法错误地把 $$U_*$$ 当作命题；第二种把它当作原因或更早状态；第三种预置了概率空间。这里， $\mathcal C_{\mathrm{S0\text{--}S7}}$ 是下文明确界定的根实际化模型类。“必然”指该类每个模型中都成立；它不指在一个完全无前提的演算中，从名为 $$U_*$$ 的对象推导PR。

1. 经修正的本源问题

问题不是“最先存在的对象是什么？”任何原子、数字、集合、规律、图、场、比特或物质，都已经引入正面规定。问题也不是“预先存在的可能空间中哪一个成员被选择了？”这会引入备选空间与选择机制。

本文选择的问题是：

在不允许任何先置实际性或正面根结构的条件下，实际第一发生的最小正规形是什么？

这个问题包含范围选择：它研究实际发生。一个静态公式、完整轨迹或抽象空间中的成员，可以描述演化而不实施演化：

\operatorname{Encodes}(S,H) \not\Rightarrow \operatorname{Occurs}(H).

因此，仅仅静态可获得并不能反驳实际第一发生理论。

“第一”也需要修正。在实际时间秩序出现之前，第一不能指一个已经实际存在的时间坐标的最小值。它表示依赖秩序中的最小性：

x\prec y \quad\Longleftrightarrow\quad y\text{在构成上预设}x.

根部在 $\prec$ 下没有先置实际前件。

2. 普通的“无”与绝对未定义

2.1 普通的“无”

令 $\Phi_0$ 为先前确定语句的集合。在根部：

\Phi_0=\varnothing.

普通“无”语句 $$n$$ 可以定义为：

n\;\Longleftrightarrow\; \bigwedge_{\varphi\in\Phi_0}\neg\varphi.

根据空合取的标准约定：

\bigwedge_{\varphi\in\varnothing}\neg\varphi=\top,

得到：

n\Longleftrightarrow\top.

所以普通的“无”可以被稳定描述。当前描述 $$n$$ 没有被纳入它所否定的范围。它的结构是：

\text{没有先置规定} + \text{一个描述该缺失的外部当前规定}.

这是有意义且稳定的“无”，但不是绝对未定义。

2.2 绝对未定义

本文仅在元语言中用：

\[ U_* \]

标记绝对未定义边界。它不是：

空集；
空的一阶定义域；
假；
底元素；
范畴初始对象；
一个性质为“没有性质”的状态；
产生其他东西的实体。

把 $$U_*$$ 放进对象域就已经规定了它。即使范畴初始对象 $$0$$ 也具有恒等箭头和泛性质，因此已经过度结构化：

U_*\neq0_{\mathcal C}.

本文不把 $$U_*$$ 当作前提推理，而是研究：在没有外部实际介质的条件下，一个实际根发生若要忠实呈现对象层面绝对无规定，需要满足什么条件。

3. 原始项与类型约束

令 $$a$$ 表示第一实际发生的候选。

定义1——实际发生

\operatorname{Act}(a)

表示 $$a$$ 属于被选定的实际侧。它是模型中的原始项，不被还原成静态图或编码事件集合中的成员关系。

定义2——已实施规定

\operatorname{Det}(a)

表示该发生实施了一个可区分规定。如果所谓发生与未发生之间不存在任何可能差异，它不属于被选择的实际域：

\neg\operatorname{Diff}\bigl(\operatorname{Act}(a), \neg\operatorname{Act}(a)\bigr) \Longrightarrow \neg\operatorname{Act}(a).

这是本文所选“实际”含义的构成标准，不是关于所有形而上学的中立定理。

定义3——本体实施

\operatorname{Enacts}(e,a)

表示实际发生 $$e$$ 是实施 $$a$$ 的载体、求值者或行为。两个参数位置都以候选实际发生为类型，从而不把“支持”关系误写为集合成员关系。

定义4——自包含

\operatorname{Enacts}(a,a)

并且不存在先置实际 $$e$$ 满足：

e\prec a\land\operatorname{Enacts}(e,a).

因此第一行为不能由更早的实际载体执行。这个公式是根模型的构成条件，并不声称普通物理事件会字面地自我致因。

定义5——自我豁免

如果正在发生的表示行为作为一个正面规定，停留在它所呈现的无规定范围之外，则称该表示自我豁免。

定义6——PR正规形

令：

D=\{A,N\}

表示根冲突在回顾意义上被商化为已实施规定 $$A$$ 及其否定 $$N$$ 。PR正规形是映射：

\sigma:D\to D

并满足：

\sigma(A)=N,\qquad\sigma(N)=A.

等价地：

\operatorname{Fix}(\sigma)=\varnothing, \qquad \sigma^2=\operatorname{id}_D.

$$A,N$$ 是状态标签，不是先置物理对象或分支。

定义7——实际侧记号

\operatorname{ActualFace}(U_*)

不表示把一个函数作用到对象 $$U_*$$ 上。它是一个缩写：指在绝对未定义边界满足S0–S4的实际根模型，其最小商动力的同构类。

4. 构成性条件S0–S7

S0——实际目标选择

本文研究实际发生。静态描述不会仅因编码了一段历史而成为实际。

S1——绝对未定义边界

$$U_*$$ 不提供任何对象层面的正面规定，它自身也不是对象。

S2——有根性

不允许先置的实际事件、基底、物理时间、概率空间或外部实际执行器。

S3——本体自包含

第一表示行为实施自身的根表示，不由更早的实际载体执行。

S4——不得自我豁免

对绝对未定义的忠实实际表示，不能把自身发生排除在它所呈现的完全缺失之外。否则剩下的是：

\text{普通的无} + \text{一个正面外部标记}.

S5——回顾性二元商

令 $$X$$ 为根模型使用的非空构形域。无论模型还提供多少内部描述，其根部规定冲突都允许满射的回顾性分类：

q:X\twoheadrightarrow D=\{A,N\},

其中 $$A$$ 记录已实施规定， $$N$$ 记录其否定。该商是回顾性的：它不宣称发生以前已经存在两个实际备选项。这里不预设任何商更新律。

S6——持续实际修正

永久真值空缺、静态真值过剩或终止的矛盾闪光，不被计作本文所选域中的持续实际运动。同一个根约束的重新作用由一个全域自主算子表示：

F:X\to X.

S7——非固定性

根冲突不在任一商极上稳定：

\forall x\in X,\qquad q(F(x))\neq q(x).

S5–S7是最强的模型限制。S5施加一个经典的“规定／无规定”状态商；S6排除外部执行器与终止闪光；S7要求保持不稳定的是根冲突自身，而不只是同一商状态内部的隐藏细节。它们完成从语义不可闭合到已实施延续的过渡。本文论证它们与所选实际运动问题的关系，但不把它们说成所有逻辑语义必须接受的规则。

定义8——根实际化模型类

根实际化模型是元组：

\mathcal M=(a,X,F,q)

并带有对定义1–5的解释。令 $\mathcal C_{\mathrm{S0\text{--}S7}}$ 表示满足S0–S7的此类模型组成的类。S0–S4固定本体解释；S5–S7提供数学分类使用的有限动力数据。这个分离避免把有限定理误认为无前提地证明了本体桥梁。

该元组是理论研究者事后构造的元语言表示。S2不禁止这种回顾性数学；它禁止把 $$X$$ 、 $$F$$ 或 $$q$$ 实体化为一台先已实际存在、负责执行根事件的机器。同样， $$F$$ 表示最小根约束的重新作用，它不是那个仍未知、将生成ER结构、混沌或物理的具体Rule。

5. 形式推导

引理1——普通的“无”允许稳定二值赋值

对：

n\Longleftrightarrow \bigwedge_{\varphi\in\Phi_0}\neg\varphi, \qquad \Phi_0=\varnothing,

存在赋值 $$v$$ 满足：

\[ v(n)=1. \]

证明

右侧为空合取 $\top$ ，所以：

v(n)=v(\top)=1.

\square

引理2——自我豁免不满足绝对范围

若表示行为 $$a$$ 被排除在它所呈现的无规定之外，则所得结构至少包含一个正面已实施规定，即 $$a$$ 自身。因此，它只表示相对于先前集合的普通缺失，而不是绝对未定义。

证明

假设 $$a$$ 表示“没有任何规定适用”，但“没有任何规定”的范围排除了 $$a$$ 。于是：

\operatorname{Act}(a)\land\operatorname{Det}(a)

被保留在否定范围之外。因此总体结构并非没有正面已实施规定，这与S4的绝对范围冲突。故在所选根模型中，任何忠实本体表示都不得自我豁免。

\square

引理3——自包含表示没有稳定二值模型

令实际根部的最小规定集合为：

\Phi_1=\{u\}.

在不得自我豁免的条件下，循环语义约束为：

u\Longleftrightarrow \bigwedge_{\varphi\in\Phi_1}\neg\varphi.

则不存在赋值：

v:\Phi_1\to\{0,1\}

满足该约束。

证明

因为 $\Phi_1=\{u\}$ ：

u\Longleftrightarrow\neg u.

满足约束的赋值必须满足：

\[ v(u)=1-v(u). \]

若 $$v(u)=0$$ ，右侧为 $$1$$ ；若 $$v(u)=1$$ ，右侧为 $$0$$ 。两种可能均失败，所以不存在稳定二值赋值。

\square

这是无模型结论。它不是在经典对象逻辑中把 $u\land\neg u$ 断言为定理，也没有使用爆炸原则。

定理1——有限无不动点交换定理

令：

D=\{A,N\},

并令 $f:D\to D$ 为全域映射。若：

\operatorname{Fix}(f)=\varnothing,

则：

f(A)=N,\qquad f(N)=A.

证明

由于 $$A$$ 不是不动点， $f(A)\neq A$ 。由全域性及 $D=\{A,N\}$ ，只能有 $$f(A)=N$$ 。同理，由 $$N$$ 不是不动点， $f(N)\neq N$ ，只能有 $$f(N)=A$$ 。这两个取值唯一确定 $$f$$ 。

\square

推论1——无不动点对合

对唯一的全域无不动点映射：

\operatorname{Fix}(f)=\varnothing

且：

f^2=\operatorname{id}_D.

因此所有轨道为：

A,N,A,N,\ldots

或其相位平移：

N,A,N,A,\ldots.

除相位外只有一个周期二轨道。

定理2——PR正规形定理

每个满足S5–S7的根模型，都在回顾性实际商上诱导唯一PR正规形：

(D,f)\cong(D,\sigma),

其中：

\sigma(A)=N,\qquad\sigma(N)=A.

证明

S5给出满射 $q:X\twoheadrightarrow D$ ，S6给出全域映射 $F:X\to X$ 。任取 $x\in q^{-1}(d)$ ，定义候选商更新：

\[ f(d):=q(F(x)). \]

该定义与代表元的选择无关。事实上，由S7， $q(F(x))\neq d$ ；又因为 $$D$$ 恰有两个元素，所以 $$q(F(x))$$ 必是 $D\setminus\{d\}$ 中唯一的元素。因此 $$f$$ 良定义、全域，并满足 $q\circ F=f\circ q$ ；它也没有不动点。由定理1唯一得到 $f=\sigma$ ，推论1给出对合与周期二轨道。

\square

命题1——有限前提的尖锐性

删除以下任一有限限制，数学上的PR结论即不再成立：

二元商。 在 $D_3=\{0,1,2\}$ 上，全域无不动点映射 $r(i)=i+1\pmod 3$ 是三周期，而不是PR。
全域延续。 偏映射 $$p(A)=N$$ 且 $$p(N)$$ 未定义，它不是对合，表示一次终止更新。
商层逐状态非固定。 令 $X=\{a_0,a_1,n_0,n_1\}$ ，令 $$q(a_i)=A$$ 、 $$q(n_i)=N$$ ，并让 $$F$$ 分别交换 $$a_0,a_1$$ 与 $$n_0,n_1$$ 。于是 $$F$$ 确实包含内部运动，但对每个 $$x$$ 都有 $$q(F(x))=q(x)$$ ；诱导商映射是恒等，而不是PR。

证明

三个构造均已显式给出，直接代入即可验证上述性质。

\square

命题1对解释至关重要：“存在运动”本身不能证明PR。论证需要更强的主张——保持非固定的是根部“规定／无规定”冲突自身。这一主张就是S7；它的本体论辩护不能由初等有限定理代替。

定理3——无时间伴生定理

对每个：

\mathcal M\in\mathcal C_{\mathrm{S0\text{--}S7}},

其诱导的最小商都满足：

\operatorname{ActualFace}_{\mathcal M}(U_*)\cong\mathrm{PR}.

PR不是后来从候选中选出的，而是绝对未定义边界实际侧的最小实施正规形。

证明

由S1与S2， $$U_*$$ 既不是更早状态，也不是可以引发事件的对象。由S3与引理2，实际根表示不能依赖自我豁免的外部标记。由引理3，其自包含二值约束没有稳定赋值。S5–S7在不预设交换律的前提下，规定这种语义不可闭合如何在最小商上被计作自主、持续且不稳定化的实际性。定理2随后把诱导商动力唯一分类为PR。

推导没有引入时间参数或概率测度。因此关系是结构性的：

U_*\mid\mathrm{PR},

而不是时间、因果或概率关系。这里的竖线只是同一根说明之两个侧面的分隔符，不表示条件概率、整除或时间先后。

\square

6. 为什么这不只是关于语句的语句

语言符号可以停留在其指称对象之外。“无”这个词即使描述空定义域，本身仍然是墨迹、声音或数据。因此，语言层面的自我豁免非常普通，并不构成悖论。

本文研究的根问题删除了这一选项。如果第一实际发生由外部实际铭文、载体、求值器或执行器实施，那么该载体在实际性秩序中先于所谓第一事件，违反S2。因此根表示是本体的，而不仅是描述的：

\text{表示行为} = \text{第一已实施差异}.

语义公式：

u\Longleftrightarrow\neg u

并不是宇宙的语言原因，而是同一个无不动点结构在语义投影下的表示。本文主张的是最小商上的结构同构：

\mathrm{PR}_{\mathrm{semantic}} \cong \mathrm{PR}_{\mathrm{ontic}},

而不是因果关系：

\text{语句}\to\text{宇宙}.

7. 替代语义与反模型

7.1 Kripke式真值空缺

在部分语义中，可以赋值：

v(u)=\uparrow, \qquad \neg\uparrow=\uparrow.

这给出一个非二值不动点，并反驳“负自指在所有语义中都必须振荡”的无条件主张。它不反驳明确限定为二值的引理3，也不反驳明确包含持续实际修正的定理2。在本文的解释中，永久空缺仍停留在未实际化侧，而不构成持续实际运动[3]。

7.2 稳定的次协调真值过剩

次协调语义可以在不爆炸的情况下同时赋真与假。这样的稳定真值过剩在逻辑上合法。如果把它当作固定状态而不是已实施的非固定性，它位于S7之外。因此本文不主张所有次协调逻辑都会还原成PR修正[1,5]。

7.3 单次终止闪光

一个模型可以设定一次无理由的实际事件，随后不再继续。它不反驳有限定理，而是否定S6。它是对任何普遍实际性理论的真实竞争者，但不能包含延展宇宙、观察者或本源研究。本文的对象是持续实际存在。

7.4 共生关系项

第一关系可以同时构成两个角色。本文不回避该情况。主张并不是一个事件只能有一个可描述角色，而是其规定冲突允许 $$A/N$$ 回顾性商。根角色不需要在关系之前作为独立实际对象存在。

7.5 高元或多值根

根模型可能包含两个以上内部状态。定理2并不把它的所有内容约化为二态，只分类最小的规定／无规定商。若某个模型拒绝这一商的存在——例如拒绝已实施与未实施状态之间的一切确定差异——它就拒绝S0或S5，位于定理范围之外。

7.6 正后继、旋转与移位

如下映射：

n\mapsto n+1,

$$S^1$$ 上的无不动点旋转或无限序列上的移位，都可以持续而不具有表面的PR周期二形态。它们是对下式的有效数学反例：

\operatorname{Fix}(f)=\varnothing \Longrightarrow f=\mathrm{PR}.

本文没有作出这个推理。这些模型预设了数字、后继、圆、群作用、序列空间或更新规则。它们可以作为下游Rule，却不以原始形式满足S2。

7.7 随机第一转移

概率至少需要可测或其他结构化结果空间：

(\Omega,\mathcal F,P).

在绝对根部，S2不允许该结构作为先置项。随机可以作为后来的Rule或求解方式出现，但在备选结果尚未成立之前，它不是原始备选项。

7.8 静态完整历史

完整历史：

H=(X_0,X_1,X_2,\ldots)

可以表示为一个静态数学对象。但该表示不提供实际遍历：

\operatorname{ExistsAsDescription}(H) \not\Rightarrow \operatorname{Occurs}(X_n\to X_{n+1}).

外部手指遍历序列会把实际性问题转移到手指；内部遍历则属于实际性核心。

7.9 无根或双无限次序

双无限历史：

(\ldots,X_{-1},X_0,X_1,\ldots)

可以包含运动，却没有第一项。它是一个自洽的竞争本体论，但它拒绝本文所选的有根问题，而不是回答该问题：其中不存在关于 $\prec$ 的最小实际发生。因此本文定理不排除永恒或无根实际性。

7.10 商状态固定的内部运动

命题1给出一个模型： $$F$$ 持续交换隐藏构形，而 $$q(F(x))=q(x)$$ 。这直接反驳不加限制的口号“有运动就有PR”。本文定理要求保持不固定的是根部规定冲突自身。若某理论把任何内部变化都视为实际，同时允许 $$A/N$$ 状态保持固定，它就拒绝S7。

7.11 静态PR图与任意快照游走

含有箭头 $A\leftrightarrows N$ 的静态图编码了PR轨道，但仅凭编码并不会实施遍历。反过来，在预存快照库中的任意游走可以模仿任何有限历史，包括混沌历史。若游走由外部实际规则选择，本源问题就转移到选择器；若选择从未实际发生，游走只是数学记录。因此，无论静态PR记号还是类似ALL的快照库，都不能仅凭表示提供第一实际性。

8. 为什么时间和概率不介入结论

定理不是说：

U_*\text{持续零秒，然后PR开始}.

持续时间已经预设时间秩序。定理也不是说PR在根候选抽奖中获胜；概率已经预设可区分结果。

相反：

\Delta t(U_*,\mathrm{PR}) \quad\text{未定义},

并且：

P(\mathrm{PR}\mid U_*) \quad\text{未定义}.

修正指标：

k=0,1,2,\ldots

表示逻辑更新层级。物理时间如果涌现，将是已实施更新秩序的下游解释，而不是证明输入。

因此，“伴生”意味着：

\boxed{ \begin{gathered} \text{在所选模型类中，不存在这样一个模型：它在绝对未定义边界具有实际根表示，}\\ \text{却没有PR正规形。} \end{gathered} }

它不表示两个实体在一个已经存在的瞬间同时出现。

9. 与宇宙生成的关系

本文最低限度地使用“宇宙”一词：一个内部持续的实际域，不必等同于本物理宇宙。PR既不提供粒子，也不提供物理规律。它提供以下二者之间的最小差别：

\text{静态可能描述}

与：

\text{内部已实施延续}.

后续研究架构是：

\mathrm{PR} \rightleftarrows \mathrm{ER} \rightleftarrows \mathrm{LE} \xrightarrow{\mathrm{Rule}} \text{持续前几何动力}.

PR 表示自包含的实际性／非固定性核心；
ER 表示已实施关系局面或当前配置；
LE 表示局部求解或惰性求值，使不可解的全局循环不被当作已经完成的全局值；
Rule 规定具体更新，本文没有推出Rule。

所以PR不是添加到一个已经存在宇宙中的引擎，而是最小实际性正规形。Rule决定该实际性具体做什么。

10. 混沌与向上涌现

PR本身不蕴含混沌：

\mathrm{PR}\not\Rightarrow\mathrm{Chaos}.

依赖Rule的前几何动力还需要更多性质，可能包括：

敏感性或损伤传播；
可区分未来的增长；
非平凡回返；
状态空间或拓扑空间中的拉伸—折叠类似物；
有界或亚稳区域；
多尺度时间不规则性；
持久局域结构。

即使混沌也不蕴含物质：

\mathrm{Chaos}\not\Rightarrow\mathrm{Matterlike}.

条件性向上链条为：

\begin{aligned} \mathrm{PR实际性} &\to \mathrm{持续ER/LE动力}\\ &\to \mathrm{依赖Rule的混沌或临界复杂性}\\ &\to \mathrm{持久局域结构}\\ &\to \mathrm{可重复相互作用}\\ &\to \mathrm{原始化学}\\ &\to \mathrm{类生命组织}\\ &\to \mathrm{能动性}\\ &\to \mathrm{反思性本源研究}. \end{aligned}

每个箭头都可能失败。Rule可以产生运动却不产生混沌；混沌可以耗散而没有稳定结构；结构可以无法重复相互作用；相互作用网络可以无法复制；复制可以无法发展出能动性或反思智能。

具体Rule以及与本宇宙之间的经验桥仍是开放问题。

11. 与既有逻辑结果的关系

无二值模型结构类似说谎者及其他否定式自指。真理修正理论严格研究循环定义及其反复修正[2]。Kripke式不动点语义允许真值空缺[3]；次协调方法允许非爆炸的真值过剩[1,5]。这些替代方案并非错误，而是明确了S6与S7承担的工作。

Lawvere不动点定理[4]在具有相应乘积、内部Hom结构与弱点满射的系统中，为对角论证提供与表示方式无关的范畴形式。本文不把 $$U_*$$ 放入范畴。范畴论开始于对象和箭头已经可用之后。因此Lawvere定理只是负对角结构反复出现的支持性证据，而不是undefined必然实际化或宇宙始于PR的证明。

本文对数学新颖性的主张是有限的：有限交换定理非常初等。本文提出的贡献是明确区分：

普通的“无”；
绝对未定义；
自我豁免的描述；
本体自包含表示；
稳定语义不可闭合；
持续PR实际性。

12. 依赖台账

结果	依赖	状态
普通的“无”稳定	空合取约定	派生有限结果
自我豁免不绝对	绝对范围定义、S4	构成性引理
无稳定二值赋值	自包含、经典二值否定	派生有限结果
交换唯一	二元全域性与逐状态非固定性	派生有限结果
PR是最小正规形	S5–S7、交换定理	模型类派生定理
PR与 $$U_*$$ 实际侧伴生	S0–S7	所选模型类中的本体定理
修正层级就是物理时间	需要额外解释	条件桥
PR产生混沌	需要具体Rule	开放构造
混沌产生物质／生命	需要持久性与组织条件	开放构造
本宇宙实例化该模型	需要经验识别	开放经验桥

13. 精确的非主张

本文没有证明：

绝对未定义必然实际化；
$$U_*$$ 是原因、状态、实体、对象或更早瞬间；
静态公式可以自行执行；
所有逻辑都必须拒绝真值空缺或真值过剩；
所有动力都约化成二值振荡；
没有S6时PR单独保证持续；
PR单独保证混沌；
混沌保证物质、化学、生命或智能；
已经找到具体宇宙生成Rule；
已经推导本可观测宇宙或完成经验识别。

14. 结论

普通的“无”之所以稳定，是因为它可以从自身否定范围之外被描述。绝对未定义不同。在不存在外部实际介质的根部，忠实的实际表示不能豁免自身发生。这形成一个没有稳定经典二值赋值的自包含否定约束。

纯逻辑部分证明，自包含否定约束没有稳定经典二值赋值。有限数学定理进一步证明：在回顾性商集 $D=\{A,N\}$ 上，全域且逐状态非固定既使商动力自动良定义，也唯一强制交换。所得结构是对合、无不动点且具有周期二轨道，即最小PR正规形。

因此，在明确选择的模型类中：

\boxed{ \operatorname{ActualFace}(U_*) \cong \mathrm{PR} }

PR不是在undefined之后通过概率选择得到的，也不是后来发生的一个事件。它是一个自身不是实际状态的边界所具有的实际侧结构。

证明留下的最深问题不再是初等交换定理，而是：每一种充分的持续第一实际性概念，是否都必须满足本体自包含、不得自我豁免、回顾性规定／无规定商以及非固定修正。本文把这个问题明确暴露，而没有把它隐藏在符号中。

声明

作者身份。 贾宝龙（Jia, Baolong）是唯一署名作者，并对框架、论证、术语和最终文本负责。

AI协助。 AI用于结构整理、双语草拟、形式符号、排版准备和内部对抗性评审。这些活动不构成外部同行评审。

外部同行评审。 无。

内部评审。 已完成四轮有记录的对抗性评审，分别覆盖论证架构、反模型、双语一致性与发布边界。

数据与代码。 本版本定理不依赖经验数据集或分析代码。

资助、利益冲突与许可。 公开发布前由作者确认。

参考文献

Belnap, N. D. (1977). A useful four-valued logic. In J. M. Dunn & G. Epstein (Eds.), Modern Uses of Multiple-Valued Logic (pp. 8–37). Reidel.
Gupta, A., & Belnap, N. D. (1993). The Revision Theory of Truth. MIT Press.
Kripke, S. (1975). Outline of a theory of truth. The Journal of Philosophy, 72(19), 690–716. https://doi.org/10.2307/2024634
Lawvere, F. W. (1969). Diagonal arguments and cartesian closed categories. In Category Theory, Homology Theory and Their Applications II, Lecture Notes in Mathematics 92, 134–145. https://doi.org/10.1007/BFb0080769
Priest, G. (2006). In Contradiction: A Study of the Transconsistent (2nd ed.). Oxford University Press. https://doi.org/10.1093/acprof:oso/9780199263301.001.0001