Axiom of finite choice

From testwiki
Jump to navigation Jump to search

Template:Short description In mathematics, the axiom of finite choice is a weak version of the axiom of choice which asserts that if (Sα)α∈A is a family of non-empty finite sets, then

∏α∈ASα≠∅ (set-theoretic product).[1]Template:Rp

If every set can be linearly ordered, the axiom of finite choice follows.[1]Template:Rp

Applications

An important application is that when (Ω,2Ω,ν) is a measure space where ν is the counting measure and f:Ω→ℝ is a function such that

∫Ω|f|dν<∞,

then f(ω)≠0 for at most countably many ω∈Ω.

References


Template:Settheory-stub