中文
Boundary Theory · Xueqiang Gao

Autonomy boundaries, made computable — and machine-checked.

Boundary ontology · Variational sharpness · Computable criterion · Machine-checked proofs

Visible to those genuinely able to criticise it — checkable without belief.


Start here

Research map The global map of the research programme One figure showing where each research line stands — premises, formalisation, evidence, and interpretation.
Latest Current programme: the self-reference boundary machine (round 69) The newest round — what changed, and why it is not a paper.
Five minutes The idea, in four steps What the theory claims, in the order a reader needs it: ontology, geometry, dynamics, observable. No prerequisites.
The mathematics The boundary as a mathematical object Why an autonomy boundary can be defined as a stable closure fiber of an attribution functor — and what that definition buys.
Verification Machine-checked results The Lean development body, the exact commands that reproduce it, and an honest ledger of what is not proved.

The theory in four steps

The programme is not an optimisation trick. It is a chain from a philosophical concept to a machine-checked theorem:

philosophical concept→ formal mathematical object→ computable observable→ machine-checked theorem
LAYER I
ONTOLOGY
Causal intervention category
A1
Attributive presheaf  
A2
Causal cohesion is a closure operator
A3
THE BOUNDARY

interventions may still occur; attribution is no longer penetrated

Layer I establishes the object · Layer II selects an equilibrium of it — separately
LAYER II
MECHANICS
boundary sharpness
maintenance cost
uncertainty entropy
A4, A5
The theory in one figure. Layer I establishes what the boundary is; Layer II is a separate variational theory that selects an equilibrium of it. The categorical apparatus is not machinery for deriving the two-term potential.
Step 1 · Ontology What is a boundary? An agent's autonomy boundary is defined as the stable closure fiber of an attribution functor on a category of causal interventions. This is a definition, not a measurement. Definition
Step 2 · Geometry Give the boundary a coordinate: sharpness κ The object is projected onto a single scalar — how sharply the boundary discriminates. κ is what makes the object comparable across systems. Definition
Step 3 · Dynamics Two costs, one potential Maintenance cost grows with sharpness; uncertainty entropy falls with it. Their sum is a potential whose minimum is the equilibrium sharpness. Machine-Checked
Step 4 · Observable A criterion you could measure At the equilibrium the dimensionless ratio σ takes a definite value. Whether real agents exhibit it is an empirical question that has not been tested. Empirical prediction
Read this before the mathematics. The formal layer is built and machine-checked. The empirical layer is empty: no real deployed agent system has been tested. Every page states which of the five labels applies — Definition, Assumption, Machine-Checked Theorem, Conjecture, Empirical Prediction.

All pages

PageWhat it answersStatus
OverviewThe idea in four stepsbuilt
Current programmeLatest round: self-reference boundary machine (round 69)built
The objectWhat is the autonomy boundary, mathematically?built
The mechanicsWhy does a sharpness have an equilibrium?built
The observableWhat could actually be measured in an agent?built
Core hallThe seven pillars that survived, with the negatives that shaped thembuilt
AnchorsWhere the mathematics meets the worldbuilt
ScopeWhat this theory does not claimbuilt
Machine-checked resultsWhat is proved, and how do I reproduce it?built
Epistemic ledgerEvery claim, its tag, and where its evidence livesbuilt
The experimentThe falsifiable test that has not been runbuilt
Papers & codeManuscripts and source, with licencesbuilt
Research mapThe programme's global map of research linesbuilt
ChallengeHow to question or narrow a claimbuilt
Timestamp logSHA-256 hashes and OpenTimestamps proofs for all published outputsBuilt
AboutWho maintains this, and how to cite itbuilt

Timestamp log — SHA-256 hashes and OpenTimestamps proofs for all published outputs. → /timestamps


Contact & affiliation

NameXueqiang Gao (高学强)
RoleIndependent researcher
LocationChina
ResearchA formal theory of autonomy boundaries — making the boundaries of AI agents computable, testable and machine-checked.
Found something to challenge? → How to challenge this work