The Logical Structure of Physical Laws A Fixed Point Reconstruction
📝 Original Paper Info
- Title: The Logical Structure of Physical Laws A Fixed Point Reconstruction- ArXiv ID: 2512.25057
- Date: 2025-12-31
- Authors: Eren Volkan Küçük
📝 Abstract
We formalise the self referential definition of physical laws using monotone operators on a lattice of theories, resolving the pathologies of naive set theoretic formulations. By invoking Tarski fixed point theorem, we identify physical theories as least fixed points of admissibility constraints derived from Galois connections. We demonstrate that QED and General Relativity can be represented in such a logical structure with respect to their symmetry and locality principles.💡 Summary & Analysis
1. **Key Contribution**: This paper explores the concept of 'self-subsumption' to mathematically encapsulate stability in laws, a critical idea in both physics and metaphysics. 2. **Simple Explanation**: Laws are rules that accurately predict natural phenomena. The paper uses the concept of self-subsumption to make these laws more robust, similar to how bricks must interlock for a sturdy building structure. 3. **Sci-Tube Style Script**: - [Easy] What is a law? A law helps us understand the world. This paper uses 'self-subsumption' to make laws more reliable and stable. - [Intermediate] The paper proposes using mathematical stability to address significant issues in physics and metaphysics, ensuring that these laws remain consistent across different scenarios. - [Advanced] By employing self-subsumption and Tarski's fixed point theorem, the paper mathematically captures and controls law stability, providing a structured approach for robust theoretical frameworks.📄 Full Paper Content (ArXiv Source)
A recurring thought in both metaphysics and physics is that lawhood is tied to a kind of stability: Laws are not merely true regularities, but statements (or structures) that remain robust under appropriate changes of description, coordinate choice, or background assumptions. In philosophy, this idea is often expressed by appealing to invariance. What is objective, and what counts as a genuine explanatory pattern, should be invariant under an admissible class of transformations . In physics the same theme appears concretely as symmetry and constraint principles. A mature theory is not just a list of dynamical equations; it is a package that is closed under the consequences of its constitutive requirements (symmetry, locality, unitarity, renormalisability, covariance, etc.).
This paper studies a particularly strong way of packaging that stability idea, which we call self-subsumption, that is, the proposal that the selected laws are exactly those candidates that satisfy an admissibility criterion whose evaluation itself depends on the totality of selected laws. Schematically, one tries to say
\text{"}\psi\in P \iff \text{$\psi$ is admissible relative to $P$"}.
Read naively and extensionally, this easily collapses into a Russell-style type confusion. The criterion is applied to an object of the wrong kind, and if one forces well-formedness by collapsing levels, the resulting statement degenerates into a toxic self-membership condition of the form $`P\in P`$ . Our first aim is to make this failure precise and to isolate what, in the extensional encoding, turns an intended explanatory constraint into either ill-typed syntax or a trivial self-endorsement.
Our second aim is to give a repair that preserves the self-subsumption idea while preventing the type collapse. The central move is to keep distinct the type of laws (elements of a candidate domain) and the type of law-packages (sets, subspaces, or other structured collections of laws). Once this distinction is enforced, the self-subsumption biconditional becomes a fixed point equation for an induced admissibility operator. In the basic setting where packages form a complete lattice and the admissibility operator is monotone, Tarski’s theorem guarantees fixed points and provides canonical extremal solutions, in particular a least fixed point $`\mu\mathcal F`$ . This brings self-reference into a familiar and mathematically controlled form, analogous in spirit (though not identical in purpose) to fixed point treatments of semantic self-reference .
Our third aim is to explain how this fixed point normal form functions as a useful template in physics. The formalism is not proposed as a machine that derives the laws of nature from first principles. Rather, it isolates a structural pattern already implicit in practice: Once a candidate domain $`\Sigma`$ is fixed and one specifies admissibility constraints, one obtains a completion map $`\mathcal F`$ whose fixed points are exactly the closed, admissible theory-packages. Importantly, such completion maps need not be inflationary. A “seed” $`S`$ may serve only to extract constraints that determine an admissible completion $`\mathcal F(S)`$, without requiring $`S\subseteq \mathcal F(S)`$. This feature matches common physics methodology, where a partial commitment can select a canonical completion under additional principles.
The main results can be summarised as follows:
-
We show that an extensional set-theoretic formulation of self-subsumption either becomes ill-typed or collapses into self-membership once levels are identified.
-
We give a typed reconstruction in which self-subsumption is equivalent to a fixed point equation $`P=\mathcal F(P)`$ on a lattice of packages, with canonical minimal choice $`P=\mu\mathcal F`$ under monotonicity.
-
We provide an invariance-based construction of monotone admissibility operators via a Galois correspondence between packages and symmetry groups, and illustrate the framework with toy instantiations for QED and GR.
In that light, the plan of the paper is as follows: Section 2 diagnoses the failure of the extensional formulation. Section 3 develops the typed fixed point reconstruction and establishes the fixed point normal form. Section 4 explains how to instantiate the schema in physics via completion operators encoding constitutive constraints. Section 5 presents the QED and GR examples. We conclude by summarising what the fixed point viewpoint clarifies, and what it does not attempt to settle about the metaphysics of laws.
Failure of Extensional Set-Theoretic Formulation
Our first aim is to show that an extensional set-theoretical formulation1 of self-subsumption leads to inconsistencies, or is just unfruitful, in the sense of being a tautology. More concretely, it shows that a naive extensional set-theoretic encoding either (i) is ill-typed unless one collapses levels, or (ii) collapses into $`P\in P`$ once levels are collapsed.
Let $`\Lambda`$ be a set of candidate laws.2 Represent the characteristic $`C`$ extensionally by its extension
C^{\mathrm{ext}}\subseteq \Lambda,
\qquad \psi\in C^{\mathrm{ext}} \iff C(\psi).
Define the “selected” laws
P \;:=\; \{\psi\in\Lambda : C(\psi)\}.
Lemma 1. Under the extensional reading above, $`P=C^{\mathrm{ext}}`$.
Proof. For all $`\psi\in\Lambda`$, $`\psi\in P \iff C(\psi) \iff \psi\in C^{\mathrm{ext}}.`$ Hence $`P=C^{\mathrm{ext}}`$ by extensionality. ◻
The informal move “assume $`C(P)`$” requires that $`P`$ is a legitimate argument of $`C(\cdot)`$. In the present encoding, $`C(\cdot)`$ is a predicate on elements of $`\Lambda`$, so $`C(P)`$ is meaningful only if
P \in \Lambda.
But $`P`$ was constructed as a subset $`P\subseteq \Lambda`$, i.e. a law-set (a set of laws, possibly defined under certain criteria) rather than a law. Treating $`P`$ simultaneously as an element of $`\Lambda`$ is a type collapse .
One can force this by choosing a universe $`\Lambda`$ that contains sets among its “laws”. In that case, the extensional collapse becomes toxic:
Proposition 1. *Assume the extensional setup above, and also assume the type-collapsing condition $`P\in\Lambda`$ so that $`C(P)`$ is well-formed. Then
C(P)\quad\Longrightarrow\quad P\in P.
```*
</div>
<div class="proof">
*Proof.* By definition, $`C(P)`$ means $`P\in C^{\mathrm{ext}}`$. By
Lemma <a href="#lem:collapse" data-reference-type="ref"
data-reference="lem:collapse">1</a>, $`C^{\mathrm{ext}}=P`$, hence
$`P\in P`$. ◻
</div>
<div class="corollary">
**Corollary 1**. *In ZFC with Foundation, the conjunction of the
extensional reconstruction and $`C(P)`$, made well-formed by
$`P\in\Lambda`$, is inconsistent.*
</div>
In non-well-founded set theories, $`P\in P`$ can be consistent .
However, in the extensional encoding, the intended explanation
``` math
\text{"$P$ is true because $C(P)$"}
reduces to
\text{"$P$ is true because $P\in P$"}.
Since this provides no independent ground beyond $`P`$’s self-membership, it amounts to a trivial self-endorsement, and thus makes explicit the unfruitfulness of the extensional formulation.
A Typed Fixed Point Reconstruction
The central repair to this problem is to keep types distinct:
\text{(laws)}\;\;\psi\in\Lambda
\qquad\text{vs.}\qquad
\text{(law-sets)}\;\;S\subseteq\Lambda.
Definition 1. Let $`\Lambda`$ be a set of Gödel codes of candidate laws (sentences). Let $`\Psi:=\mathcal P(\Lambda)`$ be the complete lattice of law-sets ordered by $`\subseteq`$.3
Definition 2. Let $`C:\Psi\times\Lambda\to\{\top, \bot \}`$ be a Boolean-valued predicate depending on a background law-set $`S`$ and a candidate law $`\psi`$.4 Define
\mathcal F:\Psi\to\Psi,\qquad
\mathcal F(S):=\{\psi\in\Lambda : C(S,\psi)\}.
Assumption 1. Assume $`\mathcal F`$ is monotone5:
S\subseteq T \;\Rightarrow\; \mathcal F(S)\subseteq \mathcal F(T).
Since $`(\Psi,\subseteq)`$ is a complete lattice and $`\mathcal F`$ is monotone, fixed points exist:
Theorem 1 (Tarski’s fixed point theorem in specialised form). Let $`(\Psi,\subseteq)`$ be a complete lattice and $`\mathcal F:\Psi\to\Psi`$ monotone. Then the set of fixed points of $`\mathcal F`$ is a complete lattice; in particular, there exists a least fixed point, denoted $`\mu\mathcal F`$.
By Tarski’s fixed point theorem, the set of all fixed points of a monotone operator $`\mathcal F:\Psi \to \Psi`$ forms a complete lattice. The least fixed point is given by
\mu \mathcal F\;=\; \bigcap \{\, S \in \Psi \;:\; \mathcal F(S)=S \,\}.
Thus
\mathcal F(\mu \mathcal F) = \mu \mathcal F,
\qquad
\forall S \in \Psi \;\; \big(\mathcal F(S)=S \;\Rightarrow\; \mu \mathcal F\subseteq S\big).
Lemma 2. *Let $`(\Psi,\subseteq)`$ be a complete lattice with least element $`\bot_\Psi`$, and let $`\mathcal F:\Psi\to\Psi`$ be monotone. If $`\mathcal F(\bot_\Psi)`$ is a fixed point, i.e. $`\mathcal F(\mathcal F(\bot_\Psi))=\mathcal F(\bot_\Psi)`$, then
\mu \mathcal F\;=\; \mathcal F(\bot_\Psi).
```*
</div>
<div class="proof">
*Proof.* Let $`X`$ be any fixed point, so $`\mathcal F(X)=X`$. Since
$`\bot_\Psi\subseteq X`$, monotonicity gives
$`\mathcal F(\bot_\Psi)\subseteq \mathcal F(X)=X`$. Thus
$`\mathcal F(\bot_\Psi)`$ is contained in every fixed point. If
$`\mathcal F(\bot_\Psi)`$ is itself fixed, it is the least fixed
point. ◻
</div>
<div class="definition">
**Definition 3**. Define the deepest law-set by
``` math
P \;:=\; \mu\mathcal F.
We will use only the defining fixed point property:
\mathcal F(P)=P.
Now, to define the membership, we set the following proposition:
Proposition 2. *For all $`\psi\in\Lambda`$,
\psi\in P \iff \psi\in\mathcal F(P) \iff C(P,\psi).
```*
</div>
Thus $`P`$ "explains" its members in the following limited but precise
sense:
``` math
\psi\in P \;\Rightarrow\; C(P,\psi).
For a law to “contain its own truthmaker” in the same formulation as the law itself, let $`L`$ be a fixed formal language and let $`\Lambda\subseteq\mathbb N`$ be a set of Gödel codes for $`L`$-sentences. Let $`p\in\Lambda`$ be the code of a sentence that expresses the meta-principle internally by quantifying over codes. Schematically, we may write
p \;\equiv\; \forall n\in\Lambda\;\Big(C(P,n)\ \Rightarrow\ \mathsf{Obtain}(n)\Big),
where $`\mathsf{Obtain}(n)`$ is read as “the law coded by $`n`$ obtains” (i.e. is among the selected/actualised laws).6
Proposition 3. If $`C(P,p)`$ holds, then $`p\in P`$.
Proof. If $`C(P,p)`$ holds, then $`p\in\mathcal F(P)`$. Since $`P`$ is a fixed point, $`\mathcal F(P)=P`$, hence $`p\in P`$. ◻
The “principle includes itself” statement is now the typed membership $`p\in P`$ (a sentence in a set of sentences), not $`P\in P`$ (a set a member of itself). Thus, the Foundation problem does not arise.
Our construction used $`\Psi=\mathcal P(\Lambda)`$, as a set of Gödel codes of candidate law-sentences, but the underlying pattern is more general. Let $`(T,\le)`$ be a partially ordered set of candidate theories (or “law-sets”). Intuitively, $`S\le T`$ means “$`T`$ has at least as much content/commitment/information as $`S`$”.
To model a self-subsuming principle, we need a way to say when an item (law, constraint, statement, datum) is admissible relative to a candidate theory.
Definition 4. Let $`U`$ be a universe of candidate items (laws, constraints, axioms, sentences, parameters, etc.). An admissibility predicate is any relation
D \;\subseteq\; T\times U,
\qquad
D(S,u)\ \text{read: "$u$ is admissible/endorsed given $S$"}.
When $`T`$ is a space of law-sets (e.g. $`T=\mathcal P(\Lambda)`$), one typically identifies $`U`$ with the same kind of objects (e.g. $`U=\Lambda`$) and regards $`S`$ as endorsing exactly those $`u`$ satisfying $`D(S,u)`$.7 This motivates the associated operator:
Definition 5. Assume $`T`$ is a collection of subsets of $`U`$. Define an operator
\mathcal F_D:T\to T,
\qquad
\mathcal F_D(S):=\{u\in U: D(S,u)\}.
Proposition 4. *For any admissibility predicate $`D`$ and induced operator $`\mathcal F_D`$, a candidate $`P\in T`$ satisfies the self-subsumption biconditional
\forall u\in U\;\;\big(u\in P \iff D(P,u)\big)
if and only if $`P`$ is a fixed point of $`\mathcal F_D`$, i.e. $`\mathcal F_D(P)=P`$.*
Proof. By definition, $`u\in \mathcal F_D(P)\iff D(P,u)`$, hence
u\in P \iff D(P,u)
\quad\Longleftrightarrow\quad
u\in P \iff u\in \mathcal F_D(P),
which is equivalent to $`P=\mathcal F_D(P)`$ by extensionality of sets. ◻
Proposition 4 says any attempt to characterise a fundamental law-set $`P`$ by a membership rule that itself refers to $`P`$ is exactly a fixed point equation. Our $`C(P,\psi)`$ is one instance with $`D=C`$ and $`U=\Lambda`$. No monotonicity or lattice assumptions are required for Proposition 4 to hold.
By contrast, the existence of fixed points and the availability of a canonical choice, such as the least fixed point $`\mu \mathcal F`$, do require additional hypotheses. In the closure-style regime considered here, we assume $`\mathcal F`$ is monotone on a complete lattice, so that Tarski guarantees fixed points and yields distinguished extremal solutions. Non-monotone admissibility notions (for instance consistency or optimality constraints) may still admit fixed points but fall outside the scope of the Tarski canonicity argument. For this reason, to get the existence of fixed points systematically, one typically assumes a lattice-theoretic structure and monotonicity. At the beginning of this section, we have a complete lattice $`\Psi=\mathcal P(\Lambda)`$ and (by Assumption 1) a monotone operator $`\mathcal F`$. Hence, Tarski applies and yields least and greatest fixed points; in particular $`P=\mu\mathcal F`$ is well-defined.
Importantly, Tarski-style existence does not require uniqueness. In fact, the general conclusion is the opposite: Fixed points can form a rich lattice. If our aim is to analyse where such assumptions lead, this is a feature:
-
different fixed points correspond to different admissible global law-sets satisfying the same meta-criterion,8
-
the least and greatest fixed points give canonical extremal solutions,
-
studying the lattice of fixed points becomes a principled way to study the space of possible “fundamental” packages consistent with a given admissibility concept.
So the fixed point framework is naturally a constraint-analysis engine. The genuinely structural content is:
\text{(self-subsumption schema)} \quad\Rightarrow\quad \text{(fixed point equation)}.
Choosing which fixed point (least, greatest, or another) is an extra selection principle. Our choice of $`\mu \mathcal F`$ corresponds to a minimality stance.
The equation $`P=\mathcal F(P)`$ is still a circular characterisation. The fixed point method does not erase circularity; it replaces it with a non-vicious circularity9 resolved by a selection principle, that is, “choose the least fixed point $`P=\mu\mathcal F`$”.
Given $`\mathcal F`$, $`P=\mu\mathcal F`$ is canonical. But the choice of $`\mathcal F`$ (equivalently, of the admissibility criterion $`C`$) is a remaining datum. In another light, such a choice would not say much about the structural content of the theory, and would work as a choice of gauge.
Physical Instantiation
The fixed point normal form is a meta-constraint template. To apply it to physics, fix (i) a candidate domain of laws $`\Sigma`$ and (ii) a lattice of theory-packages $`\mathcal T`$ (such as $`\mathcal P(\Sigma)`$, or as in the Examples section below, lattice of linear subspaces when $`\Sigma`$ is a vector space) together with an admissibility operator $`\mathcal F:\mathcal T\to\mathcal T`$ encoding the chosen constraints. A package counts as admissible precisely when it is closed:
P=\mathcal F(P).
In physics, certain requirements function less like contingent dynamical laws and more like constitutive constraints. Examples include unitarity, symmetry principles, locality/causality constraints, renormalisability, etc. A natural reading of our framework is:
A package counts as a physical theory only if it is closed under the implications of these admissibility constraints.
Thus, $`\mathcal F(S)`$ returns the admissible completion determined by the constraints extracted from $`S`$.10 As an intuitive example, let $`\mathcal T`$ be a space of partial “theory data” ordered by “information content”. Define $`\mathcal F(S)`$ to be the admissible completion operator of $`S`$ under a certain set of admissibility constraints, which ought to be chosen by the physicist according to the subject in question. Then, fixed points are solutions that give canonical admissible packages; that is, $`S`$ is admissible iff $`\mathcal F(S)=S`$.
In this reading, our framework organises the landscape such that the fixed points are the admissible theories, and extremal solutions ($`\mu \mathcal F`$, $`\nu \mathcal F`$) give canonical minimal structures.
Therefore, one can state a “metaprinciple” as follows:
Meta-principle: Any proposal in which “the laws of nature” are characterised as exactly those statements satisfying an admissibility criterion that itself depends on the totality of laws has, in general, fixed point form $`P=\mathcal F(P)`$, with a canonical minimal choice, $`\mu \mathcal F`$.
A General Logical Architecture
While the logical schema outlined guarantees fixed points for any monotone operator, we must identify a physically motivated operator that satisfies this property. As noted previously, simple consistency checks are often non-monotone and metatheoretically complex. In this section, we propose that the interplay between Dynamical Laws and Symmetry Groups provides the robust, monotonic structure required to ground self-subsuming principles.
Let us define two abstract domains of discourse for a physical theory:
Definition 6 (The Space of Laws, $`\Sigma`$). Let $`\Sigma`$ be a chosen candidate set of possible mathematical formulations of dynamical constraints.
Definition 7 (The space of symmetry groups, $`\Gamma`$). Let $`\Gamma`$ be a poset of admissible symmetry groups acting on the system, ordered by inclusion. In typical applications $`\Gamma`$ is a family of subgroups of a fixed ambient transformation group (e.g. internal gauge transformations, or $`\operatorname{Diff}(M)`$), and we assume $`\Gamma`$ is closed under the joins needed below (e.g. it is a complete lattice, or at least admits the join of the relevant collections of subgroups).11
Next, we posit a binary relation $`R\subseteq \Sigma\times \Gamma`$, where $`\phi\,R\,G`$ means that the law $`\phi`$ respects the symmetry group $`G`$.12 This relation induces two canonical mappings:
Definition 8 (Invariant map, $`\operatorname{Inv}:\Gamma\to \mathcal T`$). For $`G\in\Gamma`$, define
\operatorname{Inv}(G)\;:=\;\{\phi\in \Sigma:\ \phi\,R\,G\},
viewed as an element of the package lattice $`\mathcal T`$ (e.g. if $`\mathcal T`$ is a lattice of linear subspaces, then $`\operatorname{Inv}(G)`$ is automatically a subspace because linear combinations of invariant laws are invariant).
Definition 9 (Symmetry map, $`\operatorname{Sym}:\mathcal T\to\Gamma`$). For $`S\in\mathcal T`$, define
\operatorname{Sym}(S)\;:=\;\bigvee \{\,G\in\Gamma:\ S\subseteq \operatorname{Inv}(G)\,\},
i.e. the greatest symmetry in $`\Gamma`$ compatible with $`S`$ (the join exists by the standing closure assumption on $`\Gamma`$).
With these definitions, one has the Galois correspondence
S\subseteq \operatorname{Inv}(G)\quad\Longleftrightarrow\quad G\subseteq \operatorname{Sym}(S),
so $`\operatorname{Inv}`$ and $`\operatorname{Sym}`$ form an antitone Galois connection between packages and symmetry groups. In particular, $`\operatorname{Inv}`$ is antitone and $`\operatorname{Sym}`$ is antitone, hence their composition is monotone. The logic follows directly from the reversal of the inclusion order twice:
\begin{equation}
S_1 \subseteq S_2 \implies \operatorname{Sym}(S_2) \subseteq \operatorname{Sym}(S_1) \implies \operatorname{Inv}(\operatorname{Sym}(S_1)) \subseteq \operatorname{Inv}(\operatorname{Sym}(S_2)).
\end{equation}
We then obtain a canonical invariance-based completion operator
\begin{equation}
\label{eq:invariance-closure}
\mathcal F(S)\;:=\;\operatorname{Inv}(\operatorname{Sym}(S)).
\end{equation}
This operator is monotone on $`\mathcal T`$, so by Tarski’s theorem it admits fixed points. Fixed points $`P=\mathcal F(P)`$ are precisely packages that are symmetry-closed relative to the chosen candidate domain and admissible symmetry family.
More general admissibility operators may be built by composing $`\operatorname{Sym}`$ and $`\operatorname{Inv}`$ with additional monotone meta-maps, such as the localisation map on $`\Gamma`$, encoding a gauge principle in the QED example below. Such operators remain monotone but need not satisfy $`S\subseteq \mathcal F(S)`$, so a seed may select an admissible completion without being contained in it.
Cases with More Structural Constraints
It is important to emphasise that the specific Law–Symmetry duality need not be the only structural constraint on a physical theory. In practice, mature theories must satisfy multiple independent requirements, such as symmetry (gauge, Lorentz, diffeomorphism, etc.), causality, and unitarity, simultaneously. A strength of the fixed point schema is that such requirements can be composed into a single admissibility operator.
In the abstract discussion, the package lattice $`\mathcal T`$ need not be a powerset $`\mathcal P(\Sigma)`$. In the Examples section, for instance, $`\Sigma`$ is a vector space of candidate Lagrangian terms and $`\mathcal T`$ is taken to be the complete lattice of linear subspaces of $`\Sigma`$. In such cases, an operator defined naively by
S\longmapsto \{\psi\in\Sigma:\ C(S,\psi)\}
need not land in $`\mathcal T`$. To define admissibility operators uniformly on an arbitrary package lattice $`\mathcal T`$, we introduce a package closure map that projects subsets of $`\Sigma`$ to the least package containing them.
Definition 10. Let $`\mathcal T\subseteq \mathcal P(\Sigma)`$ be a complete lattice of packages ordered by $`\subseteq`$. Define the closure operator
\langle X\rangle_{\mathcal T}\;:=\;\bigwedge\{\,P\in\mathcal T:\ X\subseteq P\,\}\in\mathcal T,
\qquad X\subseteq \Sigma.
If $`\mathcal T=\mathcal P(\Sigma)`$ then $`\langle X\rangle_{\mathcal T}=X`$. If $`\Sigma`$ is a vector space and $`\mathcal T`$ is the lattice of linear subspaces, then $`\langle X\rangle_{\mathcal T}=\mathrm{span}(X)`$.
Each physical principle may be encoded as a monotone operator
\mathcal F_i:\mathcal T\to\mathcal T,
for instance via a predicate $`C_i(S,\psi)`$ by setting
\mathcal F_i(S)\;:=\;\Big\langle \{\psi\in\Sigma:\ C_i(S,\psi)\}\Big\rangle_{\mathcal T}.
Given a family of monotone operators $`\{\mathcal F_i\}_i`$, define their combined operator by the meet in $`\mathcal T`$:
\mathcal F_{\mathrm{tot}}(S)\;:=\;\bigwedge_i \mathcal F_i(S).
In the examples, $`\mathcal T`$ is closed under intersections, so this meet is simply $`\bigcap_i \mathcal F_i(S)`$.
Lemma 3. If each $`\mathcal F_i`$ is monotone, then $`\mathcal F_{\mathrm{tot}}`$ is monotone.
Proof. If $`S\subseteq S'`$ then $`\mathcal F_i(S)\subseteq \mathcal F_i(S')`$ for all $`i`$. Hence $`\bigwedge_i \mathcal F_i(S)\subseteq \bigwedge_i \mathcal F_i(S')`$, so $`\mathcal F_{\mathrm{tot}}`$ is monotone. ◻
Thus, on a complete lattice of theory-packages $`\mathcal T`$, Tarski’s theorem applies to $`\mathcal F_{\mathrm{tot}}`$. In particular, $`\mathcal F_{\mathrm{tot}}`$ admits fixed points, and its least fixed point $`\mu\mathcal F_{\mathrm{tot}}`$ gives a canonical minimal package stable under all encoded principles.
This shows that the fixed point view is not tied to any single physical hypothesis, but provides a general logical architecture: Once a domain of candidates $`\Sigma`$ and admissibility constraints are specified, “the theory” is a structure in the lattice of theory-packages. Additional principles, known or yet to be discovered, correspond to refining $`\mathcal F_{\mathrm{tot}}`$, which updates the resulting stable packages accordingly. Of course, choosing or discovering such criteria is itself a philosophical problem to be discussed, which will not be attempted here.
Fixed points of the operator $`P=\mathcal F(P)`$ may be called closed theory-packages relative to $`\Sigma`$. The laws in $`P`$ determine a symmetry content $`\operatorname{Sym}(P)`$, and $`\operatorname{Inv}(\operatorname{Sym}(P))`$ returns the set of laws compatible with that symmetry content within the chosen candidate domain. Thus, $`P`$ contains no terms that break its admitted symmetries, and it is complete with respect to the chosen convention. Tarski’s theorem guarantees a least fixed point, which is the minimal closed package relative to $`\mathcal F`$ (and to $`\Sigma`$).
In summary, the Galois connection provides a mathematically well-behaved admissibility operator built from invariance, avoiding the metatheoretic difficulties of treating raw “consistency checking” as the primary admissibility filter.
Examples
In the physics examples below, we show that once one fixes a natural candidate domain and encodes standard physical constraints (symmetry, locality, and a truncation criterion) as a monotone completion operator, familiar theories such as QED and GR can be presented as fixed points of that operator. For more information on the subjects, the reader is kindly directed to .
I. Quantum Electrodynamics
Operator domain.
Fix four-dimensional Minkowski spacetime.13 Let $`\Sigma_{\le 4}`$ denote the vector space of local polynomial Lagrangian densities built from a Dirac spinor $`\psi(x)`$ and a vector potential $`A_\mu(x)`$, and finitely many derivatives, subject to:
-
a power-counting bound of dimension $`\le 4`$ ;
-
an equivalence relation $`\sim`$ identifying densities that differ by a total derivative and by standard “inessential” redundancies caused by integration by parts.
We write $`[\mathcal O]\in \Sigma_{\le 4}`$ for the equivalence class of a density $`\mathcal O`$. This implements the idea that physics is insensitive to Lagrangian terms differing by boundary terms.
Theory packages.
A theory package $`S`$ will be represented as a linear subspace $`S\subseteq \Sigma_{\le 4}`$, spanned by a chosen generating set of operator classes. In particular, if $`[\mathcal O_1],[\mathcal O_2]\in S`$, then $`a[\mathcal O_1]+b[\mathcal O_2]\in S`$ for all scalars $`a,b`$, where the linear closure is treated as background structure instead of a part of the admissibility operator.14
Symmetry space.
Let $`\Gamma`$ be a poset of symmetry groups acting on the fields, ordered by inclusion. Since we fix Minkowski spacetime and restrict attention to Lorentz-scalar densities, spacetime symmetries are treated as background constraints and omitted from $`\Gamma`$ (although it is trivial to incorporate them, as well as the discrete symmetries).15 Since $`\psi`$ carries no additional flavour or internal index, the relevant internal symmetry transformations are constant, non-spacetime field redefinitions $`\psi\mapsto U\psi`$ that preserve the free Dirac density $`\bar\psi(i\gamma^\mu\partial_\mu-m)\psi`$. Preservation of the mass term requires $`\bar\psi\psi\mapsto \bar\psi\psi`$, and preservation of the kinetic term requires $`\bar\psi\gamma^\mu\partial_\mu\psi\mapsto \bar\psi\gamma^\mu\partial_\mu\psi`$. These two requirements imply that $`U`$ commutes with the Dirac bilinear structure, hence $`U`$ can only act as multiplication by a constant phase. Imposing unitarity restricts this to $`U=e^{i\theta}`$, so the continuous internal symmetry group is $`U(1)_{\mathrm{glob}}`$. The free theory has a global symmetry, $`U(1)_{\mathrm{glob}}`$, whereas with the addition of the gauge principle as one of the criteria, we also have a local one, $`U(1)_{\mathrm{loc}}`$. Therefore,
\Gamma \;:=\;\{\,\mathbf{1},\,U(1)_{\mathrm{glob}},\,U(1)_{\mathrm{loc}}\,\},
\qquad
\mathbf{1}\subset U(1)_{\mathrm{glob}} \subset U(1)_{\mathrm{loc}}.
Hence $`\Gamma`$ has a greatest element given by
\top_\Gamma \;=\; U(1)_{\mathrm{loc}}.
Invariant map.
For $`G\in\Gamma`$, define
\operatorname{Inv}(G)\;:=\;\{\, [\mathcal O]\in \Sigma_{\le 4} : [\mathcal O]\ \text{is invariant under}\ G \,\}.
Here, invariance means that $`[\mathcal O]`$ is invariant if for one (equivalently any) representative $`\mathcal{O}`$, the transformed density differs from $`\mathcal O`$ by $`\sim`$.
Symmetry map.
For a package $`S\subseteq \Sigma_{\le 4}`$, define
\operatorname{Sym}(S)\;:=\;\max\{\,G\in\Gamma:\ S\subseteq \operatorname{Inv}(G)\,\}.
Since $`U(1)_{\mathrm{glob}}\subset U(1)_{\mathrm{loc}}`$, this maximum exists.16
Galois correspondence.
With the above definitions one has the standard antitone correspondence:
S\subseteq \operatorname{Inv}(G)\quad\Longleftrightarrow\quad G\subseteq \operatorname{Sym}(S),
so $`\operatorname{Inv}`$ and $`\operatorname{Sym}`$ form a Galois connection between operator packages and symmetry groups.
The step from global to local symmetry is not obtained automatically from $`\operatorname{Sym}(S)`$; it represents an additional physical principle, the gauge principle, encoded here as a map on symmetry groups.
Localisation operator.
Introduce an order-preserving map, $`\operatorname{Loc}:\Gamma\to\Gamma`$, as
\operatorname{Loc}(\mathbf{1})=\mathbf{1},\qquad
\operatorname{Loc}\big(U(1)_{\mathrm{glob}}\big)=U(1)_{\mathrm{loc}},\qquad
\operatorname{Loc}\big(U(1)_{\mathrm{loc}}\big)=U(1)_{\mathrm{loc}}.
It should be noted that, in this example, $`\operatorname{Loc}`$ fixes the top element,
\operatorname{Loc}(\top_\Gamma)=\top_\Gamma,
reflecting the idea that once the symmetry is already local, localisation does nothing further. An element $`\alpha(x) \in U(1)_\mathrm{loc}`$ acts by
\begin{equation}
\label{eq:u1loc}
\psi(x)\mapsto e^{i\alpha(x)}\psi(x),
\;
\bar\psi(x)\mapsto \bar\psi(x)e^{-i\alpha(x)},
\;
A_\mu(x)\mapsto A_\mu(x)-\frac{1}{e}\partial_\mu\alpha(x),
\end{equation}
where the coupling $`e`$ is fixed so that $`D_\mu=\partial_\mu+ieA_\mu`$ transforms covariantly.
The localisation map is not itself one of the admissibility predicates $`C_i`$, nor one of the induced package-operators $`\mathcal F_i`$, because it does not act on theory packages $`S`$ or on candidate laws $`\psi`$. Rather, $`\operatorname{Loc}`$ is part of the background structure used to define an admissibility principle associated with local gauge symmetry. Concretely, one may introduce a predicate
C_{\mathrm{gauge}}(S,[\mathcal O])\;:=\;\Big([\mathcal O]\in \operatorname{Inv}\big(\operatorname{Loc}(\operatorname{Sym}(S))\big)\Big),
which reads “relative to the background package $`S`$, the candidate operator $`[\mathcal O]`$ is admissible because it is invariant under the localized symmetry extracted from $`S`$.” The corresponding induced operator is then
\mathcal F_{\mathrm{gauge}}(S)\;:=\;\{[\mathcal O]\in \Sigma_{\le 4}:\ C_{\mathrm{gauge}}(S,[\mathcal O])\},
so $`\operatorname{Loc}`$ enters the schema via the definitional content of $`C_{\mathrm{gauge}}`$ and hence of $`\mathcal F_{\mathrm{gauge}}`$. In the present example, we fold this into the composite operator $`\mathcal F_{\mathrm{QED}}(S)=\operatorname{Inv}(\operatorname{Loc}(\operatorname{Sym}(S)))`$.
Total admissibility operator.
Define the operator on packages
\begin{equation}
\label{eq:Fqed}
\mathcal F_{\mathrm{QED}}(S)\;:=\;\operatorname{Inv}\!\big(\operatorname{Loc}(\operatorname{Sym}(S))\big)\ \subseteq\ \Sigma_{\le 4}.
\end{equation}
By construction, $`\mathcal F_{\mathrm{QED}}`$ is monotone with respect to $`\subseteq`$. Intuitively, this operator (i) diagnoses the symmetries of $`S`$, (ii) enforces their localisation, and (iii) outputs the theory of renormalisable operators compatible with this constraint.
The computation from a free matter seed
Let the seed package be the span of the free Dirac kinetic term:
P_0\;:=\;\mathrm{span}\Big\{\big[\bar\psi\, i\gamma^\mu\partial_\mu\psi\big]\Big\}\ \subseteq\ \Sigma_{\le 4}.
Under [eq:u1loc] one has
\partial_\mu(e^{i\alpha(x)}\psi)
=
e^{i\alpha(x)}\big(\partial_\mu\psi+i(\partial_\mu\alpha)\psi\big),
so the free term $`\bar\psi i\gamma^\mu\partial_\mu\psi`$ acquires an extra contribution proportional to $`\partial_\mu\alpha`$. Hence it is invariant for $`\alpha=\text{const}`$ but not for general $`\alpha(x)`$, and therefore
\operatorname{Sym}(P_0)\;=\;U(1)_{\mathrm{glob}}.
To incorporate gauge principle, apply $`\operatorname{Loc}`$:
\operatorname{Loc}(\operatorname{Sym}(P_0))\;=\;\operatorname{Loc}\big(U(1)_{\mathrm{glob}}\big)\;=\;U(1)_{\mathrm{loc}}.
Now, to compute $`\operatorname{Inv}(U(1)_{\mathrm{loc}})\cap \Sigma_{\le 4}`$, we list the renormalisable invariant operator classes:
-
Fermion mass. The class $`\big[\bar\psi\psi\big]`$ is invariant since $`e^{-i\alpha}e^{i\alpha}=1`$:
MATH\bar\psi\psi \mapsto \bar\psi e^{-i\alpha} e^{i\alpha}\psi=\bar\psi\psi.Click to expand and view more -
Photon mass A Proca term $`\big[A_\mu A^\mu\big]`$ is not invariant under $`A_\mu\mapsto A_\mu-\frac{1}{e}\partial_\mu\alpha`$, so $`\big[A_\mu A^\mu\big]\notin \operatorname{Inv}(U(1)_{\mathrm{loc}})`$. Therefore, the photon mass is excluded.
-
Minimal coupling. Define the covariant derivative
MATHD_\mu := \partial_\mu + ieA_\mu.Click to expand and view moreUsing [eq:u1loc],
MATHD_\mu(e^{i\alpha}\psi) = (\partial_\mu+ieA_\mu)\,e^{i\alpha}\psi = e^{i\alpha}\big(\partial_\mu+ie(A_\mu-\tfrac{1}{e}\partial_\mu\alpha)\big)\psi = e^{i\alpha}D_\mu\psi,Click to expand and view moreso $`D_\mu\psi`$ transforms like $`\psi`$. Hence the class $`\big[\bar\psi\, i\gamma^\mu D_\mu\psi\big]`$ is invariant. Expanding it, we have the familiar interaction term,
MATH\bar\psi\, i\gamma^\mu D_\mu\psi = \bar\psi\, i\gamma^\mu \partial_\mu\psi \;-\; e\,\bar\psi\gamma^\mu A_\mu\psi.Click to expand and view more -
Gauge-field kinetic term. The field strength
MATHF_{\mu\nu}:=\partial_\mu A_\nu-\partial_\nu A_\muClick to expand and view moreis invariant because the shift piece cancels by commutativity of partial derivatives as
MATH\partial_\mu(A_\nu-\tfrac{1}{e}\partial_\nu\alpha)-\partial_\nu(A_\mu-\tfrac{1}{e}\partial_\mu\alpha) = \partial_\mu A_\nu-\partial_\nu A_\mu.Click to expand and view moreTherefore $`\big[-\tfrac14 F_{\mu\nu}F^{\mu\nu}\big]\in \operatorname{Inv}(U(1)_{\mathrm{loc}})`$.
-
No further renormalisable invariants up to equivalence. Dimension-$`5`$ operators are excluded by the $`\le 4`$ truncation. A term $`F_{\mu\nu}\tilde F^{\mu\nu}`$ is a total derivative in the abelian case and is removed by the equivalence relation. Gauge-fixing terms are not in $`\operatorname{Inv}(U(1)_{\mathrm{loc}})`$; they enter only at the quantisation stage.
The package.
The image of the seed under $`\mathcal F_{\mathrm{QED}}`$ is
\mathcal F_{\mathrm{QED}}(P_0)=\operatorname{Inv}(U(1)_{\mathrm{loc}})\subseteq \Sigma_{\le 4},
whose minimal generating set may be taken as
\begin{equation}
\label{eq:Pqed}
P_{\mathrm{QED}}
=
\mathrm{span}\Big\{
\big[\bar\psi\, i\gamma^\mu D_\mu\psi\big],\;
\big[\bar\psi\psi\big],\;
\big[-\tfrac14 F_{\mu\nu}F^{\mu\nu}\big]
\Big\}.
\end{equation}
In Lagrangian form, this is exactly QED:
\mathcal L_{\mathrm{QED}}
=
\bar\psi(i\gamma^\mu D_\mu-m)\psi
-\frac14 F_{\mu\nu}F^{\mu\nu}.
Fixed point property.
The package $`P_{\mathrm{QED}}`$ is stable under the admissibility operator:
\mathcal F_{\mathrm{QED}}(P_{\mathrm{QED}})=P_{\mathrm{QED}},
since $`\operatorname{Sym}(P_{\mathrm{QED}})=U(1)_{\mathrm{loc}}`$, and $`P_{\mathrm{QED}}`$ contains precisely the renormalisable invariants under that group within $`\Sigma_{\le 4}`$.
Proposition 5. *Since $`\Gamma`$ has a greatest element, and $`\operatorname{Loc}(U(1)_{\mathrm{loc}})=U(1)_{\mathrm{loc}}`$, the package
P_{\mathrm{QED}}=\operatorname{Inv}(U(1)_{\mathrm{loc}})\subseteq \Sigma_{\le 4}
is the least fixed point of $`\mathcal F_{\mathrm{QED}}(S)=\operatorname{Inv}(\operatorname{Loc}(\operatorname{Sym}(S)))`$.*
Proof. Since $`\bot_\Sigma=\{0\}`$ imposes no nontrivial invariance constraints, $`\operatorname{Sym}(\bot_\Sigma)`$ is the greatest element of $`\Gamma`$, hence $`\operatorname{Sym}(\bot_\Sigma)= \top_\Gamma = U(1)_{\mathrm{loc}}`$. Using $`\operatorname{Loc}(U(1)_{\mathrm{loc}})=U(1)_{\mathrm{loc}}`$,
\mathcal F_{\mathrm{QED}}(\bot_\Sigma)
=
\operatorname{Inv}(\operatorname{Loc}(\operatorname{Sym}(\bot_\Sigma)))
=
\operatorname{Inv}(U(1)_{\mathrm{loc}})
=
P_{\mathrm{QED}}.
Moreover, within the chosen $`\Gamma`$ one has $`\operatorname{Sym}(P_{\mathrm{QED}})=U(1)_{\mathrm{loc}}`$, hence
\mathcal F_{\mathrm{QED}}(P_{\mathrm{QED}})
=
\operatorname{Inv}(\operatorname{Loc}(\operatorname{Sym}(P_{\mathrm{QED}})))
=
\operatorname{Inv}(U(1)_{\mathrm{loc}})
=
P_{\mathrm{QED}},
so $`\mathcal F_{\mathrm{QED}}(\bot_\Sigma)`$ is a fixed point. By Lemma 2, it is the least fixed point. ◻
The “matter seed” $`P_0=\mathrm{span}\{[\bar\psi i\gamma^\mu\partial_\mu\psi]\}`$ is not itself a gauge-invariant operator class, so it need not satisfy $`P_0\subseteq P_{\mathrm{QED}}`$. What the construction shows is rather that applying the completion operator $`\mathcal F_{\mathrm{QED}}`$ to $`P_0`$ produces the least fixed point in one step:
\mathcal F_{\mathrm{QED}}(P_0)=\operatorname{Inv}(U(1)_{\mathrm{loc}})=P_{\mathrm{QED}}=\mu \mathcal F_{\mathrm{QED}}.
Thus the example exhibits QED as the canonical least fixed point selected by the monotone operator $`\mathcal F_{\mathrm{QED}}`$ on the package lattice.
Thus, it is shown that QED, in this form, can be presented as a least fixed point schema under the composed metalanguage assumptions of symmetry, locality in the sense of gauge principle, and closedness under local invariants within the renormalisable operator domain.
II. General Relativity
The QED example showed how a local internal symmetry selects interaction terms in a renormalisable operator domain under the chosen admissibility operator. General Relativity provides an analogous illustration. Once one fixes “metric geometry” as the kinematical arena and imposes diffeomorphism invariance together with locality and a derivative-order restriction, the Einstein–Hilbert action can be presented as a minimal stable package.
Geometric background.
Let $`M`$ be a smooth, connected, oriented $`4`$-manifold. The dynamical field is a Lorentzian metric $`g_{\mu\nu}`$ on $`M`$. Diffeomorphisms $`\phi\in \operatorname{Diff}(M)`$ act on $`g`$ by pullback:
g \longmapsto \phi^\ast g.
Candidate domain.
Let $`\Sigma_{\le 2}`$ be the vector space of local scalar densities built from $`g_{\mu\nu}`$ and finitely many derivatives, restricted to at most two derivatives of the metric,17 modulo the standard equivalence relation $`\sim`$ identifying densities that differ by a total derivative,
\mathcal L \sim \mathcal L + \nabla_\mu V^\mu.
We write $`[\mathcal L]\in \Sigma_{\le 2}`$ for an equivalence class. The corresponding action functional is $`S[g]=\int_M d^4x\, [\mathcal L]`$ under appropriate assumptions so that boundary terms can be ignored.
Theory packages.
A theory package is represented by a linear subspace $`S\subseteq \Sigma_{\le 2}`$ spanned by a chosen set of density-classes. Linearity is again treated as background structure, so closure under linear combinations does not need to be enforced by the admissibility operator.
Symmetry space.
For the GR example, the maximal group acting on the metric field is the group of diffeomorphisms of $`M`$, $`\operatorname{Diff}(M)`$. Therefore, let $`\Gamma`$ be
\begin{equation}
\Gamma := \{\mathbf{1}, \operatorname{Diff}(M) \}.
\end{equation}
So the “largest” symmetry allowed by the chosen framework is diffeomorphism invariance.
Invariant map.
Define
\operatorname{Inv}(G)\;:=\;\{\, [\mathcal L]\in\Sigma_{\le 2}\ :\ [\mathcal L]\ \text{is invariant under}\ G\,\},
where invariance means $`\mathcal L(g)`$ and $`\mathcal L(\phi^\ast g)`$ differ by a total derivative, and hence lie in the same equivalence class for all $`\phi\in G`$.
Symmetry map.
For a package $`S\subseteq\Sigma_{\le 2}`$ define
\operatorname{Sym}(S)\;:=\;\max\{\,G\in\Gamma:\ S\subseteq \operatorname{Inv}(G)\,\}.
Since $`\Gamma=\{\mathbf 1,\operatorname{Diff}(M)\}`$ is a finite chain, this maximum exists.
With these definitions one has the standard antitone correspondence
S\subseteq \operatorname{Inv}(G)\quad\Longleftrightarrow\quad G\subseteq \operatorname{Sym}(S),
so $`\operatorname{Inv}`$ and $`\operatorname{Sym}`$ form a Galois connection between operator packages and symmetry groups.
Admissibility operator.
Define the GR admissibility operator as
\begin{equation}
\label{eq:Fgr}
\mathcal F_{\mathrm{GR}}(S)\;:=\;\operatorname{Inv}\!\big(\operatorname{Sym}(S)\big)\ \subseteq\ \Sigma_{\le 2}.
\end{equation}
This operator is monotone with respect to $`\subseteq`$ by general properties of the Galois correspondence.
Seed.
The “seed” is the kinematical commitment to a metric field, together with no further dynamical density-terms:
P_0 := \{0\}\ \subseteq\ \Sigma_{\le 2}.
Because $`P_0`$ contains no nontrivial densities, every diffeomorphism vacuously preserves all elements of $`P_0`$, hence
\operatorname{Sym}(P_0)=\operatorname{Diff}(M).
Therefore
\mathcal F_{\mathrm{GR}}(P_0)=\operatorname{Inv}(\operatorname{Diff}(M)),
so computing the image reduces to classifying the diffeomorphism-invariant density-classes in $`\Sigma_{\le 2}`$.
A key geometric fact is that diffeomorphism-invariant local scalar densities built from the metric are constructed from curvature tensors and their covariant derivatives, rather than from raw coordinate derivatives $`\partial g`$. In particular, curvature starts at second derivative order, so there are no genuinely invariant first-derivative scalar densities built only from $`g`$ and $`\partial g`$.
Within the truncation $`\Sigma_{\le 2}`$ this yields:
-
Order 0. The only scalar density available is the volume form:
MATH[\sqrt{-g}]\ \in\ \Sigma_{\le 2}.Click to expand and view moreThus the associated action is the cosmological term
MATHS_\Lambda[g] := \int_M d^4x\, \sqrt{-g}.Click to expand and view more -
Order 1. Formally, $`\partial g`$ is not a tensor, so no coordinate-invariant scalar density can be formed from $`g`$ and $`\partial g`$ alone. Intuitively, one may always choose locally inertial coordinates at a point, so that $`\partial_\lambda g_{\mu\nu}=0`$ there.
-
Order 2. At second derivative order the curvature tensor appears. The only non-trivial scalar density, up to normalisation and equivalence of terms with extra total derivatives, is generated by the Ricci scalar $`R`$:
MATH[\sqrt{-g}\,R]\ \in\ \Sigma_{\le 2}, \qquad S_{\mathrm{EH}}[g]:=\int_M d^4x\, \sqrt{-g}\, R.Click to expand and view moreAny other curvature scalar quadratic in curvature (e.g. $`R^2`$, $`R_{\mu\nu}R^{\mu\nu}`$) lies beyond the $`\le 2`$-derivative truncation because it contains four derivatives of the metric in total.
Therefore, within $`\Sigma_{\le 2}`$,
\operatorname{Inv}(\operatorname{Diff}(M))
=
\mathrm{span}\Big\{\, [\sqrt{-g}],\ [\sqrt{-g}\,R]\,\Big\}.
Total package.
Define the GR package
\begin{equation}
\label{eq:Pgr}
P_{\mathrm{GR}}
:=
\mathrm{span}\Big\{\, [\sqrt{-g}],\ [\sqrt{-g}\,R]\,\Big\}
\ \subseteq\ \Sigma_{\le 2}.
\end{equation}
Equivalently, at the level of actions one may parameterise elements of $`P_{\mathrm{GR}}`$ by coefficients, as
S[g]
=
\int_M d^4x\, \sqrt{-g}\,\big(\alpha R - 2\beta\big),
with $`\alpha,\beta`$ constants to be identified empirically with $`1/(16\pi G)`$ and $`\Lambda/(8\pi G)`$ after normalisation.
Fixed point property.
By construction, $`P_{\mathrm{GR}}`$ is stable:
\mathcal F_{\mathrm{GR}}(P_{\mathrm{GR}})=P_{\mathrm{GR}},
because $`\operatorname{Sym}(P_{\mathrm{GR}})=\operatorname{Diff}(M)`$ and $`\operatorname{Inv}(\operatorname{Diff}(M))\cap\Sigma_{\le 2}=P_{\mathrm{GR}}`$.
Least fixed pointhood.
Since $`\mathcal F_{\mathrm{GR}}`$ is monotone on a complete lattice of packages (by the Galois correspondence), Tarski’s theorem guarantees a least fixed point. In this example we compute directly that $`\mathcal F_{\mathrm{GR}}(P_0)=P_{\mathrm{GR}}`$, and $`P_{\mathrm{GR}}`$ is a fixed point, hence it is the least fixed point above $`P_0`$.
Hence, relative to the metric kinematics, diffeomorphism invariance, locality, and the two-derivative truncation, the Einstein–Hilbert plus cosmological term is the minimal stable residue. Therefore, GR is captured as the minimal stable package within the chosen domain, $`\Sigma_{\le 2}`$.
Conclusion
We began with a simple thought that the laws of nature might be characterised as exactly those candidates that satisfy an admissibility condition whose evaluation itself depends on the totality of laws. Taken extensionally, this idea either becomes ill-typed (laws versus law-sets) or collapses into self-membership once levels are forced to coincide. The first part of the paper made this failure explicit: An extensional reconstruction cannot sustain the intended explanatory reading without either type collapse or trivial self-endorsement.
The repair is to keep types distinct and treat “theory packages” as elements of a structured space of packages. In that setting, self-subsumption is not a paradoxical set-theoretic construction but a fixed point equation
P=\mathcal F(P).
Under monotonicity on a complete lattice, Tarski’s theorem guarantees fixed points and supplies a canonical minimal choice, the least fixed point $`P=\mu\mathcal F`$. This does not remove circularity; it replaces it by a controlled closure condition, where $`P`$ is determined as the minimal package stable under an explicitly specified admissibility operator.
To connect the abstract schema to physics, we proposed reading admissibility as completion under constitutive constraints. The key structural lesson is that closure is the invariant content. A package counts as an admissible theory precisely when it is stable under the completion map. This aligns naturally with an invariance-style conception of objectivity. What is “the theory” is what survives (is closed under) the admissibility transformations one treats as constitutive. In the examples, we instantiated $`\mathcal F`$ via an invariance–symmetry correspondence, and showed how QED and GR arise as least fixed points once one fixes a candidate domain and encodes symmetry, locality in the gauge sense, and a truncation criterion.
Several limitations are built into the present formulation. First, the framework does not tell us which candidate domain $`\Sigma`$ or which admissibility operator $`\mathcal F`$ is correct; those encode substantive physical and philosophical choices. Second, the examples rely on simplifying truncations (renormalisable operators in QED; a two-derivative expansion in GR), so they illustrate the fixed point architecture rather than capture the full content of the theories. Third, monotonicity is a strong hypothesis. Many attractive criteria (consistency checks, optimality constraints, some notions of “minimality”) are not monotone, and fall outside the direct scope of the Tarski canonicity argument.
These constraints also suggest natural directions for future work:
-
Enrich the package lattices $`\mathcal T`$ to incorporate quotients by physical equivalence (gauge, duality, field redefinitions) as part of the package structure.
-
Study non-monotone admissibility notions and alternative fixed point principles, clarifying when and how canonicity survives without monotonicity.
-
Extend the invariance-based construction to more realistic settings (effective field theory bases, anomaly constraints, renormalisation group closure, and bootstrap-style constraint packages), where the set of admissible completions may form a nontrivial lattice of fixed points.
The main takeaway is structural: Whenever one characterises a “fundamental” package by a rule of membership that itself depends on that package, the resulting formulation is, in general, a fixed point problem. Making this explicit separates two questions that are often conflated. The logical question of how to represent self-subsumption without contradiction, and the substantive question of which admissibility transformations should count as constitutive of physical law.
A Note of Gratitude
The copyright of this content belongs to the respective researchers. We deeply appreciate their hard work and contribution to the advancement of human civilization.-
A property $`C`$, represented extensionally in set theory, is understood as the set of all objects that satisfy it; that is
↩︎MATH\text{ext}(C) := \{\psi \in \Lambda : C(\psi)\}.Click to expand and view more -
We do not assume a metaphysically privileged, objective “set of all possible laws”. Since this text is concerned with the formal structure of a physics theory, what concerns us is the existence of such a set, be it in a specified domain of discourse about nature or in a more general domain of metaphysics, rather than its actual law content. A standard way to construct such a set is by fixing a countable formal language $`L`$ and letting $`\mathrm{Sent}(L)`$ be its set of sentences. Since sentences are finite strings over a countable alphabet, $`\mathrm{Sent}(L)`$ is countable. Thereafter, it is ordinary to fix a Gödel coding $`g:\mathrm{Sent}(L)\to\mathbb N`$ and set
MATH\Lambda := g(\mathrm{Sent}(L))\subseteq \mathbb N .Click to expand and view moreA law-candidate is then an element $`\psi\in\Lambda`$.
Otherwise, in a more directly physics-faced setting, one can devise $`\Lambda`$ as a set of (possible) operators and/or states of a system, which satisfy certain constraints, such as locality, unitarity, gauge equivalence, etc.
Afterwards, the semantic meaning can be fixed by a class of intended models $`\mathsf{Mod}`$ and a mapping called a satisfaction relation. Each $`\psi\in\Lambda`$ has meaning via this satisfaction relation. Writing $`\varphi=g^{-1}(\psi)`$, define
MATH\llbracket \psi\rrbracket := \{ M\in \mathsf{Mod} : M\models \varphi\}\subseteq \mathsf{Mod}.Click to expand and view moreThus, candidate laws are meaningful insofar as they constrain the intended models. ↩︎
-
The powerset $`(\mathcal P(\Lambda),\subseteq)`$ is a complete lattice. For any family $`\{S_i\}_{i\in I}\subseteq\mathcal P(\Lambda)`$, arbitrary joins are unions and arbitrary meets are intersections :
↩︎MATH\bigvee_{i\in I} S_i = \bigcup_{i\in I} S_i, \qquad \bigwedge_{i\in I} S_i = \bigcap_{i\in I} S_i.Click to expand and view more -
In the metalanguage, $`C(S,\psi)=\top`$ is read as “relative to the background law-set $`S`$, the candidate law $`\psi\in\Lambda`$ satisfies the criterion $`C`$” (and $`C(S,\psi)=\bot`$ as its negation). ↩︎
-
Many tempting criteria are not monotone in $`S`$. For instance, if $`C(S,\psi)`$ means “$`S\cup\{\psi\}`$ is consistent”, then enlarging $`S`$ can break consistency, so monotonicity may fail. By contrast, if one takes
MATHC(S,\psi)\; \equiv\; (S \vdash \psi),Click to expand and view morethen $`C`$ is monotone in its first argument, that is, $`S\subseteq T`$ and $`S\vdash \psi`$, then also $`T\vdash \psi`$ for any standard, structural consequence relation. For this reason, and also the intricacies coming up with Gödel’s incompleteness theorems, we are not going to consider consistency as an internal criterion; that is, a criterion to be assessed in the formal language itself, but keep it as a metalanguage criterion. ↩︎
-
We use $`\mathsf{Obtain}`$ rather than an object-language truth predicate $`\mathsf{True}`$ to avoid importing a separate theory of truth. A total $`\mathsf{True}`$ for the same language is delicate in strong settings (Tarski-style undefinability), while Kripke-style approaches treat $`\mathsf{True}`$ as partial via a fixed point semantics. One could nevertheless replace $`\mathsf{Obtain}(n)`$ by a suitably interpreted $`\mathsf{True}(n)`$ (e.g. metalinguistically as satisfaction in the intended model(s), or internally via a Kripke fixed point). This substitution does not affect the fixed point structure developed in the paper, since our main results concern closure of law-sets under the admissibility operator $`\mathcal F(S)=\{n\in\Lambda: C(S,n)\}`$ and the canonical selection $`P=\mu \mathcal F`$, rather than properties specific to truth predicates. ↩︎
-
In the following section, where we begin applying our schema to physics, we are going to consider operator algebras instead of logical sentences or Gödel codes of them, for it is both eaiser and more usual to untangle the algebraic representations pointing to the same phenomena than doing the same for the sentence/code representation in a Principia Mathematica type of formal language ↩︎
-
One can conceive a duality à la De Haro and Butterfield , where any such distinct fixed point characterisation of a theory is isomorphic. ↩︎
-
Here “non-vicious circularity” means that self-reference is implemented as a constraint/closure condition rather than as a mere justificatory loop. That is, one specifies a monotone operator $`\mathcal F`$ and then takes the least fixed point $`\mu \mathcal F`$, so the circularity $`P=\mathcal F(P)`$ determines $`P`$ by minimal closure rather than presupposing it. This is the familiar pattern behind Kripke-style fixed point treatments of self-reference in truth theory, and it aligns with contemporary grounding discussions in which some circles need not be vicious, once a principled notion of “viciousness” is adopted. ↩︎
-
Note that it does not always have to contain $`S`$ itself once it is used as a seed to select an admissible completion, as in the case of the QED example in the next section. ↩︎
-
Depending on the context, elements of $`\Sigma`$ could be terms in a Lagrangian, differential equations of motion, or elements of a $`C^*`$-algebra; and that of $`\Gamma`$ could be rotation groups, gauge groups, or diffeomorphism group, etc.
A further input is an equivalence notion capturing when two presentations encode the same physics, for instance, via gauge equivalence, field redefinitions, dualities. One may enforce this either by quotienting the candidate domain $`\Sigma`$ by the chosen equivalence, or by requiring the admissibility criterion to be invariant under it. ↩︎
-
In physics terminology, this can be understood as “$`\phi`$ is invariant under the group $`G`$”, with invariance understood modulo the chosen equivalence on $`\Sigma`$. ↩︎
-
One can as well state “Lorentz invariance” as one of the symmetry principles explicitly. ↩︎
-
The collection of linear subspaces of $`\Sigma_{\le 4}`$ ordered by inclusion forms a complete lattice: Meets are intersections and joins are linear spans of unions. ↩︎
-
If the spinor field were not massive, it would also admit a transformation of the form
MATH\begin{equation} \psi \mapsto e^{i \theta \gamma^5} \psi, \end{equation}Click to expand and view moreyielding an additional axial $`U(1)_A`$ symmetry at the classical level, so the continuous internal symmetry enlarges to $`U(1)_V\times U(1)_A`$ in that limit. ↩︎
-
In the examples, $`\Gamma`$ is a finite chain, so we identify $`\operatorname{Sym}(S)`$ with the maximal symmetry group in $`\Gamma`$, that leaves $`S`$ invariant. ↩︎
-
Restricting the equations of motion to second derivative order is required to avoid the appearance of negative-energy ghost modes, called Ostrogradsky instability. In four dimensions, Lovelock’s theorem guarantees that the only diffeomorphism-invariant actions satisfying this stability criterion are the Einstein-Hilbert and cosmological terms. ↩︎
Related Posts
Start searching
Enter keywords to search articles
No results found
Try using different keywords