ddt
Mafia Penguin
In a later post you said A is a class, not a rule. Now I'm confused. What is it? And when you say class, do you mean class in the NBG axiomatization of set theory?Let A be a rule
Let S be a non-finite collection of objects that obeys A.
So S is countable? Why not just write 1, 2, 3, 4, ...?An example:
S={a,b,c,d,e,f,g,…}
Functions are not ordered, so there is not order.There is a bijection from S to itself (order is not important) for example:
Okay.Code:a <--> b b <--> g c <--> a d <--> d e <--> c f <--> f …
That's a contradiction - there either is, or there is not a bijection of S to itself. "tertium non datur" - the law of the excluded middle. We're doing classical logic here, right? Or are you an intuitionist? Sorry, I forgot that until yesterday, you hadn't read a bit about existing logic theories from real mathematicians.Also we can show that there is no bijection between S to itself (order is not important) for example:
No, there are infinitely many bijections of S to itself. You start with one bijection; let's call it f. Then when you swap the values f maps two elements, say, a and b, to, you have another bijection - that differs from f. As you can find infinitely many pairs of members a and b from S, you can do the swap trick in infinitely many ways. That all these bijections differ from each other is straightforward and left as an exercise to the reader.Code:a <--> b <--> g b <--> a <--> d c <--> c <--> f …
There are infinitely many maps from S to itself that are not a bijection, and a one case (again, order in not important) of a bijection between S to itself.
No it isn't. Standard Math does study bijections because they are special - they have extra properties so you can derive more theorems about them than about ordinary functions.Why only this self mapping bijection case is considered by Standard Mathematics?
As an example of a non-bijection that is considered by math, let me introduce you to a concept of your favourite mathematician Hilbert.
Hilbert had a special hotel (the Hilbert Hotel) with a (countably) infinite number of rooms - numbered 1, 2, 3, 4, ... Hilbert also operated special buses with infinitely many seats. One day, the Hilbert Hotel was full of guests, and then a full Hilbert bus arrived. Now how to accommodate those newly arrived guests?
Hilbert re-allocated all existing guests to other rooms. The guest in room #1 had to move to #2, the guest in room #2 to room #4, etc.: every guest moved to the room with the double number of his/her original room. So, after that, all odd-numbered rooms were free for the new guests from the bus.
The re-allocation function (the mapping from old room # to new room #) is clearly a non-bijective function.
Last edited: