Suppose there is a well-known theorem whose usual proof uses Axiom of Choice. Is trying to prove it without Axiom of Choice useless? What merits can such a proof have?
2026-04-06 20:12:09.1775506329
Is trying to prove a theorem without Axiom of Choice useless?
1.2k Views Asked by user8485 https://math.techqa.club/user/user8485/detail At
1
There are 1 best solutions below
Related Questions in SOFT-QUESTION
- Reciprocal-totient function, in term of the totient function?
- Ordinals and cardinals in ETCS set axiomatic
- Does approximation usually exclude equality?
- Transition from theory of PDEs to applied analysis and industrial problems and models with PDEs
- Online resources for networking and creating new mathematical collaborations
- Random variables in integrals, how to analyze?
- Could anyone give an **example** that a problem that can be solved by creating a new group?
- How do you prevent being lead astray when you're working on a problem that takes months/years?
- Is it impossible to grasp Multivariable Calculus with poor prerequisite from Single variable calculus?
- A definite integral of a rational function: How can this be transformed from trivial to obvious by a change in viewpoint?
Related Questions in AXIOM-OF-CHOICE
- Do I need the axiom of choice to prove this statement?
- Canonical choice of many elements not contained in a set
- Strength of $\sf ZF$+The weak topology on every Banach space is Hausdorff
- Example of sets that are not measurable?
- A,B Sets injective map A into B or bijection subset A onto B
- Equivalence of axiom of choice
- Proving the axiom of choice in propositions as types
- Does Diaconescu's theorem imply cubical type theory is non-constructive?
- Axiom of choice condition.
- How does Axiom of Dependent Choice imply this weaker variant?
Trending Questions
- Induction on the number of equations
- How to convince a math teacher of this simple and obvious fact?
- Find $E[XY|Y+Z=1 ]$
- Refuting the Anti-Cantor Cranks
- What are imaginary numbers?
- Determine the adjoint of $\tilde Q(x)$ for $\tilde Q(x)u:=(Qu)(x)$ where $Q:U→L^2(Ω,ℝ^d$ is a Hilbert-Schmidt operator and $U$ is a Hilbert space
- Why does this innovative method of subtraction from a third grader always work?
- How do we know that the number $1$ is not equal to the number $-1$?
- What are the Implications of having VΩ as a model for a theory?
- Defining a Galois Field based on primitive element versus polynomial?
- Can't find the relationship between two columns of numbers. Please Help
- Is computer science a branch of mathematics?
- Is there a bijection of $\mathbb{R}^n$ with itself such that the forward map is connected but the inverse is not?
- Identification of a quadrilateral as a trapezoid, rectangle, or square
- Generator of inertia group in function field extension
Popular # Hahtags
second-order-logic
numerical-methods
puzzle
logic
probability
number-theory
winding-number
real-analysis
integration
calculus
complex-analysis
sequences-and-series
proof-writing
set-theory
functions
homotopy-theory
elementary-number-theory
ordinary-differential-equations
circles
derivatives
game-theory
definite-integrals
elementary-set-theory
limits
multivariable-calculus
geometry
algebraic-number-theory
proof-verification
partial-derivative
algebra-precalculus
Popular Questions
- What is the integral of 1/x?
- How many squares actually ARE in this picture? Is this a trick question with no right answer?
- Is a matrix multiplied with its transpose something special?
- What is the difference between independent and mutually exclusive events?
- Visually stunning math concepts which are easy to explain
- taylor series of $\ln(1+x)$?
- How to tell if a set of vectors spans a space?
- Calculus question taking derivative to find horizontal tangent line
- How to determine if a function is one-to-one?
- Determine if vectors are linearly independent
- What does it mean to have a determinant equal to zero?
- Is this Batman equation for real?
- How to find perpendicular vector to another vector?
- How to find mean and median from histogram
- How many sides does a circle have?
It is often not useless at all. First let me give out a few reasons why it is useful:
It gives us a better understanding of how well-behaved some objects are. For example, vector spaces are not well-behaved in general, but in particular cases they are well-behaved (e.g. finitely generated ones).
On the other hand, compact metric spaces are quite well-behaved and many of their properties remain valid even without the axiom of choice.
It can be the case that a proof without the axiom of choice is a much more constructive one, and allows us to examine the features of an object which was proved only to exist if the axiom of choice were used.
One example coming to mind is the compactness of closed and bounded subsets of $\mathbb R$, another is the uniform continuity of a continuous function from a compact metric space into a metric space.
If a proof fails it allows us a better understanding of how much choice is needed for a certain assertion. Dependent Choice for Baire's Category theorem; Countable Choice for the equivalence between different topological properties; etc.
On the other hand, it is somewhat useless to try and prove a theorem without the axiom of choice if other parts of the theory already assume it. If you already assume that every vector space has a basis, showing that a certain proposition relying on this property holds without the axiom of choice is moot.
One example for this is the ultrafilter theorem which, together with the Krein-Milman theorem, imply the axiom of choice [4], so if you end up using both these propositions there is no use in avoiding choice anymore. It's there.
Regardless of the above, one should remember that not all things in modern mathematics are true in the absence of choice (that is, aside from the axiom of choice itself) and often reformulation and distinction between equivalent definitions is required. In those cases one can, and should, ask themselves how much choice is needed for a particular result.
For example, the assertion "$\mathbb R$ is not a countable union of countable sets" requires the axiom of choice, but it is provable from a vastly weaker statement, "countable unions of countable sets are countable".
Further reading: