Axiom in set theory
In mathematics , the axiom of finite choice is a weak version of the axiom of choice which asserts that if
(
S
α
)
α
∈
A
{\displaystyle (S_{\alpha })_{\alpha \in A}}
is a family of non-empty finite sets , then
∏
α
∈
A
S
α
≠
∅
{\displaystyle \prod _{\alpha \in A}S_{\alpha }\neq \emptyset }
(set-theoretic product ).
If every set can be linearly ordered , the axiom of finite choice follows.
Applications
An important application is that when
(
Ω
,
2
Ω
,
ν
)
{\displaystyle (\Omega ,2^{\Omega },\nu )}
is a measure space where
ν
{\displaystyle \nu }
is the counting measure and
f
:
Ω
→
R
{\displaystyle f:\Omega \to \mathbb {R} }
is a function such that
∫
Ω
|
f
|
d
ν
<
∞
{\displaystyle \int _{\Omega }|f|d\nu <\infty }
,
then
f
(
ω
)
≠
0
{\displaystyle f(\omega )\neq 0}
for at most countably many
ω
∈
Ω
{\displaystyle \omega \in \Omega }
.
References
^ Herrlich, Horst (2006). The axiom of choice . Lecture Notes in Mathematics. Vol. 1876. Berlin, Heidelberg: Springer. doi :10.1007/11601562 . ISBN 978-3-540-30989-5 .
Categories :
Text is available under the Creative Commons Attribution-ShareAlike License. Additional terms may apply.
**DISCLAIMER** We are not affiliated with Wikipedia, and Cloudflare.
The information presented on this site is for general informational purposes only and does not constitute medical advice.
You should always have a personal consultation with a healthcare professional before making changes to your diet, medication, or exercise routine.
AI helps with the correspondence in our chat.
We participate in an affiliate program. If you buy something through a link, we may earn a commission 💕
↑