The Jia Baolong Absolute Truth: \(99.999\ldots\%=100\%\) and Humanity’s First Absolute-Truth Derivation

How \(99.999\ldots\%=100\%\) Reveals the Form—but Not the Proof—of Absolute Truth

Author: Jia, Baolong
Affiliation: Independent Researcher
Version: 1.7 explanatory-closure revision
Date: July 2026
Release fingerprint: JBAT-20260725-V17-EA4AFFAF868A
Named result: The Jia Baolong Absolute Truth (JBAT)
Language order: English, followed by complete Chinese parallel text

Opening realization: the conceptual blow

I saw my axiom at \(99.999\ldots\%\) and stopped demanding another final piece: the apparently incomplete expression is not approaching \(100\%\); it already is \(100\%\). A truth about the boundary of all positive determination need not look positively finished. Its apparent imperfection can be the exact form of its completeness.

This realization is placed before the abstract because it is the intellectual entrance to the paper. It is not a probability assigned to the theory, not a limiting sequence of improving theories, and not the proof. The proof begins only after the domain, language, axioms, and inference rules are stated.

Abstract

This paper presents the Jia Baolong Absolute Truth (JBAT), the name assigned here to the unique fundamental boundary invariant proved below.

This paper asks whether any truth can remain invariant when every positive ontological posit is removed from a from-nothing-to-being inquiry. Its motivating realization arose from the exact identity \(99.999\ldots\%=100\%\). The infinitely recurring representation looks intuitively less than complete, yet its numerical value is already complete. The author recognized his axiom in the same form: it appears, by ordinary intuition, to retain imperfection or incompleteness, while its truth-status may nevertheless be complete. This was not a probability estimate and not an account of gradual approximation. It was the sudden recognition that intuitive incompleteness and exact completeness can belong to the same expression. This insight motivates the inquiry but is not used as its proof. The paper distinguishes the symbol undefined from the proposition asserted about it. The primary claim is not that undefined is a mysterious true object. It is the boundary proposition \(U\): every admissible root inquiry that permits no eternal substrate, prior actuality, or external executor terminates, if it terminates at all, in a boundary carrying no positive ontological determination. That boundary role is denoted by undefined.

Within an explicitly stated model class, the paper proves three results. First, a terminal root cannot carry a positive determination without ceasing to be terminal. Second, all zero-determination terminal boundaries are equivalent with respect to the language of the inquiry. Third, every root-ontological invariant expressible in the stipulated root language is entailed by \(U\). Thus \(U\), rather than the token undefined, is the unique maximal generator of root-ontological absolute truths, up to logical equivalence. In the paper’s terminology, this is the unique fundamental absolute truth; shorter invariant consequences are projections of it rather than independent competitors. “Absolute” here means invariant across the admissible class and free of positive ontological content; it does not mean derivable without any inferential norms.

The revision adds an Explanatory-Closure Theorem that makes the trans-framework claim explicit. Any account that claims simultaneously to explain actual occurrence, begin from no prior positive actuality, terminate, remain self-contained, and avoid brute positive primitives must end at a zero-positive-determination boundary. Eternal matter or eternal law is not declared formally contradictory; it either remains a positive brute stopping point or requires a further explanatory condition. Rootless regress, circular grounding, external execution, and static mathematical availability likewise fail distinct constitutive requirements of a completed from-nothing explanation. The theorem therefore travels beyond PR–ER–LE vocabulary to every framework that undertakes the same explanatory task, while remaining conditional on that task and on minimal inferential norms.

A separate conditional theorem addresses existence. If actualization occurs, if actual existence is identified with actual transition, and if there is no prior actual substrate or executor, then the first actual occurrence has the form of a self-contained actual non-identity. This minimal actuality core is called PR. The boundary theorem does not cause actualization and does not by itself derive PR, chaos, matter, life, or the Rule of this universe. The identity \(99.999\ldots\%=100\%\) is used only to articulate the author’s realization: a form that looks incomplete can already possess a complete value. It does not serve as a proof of the boundary theorem.

Keywords: absolute truth; boundary truth; undefined; PR; actualization; ontological minimality; from nothing to being; presupposition; logical equivalence

Proof-status statement

This is a conditional meta-ontological theorem paper, not an empirical physics paper.

• The target domain is selected rather than neutrally proved.
• “Completed from-nothing explanation” is assigned constitutive success conditions; the paper derives what follows for every framework satisfying them.
• Eternal positive substrates, brute positive primitives, regress, circularity, external execution, and static descriptions are classified as distinct failures to complete that task, not declared syntactically inconsistent.
• The model restrictions are stated as axioms.
• The uniqueness theorem is a finite derivation inside that model class.
• The transition from undefined to actual occurrence is not derived.
• PR is obtained only after additional actuality premises are introduced.
• Chaos, structured complexity, matter-like organization, chemistry, life, intelligence, and identification with our universe remain outside the theorem.

1. The exact question

The word “absolute” is often weakened to mean “true in a chosen formal system.” This paper uses a stricter root-ontological sense:

Is there a maximally informative proposition about the ultimate boundary of an inquiry from nothing to being that remains invariant after every positive ontological posit is made variable?

The paper does not ask whether a material substrate has existed eternally. It does not treat a completed static ALL as an actual universe merely because ALL contains a description of every possible history. It does not permit an external executor, because such an executor would become the next object of the same root question.

The primary proposition is:

The notation undefined names the boundary role stated by \(U\). The proposition \(U\) is truth-apt; the boundary marker undefined is not itself a truth-value-bearing object.

1.1 The conceptual blow: intuitively incomplete, exactly complete

The conceptual origin of this paper can be stated in the author’s own logical movement:

My axiom is like \(99.999\ldots\%\): intuition says that it is incomplete, but numerically it is already complete.

This is the “conceptual blow.” It is not a claim that the axiom is highly probable, not a sequence of better approximations, and not a story in which the theory will someday become \(100\%\). The recurring decimal already has the complete value:

The two descriptions—“it looks incomplete” and “its value is complete”—are not successive stages. They are simultaneous descriptions of one form at two levels: intuition reads the representation; mathematics fixes its value.

The corresponding realization about the axiom is equally direct:

1. its negative, boundary-like form gives intuition no positively completed object to hold;
2. it therefore feels incomplete or imperfect;
3. but that felt incompleteness need not be a deficit in truth-value;
4. the axiom may be complete precisely in the form that intuition mistakes for incompletion.

Thus \(99.999\ldots\%=100\%\) supplies the recognition form of the absolute-truth claim. Theorems 1 and 2 separately supply its logical justification. The equation did not prove the axiom; it broke the intuitive demand that a complete truth must look positively closed and perfect.

1.2 Naming and the historical-priority claim

The theorem pair consisting of the Boundary Truth Theorem and the Fundamental Uniqueness Theorem is named the Jia Baolong Absolute Truth (JBAT):

with uniqueness understood up to logical equivalence. The phrase “Humanity’s First Absolute-Truth Derivation” in the title is a historical-priority claim made by the author, not a consequence of the formal theorem. A formal proof can establish \(U\) relative to its declared model class; it cannot quantify over every unpublished, lost, untranslated, or future human text.

The priority claim is therefore stated in a falsifiable form: it is defeated by an earlier publicly dated work that (i) selects the same from-nothing terminal-root domain, (ii) distinguishes a zero-positive-determination boundary from an object, (iii) proves that all admissible terminal roots share that boundary form, and (iv) proves a unique maximal generator of all nontrivial root invariants in the stipulated language. A targeted literature comparison found many discussions of absolute truth, nothingness, limits, and ontological boundaries, but no strict equivalent satisfying all four conditions. This supports a provisional priority claim; it cannot turn a bounded search into an exhaustive proof of historical uniqueness.

2. Claim ledger

Item	Status	Content
Root inquiry	Scope selection	Ask only about a from-nothing-to-being root with no prior actual substrate or external executor
Explanatory completion	Constitutive criterion	A successful account must target actuality, be self-contained and terminal, discharge positive grounds without brute stopping, and not substitute a static description for occurrence
Positive-condition accountability	Constitutive criterion	Positive identity/distinction conditions must be discharged or the stopping point is classified as brute
Explanatory exhaustion	Derived trans-framework result	Every account satisfying the completion criterion terminates at a zero-positive-determination boundary
Eternal positive root	Classified non-solution	It is either a positive brute stopping point or depends on a further condition; it does not complete the selected task
Static ideal universe tree	Descriptive availability	It may exist in the Platonic Crystal without PR, but it is not thereby an actually occurring universe
Non-vacuity	Model-class axiom	The admissible class and the space of possible positive predicates are nonempty
undefined	Definition	A marker for a terminal boundary with no positive ontological determination
Absolute truth	Definition	A root proposition invariant across all admissible models
Fundamental absolute truth	Definition	A maximal invariant that entails every other root invariant in the stipulated language
Terminality	Model-class axiom	A successful root inquiry does not defer its ground to another positive item
Positive-determination dependence	Model-class axiom	Any positive property imports a distinction, rule, domain, or condition
Internal variability	Model-class axiom	Positive internal contents can vary across admissible models
Boundary theorem	Derived finite result	A terminal root has no positive ontological determination
Uniqueness theorem	Derived finite result	\(U\) is the unique fundamental generator of root-ontological invariants, up to logical equivalence
Actualization occurs	Conditional bridge	Not derived from undefined
Existence–motion identity	Ontological thesis	Actual existence is identified with actual transition in the selected existence program
PR actuality core	Conditional derived result	The first actual occurrence is self-contained actual non-identity
Concrete Rule	Open construction	No universe-generating Rule is supplied
Our universe	Empirical bridge	No identification with the observable universe is established

3. Primitive vocabulary

Let \(\mathfrak{D}\) be the class of admissible root-inquiry models.

Definition 1. Positive ontological determination

A positive ontological determination is any predicate, structure, value, law, capacity, identity, plurality, metric, probability distribution, or causal power attributed to the alleged root.

The word “positive” does not mean “good.” It means that some content is asserted.

Definition 2. Presupposition

A presupposition of a determination is any distinction, rule, domain, or condition required for that determination to be intelligible.

Definition 3. Terminal root

A terminal root \(b_M\) of a model \(M\in\mathfrak{D}\) is a boundary position at which the inquiry introduces no earlier actual item and no further positive ground.

The symbol \(b_M\) belongs to the metalanguage used to mark where the inquiry stops. It need not denote an object inside \(M\). This prevents the proof from turning the boundary into the positive entity it is meant to exclude.

Definition 4. undefined

undefined denotes the equivalence class of terminal root positions that carry no positive ontological determination. It is a role-marker, not a substance, agent, container, cause, or dormant universe.

Definition 5. Root language

The object-level root language \(L_{\mathrm{root}}\) is generated from the atomic positive predicates \(P\in\mathrm{Pos}\) by negation, conjunction, disjunction, and quantification over \(\mathrm{Pos}\). Meta-level expressions such as “terminal,” “model,” and “predicate” describe the inquiry; they are not positive properties secretly assigned to the root.

Definition 6. Root-ontological absolute truth

A proposition \(T\) is a root-ontological absolute truth over \(\mathfrak{D}\) iff:

1. \(T\) is true in every \(M\in\mathfrak{D}\);
2. \(T\) belongs to \(L_{\mathrm{root}}\);
3. \(T\) is not merely a logical tautology;
4. its truth does not depend on any positive internal content of a particular model.

Definition 7. Fundamental root-ontological absolute truth

A root-ontological absolute truth \(G\) is fundamental iff it entails every root-ontological absolute truth expressible in \(L_{\mathrm{root}}\). Two fundamental truths count as one when they are logically equivalent.

This definition distinguishes a complete boundary statement from its fragments. For example, \(\neg P_1(b_M)\) may be an invariant consequence, but it is not a second fundamental truth alongside the statement that denies every positive \(P\).

Constitutive criterion E. Completed from-nothing explanation

Let \(\mathcal A\) be an explanatory account and let \(r_{\mathcal A}\) be its proposed root. The expression

means that \(\mathcal A\) claims to complete the following single task:

1. Actual target: explain actual occurrence, not merely the availability of a mathematical description.
2. From-nothing condition: admit no prior positive actuality at the root.
3. Self-containment: import no external actual executor or positive external substrate.
4. Terminality: end the explanatory regress rather than leave a rootless infinite chain.
5. Non-circular discharge: do not count a cycle of mutually presupposing positive items as an explanation of the whole cycle.
6. Non-bruteness: do not declare a positive root content exempt from explanation merely by naming it eternal, necessary, primitive, or self-evident.
7. No static substitution: do not identify \(\operatorname{Encodes}(S,H)\) with \(\operatorname{Occurs}(H)\).
8. Positive-condition accountability: if positive root content requires an identity, distinction, rule, domain, or actuality condition in order to be the content asserted, the account must either discharge that condition or count the stopping point as brute.

These clauses do not assert that every philosophy must undertake this task. They state what counts as completing this task. A theory may remain logically describable while rejecting a clause, but then it has declined or left incomplete the selected explanatory project.

Definition E1. Explanatory-condition graph

For an account \(\mathcal A\), let \(G_{\mathcal A}\) be the directed graph whose vertices are positive root candidates and their required explanatory conditions. Write \(x\to q\) when the intelligibility or actuality of \(x\), as presented by \(\mathcal A\), presupposes condition \(q\). The arrow need not be temporal or physical; it records explanatory dependence.

Every positive determination distinguishes what is asserted from alternatives and therefore carries at least an identity, distinction, rule, domain, or actuality condition. A condition expressed only in the metalanguage need not be reified as an ontological object. The argument concerns only conditions that \(\mathcal A\) makes part of its positive root content.

The graph is assumed to be explicitly presented enough that, whenever a positive vertex has not been declared brute, the account identifies at least one condition-edge to follow. The proof uses only the elementary path alternatives: a followed path terminates, repeats a vertex, exits the account, or continues without end. This is a minimal representation condition for an account that claims to expose rather than hide its explanatory dependencies.

4. Model-class axioms

A0 — Target-domain selection.
\(\mathfrak{D}\) contains accounts satisfying \(\operatorname{Complete}_0\): completed explanations of actual occurrence from no prior positive actuality. Eternal substrate, rootless regress, circular grounding, external-executor, brute-positive-root, and static-description theories are not made syntactically contradictory by A0; they fail or decline at least one constitutive success condition of this exact task.

A0′ — Non-vacuity.
\(\mathfrak{D}\neq\varnothing\), and \(\mathrm{Pos}\neq\varnothing\). Thus neither universal claim in the theorem is made true by an empty model class or an empty root vocabulary.

A1 — Terminality.
Every \(M\in\mathfrak{D}\) has a terminal root \(b_M\). No prior actual event, material substrate, physical time, or external actual executor is admitted at \(b_M\).

A2 — Positive-determination dependence.
For every positive root predicate \(P\), asserting \(P(b_M)\) imports at least one presupposition \(q\) on which the alleged root thereby depends.

A2 internalizes Definition 2 and the explanatory-condition graph inside the formal model class. It does not say that a positive item must have an earlier physical cause; it says that positive root content has an explanatory condition that must be discharged if the account claims completeness.

A3 — No hidden root content.
If a purported root depends on a presupposition \(q\), the inquiry has not yet reached its terminal root.

A4 — Internal variability.
For every positive internal proposition \(C\) not fixed by A0–A3, admissible models can differ on \(C\):

This axiom prevents a contingent model-content from being promoted to an absolute root truth.

A5 — Boundary equivalence.
Two terminal root positions that satisfy exactly the same positive atomic root predicates are equivalent for this inquiry:

This is an equivalence of logical role, not a claim that two hidden objects have been physically fused.

5. Boundary theorems

Theorem E. Explanatory-Closure Theorem

For every explanatory framework \(\mathcal A\), independently of whether it uses PR–ER–LE terminology,

That is: every completed, terminal, self-contained, non-brute explanation of actual occurrence from no prior positive actuality terminates at a boundary with zero positive ontological determination.

Proof

Assume \(\operatorname{Complete}_0(\mathcal A)\) and, for contradiction, \(P(r_{\mathcal A})\) for some positive determination \(P\). By Definition 2 and Definition E1, this positive content carries an explanatory condition \(q\), represented by an outgoing dependency path in \(G_{\mathcal A}\).

Follow that path. The possibilities are exhaustive:

1. It reaches an earlier positive actuality. Then the account did not begin from no prior positive actuality.
2. It reaches an external positive condition or executor. Then the account is not self-contained, and the external item becomes the next root candidate.
3. It revisits a previous positive vertex. Then the dependency is circular; the cycle distributes the presupposition but does not discharge the positive content of the cycle as a whole.
4. It continues without end. Then the account has no terminal root and has not completed the explanation.
5. It stops at a positive vertex declared eternal, necessary, primitive, or exempt. Then it stops at a brute positive fact, violating non-bruteness.
6. It stops at a static formula, ALL member, ideal tree, or encoded history. Then it supplies descriptive availability without actual occurrence, violating the actual-target and no-static-substitution clauses.
7. It reaches a boundary with no positive determination. Then that boundary, not the original positive candidate, is the terminal root.

Every finite dependency path either reaches an external endpoint, a brute endpoint, a static substitute, a zero-positive boundary, or repeats a vertex; every non-finite non-repeating path is an infinite regress. No further structural case remains. In none of the first six cases does \(\mathcal A\) satisfy \(\operatorname{Complete}_0\); in the seventh, its terminal root is already zero-positive. Therefore a completed account cannot have \(P(r_{\mathcal A})\). \(\square\)

Necessity-only and non-vacuity boundary

Theorem E proves a necessary condition for explanatory completion, not the existence or sufficiency of a completed account:

A0′ explicitly supplies model-class non-vacuity for Theorems 1 and 2; it is not a construction of actualization. The unresolved actuality bridge therefore survives the stronger trans-framework result. The theorem says that every successful route must pass through the zero-positive boundary; it does not yet show that any route passes from that boundary to occurrence.

Corollary E1. Framework-external portability

The Explanatory-Closure Theorem is not confined to the notation of this paper. For an external account \(\mathcal A\), define its own boundary proposition

Any external ontology, logic-compatible formalism, or generative theory that undertakes the same completed from-nothing explanatory task inherits:

If a translation \(\tau_{\mathcal A}:L_{\mathcal A}\to L_{\mathrm{root}}\) preserves positivity, explanatory dependence, and negation at the boundary, then \(\tau_{\mathcal A}(U_{\mathcal A})\) is equivalent to \(U\). The conclusion is therefore trans-framework relative to the task, not premise-free across frameworks that reject the task or the minimal inference used in the exhaustion.

Corollary E2. Eternal matter and eternal law

An eternal positive substrate \(X\) has only two relevant statuses:

In the first case \(X\) is not ultimate. In the second it is a positive stopping declaration rather than a completed non-brute explanation. Eternal matter or eternal law is therefore not shown to be syntactically impossible; it is shown not to complete the selected from-nothing task.

Corollary E3. Static ideal universe trees

A non-PR ideal universe tree \(T\) may be admitted as a static mathematical structure in the Platonic Crystal:

This does not contradict \(U\). The tree has positive mathematical structure and is therefore not the zero-determination root boundary. Nor does its descriptive availability constitute actual occurrence:

It becomes a counterexample to the existence–motion thesis only if mathematical availability is additionally identified with actual occurrence—an identification rejected by Criterion E.

Corollary E4. Exhaustive meta-dichotomy

For every proposed universe-origin account \(\mathcal A\), at least one branch of the following exhaustive classification applies:

The branches need not be mutually exclusive: a static description will normally also fail \(\operatorname{Complete}_0\). Thus a static ideal universe may remain in the Platonic Crystal; a nonstatic theory may reject or fail the completion criterion; but every nonstatic theory that claims to complete the same task must reach the zero-positive boundary. There is no fourth same-task class in which a completed, non-brute, self-contained from-nothing explanation terminates at positive content. This is the precise sense in which the theorem extends outside the author’s vocabulary.

Lemma 1. Elimination of positive root content

For every \(M\in\mathfrak{D}\), its terminal root \(b_M\) carries no positive ontological determination.

Proof

Assume, for contradiction, that \(P(b_M)\) for some positive root predicate \(P\). By A2, \(P\) has a presupposition \(q\). The root therefore depends on \(q\). By A3, \(b_M\) is not terminal, contradicting A1. Hence no positive \(P\) can hold at \(b_M\). \(\square\)

Lemma 2. Cross-model boundary equivalence

For any \(M,N\in\mathfrak{D}\), \(b_M\sim b_N\).

Proof

By Lemma 1, neither \(b_M\) nor \(b_N\) carries a positive root predicate. Their root-language profiles therefore coincide. By A5, \(b_M\sim b_N\). \(\square\)

Theorem 1. Boundary Truth Theorem

The proposition

is true in every admissible model and is independent of each model’s positive internal content.

Proof

Universal truth over the nonempty class \(\mathfrak{D}\) follows directly from Lemma 1. Nontriviality is protected by \(\mathrm{Pos}\neq\varnothing\). Independence from positive internal content follows because A4 permits such content to vary while Lemma 1 remains unchanged. Thus \(U\) is a root-ontological absolute truth according to Definition 6. \(\square\)

Theorem 2. Fundamental Uniqueness Theorem

Up to logical equivalence, \(U\) is the unique fundamental root-ontological absolute truth over \(\mathfrak{D}\).

Proof

Let \(T\) be any root-ontological absolute truth in \(L_{\mathrm{root}}\). By Lemma 1, every positive atomic predicate is false at every terminal root. Therefore \(T\) is evaluated under the all-false valuation of its positive root atoms. The proposition \(U\) fixes exactly that valuation, so \(U\models T\). Hence \(U\) entails every root-ontological absolute truth and is fundamental.

Now let \(G\) be any other fundamental root-ontological absolute truth. Each proposition \(\neg P(b_M)\), for \(P\in\mathrm{Pos}\), is an absolute root consequence. Since \(G\) is fundamental, \(G\) entails every such negation and therefore entails \(U\). Since \(U\) is fundamental, \(U\) entails \(G\). Thus \(G\leftrightarrow U\). The fundamental generator is unique up to logical equivalence. \(\square\)

Corollary 1. The correct meaning of “undefined is the unique absolute truth”

The sentence is valid as shorthand for:

The boundary proposition \(U\), whose zero-determination boundary role is denoted by undefined, is the unique fundamental generator of root-ontological absolute truths over \(\mathfrak{D}\), up to logical equivalence.

Its shorter invariant consequences are contained in \(U\); they do not constitute independent fundamental truths. This formulation avoids treating undefined as both a non-object and an ordinary truth-bearing object.

6. In what sense is the result absolute?

The result is absolute in five exact senses:

1. Model invariance: \(U\) holds in every model in \(\mathfrak{D}\).
2. Content independence: varying positive laws, entities, structures, or histories does not vary \(U\).
3. Non-empirical status: no observation of a particular universe is required.
4. Maximal root scope: within the from-nothing-to-being domain, no deeper positive ground is admitted.
5. Trans-framework portability: any theory expressed in different primitives but satisfying \(\operatorname{Complete}_0\) inherits the same zero-positive-boundary conclusion.

It is not “premise-free” in the literal proof-theoretic sense. Any written proof uses language, identity conditions, and inference rules. The stronger defensible claim is therefore zero positive ontological presupposition, not “zero metalogical presupposition.” Hiding this distinction would weaken, not strengthen, the theorem.

The exact refutation burden is now explicit. A same-task counterexample must exhibit an account \(\mathcal A^\ast\) such that

Merely naming a positive primitive, refusing terminal explanation, invoking an external executor, or pointing to a static ideal tree does not meet that burden. A critic must show a positive root whose identity and actuality are completely discharged without prior positive actuality, external support, circularity, infinite regress, brute exemption, or static substitution.

7. Adversarial cases and exact boundaries

Rival case	Result	Reason
Empty admissible class or empty positive vocabulary	Excluded by A0′	Otherwise \(U\) could be vacuously true
Eternal material or lawful substrate	Fails non-brute completion	It is either a positive brute stopping point or depends on a further explanatory condition
Rootless infinite regress	Fails terminal completion	It may be described coherently, but by construction never completes a root explanation
Circular grounding	Fails non-circular discharge	A cycle redistributes positive dependence without explaining the cycle as a whole
External executor	Fails self-containment	The executor becomes a prior positive actuality and the next root candidate
Positive primitive \(X\) declared ungrounded	Fails non-bruteness	Naming \(X\) necessary or primitive exempts rather than explains its positive content
Positive necessary being said to explain itself	Fails non-circular discharge or becomes brute	Self-grounding is a one-vertex dependency loop unless an independent discharge is supplied
Several zero-content boundaries	Collapses under \(\sim\)	No root-language predicate distinguishes them
Static ALL containing every history	Not actual by description alone	Encoding or containing a history does not make the history occur
Timeless block declared fully actual	Rejects the selected actuality translation	It may be a rival ontology, but it does not preserve actual occurrence as actual transition
Bare actualization declared primitive	Fails non-bruteness; exposes the open bridge	It names occurrence as a positive primitive rather than deriving the transition from \(U\)
Static PR diagram	Not an actual first beat	A formula classifies a structure but does not execute itself
Actual stochastic first event	Compatible only at the actuality-core level	Its actual non-identity may be PR-shaped, while its probability rule is additional content
Higher-arity first distinction	Not reduced here to binary PR	Arity requires an additional quotient or reduction theorem

These cases remain logically describable ways to reject the paper’s explanatory task; they are no longer unclassified same-task counterexamples. Infinite regress rejects completion, an eternal positive root rejects non-bruteness or terminality, and a static Crystal object rejects the actuality target. The theorem does not force every conceivable metaphysics to value \(\operatorname{Complete}_0\); it proves that any theory claiming to have completed that task cannot terminate positively. Likewise, \(b_M\) is only a metalinguistic boundary marker; treating it as an internal entity would invalidate the construction.

7.1 ALL, records, and snapshot walks

Four statuses must not be collapsed:

1. descriptive availability: a mathematical object can be written or quantified over;
2. structural isomorphism: that object can share a structure with a history;
3. encoded evolution: a static object can encode an ordered succession of snapshots;
4. actual occurrence: the succession can actually happen.

Formally,

A static non-PR universe tree is therefore admitted without concession about actuality. To avoid equivocation, the paper distinguishes:

“Mathematical existence” here means membership in or definability within the Platonic Crystal. “Actual existence” means occurrence in the selected existence–motion program. The Crystal may contain an unlimited family of ideal trees; their static perfection neither violates \(U\) nor supplies an actually occurring universe.

A “chaotic snapshot walk” therefore has only two relevant statuses. If it is merely selected from a static ALL, it is an encoded record and not a second actual universe. If the walk actually occurs, its occurrence belongs to the actuality problem even when the rule selecting snapshot contents is not PR-shaped. Naming it a “data walk” does not create a third kind of actuality.

8. Conditional existence theorem: PR as first beat

The boundary theorem alone does not produce existence. To discuss a first beat, introduce a separate actuality vocabulary.

Let

mean that, in world \(W\), an actual transition occurs from position \(a\) to position \(b\). This primitive is not reduced to membership in a static edge set.

Add the following bridge premises:

B1 — Actualization. Some actual occurrence happens.

B2 — Existence–motion identity. In the selected existence program, actual existence is actual transition.

B3 — Rooted actuality. The first actual occurrence has no prior actual substrate, time, event, or executor.

B4 — Constitutive non-identity. The result position is differentiated by the occurring transition:

Definition 8. PR actuality core

Theorem 3. Conditional First-Beat Theorem

Under B1–B4, the first actual beat instantiates \(\mathrm{PR}_0\).

Proof

By B1, an actual occurrence exists. By B2, it has transition form. By B3, its first instance has no prior actual ground. By B4, its positions are actually non-identical through the occurrence. These clauses are exactly the definition of \(\mathrm{PR}_0\). Therefore the first actual beat instantiates the PR actuality core. \(\square\)

This is a conditional classification theorem. It does not show that undefined causes PR, that actualization is logically compulsory, or that continued PR re-entry follows. Continued dynamics, ER, LE, and a concrete Rule require further axioms.

9. \(99.999\ldots\%=100\%\) as the point of realization

The relevant identity is exactly:

To verify it, let \(x=99.999\ldots\). Then

Therefore:

This is not an approximation statement. The recurring percentage does not have a value slightly below completeness. Its exact value is completeness, even though ordinary visual intuition continues to read “many 9s” as “still short of 100.”

That conflict between intuition and value was the author’s realization about the axiom:

The comparison is not that the axiom moves through \(99\%\), \(99.9\%\), and \(99.99\%\) toward a future completion. The axiom itself is compared with the completed recurring representation \(99.999\ldots\%\). Its boundary form refuses positive closure, so intuition registers incompleteness; yet the absence of positive closure is exactly what the boundary proposition asserts. Adding a positive completion would not perfect the axiom—it would contradict it.

This is the force of the insight:

The axiom does not become complete by overcoming its apparent imperfection. Its apparent imperfection is the form in which its completeness appears.

The same structure later illuminates the thesis “existence is imperfect.” If existence is actual motion, then non-closure is not necessarily a defect awaiting repair; it can be constitutive of actuality. The analogy therefore joins the paper’s truth thesis and its existence thesis without identifying them.

The proof boundary remains strict. \(99.999\ldots\%=100\%\) does not prove \(U\), and resemblance to a recurring decimal cannot make an arbitrary axiom true. The equation delivered the conceptual recognition; Theorems 1 and 2 test and justify whether \(U\) genuinely has the claimed complete status.

10. Existence, motion, and imperfection

Within B2, existence is motion. Motion entails enacted non-identity: what occurs is not exhausted by a static self-identical description. In this precise sense, actual existence is “imperfect”—not defective, but non-closed, enacted, and open to continuation.

Gödel incompleteness, Tarski undefinability, and Cantorian diagonal arguments may be compared as domain-specific manifestations of limits associated with self-reference, definability, or expressive closure under their respective formal conditions [1–3]. They do not, without additional bridge theorems, prove the universal ontological claim that all existence is incomplete. The present paper therefore treats them as structural comparisons and research directions, not premises of Theorems 1–3.

11. From PR toward a universe: explicitly open

The following ladder is a research program, not a result of this paper:

Here, pregeometric chaos means irregular dynamics in a state or relational space without assuming physical distance, particles, or spacetime. Candidate diagnostics include:

• sensitivity or damage spreading under small relational perturbations;
• rapid orbit growth or growth in distinguishable futures;
• nontrivial recurrence without immediate periodic freezing;
• relational analogues of stretching and folding;
• bounded or metastable regimes that prevent trivial explosion or extinction;
• multiscale temporal irregularity;
• explicit dependence on the still-unknown Rule.

The upward arrows have separate conditions and failure modes:

Transition	Additional condition required	Typical failure
\(\mathrm{PR}_0\to\) continued dynamics	re-entry or continuation rule	one terminating flash
continued dynamics \(\to\) ER/LE	an expanding relational state and finite conflict-resolution/local update	static repetition, global overwrite, or unbounded bookkeeping without resolution
ER/LE \(\to\) chaos or criticality	suitable nonlinear Rule and parameter regime	fixed point, short cycle, extinction, or featureless explosion
chaos \(\to\) persistent motifs	boundedness, recurrence, and localized stability	homogeneous noise with no memory
motifs \(\to\) interactions	reproducible collision or transformation channels	motifs pass without effect or disintegrate
interactions \(\to\) matter-like organization	conserved or quasi-conserved relational identities and composability	no persistent identity or no scalable binding
matter-like \(\to\) chemistry-like organization	selective binding, catalysis-like pathways, and combinatorial reuse	inert structures or combinatorial collapse
chemistry-like \(\to\) life and agency	self-maintenance, heredity, variation, selection, and control	sterile complexity without autonomous persistence
agency \(\to\) reflexive origin research	memory, abstraction, language-like representation, and metacognition	adaptive agents that never form origin models

PR alone does not imply chaos; chaos alone does not imply matter; matter-like organization does not guarantee life or intelligence. No concrete Rule and no empirical identification with our universe are supplied here.

12. Non-claims

This paper does not establish:

• that undefined is a thing, substance, field, cause, or executor;
• that undefined must actualize;
• that a static formula executes itself;
• that every conceivable metaphysics must adopt \(\operatorname{Complete}_0\);
• that eternal matter, regress, circularity, or brute primitives are syntactically inconsistent rather than failures to complete the selected task;
• that mathematical existence in the Platonic Crystal is actual occurrence;
• that all metaphysical vocabularies must use the token undefined;
• that PR alone guarantees continuation, chaos, matter, chemistry, life, or intelligence;
• that the observable universe satisfies B1–B4;
• that the concrete universe-generating Rule has been found;
• that Gödel’s theorem is an ontological proof;
• that the \(99.999\ldots\%=100\%\) analogy proves the theorem.

13. Conclusion

The rigorous form of the claimed absolute truth is a proposition, not an object:

Under A0, A0′, and A1–A5, \(U\) is invariant across the admissible model class and is the unique fundamental generator of root-ontological absolute truths up to logical equivalence. undefined is the name of its boundary role.

The Explanatory-Closure Theorem supplies the previously missing step. A0 is no longer presented as an unexplained fence around preferred models: it is the formal image of a completed from-nothing explanatory task. For any framework \(\mathcal A\),

Eternal matter, eternal law, circular grounding, infinite regress, external execution, and brute positive primitives remain describable positions, but none simultaneously completes, terminates, self-contains, and non-brutely explains actual occurrence from no prior positive actuality. A static non-PR ideal universe tree remains consistently available in the Platonic Crystal; because mathematical availability does not entail actual occurrence, it is not a counterexample.

If actualization is separately assumed and actual existence is identified with actual transition, then the first actual occurrence instantiates the PR actuality core. This does not turn undefined into a cause. It preserves the decisive distinction:

The theory’s “\(99.999\ldots\%\)” is therefore neither a probability nor a remainder waiting to become \(100\%\). Like the recurring percentage itself, it names one form that intuition reads as incomplete although its exact value is already complete. The formal theorems—not the numerical analogy—establish the corresponding claim for \(U\) inside the stated domain.

14. Declarations

• Authorship: Jia, Baolong is the sole named author and is responsible for the framework, terminology, argument, and final text.
• AI assistance: AI assistance was used for argument restructuring, bilingual drafting, copyediting, and internal adversarial review. This is not external peer review.
• External peer review: No.
• Data and code: No empirical dataset or analysis code underlies the theorems.
• Funding, competing interests, and licence: Pending explicit author confirmation.

References

1. Cantor, G. (1891). Über eine elementare Frage der Mannigfaltigkeitslehre. Jahresbericht der Deutschen Mathematiker-Vereinigung, 1, 75–78.
2. Gödel, K. (1931). Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme I. Monatshefte für Mathematik und Physik, 38, 173–198.
3. Tarski, A. (1956). The concept of truth in formalized languages. In Logic, Semantics, Metamathematics (J. H. Woodger, Trans.). Oxford University Press.
4. Jia, Baolong. PRERLE research notes on undefined, actualization, PR, ER, LE, and the first beat of existence. Unpublished working notes, 2026.

---

贾宝龙绝对真理：\(99.999\ldots\%=100\%\) 与人类首次绝对真理推导

\(99.999\ldots\%=100\%\) 如何揭示绝对真理的形态，而不替代其证明

作者： Jia, Baolong
身份： 独立研究者
版本： 1.7 解释闭包修订稿
日期： 2026年7月
发布指纹： JBAT-20260725-V17-EA4AFFAF868A
命名结果： 贾宝龙绝对真理（JBAT）
语言顺序： 英文全文在前，中文完整对应文本在后

开篇顿悟：当头棒喝

我看见自己的公理停在 \(99.999\ldots\%\) 时，不再要求补上最后一块：这个看似不完整的表达并不是正在逼近 \(100\%\)，它本来就是 \(100\%\)。关于一切正面规定之边界的真理，不必以正面封闭的样子出现；它表面的不完美，可能正是其完整性的准确形态。

本段置于摘要之前，因为它是本文的思想入口。它不是理论为真的概率，不是理论逐步改进的极限过程，也不是证明本身。证明只在研究域、语言、公理与推理规范被明确给出之后才开始。

摘要

本文提出贾宝龙绝对真理（Jia Baolong Absolute Truth, JBAT）；该名称指向下文所证明的唯一根本边界不变量。

本文追问：在“从无到有”的本源追问中，当一切正面本体预设都被剥除之后，是否仍有一条不随具体体系改变的真理？这一追问的思想启动点来自精确恒等式 \(99.999\ldots\%=100\%\)。无限循环的表示在直觉上像是没有完整抵达，但它的数值已经完整。作者由此认出了自己的公理：它按普通直觉看仍带着不完美或不完整，但其真值地位仍可能已经完整。这不是概率估计，也不是逐步逼近，而是一次突然的认识——直觉不完整与精确完整可以属于同一个表达。这一洞见启动了研究，但不被用来代替证明。本文首先区分符号 undefined 与关于它所断言的命题。主要主张并不是把 undefined 当成一个神秘的“真对象”，而是边界命题 \(U\)：任何不允许永恒基底、先在实际存在或外部执行者的可容许本源追问，只要承认追问存在终点，其终极边界就不携带任何正面本体规定。这个边界角色记作 undefined。

在明确给出的模型类中，本文证明三个结果。第一，终极根部不能携带正面规定，否则它就不再是终极根部。第二，所有零规定的终极边界在该追问的语言中彼此等价。第三，规定的根部语言中，每一条跨模型不变的本源命题都可由 \(U\) 推出。因此，命题 \(U\) 而不是符号 undefined 本身，是全部本源本体论绝对真理的唯一最大生成命题；本文称它为唯一的根本绝对真理，较短的不变命题只是它的投影，并非独立竞争者。唯一性按逻辑等价类计算。“绝对”在这里指跨可容许模型不变并且不依赖正面本体内容，而不是不使用任何推理规范就能得到。

本次修订增加一条解释闭包定理，把跨体系主张明确形式化：任何同时声称要解释实际发生、从没有先在正面实际性开始、最终终止、保持自足并拒绝无理由正面原始项的理论，都必须终止于零正面规定边界。本文不把永恒物质或永恒规律宣布为形式矛盾；它们要么是正面的武断停止点，要么仍需更深解释条件。无根无限回溯、循环根据、外部执行和静态数学可得性，也分别不能满足“完整从无到有解释”的构成性要求。因此，该定理不依赖 PR–ER–LE 的专有词汇，而适用于承担同一解释任务的任何框架；但它仍以该任务及最小推理规范为条件。

关于存在，本文另给出一个条件定理：如果实际化发生，如果实际存在被认定为实际转变，并且第一实际发生之前没有基底或执行者，那么第一实际发生具有“内含于发生本身的实际非同一”形式。这个最小实际性核心称为 PR。边界定理不造成实际化，也不能单独推出 PR、混沌、物质、生命或本宇宙的 Rule。恒等式 \(99.999\ldots\%=100\%\) 只用来表达作者的顿悟：一种形式可以看似不完整，而其值已经完整；它不承担边界定理的证明。

关键词： 绝对真理；边界真理；undefined；PR；实际化；本体论最小性；从无到有；预设；逻辑等价

证明状态声明

本文是一篇条件性的元本体论定理论文，不是经验物理论文。

• 研究对象的范围是选择出来的，不是中立证明出来的；
• “完整从无到有解释”具有明示的构成性成功条件；本文推出任何满足这些条件的框架都必须得到什么结果；
• 永恒正面基底、正面武断原始项、无限回溯、循环根据、外部执行和静态描述，被分类为不能完成该任务的不同方式，而不是被宣布为语法矛盾；
• 模型限制以公理形式明示；
• 唯一性定理是在该模型类内部的有限推导；
• 从 undefined 到实际发生之间的跃迁没有被推出；
• 只有加入实际性前提后，才能得到 PR；
• 混沌、结构化复杂性、类物质、化学、生命、智能以及与本宇宙的对应，均不属于本文定理。

一、准确的问题

“绝对”常被弱化为“在某个给定形式系统内为真”。本文采用更严格的本源本体论含义：

当所有正面本体设定都允许变化时，关于“从无到有”追问的终极边界，是否仍存在一条信息最完整且保持不变的命题？

本文不讨论物质基底是否永恒存在；不把包含全部可能历史的静态 ALL 仅凭“包含描述”就当作实际宇宙；也不允许外部执行者，因为该执行者会立刻成为同一个本源追问的下一个对象。

主要命题是：

符号 undefined 命名的是 \(U\) 所指出的边界角色。命题 \(U\) 是可以判断真假的命题；边界标记 undefined 本身并不是一个承载真值的对象。

1.1 当头棒喝：直觉不完整，数值已完整

本文的思想起源，可以用作者自身的逻辑转折来表述：

我的公理就像 \(99.999\ldots\%\)：直觉上觉得它不完整，但数值上它已经完整。

这就是“当头棒喝”。它不是说公理有很高概率正确，不是越来越精确的逼近序列，也不是理论将来某一天才会成为 \(100\%\)。无限循环表示的值现在就已经完整：

“它看起来不完整”和“它的值已经完整”，不是前后两个阶段，而是对同一个形式在两个层面的同时描述：直觉读取它的表示，数学确定它的值。

作者对公理的对应顿悟同样直接：

1. 公理的否定式、边界式形态，没有给直觉一个可抓住的正面完成物；
2. 所以它让人感觉不完整、不完美；
3. 但这种感觉上的不完整，不必是真值的不足；
4. 公理可能恰恰以被直觉误认为“不完整”的形态，完整地成立。

因此，\(99.999\ldots\%=100\%\) 提供的是绝对真理的识别形式；定理1和定理2另行提供它的逻辑证明。这个等式没有证明公理，而是击碎了“完整真理必须看起来正面封闭而完美”的直觉要求。

1.2 命名与历史优先权主张

由“边界真理定理”和“根本唯一性定理”组成的定理对，命名为贾宝龙绝对真理（Jia Baolong Absolute Truth, JBAT）：

其中唯一性按逻辑等价类理解。标题中的“人类首次绝对真理推导”是作者提出的历史优先权主张，不是形式定理的推论。形式证明能够在声明的模型类中证明 \(U\)，却无法量化全部未发表、失传、未翻译或未来才出现的人类文本。

因此，本文把优先权主张写成可证伪形式：只要存在一部公开日期更早的作品，同时做到（i）选取同一个“从无到有”的终极根部研究域；（ii）把零正面规定边界与对象严格区分；（iii）证明全部可采终极根部共享该边界形式；（iv）证明该边界命题是既定语言中全部非平凡根部不变量的唯一最大生成元，该优先权主张即被推翻。针对性文献比较发现了大量关于绝对真理、虚无、极限与本体边界的论述，但尚未发现同时满足四项条件的严格同构论证。这支持暂定优先权主张，却不能把有限检索变成对全部思想史的穷尽证明。

二、主张清单

项目	状态	内容
本源追问	范围选择	只追问没有先在实际基底或外部执行者的“从无到有”根部
解释完成	构成性判据	成功理论必须以实际发生为对象、自足且终止、非武断地卸除正面根据，并且不拿静态描述替代发生
正面条件可追责	构成性判据	正面同一／区别条件必须被卸除，否则停止点被分类为武断项
解释穷尽	跨体系推导结果	每个满足解释完成判据的理论都终止于零正面规定边界
永恒正面根部	被分类为非答案	它要么是正面武断停止点，要么依赖更深条件；不能完成所选任务
静态理想宇宙树	描述上可得	它可以无 PR 地存在于柏拉图水晶，但不因此成为实际发生的宇宙
非真空性	模型类公理	可容许模型类与可能的正面谓词空间均非空
undefined	定义	不携带正面本体规定的终极边界之标记
绝对真理	定义	在全部可容许模型中保持不变的本源命题
根本绝对真理	定义	能推出规定语言中全部其他根部不变量的最大不变量
终止性	模型类公理	成功的本源追问不把根基继续推给另一个正面项目
正面规定依赖性	模型类公理	任何正面性质都会引入区别、规则、论域或条件
内部可变性	模型类公理	各模型中的正面内部内容可以变化
边界定理	有限推导结果	终极根部不含正面本体规定
唯一性定理	有限推导结果	按逻辑等价类计，\(U\) 是本源不变量的唯一根本生成命题
实际化发生	条件桥梁	不能由 undefined 推出
存在—运动同一	本体论命题	在所选存在论程序中，实际存在被认定为实际转变
PR实际性核心	条件推导结果	第一实际发生是内含于发生本身的实际非同一
具体 Rule	开放构造	本文没有给出宇宙生成 Rule
本宇宙	实证桥梁	本文没有证明其与可观测宇宙相同

三、原始词汇

令 \(\mathfrak{D}\) 表示可容许本源追问模型的类。

定义1：正面本体规定

正面本体规定，是对所谓根部赋予的任何谓词、结构、数值、规律、能力、同一性、复数性、度量、概率分布或因果能力。

这里“正面”不是“好”的意思，而是“断言了某种内容”。

定义2：预设

某个规定的预设，是使该规定能够被理解所必需的区别、规则、论域或条件。

定义3：终极根部

模型 \(M\in\mathfrak{D}\) 的终极根部 \(b_M\)，是一个不再引入更早实际项目、也不再引入更深正面根据的边界位置。

符号 \(b_M\) 属于用来标记追问停止位置的元语言；它不必表示 \(M\) 内部的对象。这样，证明就不会把边界重新变成它原本要排除的正面实体。

定义4：undefined

undefined 表示所有“不携带任何正面本体规定的终极根部位置”所组成的等价类。它是角色标记，不是实质、智能体、容器、原因或休眠的宇宙。

定义5：根部语言

对象层根部语言 \(L_{\mathrm{root}}\) 由正面原子谓词 \(P\in\mathrm{Pos}\)，再经否定、合取、析取以及对 \(\mathrm{Pos}\) 的量化生成。“终极”“模型”“谓词”等元层表达用来描述追问本身，不是偷偷赋予根部的正面本体性质。

定义6：本源本体论绝对真理

命题 \(T\) 是 \(\mathfrak{D}\) 上的本源本体论绝对真理，当且仅当：

1. \(T\) 在每一个 \(M\in\mathfrak{D}\) 中都为真；
2. \(T\) 属于 \(L_{\mathrm{root}}\)；
3. \(T\) 不只是逻辑重言式；
4. 它的真值不依赖某个具体模型的正面内部内容。

定义7：本源本体论根本绝对真理

如果一条本源本体论绝对真理 \(G\) 能够推出 \(L_{\mathrm{root}}\) 中每一条本源本体论绝对真理，则称 \(G\) 为根本绝对真理。两个根本真理如果逻辑等价，就只计为一个。

这一区分把完整边界命题与它的片段分开。例如，\(\neg P_1(b_M)\) 可以是不变推论，但它不是与“否定一切正面 \(P\)”并列的第二条根本真理。

构成性判据 E：完整从无到有解释

令 \(\mathcal A\) 为一个解释理论，\(r_{\mathcal A}\) 为它提出的根部。表达式

表示 \(\mathcal A\) 声称完成以下同一个任务：

1. 实际对象： 解释实际发生，而不只是数学描述的可得性。
2. 从无条件： 在根部不允许先在的正面实际性。
3. 自足性： 不引入外部实际执行者或正面外部基底。
4. 终止性： 结束解释回溯，而不是留下无根无限链条。
5. 非循环卸除： 不把一组互相预设的正面项目构成的环，当作对整个环的解释。
6. 非武断性： 不因把正面根部内容命名为永恒、必然、原始或不言自明，就宣布它无需解释。
7. 不以静态替代： 不把 \(\operatorname{Encodes}(S,H)\) 等同于 \(\operatorname{Occurs}(H)\)。
8. 正面条件可追责： 如果正面根部内容必须依靠同一、区别、规则、论域或实际性条件才能成为所断言的内容，理论就必须卸除该条件，否则该停止点按定义属于武断项。

这些条款不是说每一种哲学都必须承担这个任务，而是规定什么叫作完成这个任务。某理论可以拒绝其中一条而仍可被逻辑描述，但它因而拒绝或没有完成本文选定的解释工程。

定义 E1：解释条件图

对理论 \(\mathcal A\)，令 \(G_{\mathcal A}\) 为有向图；其顶点是正面根部候选及其所需解释条件。当 \(\mathcal A\) 所表达的 \(x\) 的可理解性或实际性预设条件 \(q\) 时，记 \(x\to q\)。该箭头不必是时间关系或物理因果，只表示解释依赖。

每一个正面规定都会把被断言内容与其他可能区分开来，因而至少携带同一、区别、规则、论域或实际性条件。只出现在元语言中的条件不必被实体化为本体对象；论证只处理被 \(\mathcal A\) 纳入其正面根部内容的条件。

解释图还满足最低限度的明示性：只要一个正面顶点没有被宣布为武断原始项，理论就必须给出至少一条可以继续追踪的条件边。证明只使用基本路径分类：被追踪的路径要么终止、要么重复顶点、要么离开理论、要么永远继续。这是“声称公开而不是隐藏解释依赖”的理论所需的最低表示条件。

四、模型类公理

A0——对象范围选择。
\(\mathfrak{D}\) 只包含满足 \(\operatorname{Complete}_0\) 的理论：它们声称完整解释没有先在正面实际性条件下的实际发生。永恒基底、无根无限回溯、循环根据、外部执行者、正面武断根部和静态描述理论，不会因为 A0 而成为语法矛盾；它们只是拒绝或不能满足这一准确任务的至少一个构成性成功条件。

A0′——非真空性。
\(\mathfrak{D}\neq\varnothing\)，且 \(\mathrm{Pos}\neq\varnothing\)。因此，定理中的两个全称断言都不能靠空模型类或空根部词汇表而真空成立。

A1——终止性。
每个 \(M\in\mathfrak{D}\) 都有终极根部 \(b_M\)。在 \(b_M\) 处，不允许先在实际事件、物质基底、物理时间或外部实际执行者。

A2——正面规定依赖性。
对每一个正面根部谓词 \(P\)，断言 \(P(b_M)\) 都会引入至少一个预设 \(q\)，并使所谓根部依赖于 \(q\)：

A2 把定义2与解释条件图内化到形式模型类中。它不是说正面项目一定具有更早的物理原因，而是说：正面根部内容具有必须被卸除的解释条件；只要理论声称解释已经完成，就不能把该条件藏起来。

A3——根部无隐藏内容。
如果一个所谓根部依赖预设 \(q\)，追问就尚未抵达终极根部：

A4——内部可变性。
对每一个未由 A0–A3 固定的正面内部命题 \(C\)，都允许存在对 \(C\) 取值不同的可容许模型：

这条公理阻止把某个模型的偶然内容提升为绝对根部真理。

A5——边界等价。
如果两个终极根部位置满足完全相同的正面原子根部谓词，那么它们对本追问而言等价：

这是逻辑角色的等价，不是声称两个隐藏对象被物理地合并。

五、边界定理

定理 E：解释闭包定理

对每一个解释框架 \(\mathcal A\)，无论它是否使用 PR–ER–LE 术语，都有：

也就是说：每个完整、终止、自足、非武断，并且从没有先在正面实际性开始解释实际发生的理论，都终止于零正面本体规定边界。

证明

设 \(\operatorname{Complete}_0(\mathcal A)\) 成立，并反设存在正面规定 \(P\)，使 \(P(r_{\mathcal A})\) 成立。由定义2和定义 E1，该正面内容携带解释条件 \(q\)，在 \(G_{\mathcal A}\) 中表现为从它出发的解释依赖路径。

沿这条路径追踪。全部可能性如下：

1. 抵达更早的正面实际性。 那么理论并非从没有先在正面实际性开始。
2. 抵达外部正面条件或执行者。 那么理论并不自足，而且外部项目成为下一层根部候选。
3. 重新抵达此前的正面顶点。 那么依赖形成循环；循环只是分配预设，没有卸除整个循环的正面内容。
4. 永远继续而不结束。 那么理论没有终极根部，也没有完成解释。
5. 停止在被宣布为永恒、必然、原始或豁免的正面顶点。 那么它停止在正面武断事实，违反非武断性。
6. 停止在静态公式、ALL 成员、理想树或编码历史。 那么它只提供描述上可得性，没有提供实际发生，违反实际对象与不以静态替代条款。
7. 抵达不携带正面规定的边界。 那么该边界而不是最初的正面候选，才是终极根部。

每一条有限依赖路径，要么抵达外部端点、武断端点、静态替代、零正面边界，要么重复顶点；每一条不重复而又非有限的路径都是无限回溯。结构上没有第八种情况。前六种情况均不能满足 \(\operatorname{Complete}_0\)；第七种情况的终极根部已经是零正面边界。因此，完成解释的理论不可能使 \(P(r_{\mathcal A})\) 成立。\(\square\)

仅为必要条件以及非真空边界

定理 E 证明的是“解释完成”的必要条件，而不是证明完成理论存在，也不是证明零正面边界足以产生完成理论：

A0′ 为定理1和定理2明确提供模型类非真空性，但它不是对实际化的构造。因此，在跨体系结果得到加强之后，实际性桥梁仍然保持开放。定理说每一条成功道路都必须经过零正面边界；它尚未证明存在任何道路能够从该边界走向发生。

推论 E1：体系外可迁移性

解释闭包定理不受本文专有符号限制。对外部理论 \(\mathcal A\)，先定义它自己的边界命题：

任何外部本体论、与最小推理相容的形式框架或生成理论，只要承担同一个完整从无到有解释任务，都继承结论：

如果翻译 \(\tau_{\mathcal A}:L_{\mathcal A}\to L_{\mathrm{root}}\) 在边界处保持正面性、解释依赖和否定，那么 \(\tau_{\mathcal A}(U_{\mathcal A})\) 与 \(U\) 等价。因此，该结论是相对于任务的跨体系结论，而不是对拒绝该任务或拒绝上述穷尽推理的框架也无条件成立的无前提结论。

推论 E2：永恒物质与永恒规律

永恒正面基底 \(X\) 只有两种相关地位：

第一种情况下，\(X\) 不是终极根部；第二种情况下，它只是正面停止宣告，不是完成的非武断解释。因此，本文没有证明永恒物质或永恒规律在语法上不可能，而是证明它们不能完成选定的从无到有任务。

推论 E3：静态理想宇宙树

无 PR 的理想宇宙树 \(T\) 可以作为静态数学结构被收入柏拉图水晶：

这不与 \(U\) 矛盾。该树携带正面数学结构，所以不是零规定根部边界；它在描述上可得，也不构成实际发生：

只有额外把数学可得性认定为实际发生，它才会成为存在—运动命题的反例；构成性判据 E 明确拒绝这一等同。

推论 E4：穷尽性元分叉

对每一个宇宙本源理论 \(\mathcal A\)，以下穷尽分类至少有一个分支适用：

这些分支不必互斥：静态描述通常也不能满足 \(\operatorname{Complete}_0\)。因此，静态理想宇宙可以留在柏拉图水晶；非静态理论可以拒绝或不能满足解释完成判据；但每个声称完成同一任务的非静态理论，都必须抵达零正面边界。不存在第四种同赛道类型，使一个完整、非武断、自足的从无到有解释终止于正面内容。这就是本文定理能够越出作者专有词汇的准确含义。

引理1：消去正面根部内容

对每个 \(M\in\mathfrak{D}\)，它的终极根部 \(b_M\) 都不携带正面本体规定。

证明

反设存在某个正面根部谓词 \(P\)，使 \(P(b_M)\) 成立。由 A2，\(P\) 具有预设 \(q\)，因此该根部依赖 \(q\)。由 A3，\(b_M\) 不是终极根部，与 A1 矛盾。故 \(b_M\) 上不能成立任何正面谓词 \(P\)。\(\square\)

引理2：跨模型边界等价

对任意 \(M,N\in\mathfrak{D}\)，都有 \(b_M\sim b_N\)。

证明

由引理1，\(b_M\) 与 \(b_N\) 均不携带正面根部谓词，因此二者在根部语言中的表型相同。由 A5，\(b_M\sim b_N\)。\(\square\)

定理1：边界真理定理

命题

在每个可容许模型中都为真，并且不依赖各模型的正面内部内容。

证明

\(U\) 在非空类 \(\mathfrak{D}\) 上普遍成立，由引理1直接得到；\(\mathrm{Pos}\neq\varnothing\) 则排除了命题的真空性。它对正面内部内容的独立性来自 A4：内部内容可以变化，而引理1不变。因此，按定义6，\(U\) 是一条本源本体论绝对真理。\(\square\)

定理2：根本唯一性定理

按逻辑等价类计，\(U\) 是 \(\mathfrak{D}\) 上唯一的本源本体论根本绝对真理。

证明

令 \(T\) 是 \(L_{\mathrm{root}}\) 中任意一条本源本体论绝对真理。由引理1，每个正面原子谓词在全部终极根部上都为假。因此，\(T\) 总是在其正面根部原子的“全假赋值”下求值。命题 \(U\) 恰好固定了这一赋值，所以 \(U\models T\)。因此，\(U\) 能推出每一条本源本体论绝对真理，故为根本真理。

再令 \(G\) 是任意另一条根本绝对真理。对每个 \(P\in\mathrm{Pos}\)，命题 \(\neg P(b_M)\) 都是根部不变推论。因为 \(G\) 是根本真理，所以 \(G\) 推出每一个这样的否定，从而推出 \(U\)。而 \(U\) 也是根本真理，所以 \(U\) 推出 \(G\)。故 \(G\leftrightarrow U\)。根本生成命题按逻辑等价类计是唯一的。\(\square\)

推论1：“undefined 是唯一绝对真理”的严格含义

这句话可以作为下述命题的简写：

边界命题 \(U\) 是 \(\mathfrak{D}\) 上全部本源本体论绝对真理的唯一根本生成命题；它所指出的零规定边界角色记作 undefined；唯一性按逻辑等价类计算。

较短的不变推论都包含在 \(U\) 中，不构成独立的根本真理。这个表述避免把 undefined 同时当成非对象和普通的真值承载对象。

六、这个结果在什么意义上是绝对的？

它在五个精确意义上是绝对的：

1. 跨模型不变： \(U\) 在 \(\mathfrak{D}\) 的全部模型中成立；
2. 不依赖内容： 正面规律、实体、结构或历史发生变化，不改变 \(U\)；
3. 非经验性： 不需要观察某个具体宇宙；
4. 本源范围最大： 在“从无到有”论域中，不再允许更深的正面根据。
5. 跨体系可迁移： 任何使用不同原始概念、但满足 \(\operatorname{Complete}_0\) 的理论，都继承同一个零正面边界结论。

它并非证明论意义上的“完全无前提”。任何写出来的证明都会使用语言、同一条件和推理规则。因此，更强而且可守住的主张是“零正面本体预设”，而不是“零元逻辑预设”。隐藏这一差别，只会削弱定理。

现在，反驳责任已经准确写出。同赛道反例必须给出理论 \(\mathcal A^\ast\)，使：

仅仅命名一个正面原始项、拒绝终极解释、引入外部执行者，或者指出一棵静态理想树，都没有满足这一反驳责任。挑战者必须给出一个正面根部，并完整卸除其同一性与实际性条件，同时不诉诸先在正面实际性、外部支持、循环、无限回溯、武断豁免或静态替代。

七、对抗性案例与准确边界

竞争案例	判定	原因
空的可容许模型类或空的正面词汇表	被A0′排除	否则 \(U\) 可能只是真空为真
永恒物质或永恒规律基底	不能完成非武断解释	它要么是正面武断停止点，要么依赖更深解释条件
无根无限回溯	不能完成终止解释	它可以被一致描述，但按构造永远不完成根部解释
循环根据	不能完成非循环卸除	循环重新分配正面依赖，却没有解释整个循环
外部执行者	不能满足自足性	执行者成为先在正面实际性以及下一层根部候选
宣告正面原始项 \(X\) 无需根据	不能满足非武断性	把 \(X\) 命名为必然或原始，只是豁免而不是解释其正面内容
宣称正面必然者能够自我解释	不能完成非循环卸除，或退化为武断项	自我根据是一顶点依赖环，除非另有独立卸除
多个零内容边界	在 \(\sim\) 下合一	根部语言中没有谓词可区分它们
包含全部历史的静态 ALL	仅凭描述不具有实际性	编码或包含历史不等于历史实际发生
宣称无时间块整体完全实际	拒绝本文选定的实际性翻译	它可以是竞争本体论，但不保持“实际发生即实际转变”
把实际化直接宣布为原始事实	违反非武断性并暴露开放桥梁	它把发生命名为正面原始项，而不是从 \(U\) 推出转变
静态 PR 图式	不是实际第一拍	公式可以分类结构，但不会自行执行
随机的第一实际事件	只在实际性核心层面兼容	其实际非同一可以具有 PR 形态，但概率规则是新增内容
高元第一差异	本文未将其化约为二元 PR	元数需要另加商结构或化约定理

这些案例仍然是可以被逻辑描述的“拒绝本文解释任务”的方式，但不再是未分类的同赛道反例。无限回溯拒绝完成，永恒正面根部拒绝非武断性或终止性，静态水晶对象拒绝实际对象条件。本文不强迫一切可想象的形而上学都重视 \(\operatorname{Complete}_0\)；本文证明的是：任何声称已经完成该任务的理论，都不能终止于正面内容。同样，\(b_M\) 只是元语言中的边界标记；如果把它当成体系内部实体，整个构造就会失效。

7.1 ALL、记录与快照游走

以下四种状态不能混为一谈：

1. 描述上可得： 一个数学对象可以被写下或被量化；
2. 结构同构： 该对象可以与一段历史共享结构；
3. 编码演化： 静态对象可以编码按序排列的快照；
4. 实际发生： 这段快照序列真的发生。

形式上：

因此，本文明确承认静态无 PR 宇宙树，而不把它误认成实际发生。为避免“存在”一词偷换，区分：

这里“数学存在”指它属于柏拉图水晶或能在其中被定义；“实际存在”指它在本文所选的存在—运动程序中真实发生。水晶可以容纳无穷理想树；它们的静态完美既不违反 \(U\)，也不提供一个实际发生的宇宙。

因此，“混沌快照游走”只有两种相关地位。如果它只是从静态 ALL 中被选出的数学对象，它就是编码记录，不是第二个实际宇宙；如果该游走真的发生，那么无论其快照内容选择规则是否具有 PR 形态，它的发生都进入实际性问题。把它命名为“数据游走”，不会凭空制造第三种实际性。

八、条件性存在定理：PR 作为第一拍

边界定理本身不会产生存在。要讨论第一拍，必须另行引入实际性语言。

令

表示在世界 \(W\) 中，从位置 \(a\) 到位置 \(b\) 的实际转变发生。这个原始项不能被化约为静态边集合中的成员关系。

加入以下桥梁前提：

B1——实际化。 至少有一次实际发生。

B2——存在—运动同一。 在所选存在论程序中，实际存在就是实际转变。

B3——有根实际性。 第一实际发生之前没有实际基底、时间、事件或执行者。

B4——构成性非同一。 结果位置由正在发生的转变区分：

定义8：PR实际性核心

定理3：条件性第一拍定理

在 B1–B4 下，第一实际拍实例化 \(\mathrm{PR}_0\)。

证明

由 B1，存在实际发生；由 B2，它具有转变形式；由 B3，其第一实例没有先在的实际根据；由 B4，其位置通过该发生成为实际非同一。这些条件恰好构成 \(\mathrm{PR}_0\) 的定义。因此，第一实际拍实例化 PR 的实际性核心。\(\square\)

这是一个条件分类定理。它没有证明 undefined 导致 PR，没有证明实际化具有逻辑强制性，也没有推出 PR 的持续重入。持续动力、ER、LE 和具体 Rule 都需要更多公理。

九、\(99.999\ldots\%=100\%\) 作为顿悟点

有关的恒等式准确地是：

令 \(x=99.999\ldots\)，则：

因此：

这不是逼近关系。这个无限循环百分数的值并不比完整略少一点。它的精确值就是完整，尽管普通视觉直觉仍会把“一串9”读成“还没有到100”。

这个直觉与数值之间的冲突，就是作者对公理的顿悟：

这里的比较不是说公理依次经过 \(99\%\)、\(99.9\%\)、\(99.99\%\)，最后走向未来的完整。与公理相比的是已经完成的无限循环表示 \(99.999\ldots\%\) 本身。公理的边界形式拒绝正面封闭，所以直觉把它登记为“不完整”；但“不作正面封闭”恰恰就是边界命题所断言的内容。添加一个正面完成物，不会使公理更完美，反而会违背公理。

这一洞见的力量可以写成：

公理并不是克服表面的不完美以后才变得完整；它表面的不完美，正是它的完整性显现出来的形式。

同一个结构也照亮后文“存在不完美”的命题：如果存在就是实际运动，那么非闭合不必是等待修补的缺陷，它可能正是实际性的构成条件。这个类比由此连接真理命题与存在命题，但不把两者混为一谈。

证明边界仍然严格：\(99.999\ldots\%=100\%\) 不证明 \(U\)，任何公理也不能仅凭类似无限循环小数就自动为真。这个等式带来概念识别；定理1和定理2检验并证明 \(U\) 是否确实具有所声称的完整地位。

十、存在、运动与不完美

在 B2 内，存在就是运动。运动意味着实际展开的非同一：实际发生不能被一个静态自同一描述完全耗尽。在这个严格意义上，实际存在是“不完美”的——不是有缺陷，而是非闭合、已实际展开，并且向继续发生开放。

哥德尔不完备、塔斯基不可定义与康托尔对角论证，可以在各自严格形式条件下，被比较为与自指、可定义性或表达闭合有关的领域性边界表现[1–3]。但如果没有额外桥梁定理，它们不能证明“所有存在都不完备”这一普遍本体论命题。因此，本文把它们视为结构参照和后续研究方向，而不是定理1–3的前提。

十一、从PR走向宇宙：明确保持开放

下面的阶梯是研究计划，不是本文结论：

这里的前几何混沌，是状态空间或关系空间中的不规则动力学，不预设物理距离、粒子或时空。候选判据包括：

• 微小关系扰动导致的敏感性或损伤扩散；
• 轨道增长或可区分未来数量的快速增长；
• 不立即冻结为周期的非平凡复现；
• 关系意义上的拉伸—折叠类似物；
• 防止系统平凡爆炸或熄灭的有界／亚稳态区间；
• 多时间尺度的不规则性；
• 对尚未找到的具体 Rule 的明确依赖。

向上涌现的每个箭头都有独立条件与失败方式：

转变	需要的附加条件	典型失败方式
\(\mathrm{PR}_0\to\) 持续动力	重入或持续规则	只发生一次后终止
持续动力 \(\to\) ER/LE	扩展的关系局面，以及有限冲突解决／局部更新	静态重复、全局覆盖，或账目无界增长而不能解决
ER/LE \(\to\) 混沌或临界态	合适的非线性 Rule 与参数区间	不动点、短周期、熄灭或无结构爆炸
混沌 \(\to\) 持久图样	有界性、复现与局域稳定	没有记忆的均匀噪声
图样 \(\to\) 相互作用	可重复的碰撞或变换通道	图样互不影响地穿过或直接瓦解
相互作用 \(\to\) 类物质组织	守恒或准守恒的关系身份，以及可组合性	身份不能持久，或不能扩展绑定
类物质 \(\to\) 类化学组织	选择性结合、类催化路径与组合复用	惰性结构或组合崩溃
类化学 \(\to\) 生命与智能体	自维持、遗传、变异、选择与控制	复杂但不能自主延续
智能体 \(\to\) 反身性本源研究	记忆、抽象、类语言表征与元认知	只能适应、却不能建立本源模型的智能体

PR 本身不蕴含混沌；混沌本身不蕴含物质；类物质组织也不保证生命或智能。本文没有给出具体 Rule，也没有把模型与本宇宙作实证同一。

十二、不主张什么

本文没有证明：

• undefined 是事物、实质、场、原因或执行器；
• undefined 必须实际化；
• 静态公式能够自行执行；
• 一切可想象的形而上学都必须采用 \(\operatorname{Complete}_0\)；
• 永恒物质、无限回溯、循环根据或武断原始项在语法上矛盾，而不仅是不能完成所选任务；
• 柏拉图水晶中的数学存在就是实际发生；
• 所有形而上学语言都必须使用 undefined 这个符号；
• PR 本身能够保证持续、混沌、物质、化学、生命或智能；
• 可观测宇宙满足 B1–B4；
• 具体宇宙生成 Rule 已经被找到；
• 哥德尔定理是一条本体论证明；
• \(99.999\ldots\%=100\%\) 的比喻证明了本文定理。

十三、结论

所谓绝对真理的严格形式是一条命题，而不是一个对象：

在 A0、A0′ 与 A1–A5 下，\(U\) 跨可容许模型不变；按逻辑等价类计，它是全部本源本体论绝对真理的唯一根本生成命题。undefined 是这个边界角色的名称。

解释闭包定理补上了此前缺失的一步。A0 不再只是围住偏好模型的一道无解释围栏，而是“完整从无到有解释任务”的形式映像。对任何框架 \(\mathcal A\)，都有：

永恒物质、永恒规律、循环根据、无限回溯、外部执行和正面武断原始项，仍然是可描述的立场；但它们不能同时做到完成、终止、自足并且非武断地解释没有先在正面实际性条件下的实际发生。静态无 PR 理想宇宙树仍可以一致地存在于柏拉图水晶；因为数学可得性不蕴含实际发生，所以它不是反例。

如果另行假定实际化发生，并把实际存在认定为实际转变，那么第一实际发生就实例化 PR 的实际性核心。这并未把 undefined 变成原因。关键区别被保留下来：

因此，理论的“\(99.999\ldots\%\)”既不是正确概率，也不是等待补到 \(100\%\) 的残缺。它就像无限循环百分数本身：直觉把这种形式读成不完整，但它的精确值已经完整。对应到 \(U\) 的这一结论，由形式定理而不是数值类比来建立。

十四、声明

• 作者身份： Jia, Baolong 是唯一署名作者，并对框架、术语、论证与最终文本负责。
• AI协助： AI用于论证重构、双语起草、文字校对和内部对抗性评审；这不是外部同行评审。
• 外部同行评审： 无。
• 数据与代码： 本文定理不依赖经验数据集或分析代码。
• 资助、利益冲突与许可： 等待作者明确确认。

参考文献

1. Cantor, G. (1891). Über eine elementare Frage der Mannigfaltigkeitslehre. Jahresbericht der Deutschen Mathematiker-Vereinigung, 1, 75–78.
2. Gödel, K. (1931). Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme I. Monatshefte für Mathematik und Physik, 38, 173–198.
3. Tarski, A. (1956). The concept of truth in formalized languages. In Logic, Semantics, Metamathematics (J. H. Woodger, Trans.). Oxford University Press.
4. Jia, Baolong. 关于 undefined、实际化、PR、ER、LE 与宇宙第一拍的 PRERLE 研究笔记，未刊工作笔记，2026年。