A finitary Kronecker's lemma and large deviations in the Strong Law of Large numbers on Banach spaces
Fuente:
arXiv
Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866910696467333120 |
|---|---|
| author | Neri, Morenikeji |
| author_facet | Neri, Morenikeji |
| contents | We explore the computational content of Kronecker's lemma via the proof-theoretic perspective of proof mining and utilise the resulting finitary variant of this fundamental result to provide new rates for the Strong Law of Large Numbers for random variables taking values in type $p$ Banach spaces, which in particular are very uniform in the sense that they do not depend on the distribution of the random variables. Furthermore, we provide computability-theoretic arguments to demonstrate the ineffectiveness of Kronecker's lemma and investigate the result from the perspective of Reverse Mathematics. In addition, we demonstrate how this ineffectiveness from Kronecker's lemma trickles down to the Strong Law of Large Numbers by providing a construction that shows that computable rates of convergence are not always possible. Lastly, we demonstrate how Kronecker's lemma falls under a class of deterministic formulas whose solution to their Dialectica interpretation satisfies a continuity property and how, for such formulas, one obtains an upgrade principle that allows one to lift computational interpretations of deterministic results to quantitative results for their probabilistic analogue. This result generalises the previous work of the author and Pischke. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2411_08620 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | A finitary Kronecker's lemma and large deviations in the Strong Law of Large numbers on Banach spaces Neri, Morenikeji Logic Probability 03F10, 03B30, 60B12, 60F10, 60F15 We explore the computational content of Kronecker's lemma via the proof-theoretic perspective of proof mining and utilise the resulting finitary variant of this fundamental result to provide new rates for the Strong Law of Large Numbers for random variables taking values in type $p$ Banach spaces, which in particular are very uniform in the sense that they do not depend on the distribution of the random variables. Furthermore, we provide computability-theoretic arguments to demonstrate the ineffectiveness of Kronecker's lemma and investigate the result from the perspective of Reverse Mathematics. In addition, we demonstrate how this ineffectiveness from Kronecker's lemma trickles down to the Strong Law of Large Numbers by providing a construction that shows that computable rates of convergence are not always possible. Lastly, we demonstrate how Kronecker's lemma falls under a class of deterministic formulas whose solution to their Dialectica interpretation satisfies a continuity property and how, for such formulas, one obtains an upgrade principle that allows one to lift computational interpretations of deterministic results to quantitative results for their probabilistic analogue. This result generalises the previous work of the author and Pischke. |
| title | A finitary Kronecker's lemma and large deviations in the Strong Law of Large numbers on Banach spaces |
| topic | Logic Probability 03F10, 03B30, 60B12, 60F10, 60F15 |
| url | https://arxiv.org/abs/2411.08620 |