English

edit
 
English Wikipedia has an article on:
Wikipedia

Alternative forms

edit

Noun

edit

π-system (plural π-systems)

  1. (set theory, measure theory, probability theory) A non-empty collection of subsets of a given set Ώ that is closed under non-empty finite intersections.
    • 2007, Rabi Bhattacharya, Edward C. Waymire, A Basic Course in Probability Theory, Springer, page 49:
      To see this, first check that  , where   is a field and, in particular, a  -system.
    • 2017, Willem Adriaan de Graaf, Computation with Linear Algebraic Groups[1], Taylor & Francis (CRC Press), page 221:
      We start with a basis of simple roots   of  . Then we apply all possible elementary transformations and add the resulting  -systems to the list. Of course, if   is a  -system, and   is a  -system obtained from it by an elementary transformation and the diagrams of   and   are the same, the root subsystems they span are the same, and therefore we do not add  .
    • 2021, Jeremy J. Becnel, Tools for Infinite Dimensional Analysis[2], Taylor & Francis (CRC Press):
      Clearly the definitions for a  -system and a  -system are both satisfied by a  -algebra. []
      Proposition 4.1.8 Let   be a set and   be a collection of subsets of  . The collection   is a  -algebra if and only if   is a  -system and a  -system.

Usage notes

edit
  • By convention, the empty intersection (aka nullary intersection: the "intersection of no sets") is taken to be Ώ itself: its explicit exclusion means that Ώ need not be a member of any arbitrary π-system (i.e., of every π-system).
  • The system is said to be a π-system on Ώ.
  • For any family Σ of subsets of Ώ, there exists a unique smallest π-system that contains every element of Σ: it is called the π-system generated by Σ.

Hyponyms

edit

Translations

edit

See also

edit

Further reading

edit

Anagrams

edit
  NODES
Note 3