[ 3 / biz / cgl / ck / diy / fa / ic / jp / lit / sci / vr / vt ] [ index / top / reports ] [ become a patron ] [ status ]
2023-11: Warosu is now out of extended maintenance.

/sci/ - Science & Math


View post   

File: 60 KB, 860x650, 1496928671937.png [View same] [iqdb] [saucenao] [google]
8970823 No.8970823 [Reply] [Original]

Every set can be well-ordered, and theorems about well-ordered sets can be proved by the means of induction. So can we define well-order on [math]\left\{z\in\textbf{C}: 0<\Re(z)<\frac{1}{2}\right\}[/math] and prove Riemann hypothesis inductively?

>> No.8970832

>>8970823

No and no

Show me an inductive construction of the set of real numbers

>> No.8970853

>>8970832
https://en.wikipedia.org/wiki/Transfinite_induction

OPs description of a proof works at a very high abstract level. But the details are surely impossible.

A well ordering of that set isn't going to be anything friendly for an inductive proof.

>> No.8971256

>>8970832
>disproving well-ordering theorem with just one word

>> No.8971260

>>8970853
Vitali set is constructed using transfinite incuction and well-ordering of reals, so it's clearly not impossible

>> No.8971507

>>8970823
(0,1) is a subset of R with no least element.
R is not well-ordered.

>> No.8971512

>>8971507
>For every set X, there exists a well-ordering with domain X.
https://en.wikipedia.org/wiki/Well-ordering_theorem
(R, [math]\leq[/math]) is not well-ordered, but there exist well-ordering of R