Union over adaptive component covers
Lax342547.AdaptiveUnion · concepts/Lax342547/AdaptiveUnion.lean · lax-342547
No public endorsements yet.
Loading review…
Sign in with ORCIDNatural Language Statement
Lemma
All disjoint exposed and tested index sets have the finite union bound four to the number of coordinates times the cover mass to the number of tests.
Concept map
Lean source view on GitHub
| 1 | import Lax342547.AdaptiveSets |
| 2 | |
| 3 | /-! |
| 4 | --- |
| 5 | title: Union over adaptive component covers |
| 6 | type: lemma |
| 7 | --- |
| 8 | All disjoint exposed and tested index sets have the finite union bound four to the number of coordinates times the cover mass to the number of tests. |
| 9 | -/ |
| 10 | |
| 11 | namespace Lax342547.AdaptiveUnion |
| 12 | |
| 13 | open Lax342547.RelativeEntropy Lax342547.FiniteSampling Lax342547.RetainedImages |
| 14 | open scoped BigOperators |
| 15 | |
| 16 | axiom adaptive_cover_union {ι Ω : Type} [Fintype ι] [Fintype Ω] [DecidableEq ι] |
| 17 | (μ : Ω → ℝ) (A : ∀ E : Finset ι, (E → Ω) → Ω → Prop) (p : ℝ) (k : ℕ) |
| 18 | (hμ : Probability μ) (hp0 : 0 ≤ p) (hp1 : p ≤ 1) |
| 19 | (hA : ∀ E exposed, cellMass μ (A E exposed) ≤ p) : |
| 20 | cellMass (productLaw (fun _ : ι => μ)) |
| 21 | (fun sample => ∃ E J : Finset ι, Disjoint E J ∧ k ≤ J.card ∧ |
| 22 | ∀ j ∈ J, A E (fun e => sample e.val) (sample j)) ≤ |
| 23 | (4 : ℝ)^Fintype.card ι*p^k |
| 24 | |
| 25 | end Lax342547.AdaptiveUnion |
| 26 |
Discussion
Ask a question or add context. Endorsements and structured flags are kept in the review panel above.
0 comments