Moderators: gmalivuk, Moderators General, Prelates
I stated that a "real number" is any number that can be used in a mathematical equation that makes sense
LE4dGOLEM wrote:Thus, infinity is not a "proper" number, because it cannot be used in a "proper" maths equation - it is not subject to the normal laws of + - / and *.
el sjaako wrote:A defenition that is close to or equivilent to what token said is that every real number is a limit of some series of rational numbers. For example, pi is the limit of a series that starts with 3, then 31/10, then 314/100, then 3141/1000, and so on (aka 3,3.1,3.14,3.141).
Token wrote:I think what you are thinking of is the Fundamental Axiom of Analysis - that every non-decreasing sequence with an upper bound has a real limit - which is, as you say, equivalent to the Least Upper Bound axiom.
Looking more closely at what you wrote there that is basicly what I'm saying, but I didn't know it was an axiom, much less a fundamental one.
Token wrote:Looking more closely at what you wrote there that is basicly what I'm saying, but I didn't know it was an axiom, much less a fundamental one.
Fundamental in the sense that without it (or an equivalent axiom), pretty much all of Analysis after about the second lecture of the most basic course would go out the window.
tetoru wrote:Token wrote:Looking more closely at what you wrote there that is basicly what I'm saying, but I didn't know it was an axiom, much less a fundamental one.
Fundamental in the sense that without it (or an equivalent axiom), pretty much all of Analysis after about the second lecture of the most basic course would go out the window.
It's only necessary if you define the reals as a (the) complete ordered field (which I personally think defeats the main point of Analysis, which is mathematical rigor.) If you construct them as Dedekind cuts or equivalence classes of Cauchy sequences then the least upper bound property (and equivalents) aren't axioms but theorems.
Yakk wrote:The problem with using axioms to define the real numbers is you hit Godel right in the face.
You cannot restrict the models your axioms describe to a single thing with a single set of properties. There are multiple different models which are described by any set of axioms of the real numbers that have different properties.
You can, however, restrict the type of thing that is a real number line using axioms.
Alky wrote:Formal definition:
http://en.wikipedia.org/wiki/Real_number
Layman's definition:
Any sequence of digits, with potentially infinite digits after the '.' but a finite amount before it, is a real number. Why the hell would they think 1 isn't a number? What number do you subtract from three to get two?
tetoru wrote:Yakk wrote:The problem with using axioms to define the real numbers is you hit Godel right in the face.
You cannot restrict the models your axioms describe to a single thing with a single set of properties. There are multiple different models which are described by any set of axioms of the real numbers that have different properties.
You can, however, restrict the type of thing that is a real number line using axioms. :)
Sorta. You can't categorically define the reals using first-order axioms, but you can using second-order logic. And even if you construct the reals in first-order ZFC, well, by Lowenheim-Skolem there are still countable models of ZFC, so this doesn't help you any: you can still get a countable uncountable set of reals out of the process. (Think about that for a while if you really want your brain to bleed.)
skeptical scientist wrote:Alky wrote:Formal definition:
http://en.wikipedia.org/wiki/Real_number
Layman's definition:
Any sequence of digits, with potentially infinite digits after the '.' but a finite amount before it, is a real number. Why the hell would they think 1 isn't a number? What number do you subtract from three to get two?
So 0.999... and 1 are different as real numbers because they are different as sequences of digits?
skeptical scientist wrote:Yeah, but don't constructions have the same problem? After all, the collection of dedekind cuts depends on your model. They're provably the same up to isomorphism anyways.
Yakk wrote:skeptical scientist wrote:Yeah, but don't constructions have the same problem? After all, the collection of dedekind cuts depends on your model. They're provably the same up to isomorphism anyways.
No, there are statements in some models of (second order logic) or (the real numbers) that are true, yet are false in a different model, as far as I know.
Take the godel-statement S for a theory T. Let U := T & S, and V := T & ~S.
Then U has a statement that is true that is false in V, namely S. Both are as consistent as the original theory T. And both are examples of models of T.
I am not sure what you mean by isomorphism, when one theory has an additional number G within a theory of the natural numbers that the other one lacks. Are you saying that the real numbers defined by the two distinct second-order logics are isomorphic across logics, provably?
tendays wrote:Guys, read the OP - he isn't asking for a definition of a real number, but the definition of a "real" number. <- quotes.
He could have said an "actual" number to mean more or less the same, I guess. As opposed to "nonsensical", maybe.
His wording is not very clear to me, but doesn't outright exclude i, for instance. Because he talks about "numbers" (And not "element of an algebraically closed field" or whatever) I'd be tempted to say the complex numbers. (which is, for me, precisely the set of things that can be qualified as "numbers")
But then he talks about problems to describe pi.
So maybe we need to limit ourselves to "the smallest algebraically closed extension of the natural numbers", i.e. the algebraic numbers.
LE4d, give us more precise requirements?
skeptical scientist wrote:Yakk wrote:skeptical scientist wrote:Yeah, but don't constructions have the same problem? After all, the collection of dedekind cuts depends on your model. They're provably the same up to isomorphism anyways.
No, there are statements in some models of (second order logic) or (the real numbers) that are true, yet are false in a different model, as far as I know.
This is only true of incomplete theories. If you have a complete theory, every statement (in the language) that is true in one model will be true in every other model. But the models themselves will be different.
Take the godel-statement S for a theory T. Let U := T & S, and V := T & ~S.
Then U has a statement that is true that is false in V, namely S. Both are as consistent as the original theory T. And both are examples of models of T.
Well, they are not themselves models, but they have models which are also models of T. But the only reason this works is because your original theory was incomplete.
I am not sure what you mean by isomorphism, when one theory has an additional number G within a theory of the natural numbers that the other one lacks. Are you saying that the real numbers defined by the two distinct second-order logics are isomorphic across logics, provably?
No, I mean that you can prove in a theory T that all objects satisfying some requirements are isomorphic. Then in any model of T, if X and Y are objects satisfying the same requirements, X and Y will be isomorphic. However, if M and M' are different models of T, and X and X' are objects of the models M and M' which satisfy the requirements, we may have that M and M' are not isomorphic from our outside perspective. For example, let T be the theory of natural numbers with set variables, and let A and B be two sets such that 0 is in both A and B, and if n is in A or B, n+1 is as well. Then A and B will be provably equal, by a simple induction argument.
However, there are secretly nonstandard models of the natural numbers, and in these models there are sets that look just like A and B as far as the theory is concerned, but are not the natural numbers as far as we're concerned with our outside perspective.
In particular, I meant that you can prove that any ordered archimedean field with the lub property is isomorphic to the reals, so you get the same object up to isomorphism (in your theory) by letting R be the unique such object, or by constructing it with dedekind cuts. But what you get still depends on your model.
Yakk wrote:There are no complete logic models that can model the reals, however. Well, there are, but they are inconsistent (and you can prove everything) and/or you cannot tell if something is proven or not (which makes calling it "logic" a bit of a stretch).
Take the godel-statement S for a theory T. Let U := T & S, and V := T & ~S.
Then U has a statement that is true that is false in V, namely S. Both are as consistent as the original theory T. And both are examples of models of T.
Well, they are not themselves models, but they have models which are also models of T. But the only reason this works is because your original theory was incomplete.
Sure sure. But if you have a theoretical framework describing an axiomitization of the reals, your theoretical framework is guaranteed to be incomplete. Right?
However, there are secretly nonstandard models of the natural numbers, and in these models there are sets that look just like A and B as far as the theory is concerned, but are not the natural numbers as far as we're concerned with our outside perspective.
That I don't get. How are they not natural numbers?
Or, more accurately, why do you say they are not natural numbers?
What are these "natural numbers with addition and multiplication" you are talking about -- if there is no way to describe their properties precicely enough to distinguish them from things you aren't talking about?
Whew. I think that works. Less certain now that I wrote it all down. And I've got a headache!
adlaiff6 wrote:The product of the binary interpretation of any string in {'.'}o{0,1}* and 2 to any integer power.
skeptical scientist wrote:1) What the hell is a binary interpretation anyways?
skeptical scientist wrote:2) Apparently all real numbers are non-negative
skeptical scientist wrote:Also, I thought {0,1}* was the set of finite strings of 0s and 1s, and if you wanted infinite strings you denoted it as {0,1}^N or {0,1}^ω.
I'm not.skeptical scientist wrote:Actually, if you're a set theorist
skeptical scientist wrote:, a real number is a set whose elements are all of the form {{{a},{a,b}}:{{a},{a,b}}~{{c},{c,d}}} (an equivalence class of "ordered pairs" interpreted as representing products of natural numbers with their formal inverses) where b is a set of the form {{}}, {{},{{}}}, {{{}}, {{},{{}}}} etc. (a "natural number" which is not {}) and a is a set of the form {{s},{s,a'}} (an "integer") where s is either 0 or 1 (interpreted as showing the sign of a) and a' is a natural number. Needless to say, verifying that 1*1=1 could be extremely time consuming with these definitions, which is why I usually advise forgetting the whole thing.
In other words, a real number is an infinite set consisting of infinite sets of two element sets, whose elements are themselves finite sets of sets of sets of sets, many of which are empty.
3.14159265... wrote:What about quantization? we DO live in a integer world?
crp wrote:oh, i thought you meant the entire funtion was f(n) = (-1)^n
i's like girls u crazy
adlaiff6 wrote:skeptical scientist wrote:1) What the hell is a binary interpretation anyways?
I'll let you know once they invent computers.
skeptical scientist wrote:adlaiff6 wrote:skeptical scientist wrote:1) What the hell is a binary interpretation anyways?
I'll let you know once they invent computers.
Something that purports to be a definition had better, y'know, define stuff. Assuming I know what a binary interpretation is just because I live in a world with computers is silly; even if I know what a binary integer like 101001 is, how the hell am I supposed to interpret an infinite decimal like .001011101001... or worse .0011111... if you don't tell me how?
3.14159265... wrote:What about quantization? we DO live in a integer world?
crp wrote:oh, i thought you meant the entire funtion was f(n) = (-1)^n
i's like girls u crazy
adlaiff6 wrote:skeptical scientist wrote:adlaiff6 wrote:skeptical scientist wrote:1) What the hell is a binary interpretation anyways?
I'll let you know once they invent computers.
Something that purports to be a definition had better, y'know, define stuff. Assuming I know what a binary interpretation is just because I live in a world with computers is silly; even if I know what a binary integer like 101001 is, how the hell am I supposed to interpret an infinite decimal like .001011101001... or worse .0011111... if you don't tell me how?
It's pretty much the same way you interpret decimal.
3.14159265... wrote:What about quantization? we DO live in a integer world?
crp wrote:oh, i thought you meant the entire funtion was f(n) = (-1)^n
i's like girls u crazy
Users browsing this forum: No registered users and 5 guests