Linked Questions

269 votes
16 answers
77k views

As I understand it, it has been proven that the axiom of choice is independent of the other axioms of set theory. Yet I still see people fuss about whether or not theorem X depends on it, and I don't ...
63 votes
8 answers
10k views

Here's a familiar conversation: Me: Do you think Conjecture A and Conjecture B are equivalent? Friend: Yes, because I think they're both true. Me: [eye roll] You know what I mean... Does there ...
Dustin G. Mixon's user avatar
53 votes
7 answers
8k views

Is there a problem which is known to be undecidable (in the algorithmic sense), but for which the only known proofs of undecidability do not use some form of the Cantor diagonal argument in any ...
Terry Tao's user avatar
  • 121k
34 votes
4 answers
4k views

Consider Frege's cardinality and HoTT set-truncation cardinality, both of which can be well-defined in constructive theory (as SetoidTT and CubicalTT, respectively). Why don’t we regard them as well ...
Ember Edison's user avatar
  • 1,523
42 votes
7 answers
4k views

Some years ago, Kevin Buzzard wrote a blog post asking whether the trace of a linear map $\phi \colon V \to V$ on a vector space $V$ can be defined "without picking a basis." He had some ...
Timothy Chow's user avatar
  • 91.7k
18 votes
4 answers
3k views

A choice function maps every set (in its domain) to an element of itself. This question concerns existence of an anti-choice function defined on the family of countable sets of reals. In an answer to ...
Aaron Meyerowitz's user avatar
12 votes
4 answers
2k views

There is a formal definition for the notion of a formal proof. Question 1. Is there any formal definition for the notion of a diagonal formal proof? Consider the following theorems both proved by ...
user47544's user avatar
  • 141
12 votes
4 answers
3k views

I cited the diagonal proof of the uncountability of the reals as an example of a `common false belief' in mathematics, not because there is anything wrong with the proof but because it is commonly ...
KP Hart's user avatar
  • 13.7k
20 votes
2 answers
2k views

This was inspired by this recent question. In my answer there, I pointed out that, given $F:{\mathcal P}(X)\to X$, an argument dating back to Zermelo allows us to define a pair $(A,B)$ of distinct ...
Andrés E. Caicedo's user avatar
7 votes
0 answers
293 views

Every mathematician understands the concept of reducing a complicated problem to a simpler problem. "Without loss of generality, we may assume…" However, I've noticed that some kinds of "...
Timothy Chow's user avatar
  • 91.7k