Pattern Field Theory CorpusINTERNAL - approval requiredJSONPDF

Pattern Field Theory Paper Repository

EQUI and Admissibility Geometry - Structural Projection, Basin Topology, and Regime Selection in Pattern Field Theory

Author: James Johan Sebastian Allen

Repository Files

Corpus record: PFT:EQUI_AND_ADMISSIBILITY_GEOMETRY_STRUCTURAL_PROJECTION_BASIN_TOPOLOGY_AND_REGIME_SELECTION

Availability: patternfieldtheory zenodo academia

Publication check: pending database verification. Public approval: no.

EQUI and Admissibility Geometry - Structural Projection, Basin Topology, and Regime Selection in Pattern Field Theory

EQUI and Admissibility Geometry - Structural Projection, Basin Topology, and Regime Selection in Pattern Field Theory

James Johan Sebastian Allen
PatternFieldTheory.com

2026-05-08

Abstract

This paper formalizes admissibility geometry in Pattern Field Theory and defines the EQUI operator as a structural boundary-enforcement and stabilization operator over configuration space. We distinguish between generative configuration space and realizable state space and show that divergences, singularities, and unbounded quantities correspond to non-admissible regions rather than physical states. Infinities are shown to be boundary markers, not values. EQUI is not a force and not a dynamical evolution law, but a selection and projection operator that enforces realizability, closure, and boundedness. This paper establishes the geometric basis for structural ceilings, regime boundaries, and stabilization in the Pattern Field Theory framework.

image

Scope and Objective

This paper defines admissibility as a structural property of configuration space and introduces the induced admissibility geometry. The objective is to formalize the operator role of EQUI as boundary enforcement and stabilization and to provide a clean dependency interface for later empirical ceiling papers.

Configuration Space and Realized State Space

Definition 1 (Configuration Space). Let \(\mathcal{C}\) denote the space of formally specifiable configurations of the generative system.

Definition 2 (Realized State Space). Let \(\mathcal{R} \subset \mathcal{C}\) denote the subset of admissible configurations that are realizable as stabilized structure.

Definition 3 (Admissibility). A configuration \(c \in \mathcal{C}\) is admissible if it satisfies closure, boundedness, and stabilization constraints.

Admissibility Geometry

Definition 4 (Admissibility Geometry). Admissibility geometry is the induced constraint geometry on \(\mathcal{C}\) defined by the boundary \(\partial \mathcal{R}\) separating admissible from non-admissible configurations.

Proposition 1. Let \(\gamma : [0,1] \rightarrow \mathcal{C}\) be a model trajectory. If \(\gamma(t)\) is defined by an unconstrained evolution rule on \(\mathcal{C}\), then any divergence or singular behavior corresponds to the case where \(\gamma(t)\) approaches or crosses \(\partial \mathcal{R}\).

Formal Diagram of Admissibility and EQUI

Remark 1. The diagram represents a constraint geometry. \(\mathcal{C}\) is definability. \(\mathcal{R}\) is realizability. \(\partial \mathcal{R}\) is the admissibility boundary. EQUI is a projection and stabilization operator into \(\mathcal{R}\).

The EQUI Operator

Definition 5 (EQUI Operator). Let \[\mathrm{EQUI} : \mathcal{C} \rightarrow \mathcal{R}\] be a structural projection and stabilization operator that maps a configuration to an admissible configuration or rejects it as non-realizable.

Proposition 2. For any admissible configuration \(r \in \mathcal{R}\), \(\mathrm{EQUI}(r)=r\).

Proposition 3. If \(c \in \mathcal{C}\setminus \mathcal{R}\) and \(\mathrm{EQUI}(c)\) exists, then \(\mathrm{EQUI}(c)\) is a boundary-respecting repair of \(c\) into \(\mathcal{R}\).

EQUI and Equilibrium

Definition 6 (Equilibrium). Equilibrium is a property of a realized state describing local structural stability inside \(\mathcal{R}\).

Proposition 4. EQUI and equilibrium are categorically distinct. EQUI is an operator on configurations. Equilibrium is a state property inside \(\mathcal{R}\).

Non-Admissible Configurations and Boundary Markers

Definition 7 (Non-Admissible Configuration). A configuration is non-admissible if it violates at least one structural constraint required for stabilization.

Proposition 5. Infinities are boundary markers of admissibility. They correspond to attempted evaluation outside \(\mathcal{R}\).

Structural Ceilings as Admissibility Bounds

Definition 8 (Structural Ceiling). Let \(f:\mathcal{R}\rightarrow\mathbb{R}\) be a realizable measurement functional. A structural ceiling is a finite bound \(B\) such that \[f(r)\le B \quad \text{for all } r\in\mathcal{R},\] with at least one maximizing sequence \(\{r_n\}\subset\mathcal{R}\) satisfying \(f(r_n)\rightarrow B\).

Proposition 6. If a modeling pipeline proposes configurations \(c\in\mathcal{C}\) with \(f(c)>B\), then those outputs are non-admissible with respect to the constraint geometry induced by \(\mathcal{R}\).

Dependent Theorem Chain Interface to GW170817 Ceiling Analysis

This section defines a dependency interface. It does not import event details. It defines the formal chain used by the GW170817 ceiling paper.

Definition 9 (Empirical Configuration Map). Let \(D\) denote an empirical dataset and let \(\Phi_D\) be a mapping from data to a subset of configurations: \[\Phi_D : D \rightarrow \mathcal{C}.\] Let \(\mathcal{C}_D := \Phi_D(D)\) denote the data-induced configuration set.

Definition 10 (Data-Induced Realizable Set). Define the realizable subset of the data-induced set by \[\mathcal{R}_D := \mathcal{C}_D \cap \mathcal{R}.\]

Lemma 1. If \(\mathcal{R}_D\) is non-empty and \(f:\mathcal{R}\rightarrow\mathbb{R}\) is bounded above on \(\mathcal{R}\) by a ceiling \(B\), then \(f\) is bounded above on \(\mathcal{R}_D\) by the same ceiling \(B\).

Proposition 7 (Ceiling Estimator Definition). Let \(f:\mathcal{R}\rightarrow\mathbb{R}\) be the ceiling functional used in a domain paper. Define the empirical ceiling estimator from data-induced realizable configurations by \[\widehat{B}_D := \sup_{r\in\mathcal{R}_D} f(r).\] Then \(\widehat{B}_D \le B\) whenever the admissibility ceiling \(B\) exists.

Proposition 8 (Boundary Saturation Criterion). If \(\widehat{B}_D\) approaches \(B\) within a chosen tolerance under increased data quality or increased posterior sampling resolution, then the dataset is consistent with boundary saturation for the functional \(f\) relative to \(\mathcal{R}\).

Remark 2. In the GW170817 ceiling paper, \(D\) is instantiated by publicly released posterior samples and \(\Phi_D\) is instantiated by the model-to-configuration parameterization used in that paper. The ceiling functional \(f\) is instantiated by the compactness-tidal structural functional defined there. This paper supplies the admissibility logic and the boundary meaning of the ceiling.

Conclusion

EQUI defines the operator separation between definability and realizability. Admissibility geometry defines the boundary meaning of divergences and the origin of structural ceilings. The dependent theorem chain defined here provides a formal bridge to empirical ceiling papers without importing domain specifics into the present paper.

Glossary

Admissibility - The property of a configuration satisfying closure, boundedness, and stabilization constraints.

EQUI - Structural admissibility and stabilization operator.

Configuration Space - Space of all formally specifiable configurations.

Realized State Space - Subset of admissible and stabilized configurations.

Structural Ceiling - Maximum admissible bound induced by admissibility geometry.

References

This paper defines formal structures. Empirical instantiations and experimental validations are provided in subsequent domain-specific papers in the Pattern Field Theory series.

Document Timestamp and Provenance

This document is part of Pattern Field Theory (PFT) and the Allen Orbital Lattice (AOL). It defines the EQUI admissibility operator and admissibility geometry used by subsequent papers in the series. Pattern Field Theory (PFT) and related marks are claimed trademarks. This work is licensed under the Pattern Field Theory Licensing framework (PFTL). Any research, derivative work, or commercial use requires an explicit license from the author.