Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with axiom-of-choice
Search options not deleted
user 165275
An important and fundamental axiom in set theory sometimes called Zermelo's axiom of choice. It was formulated by Zermelo in 1904 and states that, given any set of mutually disjoint nonempty sets, there exists at least one set that contains exactly one element in common with each of the nonempty sets. The axiom of choice is related to the first of Hilbert's problems.
4
votes
Simpler proofs using the axiom of choice
For an orthomorphism $A$ in a (real or complex) Banach lattice $X$ the formula $\lvert A\rvert x=\lvert Ax\rvert$ for $x\ge0$ can be obtained relatively quickly if one uses the fact that $X$ is order …
- 1,869
11
votes
What can be preserved in mathematics if all constructions are carried out in ZF?
One of the standard texts which presents functional analysis only based on ZF+DC is the monograph (consisting of 3 volumes) Henry G. Garnir, Marc de Wilde, and Jean Schmets, Analyse Fonctionnelle.
Als …
- 1,869
5
votes
BCT equivalent to DC
Yet another formulation of Blair's proof is in M. Väth, Topological Analysis, DeGruyter 2012.
- 1,869
1
vote
Axiom of Countable Choice and meager sets
What is your definition of meager in (ZF)? Being a countable union of nowhere dense sets? In that case, the given argument about the failure of (UMM) in (ZF) is not clear: It is not obvious (to me) th …
- 1,869