zetesis-puremath Blueprint
1
Introduction
▶
1.1
What is formalized here
1.2
Verification tiers
2
Measure theory
▶
2.1
Analytic measurability
2.2
Choquet capacity
2.3
Baire-space cylinder infrastructure
2.4
Total variation distance
3
Information theory
▶
3.1
Real-valued KL bridge
3.2
Binary KL and Pinsker’s inequality
3.3
Mutual information
4
Probability
▶
4.1
Bounded random variables + concentration
4.2
Exchangeability and double-sample
4.3
Finite-type PMF
5
Decision theory: minimax and MWU
▼
5.1
Boolean-matrix zero-sum games
5.2
Multiplicative weights update
5.3
Approximate minimax
6
Reproducing-kernel Hilbert spaces
▶
6.1
Bounded kernels
6.2
Kernel mean embedding
6.3
Maximum Mean Discrepancy
6.4
Hilbert-Schmidt Independence Criterion
7
Combinatorics: dual VC
▶
7.1
Binary matrix setup
7.2
Sauer-Shelah corollary
7.3
Assouad’s dual VC bound
References
5 Decision theory: minimax and MWU