The Irreducible Motion at the Origin of a Universe: A Logical-Razor Theorem for PR

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

An Axiomatic Proof That Exchange Alone Survives the Elimination of Static Identity

Author: Jia, Baolong
Chinese name: 贾宝龙
Affiliation: Independent Researcher
Document type: Bilingual axiomatic preprint
Version: 1.0
Date: July 2026
Framework: Jia Baolong PR-ER-LE generative ontology
Document fingerprint: JBL-PRR-20260723-V10-1B9D4E

Part I. English

Abstract

What can remain at the origin of a universe after matter, space, physical time, an external executor, pre-existing objects, privileged truth labels, and static identity have all been removed? This paper gives a conditional mathematical answer inside a sharply delimited minimal-origin model. An intuitive plus-minus question opens the argument: if affirmation preserves a state while negation exchanges it, which operation can still bear a first actual motion? The intuition is not used as a proof.

Let $D=\{Y,N\}$ be a retrospective two-class quotient of a first actual difference, with no intrinsic priority between its labels. Let $\sigma$ exchange the two labels. The four total unary maps $D\to D$ are the identity, exchange, and two constant maps. Label equivariance removes the constants; an explicit non-fixation condition removes identity. Hence the logical-razor operator

\mathfrak R(D^D) = \{f\in D^D\mid f\sigma=\sigma f,\ f\neq\operatorname{id}_D\}

has the unique value

\mathfrak R(D^D)=\{\sigma\}.

This finite classification is the paper's mathematical theorem. It does not make a static formula execute itself. Actuality enters through the selected ontology of actual transition, represented by the primitive predicate $\operatorname{ActualStep}_W$ . Under additional rootedness, internal continuation, stationarity, and result-reentry assumptions, enacted exchange is identified with the PR actuality core and its continued reentry. The theorem therefore proves the uniqueness of exchange only within the stated binary, deterministic, memoryless, label-symmetric, non-fixed model class. It does not prove that undefinedness must actualize, that every possible dynamics is binary, or that PR alone generates chaos, matter, life, or our observable universe.

Proof-status statement

The paper contains three different kinds of statement.

Scope and ontology: the origin question is restricted to actual occurrence, and actual existence is identified with actual transition inside the Jia Baolong framework.
Finite derivation: under the explicitly stated binary-map assumptions, exchange is the unique surviving operation.
Conditional architecture: if the exchange form is actually enacted, internally continued, and re-entered, it is identified as PR; further transitions toward ER, LE, chaos, and emergence require additional structure and a concrete Rule.

Only item 2 is a neutral finite derivation from the listed map assumptions. Items 1 and 3 are respectively a framework commitment and a conditional ontological interpretation.

1. The low step: an intuition with two signs

Imagine a system containing only a plus sign and a minus sign. One must be removed. Which remains?

If plus means "preserve what is already marked," it suggests

$$ P(x)=x. $$

If minus means "do not preserve the current mark," it suggests

M(x)=\sigma(x).

The image is immediate: preservation can describe a completed state, while exchange supplies a next difference. But this image proves nothing by itself. A written minus sign is static. Arithmetic subtraction, logical negation, label exchange, and actual motion are not automatically identical. The purpose of the paper is to replace the image with a finite classification theorem and then state exactly which additional assumptions are required before that theorem can be interpreted as a universe's first PR motion.

The plus-minus image is therefore an entrance, not the destination.

2. The corrected origin question

The unrestricted question "What structures exist?" admits static structures, complete histories, mathematical encodings, and arbitrary members of ALL. The present question is narrower:

Among rooted, self-contained models of an actually occurring and continuing first difference, what is the unique minimal unary normal form after label privilege and fixation are eliminated?

This corrected question prevents two category mistakes.

First, a static representation of motion is not thereby motion:

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

Second, a classification of possible maps does not make one of those maps actual:

f\in D^D \nRightarrow \operatorname{ActualStep}_W.

The proof classifies a form. The framework separately specifies the selected mode of actuality.

3. Target domain and model boundary

Let $\mathfrak D_{\mathrm{act}}$ denote the selected class of actual universes. A member $W\in\mathfrak D_{\mathrm{act}}$ is considered here only if it satisfies a rooted-origin interpretation: no prior actual event, material substrate, physical time, or external actual executor is admitted as an explanation of its first beat.

The theorem is not a theorem about:

every mathematical structure;
every logic;
every arity;
every stochastic process;
every nonstationary or history-dependent dynamics;
every static block history;
every possible account of existence.

It is a uniqueness theorem for one explicitly chosen minimal model class.

4. Primitives and notation

Definition 1. Actual step

\operatorname{ActualStep}_W(a,b)

means that an actual transition from relational position $$a$$ to relational position $$b$$ occurs in $$W$$ . The predicate is primitive in the intended ontological interpretation. Writing it in a formal language does not produce the occurrence.

Definition 2. Retrospective quotient

The first actual difference is represented, after occurrence, by

D=\{Y,N\}.

The labels $$Y$$ and $$N$$ have no intrinsic meaning, value, or priority. Their transposition is

\sigma(Y)=N, \qquad \sigma(N)=Y, \qquad \sigma^2=\operatorname{id}_D.

Definition 3. Affirmation and negation normal forms

The minimal affirmation form is

P:=\operatorname{id}_D,

and the minimal negation form is

M:=\sigma.

These definitions formalize the opening intuition. They do not assert that every use of plus or minus in mathematics has this meaning.

Definition 4. Candidate map space

\mathcal F:=D^D

is the set of all total unary maps $D\to D$ . It contains exactly four maps:

\mathcal F = \{\operatorname{id}_D,\sigma,c_Y,c_N\},

where

c_Y(x)=Y, \qquad c_N(x)=N

for every $x\in D$ .

Definition 5. Equivariant filter

\mathcal E(\mathcal F) := \{f\in\mathcal F\mid f\circ\sigma=\sigma\circ f\}.

Equivariance means that relabelling $Y\leftrightarrow N$ before or after applying $$f$$ makes no structural difference.

Definition 6. Non-fixation filter

\mathcal N(\mathcal G) := \{f\in\mathcal G\mid f\neq\operatorname{id}_D\}.

Non-fixation is an explicit model restriction. It is not derived from the mere presence of distinct event tokens.

Definition 7. Logical-razor operator

\mathfrak R(\mathcal F) := \mathcal N(\mathcal E(\mathcal F)).

The razor first removes intrinsic label preference and then removes static identity.

Definition 8. PR actuality core

\operatorname{PRCore}_W(x,y) := \operatorname{ActualStep}_W(x,y) \land y=\sigma(x).

Definition 9. Continued PR reentry

\operatorname{PRReentry}_W := \exists (x_n)_{n\in\mathbb N}\; \forall n\in\mathbb N,\; \operatorname{PRCore}_W(x_n,x_{n+1}).

This definition joins actual occurrence, exchange, continuation, and result-reentry. It is stronger than the existence of one isolated exchange.

5. Axioms and model restrictions

R0. Target-domain selection

The explanandum is an actually occurring universe. Static descriptions do not enter the selected domain merely by encoding a complete history.

R1. Existence-motion identity

Within the selected framework,

\operatorname{ActualExistence}_W \equiv \operatorname{ActualTransition}_W.

This is an ontological thesis of the framework, not a theorem of neutral logic.

R2. Rootedness and external-executor exclusion

There is a least first-beat germ in generated precedence. No prior actual event, material substrate, physical time, or external actual executor is admitted.

R3. Constitutive relation

The root relata are positions differentiated by the occurring relation. They are not independently actual objects to which a relation is subsequently attached.

R4a. Minimal continuation

The universe is not a single terminating flash. The result position of at least one actual step participates in a later actual step.

R4b. Iterated continuation

For the stronger claim of continued PR reentry, every result position in the represented quotient sequence participates in a subsequent actual step:

\forall n\in\mathbb N,\; \operatorname{ActualStep}_W(x_n,x_{n+1}).

R4b is not derived from R4a. R4a excludes one isolated flash; R4b separately excludes every finite terminating chain.

R5. Retrospective binary symmetry

The first actual difference admits the two-class quotient $D=\{Y,N\}$ , and exchanging its labels changes no intrinsic structure.

R6. Minimal unary closure

At the selected quotient level, continuation is represented by a total unary map $f:D\to D$ . This is a minimal model restriction. It is not a proof that every logical or dynamical system is unary.

R7. Stationarity, determinism, and memorylessness

The same total deterministic memoryless map $$f$$ governs adjacent quotient steps.

R8. Label equivariance

f\circ\sigma=\sigma\circ f.

R9. Quotient non-fixation

f\neq\operatorname{id}_D.

R9 requires the selected quotient to track a distinction that does not remain fixed. Event-token succession alone does not imply R9.

6. The finite classification

Lemma 1. The binary equivariant-map lemma

For $D=\{Y,N\}$ ,

\mathcal E(D^D) = \{\operatorname{id}_D,\sigma\}.

Proof. There are four total maps $D\to D$ .

$\operatorname{id}_D$ commutes with every map, hence with $\sigma$ .
$\sigma$ commutes with itself.
For $$c_Y$$ ,

c_Y\circ\sigma=c_Y, \qquad \sigma\circ c_Y=c_N,

so $$c_Y$$ is not equivariant. 4. Similarly,

c_N\circ\sigma=c_N, \qquad \sigma\circ c_N=c_Y,

so $$c_N$$ is not equivariant.

Therefore only identity and exchange remain. $\square$

Theorem 1. The logical-razor theorem

Under R5-R9,

\boxed{ \mathfrak R(D^D)=\{\sigma\} }.

Proof. By Lemma 1,

\mathcal E(D^D) = \{\operatorname{id}_D,\sigma\}.

R9 removes $\operatorname{id}_D$ . Hence

\mathcal N(\mathcal E(D^D)) = \{\sigma\}.

By Definition 7, this is $\mathfrak R(D^D)$ . $\square$

Corollary 1. The plus-minus elimination result

With $P=\operatorname{id}_D$ and $M=\sigma$ ,

P\notin\mathfrak R(D^D), \qquad M\in\mathfrak R(D^D).

Thus the intuitive answer is "minus" only after plus and minus have been explicitly formalized as identity and exchange and the selected model has explicitly required label symmetry and non-fixation.

Corollary 2. The minimal orbit

If $x_{n+1}=\sigma(x_n)$ , then

x_{n+2}=x_n, \qquad x_{n+1}\neq x_n.

The quotient orbit is a strict two-cycle. It is a minimal non-fixed reentry germ, not a chaotic system.

6.1 Where the theorem does its work

R9 openly removes identity. The proof therefore does not derive non-fixation from logic alone. Its nontrivial finite content is that label symmetry reduces all four unary maps to exactly two structural candidates:

\{\operatorname{id}_D,\sigma\}.

The selected non-fixed target then removes one of those two. The theorem is a conditional survivor theorem, not a derivation of motion from nothing.

7. From unique exchange to PR

Theorem 1 alone does not prove PR actuality. It proves that the only surviving map in the selected finite candidate class is $\sigma$ . To identify the result with PR, three distinctions are required.

7.1 Static form versus enacted occurrence

The equation

y=\sigma(x)

is a static mathematical relation. PR actuality requires

\operatorname{ActualStep}_W(x,y) \land y=\sigma(x).

The first conjunct supplies the selected actuality mode; the second classifies its minimal quotient form.

7.2 Exchange versus self-contained reentry

One exchange can terminate. Continued PR requires a sequence of actual exchanges in which the result position becomes the next argument position:

\operatorname{ActualStep}_W(x_n,x_{n+1}), \qquad x_{n+1}=\sigma(x_n).

No new external executor is introduced at each stage.

7.3 PR identification

In the Jia Baolong framework, self-contained enacted non-identity is called the PR actuality core. When its result re-enters the same non-fixed operation under R4b and R7, it becomes continued PR reentry.

7.4 PR is not a claim of classical inconsistency

The exchange orbit is mathematically consistent:

\sigma^2=\operatorname{id}_D.

No state is asserted to satisfy both $$x$$ and $\neg x$ at one fixed evaluation. "Paradox" in PR names the framework's enacted non-fixed self-reentry, not a derivation of the classical contradiction $p\land\neg p$ .

7.5 No circular use of PR

PR does not appear as a premise of Lemma 1 or Theorem 1. The finite derivation uses only the two-element quotient, label exchange, equivariance, and non-fixation. The PR name is applied afterward, when actual occurrence, internal closure, and result-reentry are added. Thus the paper does not assume PR in order to prove the unique exchange normal form.

Theorem 2. Conditional PR identification theorem

Let $W\in\mathfrak D_{\mathrm{act}}$ satisfy R0-R3, R4b, and R5-R9. Suppose the quotient sequence $$(x_n)$$ represents the successive relational positions governed by R7. Then

\operatorname{PRReentry}_W.

Proof. Theorem 1 yields $f=\sigma$ . R4b supplies an actual step at every represented stage, R7 supplies the same quotient operation, and the hypothesis identifies the quotient sequence with their successive relational positions. Therefore, for all $$n$$ ,

\operatorname{ActualStep}_W(x_n,x_{n+1}) \land x_{n+1}=\sigma(x_n).

By Definitions 8 and 9, $\operatorname{PRReentry}_W$ . $\square$

The theorem is conditional because R0-R3, R4b, R5-R9, and the quotient representation are visible premises. It does not derive actuality or indefinite continuation from pure syntax.

8. What the razor removes

The phrase "strip logic away" can otherwise conceal assumptions. The formal razor performs the following eliminations.

Candidate	Reason removed or retained
$$c_Y$$	Selects $$Y$$ as privileged; violates label equivariance
$$c_N$$	Selects $$N$$ as privileged; violates label equivariance
$\operatorname{id}_D$	Symmetric but fixed; violates quotient non-fixation
$\sigma$	Symmetric and non-fixed; retained
Binary or higher-arity operations	Outside R6; require a richer model class
Partial maps	Outside totality in R6-R7
Stochastic kernels	Outside determinism in R7
History-dependent rules	Outside memorylessness in R7
Nonstationary operations	Outside same-operation continuation in R7

The proof does not show that excluded classes are meaningless. It shows that they are not members of this minimal candidate class.

9. Countermodels and exact boundaries

9.1 Static complete history

A static structure may encode every event:

\operatorname{Encodes}(S,H).

Without an independent actuality condition, it does not follow that $$H$$ occurs. Such a model challenges R0, not the finite map theorem.

9.2 Single terminating flash

One actual exchange satisfies $\operatorname{PRCore}$ while violating R4a and R4b. A finite chain of two or more exchanges may satisfy R4a while violating R4b. Neither is a counterexample to the actuality core, but both block the infinite reentry claim.

9.3 External executor

An external machine can apply $\sigma$ . This violates R2. Including the machine in a larger universe transfers the origin question to that larger system.

9.4 Rootless actual order

An actual order with no least step violates rootedness. The paper does not prove rootless actuality impossible.

9.5 Stochastic continuation

A symmetric Markov kernel can be non-fixed, but it is not a total deterministic unary map. Theorem 1 does not classify it.

9.6 Higher-arity and higher-cardinality dynamics

A three-cycle on three labels is non-fixed and symmetric under a different group action. It lies outside R5-R6. The theorem cannot be applied before an effective two-class quotient is established.

9.7 Identity-labelled event stream

Distinct event tokens may all carry the same quotient label. The events can change while $f=\operatorname{id}_D$ . This shows that R9 is a model restriction on the chosen relevant quotient, not a consequence of token succession.

9.8 Static PR diagram

A graph of alternating labels is a static representation. It satisfies the map equation descriptively but does not provide $\operatorname{ActualStep}$ .

9.9 Arbitrary chaotic snapshot walk

A list of chaotic-looking snapshots may be merely encoded. If it actually occurs, its occurrence belongs to the selected actuality domain; its content-selection mechanism still requires separate analysis.

9.10 Autonomous toggle without semantic self-reference

An autonomous physical or abstract toggle can obey

x_{n+1}=\sigma(x_n)

without containing a truth predicate, liar sentence, or semantic self-reference. It does not refute Theorem 1. It shows instead that the finite map theorem alone cannot distinguish semantic paradox from any other enacted exchange. Calling the self-contained enacted normal form "PR" is therefore a framework-level ontological identification. Any stronger claim about semantic self-reference requires additional structure.

10. Dependency and proof-status ledger

Statement	Status
Actual existence is actual motion	Ontological thesis
Static encoding does not entail occurrence	Scope distinction
The origin model is rooted and self-contained	Model restriction
Continued reentry has an actual successor at every represented stage	Model restriction R4b
The first relevant quotient is binary and label-symmetric	Model restriction
Continuation is unary, total, deterministic, memoryless, and stationary	Model restriction
The selected quotient is non-fixed	Model restriction
The equivariant maps are identity and exchange	Derived finite result
The razor leaves exchange alone	Derived finite result
Enacted exchange is the PR actuality core	Framework definition
Continued internal exchange is PR reentry	Conditional architecture
Our observable universe satisfies the relevant R0-R9 conditions, including R4b for indefinite reentry	Empirical bridge, open
A concrete Rule realizes rich ER-LE dynamics	Open construction

11. Position inside PR-ER-LE

The theorem reaches only a minimal PR normal form. The larger architecture is

\begin{aligned} &\text{PR actuality core}\to\text{continued PR reentry}\\ &\quad\to\text{ER configuration evolution}\\ &\quad\to\text{LE local resolution}\\ &\quad\to\text{Rule-dependent complex dynamics}. \end{aligned}

PR supplies the actuality-bearing non-fixed core within the framework. ER denotes the evolving relational configuration. LE denotes local resolution of conflicts or incompatibilities that arise in the evolving configuration. A concrete Rule determines how many relational positions or nodes appear, connect, disconnect, persist, or vanish.

The logical-razor theorem does not determine that Rule.

12. Chaos and upward emergence

The strict two-cycle

x_{n+1}=\sigma(x_n)

is not chaotic. Chaos requires a richer ER state space $\mathcal X$ and a Rule such as

X_{n+1}=\mathcal R(X_n,\eta_n),

where $\eta_n$ may represent an internally actualized PR outcome rather than an externally supplied pseudorandom number.

12.1 Five levels that must not be collapsed

Actuality: a transition occurs rather than merely being encoded.
Dynamics: actual transitions form an ordered evolution.
Chaos: the evolution has specified sensitivity, recurrence, and orbit-complexity properties.
Structured complexity: persistent or metastable motifs survive the variation.
Upward emergence: motifs compose into interaction, proto-chemistry, life-like organization, agency, and reflexive inquiry.

None of these levels follows merely from naming the preceding one.

In a pregeometric setting, candidate chaos diagnostics include:

damage spreading under a small relational perturbation;
growth in distinguishable future configurations;
nontrivial recurrence without short-period collapse;
stretching-and-folding analogues in graph or rewrite space;
bounded or metastable regimes;
multiscale temporal irregularity;
robust Rule dependence.

Upward emergence requires more than chaos:

\begin{aligned} \text{PR} &\to \text{continuing ER with LE}\\ &\to \text{Rule-dependent chaos or criticality}\\ &\to \text{persistent localized motifs}\\ &\to \text{reproducible interactions}\\ &\to \text{proto-chemistry}\\ &\to \text{life-like organization}\\ &\to \text{agency}\\ &\to \text{reflexive origin research}. \end{aligned}

Every arrow can fail. Dynamics may collapse to a fixed point or short cycle, disperse without bound, become maximally noisy, form brittle structures, or become computationally inaccessible. PR continuation does not guarantee macroscopic survival.

12.2 Arrow-by-arrow proof-status matrix

Transition	Additional conditions required	Representative failure
PR actuality core $\to$ continued reentry	R4b, stationarity, result-reentry	Isolated flash or finite chain
Continued reentry $\to$ ER evolution	Rich relational state space and update Rule	Bare two-cycle with no expanding configuration
ER evolution $\to$ chaos or criticality	Sensitivity, recurrence, orbit growth, bounded regime	Fixed point, short cycle, dispersion, or maximal noise
Chaos $\to$ persistent motifs	Localization, invariants, metastability, repair	Structures dissolve faster than they persist
Motifs $\to$ reproducible interaction	Propagation channels and repeatable collision outcomes	Motifs remain isolated or collisions erase them
Interaction $\to$ proto-chemistry	Binding, composition, selective stability, conserved relations	No cumulative compounds or reaction closure
Proto-chemistry $\to$ life-like organization	Autocatalysis, heredity, variation, selection, bounded resources	Replication absent or information not retained
Life-like organization $\to$ agency and reflexive inquiry	Memory, internal modelling, goal-like regulation, abstraction	Purely reactive organization without self-model

Only the first row is directly connected to the present logical-razor result, and even that row uses additional continuation premises. All later rows are conditional research programs.

13. Relation to existing self-reference work

Lawvere gave a categorical form of diagonal and fixed-point arguments [1]. Varela developed a calculus explicitly directed at self-referential situations [2]. Kripke studied fixed-point constructions for truth and semantic paradox [3]. Grim showed that specific fuzzy self-referential semantics can exhibit attractors, fractals, and chaos [4].

These works establish important mathematical and logical contexts for self-reference. None is used here as a proof that actuality exists, that our universe begins with PR, or that exchange is universally unique. The present finite theorem is elementary and narrower: it classifies the equivariant non-fixed total unary maps on a two-element quotient. Its ontological interpretation belongs to the explicitly stated Jia Baolong framework.

14. Open problems

Can retrospective binary symmetry R5 be derived from weaker relational conditions?
Can minimal unary closure R6 be justified without treating it as a model selection?
Which alternative minimal classes survive when stochasticity, memory, or higher arity is admitted?
How can a two-cycle quotient be lifted to a high-dimensional ER state space without inserting an external executor?
Which no-medium topological Rules yield bounded chaos, strange attractors, or self-organized criticality?
What invariants support matter-like motifs and reproducible interaction?
What observations could connect any such model to our universe?

15. Conclusion

The plus-minus question is useful because it lets the reader imagine preservation and change before any technical machinery appears. But the proof begins only after the image is replaced by a model.

For a two-class quotient with no privileged label, there are four total unary maps. Equivariance removes the two constants. Non-fixation removes identity. Exchange alone remains:

\boxed{ \mathfrak R(D^D)=\{\sigma\} }.

This is the irreducible mathematical residue of the selected razor. When exchange is not merely written but actually enacted, when its result becomes the next relational position, and when no external executor is admitted, the Jia Baolong framework identifies the result as the PR actuality core in continued reentry.

The strongest defensible conclusion is therefore:

Within the stated rooted, binary, label-symmetric, deterministic, memoryless, stationary, and non-fixed origin model, exchange is the unique surviving unary operation. Under the framework's actuality and reentry interpretation, that unique operation is the minimal PR form of a universe's first continuing motion.

The concrete Rule, the emergence of chaos and matter-like structure, and the empirical identification of our universe remain open.

第二部分　中文

宇宙本源的不可约之动：PR的逻辑剃刀定理

一个公理化证明：剔除静态同一后，唯有交换存留

作者： Jia, Baolong（贾宝龙）
身份： 独立研究者
文献类型： 英中双语公理化预印本
版本： 1.0
日期： 2026年7月
体系： 贾宝龙PR-ER-LE生成本体论
文档指纹： JBL-PRR-20260723-V10-1B9D4E

摘要

当物质、空间、物理时间、外部执行器、先在对象、具有优先级的真值标签以及静态同一都被拿走以后，宇宙本源处还能留下什么？本文在一个边界严格的极小本源模型中给出条件性的数学答案。论文以一个正负号问题启动直觉：如果肯定保持当前状态，而否定交换当前状态，哪一个还能承担第一次现实运动？这一想象不作为证明。

设 $D=\{Y,N\}$ 是第一次现实差异的事后二元商，两个标签没有内在优先级。令 $\sigma$ 交换两个标签。总一元映射 $D\to D$ 只有四个：恒等、交换以及两个常值映射。标签等变性剔除常值映射；明示的非固定条件剔除恒等。因此逻辑剃刀算子

\mathfrak R(D^D) = \{f\in D^D\mid f\sigma=\sigma f,\ f\neq\operatorname{id}_D\}

具有唯一结果：

\mathfrak R(D^D)=\{\sigma\}.

这个有限分类是本文的数学定理。它不会让静态公式自行执行。现实性来自本文所选的实际转换本体论，并由原始谓词 $\operatorname{ActualStep}_W$ 表示。在另外加入有根性、内部继续、稳定性和结果回入以后，实际发生的交换被识别为PR现实性核心及其持续回入。因此，本文只在明示的二元、确定、无记忆、标签对称、非固定模型类中证明交换的唯一性。它不证明未定义必然实际化，不证明所有动力都是二元的，也不证明PR单独产生混沌、物质、生命或我们的可观测宇宙。

证明地位声明

本文包含三种不同地位的陈述。

范围与本体： 本源问题被限定为现实发生；在贾宝龙体系内部，现实存在与实际转换同一。
有限推导： 在明示的二元映射条件下，交换是唯一存留的操作。
条件性架构： 如果交换形态实际发生、内部继续并将结果重新输入，它被识别为PR；从PR走向ER、LE、混沌和涌现还需要额外结构与具体Rule。

只有第2项是从映射假设推出的中性有限推导。第1项是体系承诺，第3项是条件性本体解释。

C1　低台阶：两个符号的直觉

想象一个系统里只有正号与负号。必须拿走一个。最后留下哪一个？

如果正号表示“保持已经标出的内容”，它对应：

$$ P(x)=x. $$

如果负号表示“不保持当前标记”，它对应：

M(x)=\sigma(x).

这个画面非常直接：保持可以描述一个完成状态，交换则提供下一次差异。但这个画面本身不证明任何事情。写在纸上的负号是静态的；算术减法、逻辑否定、标签交换和实际运动也不会自动同一。本文的任务，是用有限分类定理替换这个画面，然后准确写明：在把该定理解释为宇宙第一拍的PR运动以前，还需要哪些额外假设。

因此，正负号只是入口，不是终点。

C2　修正后的本源问题

不受限制地追问“哪些结构存在”，会把静态结构、完整历史、数学编码以及ALL中的任意成员全部纳入。本文的问题更窄：

在有根、自包含、实际发生且能够继续的第一差异模型中，剔除标签优先与固定以后，唯一的极小一元正规形是什么？

这个修正阻止两种范畴错误。

第一，运动的静态表示不因此成为运动：

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

第二，对可能映射的分类不会让其中某个映射成为现实：

f\in D^D \nRightarrow \operatorname{ActualStep}_W.

证明分类的是形态；体系另外规定所选的现实性方式。

C3　目标域与模型边界

令 $\mathfrak D_{\mathrm{act}}$ 表示所选的现实宇宙类。本文只考虑满足有根本源解释的 $W\in\mathfrak D_{\mathrm{act}}$ ：不允许先在实际事件、物质基底、物理时间或外部现实执行器充当第一拍的解释。

本文的定理不是关于：

每一个数学结构；
每一种逻辑；
每一种元数；
每一个随机过程；
每一个非平稳或依赖历史的动力；
每一个静态块历史；
每一种关于存在的说明。

它只是针对一个明示选择的极小模型类的唯一性定理。

C4　原始项与记号

定义C1：实际步

\operatorname{ActualStep}_W(a,b)

表示宇宙 $$W$$ 中从关系位置 $$a$$ 到关系位置 $$b$$ 的实际转换。该谓词在预期本体解释中是原始项；把它写进形式语言不会制造实际发生。

定义C2：事后商

第一次现实差异在发生以后被表示为：

D=\{Y,N\}.

$$Y,N$$ 没有内在意义、价值或优先级。交换两个标签的映射为：

\sigma(Y)=N, \qquad \sigma(N)=Y, \qquad \sigma^2=\operatorname{id}_D.

定义C3：肯定与否定正规形

极小肯定形态为：

P:=\operatorname{id}_D,

极小否定形态为：

M:=\sigma.

这些定义把开场直觉形式化；它们不主张数学中每一个正负号都具有这一意义。

定义C4：候选映射空间

\mathcal F:=D^D

是所有总一元映射 $D\to D$ 的集合，恰有四个元素：

\mathcal F = \{\operatorname{id}_D,\sigma,c_Y,c_N\},

其中对所有 $x\in D$ ：

c_Y(x)=Y, \qquad c_N(x)=N.

定义C5：等变筛选

\mathcal E(\mathcal F) := \{f\in\mathcal F\mid f\circ\sigma=\sigma\circ f\}.

等变意味着：先交换 $$Y,N$$ 再应用 $$f$$ ，或先应用 $$f$$ 再交换标签，结构结果没有差异。

定义C6：非固定筛选

\mathcal N(\mathcal G) := \{f\in\mathcal G\mid f\neq\operatorname{id}_D\}.

非固定是明示的模型限制，不能从存在不同事件标记这一点直接推出。

定义C7：逻辑剃刀算子

\mathfrak R(\mathcal F) := \mathcal N(\mathcal E(\mathcal F)).

剃刀先去除内在标签偏好，再去除静态恒等。

定义C8：PR现实性核心

\operatorname{PRCore}_W(x,y) := \operatorname{ActualStep}_W(x,y) \land y=\sigma(x).

定义C9：持续PR回入

\operatorname{PRReentry}_W := \exists (x_n)_{n\in\mathbb N}\; \forall n\in\mathbb N,\; \operatorname{PRCore}_W(x_n,x_{n+1}).

该定义把现实发生、交换、继续和结果回入结合起来；它强于一次孤立交换。

C5　公理与模型限制

R0　目标域选择

解释对象是现实发生的宇宙。静态描述不会仅因编码完整历史而进入所选域。

R1　存在-运动同一

在所选体系内：

\operatorname{ActualExistence}_W \equiv \operatorname{ActualTransition}_W.

这是体系的本体命题，不是中性逻辑定理。

R2　有根性与外部执行器排除

生成先后中存在最小的第一拍胚。不允许先在实际事件、物质基底、物理时间或外部现实执行器。

R3　构成性关系

根部关系项是由正在发生的关系所区分的位置，不是两个先在现实对象后来附加关系。

R4a　极小继续

宇宙不是一次终止闪现。至少一个实际步的结果位置必须参与后续实际步。

R4b　迭代继续

对于更强的持续PR回入主张，被表示的商序列中每一个结果位置都必须参与下一实际步：

\forall n\in\mathbb N,\; \operatorname{ActualStep}_W(x_n,x_{n+1}).

R4b不能从R4a推出。R4a只排除一次孤立闪现；R4b另外排除每一条有限终止链。

R5　事后二元对称

第一次现实差异允许二元商 $D=\{Y,N\}$ ，交换标签不会改变内在结构。

R6　极小一元闭合

在所选商层，继续由总一元映射 $f:D\to D$ 表示。这是极小模型限制，不是关于所有逻辑或动力系统均为一元的证明。

R7　稳定、确定与无记忆

相邻商步骤由同一个总的、确定性、无记忆映射 $$f$$ 支配。

R8　标签等变

f\circ\sigma=\sigma\circ f.

R9　商非固定

f\neq\operatorname{id}_D.

R9要求所选商追踪不保持固定的差异。事件标记的先后本身不能推出R9。

C6　有限分类

引理C1　二元等变映射引理

对于 $D=\{Y,N\}$ ：

\mathcal E(D^D) = \{\operatorname{id}_D,\sigma\}.

证明。 总映射 $D\to D$ 只有四个。

$\operatorname{id}_D$ 与每个映射交换，因此与 $\sigma$ 交换。
$\sigma$ 与自身交换。
对 $$c_Y$$ ：

c_Y\circ\sigma=c_Y, \qquad \sigma\circ c_Y=c_N,

因此 $$c_Y$$ 不等变。 4. 同理：

c_N\circ\sigma=c_N, \qquad \sigma\circ c_N=c_Y,

因此 $$c_N$$ 不等变。

故只剩恒等与交换。 $\square$

定理C1　逻辑剃刀定理

在R5-R9下：

\boxed{ \mathfrak R(D^D)=\{\sigma\} }.

证明。 由引理C1：

\mathcal E(D^D) = \{\operatorname{id}_D,\sigma\}.

R9剔除 $\operatorname{id}_D$ ，因此：

\mathcal N(\mathcal E(D^D)) = \{\sigma\}.

由定义C7，这就是 $\mathfrak R(D^D)$ 。 $\square$

推论C1　正负号消元结果

令 $P=\operatorname{id}_D$ 、 $M=\sigma$ ，则：

P\notin\mathfrak R(D^D), \qquad M\in\mathfrak R(D^D).

因此，只有在把正负号明确形式化为恒等与交换，并明确要求标签对称及非固定以后，直觉问题的答案才是“负号”。

推论C2　极小轨道

若 $x_{n+1}=\sigma(x_n)$ ，则：

x_{n+2}=x_n, \qquad x_{n+1}\neq x_n.

该商轨道是严格二周期，是极小非固定回入胚，不是混沌系统。

C6.1　定理的工作实际发生在哪里

R9公开地剔除恒等。因此，证明并没有从纯逻辑中推出非固定。它的非平凡有限内容是：标签对称把全部四个一元映射压缩为恰好两个结构候选：

\{\operatorname{id}_D,\sigma\}.

随后，所选的非固定目标再剔除其中一个。该定理是条件性的存留定理，不是“从无推导运动”的定理。

C7　从唯一交换到PR

定理C1本身不证明PR现实性。它只证明在所选有限候选类中，唯一存留的映射是 $\sigma$ 。要把结果识别为PR，必须保持三个区分。

C7.1　静态形态与实际发生

方程

y=\sigma(x)

是静态数学关系。PR现实性要求：

\operatorname{ActualStep}_W(x,y) \land y=\sigma(x).

第一个合取项提供所选现实性方式；第二个合取项分类其极小商形态。

C7.2　交换与自包含回入

一次交换可以终止。持续PR要求一串实际交换，而且结果位置成为下一步的输入位置：

\operatorname{ActualStep}_W(x_n,x_{n+1}), \qquad x_{n+1}=\sigma(x_n).

每一步都不增加新的外部现实执行器。

C7.3　PR识别

在贾宝龙体系中，自包含、实际发生的非同一被称为PR现实性核心。当其结果在R4b与R7下重新进入同一非固定操作时，它成为持续PR回入。

C7.4　PR不是经典矛盾主张

交换轨道在数学上是一致的：

\sigma^2=\operatorname{id}_D.

本文没有断言某个状态在同一次固定求值中同时满足 $$x$$ 与 $\neg x$ 。PR中的“悖论”指体系所说的实际非固定自回入，不是对经典矛盾 $p\land\neg p$ 的推导。

C7.5　没有循环使用PR

PR没有作为引理C1或定理C1的前提出现。有限推导只使用二元素商、标签交换、等变性与非固定。只有在加入实际发生、内部闭合及结果回入以后，才把PR名称应用于该正规形。因此，本文没有为了证明唯一交换形态而预先假定PR。

定理C2　条件性PR识别定理

设 $W\in\mathfrak D_{\mathrm{act}}$ 满足R0-R3、R4b及R5-R9，并且商序列 $$(x_n)$$ 表示由R7支配的连续关系位置，则：

\operatorname{PRReentry}_W.

证明。 定理C1给出 $f=\sigma$ 。R4b在每一个被表示的阶段提供实际步，R7提供同一个商操作，假设则把商序列识别为这些实际步的连续关系位置。因此对所有 $$n$$ ：

\operatorname{ActualStep}_W(x_n,x_{n+1}) \land x_{n+1}=\sigma(x_n).

由定义C8与C9， $\operatorname{PRReentry}_W$ 。 $\square$

该定理是条件性的，因为R0-R3、R4b、R5-R9及商表示都是可见前提；它不从纯语法中推出现实性或无限继续。

C8　剃刀实际剔除了什么

“把逻辑逐层拿走”可能掩盖前提。形式剃刀执行以下消元：

候选	被剔除或保留的原因
$$c_Y$$	偏爱 $$Y$$ ，违反标签等变
$$c_N$$	偏爱 $$N$$ ，违反标签等变
$\operatorname{id}_D$	对称但固定，违反商非固定
$\sigma$	对称且非固定，保留
二元或更高元操作	在R6之外，需要更丰富的模型类
部分映射	在R6-R7的总映射要求之外
随机核	在R7的确定性之外
依赖历史的规则	在R7的无记忆性之外
非平稳操作	在R7的同操作继续之外

证明不主张被排除的类别没有意义；它只说明它们不属于该极小候选类。

C9　反模型与准确边界

C9.1　静态完整历史

静态结构可以编码每一个事件：

\operatorname{编码}(S,H).

若没有独立现实性条件，不能推出 $$H$$ 发生。它挑战R0，而不挑战有限映射定理。

C9.2　一次终止闪现

一次实际交换满足 $\operatorname{PRCore}$ 却违反R4a与R4b。包含两次或更多交换的有限链可以满足R4a却违反R4b。二者都不是现实性核心的反例，但都会阻断无限回入主张。

C9.3　外部执行器

外部机器可以应用 $\sigma$ 。这违反R2。若把机器纳入更大宇宙，本源问题转移到更大系统。

C9.4　无根现实顺序

没有最小步骤的现实顺序违反有根性。本文不证明无根现实不可能。

C9.5　随机继续

对称马尔可夫核可以非固定，但不是总的确定性一元映射。定理C1不分类它。

C9.6　高元与高基数动力

三个标签上的三循环可以非固定，并在另一群作用下对称。它位于R5-R6之外；在建立有效二元商以前，不能应用本文定理。

C9.7　恒等标签事件流

不同事件标记可能都携带同一个商标签。即使 $f=\operatorname{id}_D$ ，事件仍可变化。这说明R9是对所选相关商的模型限制，而不是事件先后的结果。

C9.8　静态PR图

交替标签图是静态表示。它在描述上满足映射方程，却不提供 $\operatorname{ActualStep}$ 。

C9.9　任意混沌快照游走

看起来混沌的快照列表可能只是编码。若它实际发生，其发生属于所选现实域；其内容选择机制仍需单独分析。

C9.10　没有语义自指的自主翻转器

一个自主的物理或抽象翻转器可以满足：

x_{n+1}=\sigma(x_n)

但不包含真理谓词、说谎者句或语义自指。它不反驳定理C1，而是说明有限映射定理本身不能区分语义悖论与其他实际交换。把自包含、实际发生的该正规形称为PR，是体系层面的本体识别；任何更强的语义自指主张都需要额外结构。

C10　依赖与证明地位账本

陈述	地位
现实存在是实际运动	本体命题
静态编码不蕴含实际发生	范围区分
本源模型有根且自包含	模型限制
持续回入在每一个被表示阶段都有下一实际步	模型限制R4b
第一个相关商是二元且标签对称	模型限制
继续是一元、总、确定、无记忆且稳定的	模型限制
所选商非固定	模型限制
等变映射只剩恒等与交换	已推导有限结果
剃刀只留下交换	已推导有限结果
实际发生的交换是PR现实性核心	体系定义
持续内部交换是PR回入	条件性架构
我们的可观测宇宙满足相关R0-R9条件，其中无限回入还包括R4b	经验桥，开放
具体Rule实现丰富ER-LE动力	开放构造

C11　在PR-ER-LE中的位置

本文定理只到达极小PR正规形。更大架构为：

\begin{aligned} &\text{PR现实性核心}\to\text{持续PR回入}\\ &\quad\to\text{ER配置演化}\\ &\quad\to\text{LE局部解决}\\ &\quad\to\text{依赖Rule的复杂动力}. \end{aligned}

在体系内部，PR提供承载现实性的非固定核心；ER表示演化中的关系配置；LE表示对演化配置中冲突或不相容的局部解决。具体Rule决定多少关系位置或节点出现、连接、断开、保持或消失。

逻辑剃刀定理不决定这个Rule。

C12　混沌与向上涌现

严格二周期

x_{n+1}=\sigma(x_n)

不是混沌。混沌需要更丰富的ER状态空间 $\mathcal X$ 以及如下Rule：

X_{n+1}=\mathcal R(X_n,\eta_n),

其中 $\eta_n$ 可以代表内部实际化的PR结果，而不是外部提供的伪随机数。

C12.1　不能混为一谈的五个层级

现实性： 转换实际发生，而不是仅被编码。
动力： 实际转换形成有序演化。
混沌： 演化满足明示的敏感性、回归和轨道复杂性条件。
结构复杂性： 持久或亚稳基元能够在变化中存留。
向上涌现： 基元进一步组合成相互作用、原化学、类生命组织、能动性及反身研究。

仅仅命名前一层，不会推出后一层。

在前几何环境中，候选混沌诊断包括：

微小关系扰动造成的损伤传播；
可区分未来配置的增长；
不坍缩为短周期的非平凡回归；
图空间或重写空间中的拉伸-折叠类似物；
有界或亚稳区间；
多尺度时间不规则性；
对Rule的稳健依赖。

向上涌现需要的不只是混沌：

\begin{aligned} \text{PR} &\to \text{带LE的持续ER}\\ &\to \text{依赖Rule的混沌或临界性}\\ &\to \text{持久局域基元}\\ &\to \text{可重复相互作用}\\ &\to \text{原化学}\\ &\to \text{类生命组织}\\ &\to \text{能动性}\\ &\to \text{反身本源研究}. \end{aligned}

每一个箭头都可能失败。动力可能坍缩到固定点或短周期、无限弥散、成为最大噪声、形成脆弱结构，或在计算上不可达。PR继续不保证宏观结构存活。

C12.2　逐箭头证明地位矩阵

转换	所需附加条件	代表性失败方式
PR现实性核心 $\to$ 持续回入	R4b、稳定性、结果回入	孤立闪现或有限链
持续回入 $\to$ ER演化	丰富关系状态空间与更新Rule	只有二周期，没有膨胀配置
ER演化 $\to$ 混沌或临界性	敏感性、回归、轨道增长、有界区间	固定点、短周期、弥散或最大噪声
混沌 $\to$ 持久基元	局域化、不变量、亚稳性、修复	结构消散快于保持
基元 $\to$ 可重复相互作用	传播通道与可重复碰撞结果	基元彼此隔离或碰撞即消失
相互作用 $\to$ 原化学	结合、组合、选择稳定与关系守恒	无累积化合物或反应闭合
原化学 $\to$ 类生命组织	自催化、遗传、变异、选择与有界资源	无复制或信息不能保持
类生命组织 $\to$ 能动性及反身研究	记忆、内部建模、目标式调节与抽象	只有反应，没有自我模型

只有第一行与本文逻辑剃刀结果直接相连，而且仍使用额外继续前提；其余各行都是条件性研究计划。

C13　与既有自指研究的关系

Lawvere给出了对角论证与不动点论证的范畴形式[1]；Varela发展了直接处理自指情形的演算[2]；Kripke研究了真理及语义悖论中的不动点构造[3]；Grim证明某些模糊自指语义能够出现吸引子、分形和混沌[4]。

这些工作为自指提供重要数学与逻辑背景。本文不使用它们来证明现实性存在、本宇宙始于PR或交换在所有系统中普遍唯一。本文的有限定理更初等也更窄：它只分类二元商上的等变、非固定、总一元映射；其本体解释属于明示的贾宝龙体系。

C14　开放问题

能否从更弱的关系条件推导R5的事后二元对称？
能否不把R6作为模型选择，而进一步证明极小一元闭合？
引入随机、记忆或高元后，哪些替代极小模型仍能存留？
如何在不插入外部执行器的情况下，把二周期商提升为高维ER状态空间？
哪些无介质拓扑Rule能产生有界混沌、奇异吸引子或自组织临界性？
哪些不变量支持类物质基元及可重复相互作用？
什么观测能够把这类模型与我们的宇宙连接起来？

C15　结论

正负号问题的价值，在于让读者在技术机器出现之前就想象“保持”与“改变”。但只有当这个画面被模型替换以后，证明才真正开始。

对于没有优先标签的二元商，总一元映射只有四个；等变性剔除两个常值映射，非固定剔除恒等，唯一剩下交换：

\boxed{ \mathfrak R(D^D)=\{\sigma\} }.

这是所选剃刀留下的不可约数学剩余。当交换不只是被写下，而是实际发生；当结果成为下一个关系位置；当外部执行器被排除时，贾宝龙体系把它识别为持续回入中的PR现实性核心。

因此，最强而准确的结论是：

在明示的有根、二元、标签对称、确定、无记忆、稳定且非固定的本源模型中，交换是唯一存留的一元操作；在体系的现实性与回入解释下，这个唯一操作就是宇宙第一次持续运动的极小PR形态。

具体Rule、混沌与类物质结构的涌现，以及本宇宙的经验识别，仍然开放。

Publication declarations / 发表声明

Authorship / 作者。 Jia, Baolong is the sole named author and is responsible for the framework, argument, terminology, and final text. / Jia, Baolong（贾宝龙）为唯一署名作者，并对体系、论证、术语与最终文本负责。

AI-assisted preparation / AI辅助。 OpenAI Codex assisted with manuscript structuring, mathematical notation, bilingual editing, Markdown and PDF production, and four rounds of internal adversarial review. It is not an author, and the reviews are not external peer review. / OpenAI Codex协助论文结构、数学记号、双语编辑、Markdown与PDF制作，以及四轮内部对抗评审；它不是作者，相关评审也不是外部同行评审。

Data and code / 数据与代码。 The finite theorem does not rely on an empirical dataset or analysis code. / 本文有限定理不依赖经验数据集或分析代码。

Funding, competing interests, and licence / 资助、利益冲突与许可。 These fields require the author's explicit confirmation before public deposit. No declaration is inferred on the author's behalf. / 公开存档前，这些字段须由作者明确确认；本文不代替作者作出声明。

References / 参考文献

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. Springer. https://doi.org/10.1007/BFb0080769
Varela, F. J. (1975). "A calculus for self-reference." International Journal of General Systems, 2(1), 5-24. https://doi.org/10.1080/03081077508960828
Kripke, S. (1975). "Outline of a theory of truth." The Journal of Philosophy, 72(19), 690-716. https://doi.org/10.2307/2024634
Grim, P. (1993). "Self-reference and chaos in fuzzy logic." IEEE Transactions on Fuzzy Systems, 1(4), 237-253. https://doi.org/10.1109/91.251728
Gupta, A., and Belnap, N. (1993). The Revision Theory of Truth. MIT Press.
Devaney, R. L. (1989). An Introduction to Chaotic Dynamical Systems (2nd ed.). Addison-Wesley.
Jia, Baolong. (2026). The Ontology of Self-Reference: From Static Tautology to Cosmic Engine. Zenodo. https://doi.org/10.5281/zenodo.19389428
Jia, Baolong. (2026). Jia Baolong's First Law of the Universe: The Absolute Dual-Paradigm Axiomatic Foundation. Zenodo. https://doi.org/10.5281/zenodo.19289833
Jia, Baolong. (2026). The JiaBaolong Universal Axiom System: Two Axioms, One Universe. Zenodo. https://doi.org/10.5281/zenodo.19440952

Candidate	Reason removed or retained
$\(c_Y\)$	Selects $\(Y\)$ as privileged; violates label equivariance
$\(c_N\)$	Selects $\(N\)$ as privileged; violates label equivariance
$\operatorname{id}_D$	Symmetric but fixed; violates quotient non-fixation
$\sigma$	Symmetric and non-fixed; retained
Binary or higher-arity operations	Outside R6; require a richer model class
Partial maps	Outside totality in R6-R7
Stochastic kernels	Outside determinism in R7
History-dependent rules	Outside memorylessness in R7
Nonstationary operations	Outside same-operation continuation in R7

候选	被剔除或保留的原因
$\(c_Y\)$	偏爱 $\(Y\)$ ，违反标签等变
$\(c_N\)$	偏爱 $\(N\)$ ，违反标签等变
$\operatorname{id}_D$	对称但固定，违反商非固定
$\sigma$	对称且非固定，保留
二元或更高元操作	在R6之外，需要更丰富的模型类
部分映射	在R6-R7的总映射要求之外
随机核	在R7的确定性之外
依赖历史的规则	在R7的无记忆性之外
非平稳操作	在R7的同操作继续之外