Uniform logical proofs for Riesz representation theorem, Daniell-Stone theorem and Stone's representation theorem for probability algebras

Alireza Mofidi

REVIEW 2 major objections 5 minor 20 references

Uniform logical proofs for Riesz representation theorem, Daniell-Stone theorem and Stone's representation theorem for probability algebras

T0 review · 2 major / 5 minor · reviewed 2026-08-14 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read This paper claims that Riesz representation, Daniell-Stone, and Stone's representation theorems all admit uniform proofs from the logical compactness theorem of integration logic.

desk verdict Uniform compactness proofs for three classical theorems, but the Daniell–Stone and Riesz proofs have a real, repairable gap: the finite approximating structures don't satisfy the definition of L-structure. read the letter →

arxiv 1908.03774 v1 pith:6QK2NES6 submitted 2019-08-10 math.CA math.LO

Alireza Mofidi This is my paper · ORCID

classification math.CAmath.LO MSC 28C0528A6003C9803C65

keywords RieszrepresentationtheoremDaniell-StoneStoneprobabilityalgebraintegrationlogiclogicalcompactnessmeasureexistencetheorems

verification ladder T0 review T1 audit T2 compute T3 formal

The pith

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

The reading

The paper sets out to prove three classical measure-existence theorems by one uniform logical method. The method is to write the desired measure as a theory in integration logic, show that theory is finitely satisfiable using finite or approximately finite measure structures, and then apply the logical compactness theorem to obtain a single model carrying the desired measure. A sympathetic reader should care because, if the proofs are valid, three theorems normally proved by different analytic techniques become corollaries of one logical principle, and integration logic gains a concrete demonstration as a tool for measure theory.

What carries the argument

The machine that carries all three arguments is the logical compactness theorem for integration logic: every finitely satisfiable theory has a model. Integration logic is a probability logic whose formulas are interpreted as measurable real-valued functions and whose quantifier is the integral, so a closed statement such as $\int R_f = I(f)$ directly asserts that the integral of the interpretation equals the given functional value. Two auxiliary lemmas connect this logic to analysis: Lemma 2.7 converts finite approximate satisfiability into finite satisfiability, and Lemma 2.8 builds monotone [0,1]-valued approximations to characteristic functions of interval pullbacks. All three proofs run the same skeleton: axiomatize, prove finite satisfiability, invoke compactness, and transfer the measure back when the target lives on the original space.

What would settle it

In Theorem 3.3, let $X=\{a,b\}$, let $A$ consist of the constant functions on $X$, and let $I$ be a positive linear functional with $I(1)=1$. In the finite-satisfiability step, the Boolean algebra generated by the sets $f_i^{-1}(J_j)$ contains only $\emptyset$ and $X$, so the singletons $\{a\}$ and $\{b\}$ are not measurable. Since Definition 2.4 makes singleton measurability part of being an L-structure, the constructed finite structure is not a model, and the appeal to Lemma 2.7 and Theorem 2.6 is unsupported as written.

Watch

Extended reading notes

Core claim

The central claim is that the logical compactness theorem for integration logic gives new, uniform proofs of all three theorems. In each proof, a language is built with constants for points and relation symbols for the functions or Boolean elements at issue, and a theory states the algebraic and lattice laws together with the values of the functional as integrals. Finite satisfiability of the theory is checked by constructing finite or approximately finite measure structures; compactness then produces a model whose underlying measure is the desired one, and for the two function-space theorems the measure is transferred back to the original space by the subspace-measure construction. The paper presents this as evidence that a single logical existence principle can replace theorem-specific analytic approximation arguments.

Load-bearing premise

The load-bearing premise is that the finite approximate structures built in the Daniell-Stone proof are genuine L-structures in the integration-logic sense, yet Definition 2.4 demands that every singleton be measurable while the Boolean algebra generated by the finitely many sets $f_i^{-1}(J_j)$ need not contain singletons; unless that gap is repaired, the compactness theorem cannot be applied to those structures.

Editorial extensions

If this is right

Stone's representation theorem for probability algebras becomes a direct compactness consequence: the axioms force each element to behave as a measurable characteristic function with the prescribed measure, and the model's associated probability algebra is sigma-order-continuously isomorphic to the original one.
The Daniell-Stone theorem follows once finite approximate satisfiability is established; the compactness model supplies a measure on a superspace whose subspace measure on the original space represents the Daniell integral.
The Riesz representation theorem for compact Hausdorff spaces follows by the same theory with Dini's theorem replacing order-continuity, and the resulting Baire measure extends uniquely to a Radon measure.
A single logical framework thus handles all three existence theorems with the same axioms and the same compactness step, rather than three bespoke analytic constructions.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

The author leaves implicit that the same recipe is a general transfer principle: any measure-existence statement expressible as a finitely satisfiable integration-logic theory would yield its measure by compactness, with the analytic work concentrated entirely in the finite-satisfiability check.
A likely repair for the singleton-measurability gap in the Daniell-Stone finite models is to adjoin all singletons to the generated Boolean algebra with zero mass; the paper does not state this repair, so it is an inference that the compactness step can be made rigorous without changing the proof's shape.
The Riesz proof's reliance on Dini's theorem suggests the method extends to any setting where monotone pointwise convergence can be upgraded to uniform convergence; a locally compact version would likely need a compactification step or a different finite-model construction.
A natural test of the method's scope would be to apply it to other existence theorems, such as the existence of conditional expectations or disintegrations, where the finite-model check may mirror the one used here.

Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Desk Editor's Note

read the letter

Plainly: this paper does what it says — uniform logical compactness proofs for Riesz, Daniell-Stone, and Stone. The Stone proof is complete and well-structured; the other two are not formally valid as printed, because of one gap in the finite-satisfiability construction. The gap is real, and it is also easy to fix.

What is genuinely new: I don't know of earlier proofs of all three theorems by a single integration-logic compactness template. The finite-satisfiability work in the Daniell-Stone proof is real analysis: Lemma 2.10 finds inessential partition points, the ξ_n approximations control the measure of atoms, and Claim 1 uses order-continuity to bound the error. The subspace-measure argument in Claim 2 is detailed and makes an interesting use of Lemma 2.11. The Riesz proof adapts the same machinery, replacing order-continuity by Dini's theorem; the adaptation is sketched rather than spelled out, but that is acceptable if the base proof is repaired.

The soft spot is exactly where the stress-test places it. In Theorem 3.3, B0 is the finite Boolean algebra generated by f_i^{-1}(J_j). The paper says (X,B0,λ) is an L-structure. It is not, under Definition 2.4, unless every singleton is in B0. In general it isn't — take A to be just the constant functions and B0 is trivial. The equality symbol then fails to be measurable, so the structure is not a model in the sense required by compactness. This matters because finite satisfiability is the step that feeds the compactness theorem. The repair is simple: enlarge the algebra by adjoining singletons with zero mass and extend λ0 accordingly, for instance by concentrating each atom's mass at one point. The functions f_i stay measurable because they are constant on atoms. The paper doesn't mention this, so the proof as written is incomplete. The Riesz theorem inherits the same issue.

Also worth noting: the compactness theorem is cited from Bagheri–Pourmahdian, not proved here; for a paper aimed at analysts that's fine, but readers should know.

For whom: anyone interested in logical methods in measure theory, or in uniform proofs of existence theorems. It's a methodological contribution, not new theorem statements. If the singleton gap is repaired, I'd be happy to see it in print. I'd send it to a serious referee — this is not a desk-reject — with a request that the finite-structure construction be corrected. My own verdict is conditional.

Referee Report

2 major / 5 minor

Summary. The paper proposes new proofs of three classical measure-existence theorems—Riesz representation, Daniell-Stone, and Stone representation for probability algebras—within the framework of integration logic. The strategy is uniform: express the desired measure as a theory in integration logic, prove finite (approximate) satisfiability by constructing finite measures directly from the given functional, apply the logical compactness theorem, and then transfer the resulting measure back to the original space or read off the desired algebra. The paper is self-contained and aimed at a general mathematical audience.

Significance. The uniform compactness-based approach is attractive and, if the finite-satisfiability step is made correct, would be a valuable illustration of logical methods in measure theory. The paper contains substantial analytic work, notably the full-outer-measure argument in Claim 2 and the covering lemma (Lemma 2.11). There is no circularity or parameter-fitting: the axioms are natural and the analytic content is genuinely nontrivial. However, the construction of the finite L-structures in Theorems 3.3 and 3.4 does not currently satisfy the paper's own Definition 2.4, so the central compactness step is formally incomplete as printed. The gaps are local and repairable.

major comments (2)

[Section 3.2, same paragraph] The assertion that (X,B0,λ) is an L-structure is not compatible with Definition 2.4. The algebra B0 is generated by finitely many sets f_i^{-1}(J_j), and it need not contain singletons; for example, taking X=[0,1], A=C(X), f_1(x)=x, and a two-interval partition of the range yields a B0 generated by two half-open intervals, which contains no singleton. Definition 2.4 and Proposition 2.3 require every singleton to be measurable, so the structure does not qualify as a model in the sense used by Lemma 2.7 and Theorem 2.6. Since finite satisfiability is precisely the step that feeds compactness, the compactness argument is formally inapplicable as written. The repair is straightforward—enlarge B0 to σ(B0 ∪ {{x}:x∈X}) and extend λ0 by assigning measure zero to the added singletons, e.g., by concentrating each atom's mass at a chosen point—but the paper does not state it. Theorem 3.4 inherits the same gap, because its finite-satisfiability step is explicitly described as very similar to the Daniell-Stone case.
[Section 3.2, construction of the finite approximate structure] Even apart from the singleton issue, the proof interprets R_f by f itself for every f∈A and then claims that an L-structure has been obtained. But B0 is generated only by the functions f_1,...,f_t that appear in axiom 7 of the finite subset T0; an arbitrary f∈A need not be B0-measurable, so the interpretation of R_f would not be an admissible measurable function. Consequently the claim that the instances of axioms 1–6 in T0 hold exactly is not well founded for functions outside the list. The repair is again local: take f_1,...,f_t to include all functions whose relation symbol occurs anywhere in T0, and interpret symbols not occurring in T0 by a fixed B0-measurable function (e.g., the constant 0 function). This point should be stated explicitly, since the finite-satisfiability argument is load-bearing for the compactness application.

minor comments (5)

[Throughout] The text contains numerous typographical artifacts (e.g., "D aniell", "th eorem", "di ﬀerent", "It it indeed") that should be corrected in a revision.
[Subsection 2.1] The definition of a measure on a Boolean algebra is introduced as "finitely additive" but the displayed condition is countable additivity; the terminology should be aligned with the condition.
[Theorem 3.4, after Dini's theorem] The phrase "it can be easily shown that lim I(g_n)=1" should be expanded: since I is a positive linear functional on C(X), it is continuous with respect to uniform convergence, so the uniform convergence from Dini's theorem transfers to the limit of I(g_n).
[Lemma 2.10] The proof is given in detail only for t=1, with the general case deferred to "similar" reasoning; since the paper applies the lemma to finite families, a full proof for the general case would improve the presentation.
[Section 3.2, subclaim in Claim 2] The identity R_f * R_g a.e. = R_{f*g} is asserted with "it is not hard to see"; a short derivation from axioms 3–6 would help the intended general-audience readership verify this important step.

Circularity Check

0 steps flagged · score 1.0 of 10

No significant circularity: the compactness proofs construct finite approximating measures from the functional and then invoke an external compactness theorem; the sole self-citation is not load-bearing.

full rationale

The central derivation chain is not circular. In the Daniell-Stone proof (Theorem 3.3), axiom 7 of the theory T states the target equality, but finite satisfiability is proved by constructing finite approximating measures directly from the Daniell integral: lambda0(P_k) = lim_n I(xi^n_k), where xi^n_k are lattice functions increasing to characteristic functions of atoms. The proof then uses positivity, linearity, and order-continuity of I to show |I(f_i) - integral f_i d lambda| <= epsilon for each of finitely many f_i. This is not a restatement of the conclusion. The Stone representation proof similarly builds finite models on atoms of finite subalgebras with measure values inherited from mu. The Riesz proof is explicitly very similar and uses Dini's theorem to replace order-continuity. Compactness (Theorem 2.6) is imported from external reference [1], not from the present author; it is used as a genuine existence theorem, not as a container for the desired measure. The only self-citation, [15], is a parenthetical remark about an abstract framework and is not load-bearing. There is a genuine formal gap as printed: the finite algebra B0 generated by finitely many f_i^{-1}(J_j) need not contain singletons, so the structure (X,B0,lambda) may fail Definition 2.4's requirement that every singleton be measurable; without a repair the compactness argument is not formally applicable. That is a correctness concern, not circularity: no fitted parameter, definitional collapse, or self-citation chain forces the target result. The score is therefore minimal.

Assumptions & free parameters 0 free parameters · 7 assumptions · 0 invented entities

The paper introduces no new objects into the mathematical ontology; the finite models and compactness models are proof artifacts. Auxiliary partition points and error tolerances are existential choices, not fitted parameters. The main external support is the compactness theorem of integration logic.

assumptions (7)

standard math Compactness theorem for integration logic (Theorem 2.6): any finitely satisfiable theory is satisfiable.
Load-bearing external result, cited to [1]; used in all three main proofs to pass from finite satisfiability to a global model.
standard math Caratheodory extension theorem (Theorem 2.2).
Used to identify the measure nu on B with the Caratheodory extension from the Boolean algebra C in Claims 2, and in preliminary measure constructions.
domain assumption Existence of the extended product measures with diagonal sets (Proposition 2.3, from Keisler [12]).
Required by Definition 2.4 so that equality is measurable in simple L-structures.
standard math Subspace measure facts, Proposition 2.1 (from Fremlin [5]).
Used in Theorems 3.3 and 3.4 to transfer integrals from the compactness model back to X once full outer measure is established.
standard math Lemma 2.7: finite approximate satisfiability implies finite satisfiability via a nonprincipal ultrafilter.
Stated without full proof; bridges approximate finite models to exact finite satisfiability for the compactness theorem.
standard math Marik's Baire-to-Borel extension theorem [14].
Used in Theorem 3.4 to extend the Baire measure on X to a Radon measure.
standard math Dini's theorem on uniform convergence of monotone sequences on compact spaces.
Used in Theorem 3.4 to replace pointwise convergence by uniform convergence so that the positive functional commutes with limits.

how reviews work

0 comments

Cite this review

Pith. "Pith review of Uniform logical proofs for Riesz representation theorem, Daniell-Stone theorem and Stone's representation theorem for probability algebras." pith.science (2026). https://pith.science/paper/6QK2NES6

@misc{pith2026190803774,
  author       = {Pith},
  title        = {Pith review of: Uniform logical proofs for Riesz representation theorem, Daniell-Stone theorem and Stone's representation theorem for probability algebras},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/6QK2NES6}},
  note         = {Machine review of arXiv:1908.03774}
}

read the original abstract

Riesz representation theorem, Daniell-Stone theorem for Daniell integrals and Stone's representation theorem for probability and measure algebras are three important classical results in analysis concerning existence of measures with certain properties. Many proofs of these theorems can be found in the literature of analysis, from elementary ones which use ordinary techniques from measure theory, to more sophisticated ones, such as those employing techniques from nonstandard analysis, in particular for Riesz representation theorem. In this paper, as the first goal, we give new proofs for all these three theorems. Our proofs have a mild logical flavor and are uniform in the sense that they are all based on the same general idea and rely on the application of the same technical tool from logic to measure theory, namely logical compactness theorem. In fact, as the second goal of the paper, we try to reveal more the power of logical methods in analysis in particular measure theory, and make stronger connections between analysis and logic. We use the setting of "integration logic" which is a logical framework (and one of the forms of probability logics) for studying measure and probability structures by logical means. Indeed, we elaborate this setting and use its expressive power and a version of compactness theorem holding in it to show its application in measure theory by giving new proofs for the above-mentioned measure existence theorems. As mentioned, an advantage of these proofs is that they are all given in a uniform way since they are all based on the logical compactness theorem. The paper is mostly written for general mathematicians, in particular the people active in analysis or logic as the main audience. So it is self-contained and the reader does not need to have any advanced prerequisite knowledge from logic or measure theory.

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

20 extracted references · 20 canonical work pages

[1]

Bagheri, M

S. Bagheri, M. Pourmahdian, The logic of integration, Ar ch. Math. Logic 48 (2009) 465–492

work page 2009
[2]

Fajardo, H

S. Fajardo, H. Keisler, Model theory of stochastic proce sses, Lecture Notes in Logic 14 ASL, 2002

work page 2002
[3]

Farah, B

I. Farah, B. Hart, D. Sherman, Model theory of operator al gebras I: Stability, Bull. London Math. Soc. 45 (2013) 825–8 38

work page 2013
[4]

Fremlin, Measure theory, vol

D. Fremlin, Measure theory, vol. 3, Torres Fremlin, 2002

work page 2002
[5]

Fremlin, Measure theory, vol

D. Fremlin, Measure theory, vol. 2, Torres Fremlin, 2003

work page 2003
[6]

D. J. H. Garling, A ’short’ proof of the Riesz representat ion theorem, Proc. Cambridge Philos. Soc. 73 (1973) 459–460

work page 1973
[7]

D. J. H. Garling, Another ’short’ proof of the Riesz repre sentation theorem, Math. Proc. Cambridge Philos. Soc. 99 (1 986) 261–262

work page
[8]

Goldbring, H

I. Goldbring, H. Towsner, An approximate logic for measu res, Israel Journal of Mathematics. 199 (2) (2014) 867–913

work page 2014

Show all 20 references

[9]

Halmos, Measure theory, Princeton, V an Nostrand, 1974

P . Halmos, Measure theory, Princeton, V an Nostrand, 1974

1974
[10]

D. G. Hartig, The Riesz representation revisited, Amer . Math. Monthly 90 (1983) 277–280

1983
[11]

Hoover, Probability logic, Annals of Mathematical L ogic 14 (1978) 287–313

D. Hoover, Probability logic, Annals of Mathematical L ogic 14 (1978) 287–313

1978
[12]

Keisler, Probability quantiﬁers, in: Model Theoret ic Logic, edited by J

H. Keisler, Probability quantiﬁers, in: Model Theoret ic Logic, edited by J. Barwise and S. Feferman, Springer-V er lag, 1985, pp. 509–556

1985
[13]

Kuyper, S

R. Kuyper, S. A. Terwijn, Model theory of measure spaces and probability logic, The Review of Symbolic Logic 6 (3) (20 13) 367–393
[14]

Marik, The Baire and Borel measure, Czechoslovak Mat h

J. Marik, The Baire and Borel measure, Czechoslovak Mat h. J. 7 (1957) 248–253

1957
[15]

Moﬁdi, S

A. Moﬁdi, S. Bagheri, Quantiﬁed universes and ultrapro duct, Math. Logic Quart 58 (2012) 63–74

2012
[16]

Raˇ skovi´ c, R

M. Raˇ skovi´ c, R. Dordevi´ c, Probability quantiﬁers and operators, V esta Company, Belgrade, 1996

1996
[17]

Ross, Y et another short proof of the Riesz representa tion theorem, Math

D. Ross, Y et another short proof of the Riesz representa tion theorem, Math. Proc. Cambridge Philos. Soc 105 (1989) 2 61–262

1989
[18]

Royden, Real Analysis, Macmillan Co., New Y ork., 198 8

H. Royden, Real Analysis, Macmillan Co., New Y ork., 198 8
[19]

S. A. Terwijn, Probabilistic logic and induction, Jour nal of Logic and Computation 15(4) (2005) 507–515

2005
[20]

Zivaljevic, A Loeb measure approach to the Riesz repr esentation theorem, Publ

R. Zivaljevic, A Loeb measure approach to the Riesz repr esentation theorem, Publ. Inst. Math. (Beograd) (N.S.) 32 ( 1982) 175–177. 18

1982

Pith tools

Reviewed August 14, 2026 · model on record in the stance chip above.

[1] [1]

Bagheri, M

S. Bagheri, M. Pourmahdian, The logic of integration, Ar ch. Math. Logic 48 (2009) 465–492

work page 2009

[2] [2]

Fajardo, H

S. Fajardo, H. Keisler, Model theory of stochastic proce sses, Lecture Notes in Logic 14 ASL, 2002

work page 2002

[3] [3]

Farah, B

I. Farah, B. Hart, D. Sherman, Model theory of operator al gebras I: Stability, Bull. London Math. Soc. 45 (2013) 825–8 38

work page 2013

[4] [4]

Fremlin, Measure theory, vol

D. Fremlin, Measure theory, vol. 3, Torres Fremlin, 2002

work page 2002

[5] [5]

Fremlin, Measure theory, vol

D. Fremlin, Measure theory, vol. 2, Torres Fremlin, 2003

work page 2003

[6] [6]

D. J. H. Garling, A ’short’ proof of the Riesz representat ion theorem, Proc. Cambridge Philos. Soc. 73 (1973) 459–460

work page 1973

[7] [7]

D. J. H. Garling, Another ’short’ proof of the Riesz repre sentation theorem, Math. Proc. Cambridge Philos. Soc. 99 (1 986) 261–262

work page

[8] [8]

Goldbring, H

I. Goldbring, H. Towsner, An approximate logic for measu res, Israel Journal of Mathematics. 199 (2) (2014) 867–913

work page 2014