Algorithmic randomness, reverse mathematics, and the dominated convergence theorem

DOI10.1016/J.APAL.2012.05.010zbMATH Open1259.03021OpenAlexW2059834295MaRDI QIDQ714719FDOQ714719

Authors Jeremy Avigad, Edward T. Dean, Jason Rute

Publication date 11 October 2012

Published in Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1106.0775

zbMATH Keywords

measurealgorithmic randomnessreverse mathematicsWKLLebesgue integrationrainbow RamseyWWKLdominated convergence\(G\)-delta2-RAN

Mathematics Subject Classification ID

Algorithmic randomness and dimension (03D32) Foundations of classical theories (including reverse mathematics) (03B30) Second- and higher-order arithmetic and fragments (03F35) Constructive and recursive analysis (03F60)

Abstract: We analyze the pointwise convergence of a sequence of computable elements of L^1(2^omega) in terms of algorithmic randomness. We consider two ways of expressing the dominated convergence theorem and show that, over the base theory RCA_0, each is equivalent to the assertion that every G_delta subset of Cantor space with positive measure has an element. This last statement is, in turn, equivalent to weak weak K"onig's lemma relativized to the Turing jump of any set. It is also equivalent to the conjunction of the statement asserting the existence of a 2-random relative to any given set and the principle of Sigma_2 collection.

Recommendations

• Undominated sequences of integrable functions
• Beyond Dominated Convergence: Newer Methods of Integration
• Extension of the continuity theorems of Lebesgue integration
• On the dominated convergence theorem for the Kurzweil–Stieltjes integral
• A metastable dominated convergence theorem
• scientific article; zbMATH DE number 7046851
• A constructive and formal proof of Lebesgue's dominated convergence theorem in the interactive theorem prover Matita
• scientific article; zbMATH DE number 4051928
• Dominated convergence theorems for the integration of function sequence with respect to weak convergence probability measure sequence
• Limit theorems for the integration of measurable function sequence with respect to weak convergence probability measure sequence

Cites work

• scientific article; zbMATH DE number 4008384 (Why is no real title available?)
• scientific article; zbMATH DE number 227056 (Why is no real title available?)
• A computational aspect of the Lebesgue differentiation theorem
• Algorithmic randomness and complexity.
• An application of Martin-Löf randomness to effective probability theory
• Computability and randomness
• Computability of probability measures and Martin-Löf randomness over metric spaces
• Computability on the probability measures on the Borel sets of the unit interval
• Computable randomness and betting for computable probability spaces
• Factorization of polynomials and \(\Sigma ^ 0_ 1\) induction
• Lebesgue Convergence Theorems and Reverse Mathematics
• Lowness notions, measure and domination
• Mass problems and measure-theoretic regularity
• Measure theory and weak König's lemma
• Randomness and differentiability
• Riesz representation theorem, Borel measures and subsystems of second- order arithmetic
• Statistical properties of dynamical systems -- Simulation and abstract computation
• Subsystems of second order arithmetic
• The strength of the rainbow Ramsey Theorem
• Uniform almost everywhere domination

Cited in

(18)

• On the computability of perfect subsets of sets with positive measure
• On the uniform computational content of the Baire category theorem
• Algorithmic randomness and Fourier analysis
• The strength of compactness in computability theory and nonstandard analysis
• Computability theory, nonstandard analysis, and their connections
• Randomness notions and reverse mathematics
• Pathwise-randomness and models of second-order arithmetic
• Splittings and disjunctions in reverse mathematics
• Program extraction for 2-random reals
• Algorithmic randomness for Doob's martingale convergence theorem in continuous time
• On the logical strengths of partial solutions to mathematical problems
• Measure theory and higher order arithmetic
• The Dirac delta function in two settings of reverse mathematics
• The weakness of being cohesive, thin or free in reverse mathematics
• On uniform relationships between combinatorial problems
• Where pigeonhole principles meet Koenig lemmas
• Computable Measure Theory and Algorithmic Randomness
• scientific article; zbMATH DE number 1163978 (Why is no real title available?)

This page was built for publication: Algorithmic randomness, reverse mathematics, and the dominated convergence theorem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q714719)