Algorithmic randomness, reverse mathematics, and the dominated convergence theorem

DOI10.1016/J.APAL.2012.05.010zbMATH Open1259.03021arXiv1106.0775OpenAlexW2059834295MaRDI 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)

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.

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

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

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)

Cites Work

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

Cited In (16)

• Pathwise-randomness and models of second-order arithmetic
• RANDOMNESS NOTIONS AND REVERSE MATHEMATICS
• Splittings and disjunctions in reverse mathematics
• On the logical strengths of partial solutions to mathematical problems
• Where pigeonhole principles meet Koenig lemmas
• The strength of compactness in computability theory and nonstandard analysis
• On uniform relationships between combinatorial problems
• On the uniform computational content of the Baire category theorem
• Computable Measure Theory and Algorithmic Randomness
• COMPUTABILITY THEORY, NONSTANDARD ANALYSIS, AND THEIR CONNECTIONS
• Title not available (Why is that?)
• Measure theory and higher order arithmetic
• The weakness of being cohesive, thin or free in reverse mathematics
• Program extraction for 2-random reals
• The Dirac delta function in two settings of reverse mathematics
• On the computability of perfect subsets of sets with positive measure

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)