feat(Probability/Independence): grouping an independent family by pairwise disjoint index sets#41935
Conversation
…rwise disjoint index sets
Welcome new contributor!Thank you for contributing to Mathlib! If you haven't done so already, please review our contribution guidelines, as well as the style guide and naming conventions. In particular, we kindly remind contributors that we have guidelines regarding the use of AI when making pull requests. We use a review queue to manage reviews. If your PR does not appear there, it is probably because it is not successfully building (i.e., it doesn't have a green checkmark), has the If you haven't already done so, please come to https://leanprover.zulipchat.com/, introduce yourself, and mention your new PR. Thank you again for joining our community. |
PR summary 5c4f635b2eImport changes for modified filesNo significant changes to the import graph Import changes for all files
|
If
m : ι → MeasurableSpace Ωis an independent family of σ-algebras andG : ι' → Set ιis apairwise disjoint family of index sets, then the family of grouped σ-algebras
fun i' ↦ ⨆ j ∈ G i', m jis again independent.This is the indexed-family version of the existing two-group lemma
indep_iSup_of_disjoint, fromwhich it follows by induction on the finite subfamily, peeling off one group at a time against the
union of the remaining ones. As usual it is proven for the kernel notion of independence
(
Kernel.iIndep_iSup_of_disjoint) and specialized to independence w.r.t. a measure(
iIndep_iSup_of_disjoint) and to conditional independence (iCondIndep_iSup_of_disjoint).The lemma is the natural bridge from an independent family to block/grouping arguments — e.g.
Markov-style properties of recursions driven by disjoint sets of randomness sources. It was
developed for a formalization of end-to-end latency distributions of periodic task chains, where it
establishes that successive chain states, being measurable w.r.t. σ-algebras of disjoint groups of
an independent family, form an independent family themselves.