Differences between revisions 3 and 20 (spanning 17 versions)
Revision 3 as of 2024-03-22 22:47:18
Size: 1253
Comment: Style
Revision 20 as of 2026-08-09 18:48:19
Size: 1846
Comment: Note
Deletions are marked like this. Additions are marked like this.
Line 1: Line 1:
= σ Algebra Notation = = σ Algebra =

A '''σ algebra''' (sigma algebra) is a set of measurable sets.
Line 9: Line 11:
== Sets and Subsets == == Description ==
Line 11: Line 13:
The maximal set, which in probability applications is the '''sample space''', is notated as ''Ω''. A σ algebra is usually notated using a calligraphic uppercase letters, like 𝒜.

For a given sample space ''Ω'', a σ algebra 𝒜 can be defined. It is the [[Analysis/Sets|subset]] of the [[Analysis/PowerSet|power set]] of the sample space (𝒜 ''⊆ P(Ω)'') that satisfies three conditions:

 * Both the empty set and the full sample space are in the σ algebra; ''Ø, Ω ∈'' 𝒜
 * The sigma algebra is closed on complementation; ''A ∈'' 𝒜 ''-> A^C^ ∈'' 𝒜
 * The sigma algebra is closed upon [[Analysis/Cardinality|countable]] unions; ''⋃ A,,i,, ∈'' 𝒜 where members of 𝒜 be indexed as ''A,,i,,'', ''i ∈ N''

The smallest possible σ algebra is given by condition 1 literally: ''{Ø, Ω}''. The largest possible σ algebra is of course ''P(Ω)'' itself. All possible σ algebra are bounded by these two extrema.
Line 15: Line 25:
=== Subsets === === Properties ===
Line 17: Line 27:
Subsets are usually named with calligraphic uppercase letters, but that's not exactly practical in typed notes. Capital letters will be used instead. For a given sample space ''Ω'', and some number of σ algebras 𝒜'',,i,,'' defined on it, ''⋂,,i,,'' 𝒜 '',,i,,'' is also a σ algebra.
Line 19: Line 29:
A subset of ''Ω'' is expressed as ''A ⊆ Ω''. It follows that for any ℳ ''⊆ P(Ω)'', the smallest possible σ algebra that contains ℳ (or the σ algebra generated by ℳ) is given by the intersection of every 𝒜 larger than ℳ. This operation is notated as:

{{attachment:gen.svg}}
Line 23: Line 35:
=== Intersections and Unions === === Relation to Borel Sets ===
Line 25: Line 37:
The '''intersection''' of two sets is notated as ''A ⋂ B''; the '''union''' of two sets is notated as ''A ⋃ B''. The '''Borel set''' (or Borel σ algebra) defined on ''Ω'' is the smallest possible σ algebra generated by the [[Analysis/TopologicalSpace|topology]] of ''Ω''. It follows that:
Line 27: Line 39:
The intersection of all subsets ''A,,i,,'' can be expressed as: {{attachment:borel.svg}}
Line 29: Line 41:
{{attachment:intersection.svg}}

The union of all subsets ''A,,i,,'' can be expressed as:

{{attachment:union.svg}}

----



== Properties ==


A pair of sets are '''disjoint''' if there is no intersection, which is expressed as ''A ⋂ B = ∅''

----



== Maps ==

Maps are usually named with blackboard bold letters, but that's not exactly practical in typed notes. Bold capital letters will be used instead.

A map translates a (sub)set into a real number. A parallel to the functional expression of probability, ''p(A)'', is '''''P''': A -> R''.
The Borel set is equal to the power set only when ''Ω'' is discrete and countable. Otherwise, the Borel set is always a subset of the power set.

σ Algebra

A σ algebra (sigma algebra) is a set of measurable sets.


Description

A σ algebra is usually notated using a calligraphic uppercase letters, like 𝒜.

For a given sample space Ω, a σ algebra 𝒜 can be defined. It is the subset of the power set of the sample space (𝒜 ⊆ P(Ω)) that satisfies three conditions:

  • Both the empty set and the full sample space are in the σ algebra; Ø, Ω ∈ 𝒜

  • The sigma algebra is closed on complementation; A ∈ 𝒜 -> AC 𝒜

  • The sigma algebra is closed upon countable unions; ⋃ Ai 𝒜 where members of 𝒜 be indexed as Ai, i ∈ N

The smallest possible σ algebra is given by condition 1 literally: {Ø, Ω}. The largest possible σ algebra is of course P(Ω) itself. All possible σ algebra are bounded by these two extrema.

Properties

For a given sample space Ω, and some number of σ algebras 𝒜i defined on it, i 𝒜 i is also a σ algebra.

It follows that for any ℳ ⊆ P(Ω), the smallest possible σ algebra that contains ℳ (or the σ algebra generated by ℳ) is given by the intersection of every 𝒜 larger than ℳ. This operation is notated as:

gen.svg

Relation to Borel Sets

The Borel set (or Borel σ algebra) defined on Ω is the smallest possible σ algebra generated by the topology of Ω. It follows that:

borel.svg

The Borel set is equal to the power set only when Ω is discrete and countable. Otherwise, the Borel set is always a subset of the power set.


CategoryRicottone

Analysis/SigmaAlgebra (last edited 2026-08-09 18:48:19 by DominicRicottone)