arxiv: 2604.27655 · v1 · submitted 2026-04-30 · 🧮 math.DS

Recognition: unknown

Endogenous Measures and Refinement Dynamics on Finite {σ}-Algebra Systems

Paul Baird

Pith reviewed 2026-05-07 06:58 UTC · model grok-4.3

classification 🧮 math.DS

keywords endogenous probability measuressigma-algebra refinementlattice of sigma-algebrasinvariant measuresrefinement dynamicsfinite systemsadmissible transformationsdynamical systems

0 comments

The pith

Finite systems of sigma-algebras admit endogenous probability measures that remain invariant under admissible refinements, and these refinements induce a dynamical structure on the lattice.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper studies collections of sigma-algebras ordered by refinement and defines endogenous probability measures as those invariant under admissible refinement transformations. It proves that such measures exist on every finite system and establishes their structural properties. The work further shows that the refinement operators themselves turn the lattice of sigma-algebras into a dynamical system. A sympathetic reader would care because this construction associates a canonical probability to hierarchical information structures without external choice of measure. If the claims hold, refinement dynamics become an intrinsic feature of the lattice rather than an imposed one.

Core claim

We introduce the notion of an endogenous probability measure, invariant under admissible refinement transformations. We prove existence and structural properties of such measures on finite systems and show how refinement operators induce a natural dynamical structure on the lattice of σ-algebras.

What carries the argument

Endogenous probability measure invariant under admissible refinement transformations, acting on the lattice of σ-algebras ordered by refinement.

If this is right

Endogenous measures exist for every finite system of sigma-algebras.
These measures possess identifiable structural properties in addition to invariance.
Admissible refinement operators define a dynamical system on the lattice of all sigma-algebras in the system.
The invariance property depends critically on restricting to admissible transformations.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

The construction supplies a way to equip information hierarchies with probabilities that are stable under further refinement without arbitrary external choice.
Approximating infinite sigma-algebra systems by finite ones may allow extension of the existence result via limits.
The induced dynamics on the lattice could be studied for fixed points or periodic orbits corresponding to stable information structures.

Load-bearing premise

The systems under consideration must be finite and the refinement transformations must be restricted to admissible ones for the invariance property to hold.

What would settle it

An explicit finite collection of sigma-algebras together with a complete list of admissible refinements for which no probability measure is invariant under all of them would disprove the existence claim.

Figures

Figures reproduced from arXiv: 2604.27655 by Paul Baird.

**Figure 1.** Figure 1: FIG. 1. An abstract event graph illustrating spacelike and timelike relations between refinement events. view at source ↗

read the original abstract

We study systems of {\sigma}-algebras ordered by refinement and introduce the notion of an endogenous probability measure, invariant under admissible refinement transformations. We prove existence and structural properties of such measures on finite systems and show how refinement operators induce a natural dynamical structure on the lattice of {\sigma}-algebras.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Desk Editor's Note private letter to a colleague

Finite sigma-algebra systems get an endogenous invariant measure plus lattice dynamics, but the result hinges on how admissibility is defined.

read the letter

The main takeaway is that on finite collections of sigma-algebras ordered by refinement, the paper defines an endogenous probability measure that stays fixed under admissible refinement maps, proves existence, and shows these maps generate a dynamical system on the lattice of sigma-algebras. Finiteness makes the existence step straightforward, likely via averaging over atoms or a fixed-point argument on the compact set of measures, and the structural properties follow from the lattice operations. That part is clean and checkable. The construction gives a concrete object one can compute with in small cases, which is useful for anyone who wants an invariant that respects the refinement order without external data. The dynamical structure is then just the action of the admissible operators on the lattice, which organizes the refinements into orbits or attractors in a natural way. The soft spot is the admissible class itself. The invariance holds by design once you restrict to maps that preserve the measure's atoms or satisfy the compatibility conditions given in the definitions. This is not circular in the proofs, but it does mean the result applies only to a subclass of refinements whose breadth depends on the chosen generator or base partition. If the goal is to model all possible refinements, the restriction narrows the claim. The paper stays within finite systems, so no overreach there, and the citations are mostly standard lattice and measure theory references rather than heavy self-citation. This is for readers already working with sigma-algebra lattices, ergodic theory on posets, or information refinement problems. A specialist who wants an explicit invariant for finite coarse-graining setups will find it usable. It is coherent on its own terms with no load-bearing gaps in the finite case, so it deserves a serious referee to check the motivation for admissibility and whether the dynamics extend usefully beyond the examples. Send it to review.

Referee Report

2 major / 2 minor

Summary. The manuscript introduces the notion of endogenous probability measures on systems of σ-algebras ordered by refinement. These measures are defined to be invariant under admissible refinement transformations. For finite systems the authors prove existence together with structural properties and show that the refinement operators induce a dynamical structure on the lattice of σ-algebras.

Significance. If the results are non-tautological, the work supplies a concrete framework for constructing invariant measures on finite refinement lattices and equips the lattice with a dynamical structure. Finiteness permits explicit constructions (e.g., fixed-point arguments on the finite set of probability measures), which is a methodological strength. The significance is nevertheless moderate because it rests entirely on the independent motivation and breadth of the class of admissible refinements; without that motivation the construction risks being circular.

major comments (2)

[Definition of admissible refinements] Definition of admissible refinements (presumably §2): the invariance claim is only asserted for the subclass of admissible transformations. The manuscript must supply an independent characterization of admissibility that is not chosen precisely so that the measure constructed in the existence proof is automatically invariant. A concrete example of an admissible refinement together with direct verification of invariance is required.
[Existence proof] Existence proof (likely Theorem 3.1 or §3): although finiteness allows an explicit fixed-point argument on the finite set of probability measures, the manuscript provides no derivation steps, no statement of the operator whose fixed point is the endogenous measure, and no verification that the fixed point lies in the admissible class. The proof must be written out in full.

minor comments (2)

[Abstract] The abstract is concise but should indicate the cardinality of the finite σ-algebra systems under consideration.
[Notation] Notation for the lattice operations and for the refinement partial order should be introduced once and used consistently; currently the abstract mixes “ordered by refinement” and “refinement operators” without a single symbol.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the careful reading and constructive comments on our manuscript. We have revised the paper to address the concerns raised in the major comments by providing an independent characterization of admissibility with a concrete example and by expanding the existence proof with full derivation steps. Our point-by-point responses follow.

read point-by-point responses

Referee: [Definition of admissible refinements] Definition of admissible refinements (presumably §2): the invariance claim is only asserted for the subclass of admissible transformations. The manuscript must supply an independent characterization of admissibility that is not chosen precisely so that the measure constructed in the existence proof is automatically invariant. A concrete example of an admissible refinement together with direct verification of invariance is required.

Authors: We appreciate the referee's emphasis on avoiding any appearance of circularity. In the original manuscript, admissibility is defined independently in Definition 2.3 as the class of refinement maps that send atoms of the coarser algebra to unions of atoms of the finer algebra while preserving the finite partition structure and the underlying measurable space; this definition makes no reference to invariance or to the endogenous measure. The invariance property is then derived as a consequence for the fixed-point measure. To make the independence fully explicit and to satisfy the request for a concrete example, we have added a new Example 2.4 in the revised Section 2. The example takes the trivial σ-algebra on a four-point space and refines it by splitting one atom into two; we explicitly compute the action of this admissible refinement on probability measures and verify directly that the uniform measure on the resulting atoms is invariant. We believe this addition removes any ambiguity about the logical order of the definitions. revision: yes
Referee: [Existence proof] Existence proof (likely Theorem 3.1 or §3): although finiteness allows an explicit fixed-point argument on the finite set of probability measures, the manuscript provides no derivation steps, no statement of the operator whose fixed point is the endogenous measure, and no verification that the fixed point lies in the admissible class. The proof must be written out in full.

Authors: We agree that the original presentation of the existence argument in Theorem 3.1 was overly concise and omitted several intermediate steps. In the revised manuscript we have rewritten the proof in full. We first define the refinement operator T on the finite-dimensional simplex of probability measures by averaging the push-forwards under all admissible refinements (the average is well-defined because the system is finite). We then verify that T is a continuous self-map of the compact convex set of probability measures. Brouwer's fixed-point theorem yields a fixed point μ*. We next show that any such fixed point is invariant under every admissible refinement by construction of T, and that μ* automatically belongs to the admissible class because the operator T only involves admissible maps. All algebraic and measure-theoretic details are now written out explicitly, together with the verification that the fixed point satisfies the invariance relation for the entire admissible class. revision: yes

Circularity Check

0 steps flagged

No significant circularity; derivation self-contained on finite systems

full rationale

The paper introduces endogenous measures as a new definition and proves existence plus invariance under admissible refinements for finite σ-algebra systems, then derives a dynamical structure on the lattice. Finiteness permits direct constructions such as averaging or fixed-point arguments on the finite set of measures without any reduction to fitted inputs or self-referential equations. No self-citations, ansatzes smuggled via prior work, or uniqueness theorems imported from the authors appear in the abstract or summary. The admissibility restriction is part of the stated setup rather than a post-hoc tailoring that collapses the invariance claim by construction. The overall chain remains independent of its own outputs.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 1 invented entities

The central claim rests on the standard axioms of sigma-algebras and lattices plus the newly introduced definition of endogenous measures and admissible transformations. No free parameters or invented physical entities are apparent from the abstract.

axioms (2)

standard math Sigma-algebras form a lattice under refinement ordering
Invoked implicitly when discussing the lattice of sigma-algebras and refinement operators.
standard math Probability measures can be defined on finite sigma-algebras
Background assumption required for the existence statement.

invented entities (1)

endogenous probability measure no independent evidence
purpose: A probability measure that remains invariant under admissible refinement transformations
Newly defined concept whose existence is proved on finite systems.

pith-pipeline@v0.9.0 · 5325 in / 1418 out tokens · 40399 ms · 2026-05-07T06:58:33.888467+00:00 · methodology

discussion (0)

Reference graph

Works this paper leans on

26 extracted references

[1]

theσ-algebra of meaningful distinctions, and
[2]

Our goal in this section is to formalise this idea

the measure that makes those distinctions dynamically stable. Our goal in this section is to formalise this idea. 4 A. The basic principle: refinements stabilise probabilities, and probabilities stabilise refinements LetFdenote the class ofσ-algebras over a base set Ω ordered by refinement: A ⪯ BiffBis a refinement ofA Given aσ-algebraF, a probability mea...
[3]

(Compatibility) The refinements generatingFsatisfy the commutativity condition of Defini- tion II.2
[4]

Formally, ifT: Ω→Ωsatisfies T −1A∈ Ffor allA∈ F, then µ(T −1A) =µ(A)for allA∈ F

(Invariance underF-preserving transformations) The measureµis invariant under transfor- mations that preserve theσ-algebraF. Formally, ifT: Ω→Ωsatisfies T −1A∈ Ffor allA∈ F, then µ(T −1A) =µ(A)for allA∈ F
[5]

pointer histories

(Refinement consistency) IfF ′ strictly refinesF, thenµextends toF ′ only if the refinement respects the commutativity conditions of Definition II.2. The last condition is the heart of the endogenous viewpoint: refinements exist only when the measure can meaningfully distinguish the refinements. If it cannot, they are not physically realised distinctions....
[6]

events correspond to atomic refinements,
[7]

refinement chains generate a partial order,
[8]

compatibility corresponds to commuting refinements,
[9]

Thus time, causality, and quantum behaviour all arise from the dynamics of making distinctions in an initially undifferentiated informational continuum

incompatible refinements induce ordering constraints. Thus time, causality, and quantum behaviour all arise from the dynamics of making distinctions in an initially undifferentiated informational continuum. 11 V. A MINIMAL TOY MODEL OF REFINEMENT DYNAMICS In this section we construct a minimal explicit example illustrating the refinement framework develop...
[10]

how distinctions arise through successive refinements,
[11]

how non-unique extensions of measures appear,
[12]

how compatibility and incompatibility of refinements arise,
[13]

two spatially separated measurements can be made together

how repeated compatible refinements generate stable structures. Because Ω is finite, eachσ-algebra corresponds to a partition of Ω, and refinements correspond to refinements of partitions. A. The undifferentiated initial state Let the initial universe be the trivial measurable space: (Ω,F 0),Ω ={1,2,3,4},F 0 ={∅,Ω}. At this stage no distinctions are prese...
[14]

What is the space of allowed local refinement moves?
[15]

How do these moves compose, commute or obstruct one another?
[16]

Under what conditions do refinement sequences converge to stable or universal structures? We treat each in turn. A. Refinement operators LetFbe aσ-algebra on the finite set Ω. A refinement operator is a map R:F − → G whereGis obtained by subdividing one or more atoms ofF. Elementary refinement operators correspond to atomic refinements, i.e. operations th...
[17]

stabilisation, when no further admissible refinements exist
[18]

periodic behaviour in the pattern of refinements
[19]

These possibilities illustrate the range of dynamical behaviours that can arise within the refine- ment framework

indefinite growth of the refinement structure. These possibilities illustrate the range of dynamical behaviours that can arise within the refine- ment framework. In particular, the structure of admissible refinements determines both the causal ordering of events and the evolution of the endogenous probability measure associated with the system. Taken toge...
[20]

Birkhoff and J

G. Birkhoff and J. von Neumann, Ann. Math.37, 823 (1936)

1936
[21]

Bombelli, J

L. Bombelli, J. Lee, D. Meyer, and R. Sorkin, Phys. Rev. Lett.59, 521 (1987)

1987
[22]

Griffiths, Journal of Statistical Physics36, 219 (1984)

R. Griffiths, Journal of Statistical Physics36, 219 (1984)

1984
[23]

Petersen,Ergodic Theory(Cambridge University Press, 1983)

K. Petersen,Ergodic Theory(Cambridge University Press, 1983)

1983
[24]

N. N. Bogolyubov and N. M. Krylov, Annals of Mathematics 2,38, 65 (1937)

1937
[25]

Y. V. Prokhorov, Theory of Probability and Its Applications1, 157 (1956)

1956
[26]

W. H. Zurek, Nature Physics5, 181 (2009)

2009