• Re: More complex numbers than reals?

    From Ben Bacarisse@21:1/5 to Chris M. Thomasson on Tue Jul 9 13:37:33 2024
    "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> writes:

    Are there "more" complex numbers than reals? It seems so, every real has
    its y, or imaginary, component set to zero. Therefore for each real there
    is an infinity of infinite embedding's for it wrt any real with a non-zero
    y axis? Fair enough, or really dumb? A little stupid? What do you think?

    You quite correctly put "more" in scare quote because it's not clear, at
    first glance, what it means in cases like this.

    A mathematician, to whom this is a whole new topic, would start by
    asking you what you mean by "more". Without that, they could not
    possibly answer you. So, what do you mean by "more" when applied to
    sets like C and R?

    (Obviously, some mathematicians have already come up with a meaning that
    is of use to them, but I want to see if you are interesting in thinking mathematically or whether you just want "the answer".)

    --
    Ben.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Jim Burns@21:1/5 to Chris M. Thomasson on Tue Jul 9 12:25:00 2024
    On 7/9/2024 1:24 AM, Chris M. Thomasson wrote:

    Are there "more" complex numbers than reals?
    It seems so,
    every real has its y, or imaginary, component
    set to zero.
    Therefore
    for each real
    there is an infinity of infinite embedding's
    for it wrt any real with a non-zero y axis?
    Fair enough, or really dumb?
    A little stupid?
    What do you think?

    Not stupid, but also not correct.

    Galileo asked a similar question. https://en.wikipedia.org/wiki/Galileo%27s_paradox

    The natural numbers can be mapped 1.to.1 to
    the natural.number squares.
    In an obvious way.
    There is room for all the numbers in the squares.
    Thus, there are at least as many squares as numbers.
    There aren't more squares than numbers; they fit.

    But there are "more" numbers than squares.
    Also obviously.

    Galileo's resolution was to stop asking that question.

    Less obviously,
    there are 1.to.1 maps from the complex plane
    to the real line,
    and not more plane than line.
    And also "more" plane than line.

    Here's a handwave of one way to do that.
    I'm sure there are loose threads dangling,
    but I'm also sure they can be tucked in.

    Define the stretch.operator 🗚x which interleaves 0s
    with the decimal digits of real number x
    For x = x₀.x₁x₂x₃...
    🗚x = x₀.0x₁0x₂0x₃0...

    x+iy ⟼ 10⋅🗚x+🗚y = x₀y₀.x₁y₁x₂y₂x₃y₃...

    There isn't "more" plane than line. Not.obviously.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Tue Jul 9 16:40:59 2024
    Le 09/07/2024 à 14:37, Ben Bacarisse a écrit :

    A mathematician, to whom this is a whole new topic, would start by
    asking you what you mean by "more". Without that, they could not
    possibly answer you.

    Good mathematicians could.

    So, what do you mean by "more" when applied to
    sets like C and R?

    Proper subsets have less elements than their supersets.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Ben Bacarisse@21:1/5 to wolfgang.mueckenheim@tha.de on Tue Jul 9 18:30:36 2024
    WM <wolfgang.mueckenheim@tha.de> writes:

    Le 09/07/2024 14:37, Ben Bacarisse a crit :

    A mathematician, to whom this is a whole new topic, would start by
    asking you what you mean by "more". Without that, they could not
    possibly answer you.

    Good mathematicians could.

    So, what do you mean by "more" when applied to
    sets like C and R?

    Proper subsets have less elements than their supersets.

    Let's see if Chris is using that definition. I think he's cleverer than
    you so he will probably want to be able to say that {1,2,3} has "more"
    elements than {4,5}.

    --
    Ben.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Alan Mackenzie@21:1/5 to FromTheRafters on Tue Jul 9 18:23:44 2024
    FromTheRafters <FTR@nomail.afraid.org> wrote:

    In a sense there are 'more' since the reals are all on the x axis line
    whereas the 2D R x R space is filled with complex numbers. R is
    contained in C. In another sense they are the same size set, C being
    basically R by R in the same sense as Q being Z by Z).

    Are there any other sizes of sets between countable Q and uncountable
    R?

    That is the Continuum Hypothesis, that asserts there are none. It has
    been shown that neither CH nor its negation can be proven in ZFC. (But
    don't ask me for the proof!)

    How about between uncountable R and uncountable C?

    These sets have the same cardinality, so no.

    --
    Alan Mackenzie (Nuremberg, Germany).

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From sobriquet@21:1/5 to All on Tue Jul 9 21:38:19 2024
    Op 09/07/2024 om 07:24 schreef Chris M. Thomasson:
    Are there "more" complex numbers than reals? It seems so, every real has
    its y, or imaginary, component set to zero. Therefore for each real
    there is an infinity of infinite embedding's for it wrt any real with a non-zero y axis? Fair enough, or really dumb? A little stupid? What do
    you think?

    How can you compare them if they are not even in the same dimension?
    It seems that instead of comparing the real number line to the complex
    plane (or the Cartesian plane for that matter), you might as well
    compare a unit of length to a square unit of area.
    Numerically they might be the same, but they are not identical, because
    a line has no area, so a unit of length 1 has an area of 0 units squared.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Stefan Ram@21:1/5 to sobriquet on Tue Jul 9 20:09:56 2024
    sobriquet <dohduhdah@yahoo.com> wrote or quoted:
    How can you compare them if they are not even in the same dimension?

    It's not about comparing the elements in the sets, but just about
    comparing the cardinality (size) of one set with the cardinality of
    the other set. Therefore it is not a problem that we cannot compare
    an element of the one set with an element of the other set.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From sobriquet@21:1/5 to All on Tue Jul 9 22:27:23 2024
    Op 09/07/2024 om 22:05 schreef Chris M. Thomasson:
    On 7/9/2024 12:38 PM, sobriquet wrote:
    Op 09/07/2024 om 07:24 schreef Chris M. Thomasson:
    Are there "more" complex numbers than reals? It seems so, every real
    has its y, or imaginary, component set to zero. Therefore for each
    real there is an infinity of infinite embedding's for it wrt any real
    with a non-zero y axis? Fair enough, or really dumb? A little stupid?
    What do you think?

    How can you compare them if they are not even in the same dimension?
    It seems that instead of comparing the real number line to the complex
    plane (or the Cartesian plane for that matter), you might as well
    compare a unit of length to a square unit of area.
    Numerically they might be the same, but they are not identical, because
    a line has no area, so a unit of length 1 has an area of 0 units squared.

    Are the complex numbers just as infinitely dense as the reals are? Or
    are there somehow "more" of them wrt the density of the reals vs, say,
    the rationals and/or the naturals? Is the "density" of an uncountable infinity the same for every uncountable infinity? The density of the
    complex numbers and the reals is the same?

    How do you define sets exactly?
    Is there a specific set that corresponds to sqrt(2)?
    Does this set have an infinite number of elements analogous to the
    sqrt(2) having an infinite decimal expansion?

    It seems that the existence of something like sqrt(2) is already rather dubious.
    In reality, things are finite and space and time might also be finite
    (composed of atoms of space and time that can't be subdivided with
    the parts retaining their original spatial and temporal properties).
    So if the concept of irrational numbers like sqrt(2) turns out to be
    nonsense, that means the concept of the number line is nonsense likewise
    and we don't even need to consider higher dimensional nonsense.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From sobriquet@21:1/5 to All on Tue Jul 9 22:51:46 2024
    Op 09/07/2024 om 22:33 schreef Chris M. Thomasson:
    On 7/9/2024 1:29 PM, Chris M. Thomasson wrote:
    On 7/9/2024 1:27 PM, sobriquet wrote:
    Op 09/07/2024 om 22:05 schreef Chris M. Thomasson:
    On 7/9/2024 12:38 PM, sobriquet wrote:
    Op 09/07/2024 om 07:24 schreef Chris M. Thomasson:
    Are there "more" complex numbers than reals? It seems so, every
    real has its y, or imaginary, component set to zero. Therefore for >>>>>> each real there is an infinity of infinite embedding's for it wrt
    any real with a non-zero y axis? Fair enough, or really dumb? A
    little stupid? What do you think?

    How can you compare them if they are not even in the same dimension? >>>>> It seems that instead of comparing the real number line to the
    complex plane (or the Cartesian plane for that matter), you might
    as well compare a unit of length to a square unit of area.
    Numerically they might be the same, but they are not identical,
    because
    a line has no area, so a unit of length 1 has an area of 0 units
    squared.

    Are the complex numbers just as infinitely dense as the reals are?
    Or are there somehow "more" of them wrt the density of the reals vs,
    say, the rationals and/or the naturals? Is the "density" of an
    uncountable infinity the same for every uncountable infinity? The
    density of the complex numbers and the reals is the same?

    How do you define sets exactly?
    Is there a specific set that corresponds to sqrt(2)?
    Does this set have an infinite number of elements analogous to the
    sqrt(2) having an infinite decimal expansion?

    It seems that the existence of something like sqrt(2) is already
    rather dubious.
    In reality, things are finite and space and time might also be finite
    (composed of atoms of space and time that can't be subdivided with
    the parts retaining their original spatial and temporal properties).
    So if the concept of irrational numbers like sqrt(2) turns out to be
    nonsense, that means the concept of the number line is nonsense
    likewise and we don't even need to consider higher dimensional nonsense. >>>


    Wrt the sqrt of two. Well, every square already has it in its
    diagonals, right?

    The sqrt of 2 can scale to any square. Right?

    Either spacetime is continuous or it's not. So far it seems things
    usually are not continuous (stuff like energy and space can't be
    subdivided indefinitely). So it seems reasonable to assume that the
    concept of continuity is nonsense.

    If spacetime is not continuous, what basis do we have to the concept of continuity?

    You seem to maintain that numbers reside in a special magical realm
    where we can take a number and we can split it into two smaller numbers
    and we can do that without any limitations and that begs the question
    how we are supposed to represent these numbers if the number of digits
    gets so large that it exceeds way beyond the number of elementary
    particles in the universe.

    Are we talking about some sort of simulation of the multiverse here
    where we don't run into such issues?

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Alan Mackenzie@21:1/5 to sobriquet on Tue Jul 9 21:33:07 2024
    sobriquet <dohduhdah@yahoo.com> wrote:
    Op 09/07/2024 om 22:05 schreef Chris M. Thomasson:
    On 7/9/2024 12:38 PM, sobriquet wrote:
    Op 09/07/2024 om 07:24 schreef Chris M. Thomasson:
    Are there "more" complex numbers than reals? It seems so, every real
    has its y, or imaginary, component set to zero. Therefore for each
    real there is an infinity of infinite embedding's for it wrt any real
    with a non-zero y axis? Fair enough, or really dumb? A little stupid?
    What do you think?

    How can you compare them if they are not even in the same dimension?
    It seems that instead of comparing the real number line to the complex
    plane (or the Cartesian plane for that matter), you might as well
    compare a unit of length to a square unit of area.
    Numerically they might be the same, but they are not identical, because
    a line has no area, so a unit of length 1 has an area of 0 units squared.

    Are the complex numbers just as infinitely dense as the reals are? Or
    are there somehow "more" of them wrt the density of the reals vs, say,
    the rationals and/or the naturals? Is the "density" of an uncountable
    infinity the same for every uncountable infinity? The density of the
    complex numbers and the reals is the same?

    How do you define sets exactly?

    By the axioms of set theory.

    Is there a specific set that corresponds to sqrt(2)?

    There exists a Dedekind cut of the set of rational numbers which is
    sqrt(2).

    Does this set have an infinite number of elements analogous to the
    sqrt(2) having an infinite decimal expansion?

    No. There is no such analogy. The infinite decimal expansion is
    entirely irrelevant.

    It seems that the existence of something like sqrt(2) is already rather dubious.

    Not at all. You remind me of John Gabriel, who continually asserted the non-existence of mathematical entities, without being able to say what he
    meant by this non-existence. The real number sqrt(2) exists by the
    axioms of set theory and real numbers.

    In reality, things are finite and space and time might also be finite (composed of atoms of space and time that can't be subdivided with
    the parts retaining their original spatial and temporal properties).

    So if the concept of irrational numbers like sqrt(2) turns out to be nonsense, ....

    You're several hundred years too late for that debate. The concept of irrational numbers is fully formed, without known inconsistency.

    .... that means the concept of the number line is nonsense likewise and
    we don't even need to consider higher dimensional nonsense.

    The number line isn't nonsense. You're in danger of aligning yourself
    with this newsgroup's cranks, past and present.

    --
    Alan Mackenzie (Nuremberg, Germany).

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From sobriquet@21:1/5 to All on Tue Jul 9 23:45:59 2024
    Op 09/07/2024 om 23:33 schreef Alan Mackenzie:
    sobriquet <dohduhdah@yahoo.com> wrote:
    Op 09/07/2024 om 22:05 schreef Chris M. Thomasson:
    On 7/9/2024 12:38 PM, sobriquet wrote:
    Op 09/07/2024 om 07:24 schreef Chris M. Thomasson:
    Are there "more" complex numbers than reals? It seems so, every real >>>>> has its y, or imaginary, component set to zero. Therefore for each
    real there is an infinity of infinite embedding's for it wrt any real >>>>> with a non-zero y axis? Fair enough, or really dumb? A little stupid? >>>>> What do you think?

    How can you compare them if they are not even in the same dimension?
    It seems that instead of comparing the real number line to the complex >>>> plane (or the Cartesian plane for that matter), you might as well
    compare a unit of length to a square unit of area.
    Numerically they might be the same, but they are not identical, because >>>> a line has no area, so a unit of length 1 has an area of 0 units squared.

    Are the complex numbers just as infinitely dense as the reals are? Or
    are there somehow "more" of them wrt the density of the reals vs, say,
    the rationals and/or the naturals? Is the "density" of an uncountable
    infinity the same for every uncountable infinity? The density of the
    complex numbers and the reals is the same?

    How do you define sets exactly?

    By the axioms of set theory.

    Is there a specific set that corresponds to sqrt(2)?

    There exists a Dedekind cut of the set of rational numbers which is
    sqrt(2).

    Does this set have an infinite number of elements analogous to the
    sqrt(2) having an infinite decimal expansion?

    No. There is no such analogy. The infinite decimal expansion is
    entirely irrelevant.

    It seems that the existence of something like sqrt(2) is already rather
    dubious.

    Not at all. You remind me of John Gabriel, who continually asserted the non-existence of mathematical entities, without being able to say what he meant by this non-existence. The real number sqrt(2) exists by the
    axioms of set theory and real numbers.

    In reality, things are finite and space and time might also be finite
    (composed of atoms of space and time that can't be subdivided with
    the parts retaining their original spatial and temporal properties).

    So if the concept of irrational numbers like sqrt(2) turns out to be
    nonsense, ....

    You're several hundred years too late for that debate. The concept of irrational numbers is fully formed, without known inconsistency.

    .... that means the concept of the number line is nonsense likewise and
    we don't even need to consider higher dimensional nonsense.

    The number line isn't nonsense. You're in danger of aligning yourself
    with this newsgroup's cranks, past and present.


    So basically what you're saying is that reality is irrelevant with
    respect to the concepts in the mathematical realm?
    Can we really expect a concept of continuity to exist in the
    mathematical realm even if it turns out that we find solid evidence for
    the claim that everything in the empirical realm (energy, matter, time,
    space, information) turns out to be discrete?

    Are you saying N J Wildberger is a crank? https://www.youtube.com/watch?v=jlnBo3APRlU

    I'm not a mathematician myself, but I'm interested in science and math
    and the arguments given by N J Wildberger seem reasonable.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Wed Jul 10 00:05:25 2024
    Am 09.07.2024 um 23:45 schrieb sobriquet:

    So basically what you're saying is that reality is irrelevant with
    respect to the concepts in the mathematical realm?

    I would't say "irrelevant". But let's not open that can of wurms. :-P

    But you question here is right to the point, I'd say:

    Can we really expect a concept of continuity to exist in the
    mathematical realm even if it turns out that we find solid evidence for
    the claim that everything in the empirical realm (energy, matter, time, space, information) turns out to be discrete?

    Yes. After all this /concept/ exists in math and it DOES work (->Analysis).

    Actually, it's rather helpful in physics (even if it only might just be
    an "approximation".)

    Are you saying N J Wildberger is a crank?

    Yes. (Though he is a quite capable mathematian too _IN HIS FIELD_!)

    I'm not a mathematician myself, but I'm interested in science and math
    and the arguments given by N J Wildberger seem reasonable.

    Well, if you say so.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Wed Jul 10 00:16:34 2024
    Am 09.07.2024 um 22:27 schrieb sobriquet:

    How do you define sets exactly?

    Actually, we don't _define_ the concept of /set/ by a "proper definition".

    Is there a specific set that corresponds to sqrt(2)?

    Well, rather a sequence (which is a certain kind of set in the context
    of set theory):

    (1, 1.4, 1.41, 1.414, ...)

    Does this set have an infinite number of elements analogous to the
    sqrt(2) having an infinite decimal expansion?

    Yes. See above. This sequence (called an /infinite sequence/) has
    infinitely many terms.

    It seems that the existence of something like sqrt(2) is already rather dubious.

    Oh, really?

    If you say so.

    So in your "math" there is no /number/ x such that x^2 = 2.

    Ok, if you can live with(out) that, fine.

    In reality, things are finite and space and time might also be finite (composed of atoms of space and time that can't be subdivided with
    the parts retaining their original spatial and temporal properties).

    Yes, they could.

    So if the concept of irrational numbers like sqrt(2) [etc.]

    Hint (1): You won't find numbers like sqrt(2) IN (PHYSICAL) REALITY.

    Hint (2): You won't find numbers like 1, 2, 3 there neither/either (?).

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Alan Mackenzie@21:1/5 to sobriquet on Tue Jul 9 22:20:00 2024
    sobriquet <dohduhdah@yahoo.com> wrote:
    Op 09/07/2024 om 23:33 schreef Alan Mackenzie:
    sobriquet <dohduhdah@yahoo.com> wrote:
    Op 09/07/2024 om 22:05 schreef Chris M. Thomasson:
    On 7/9/2024 12:38 PM, sobriquet wrote:
    Op 09/07/2024 om 07:24 schreef Chris M. Thomasson:
    Are there "more" complex numbers than reals? It seems so, every real >>>>>> has its y, or imaginary, component set to zero. Therefore for each >>>>>> real there is an infinity of infinite embedding's for it wrt any real >>>>>> with a non-zero y axis? Fair enough, or really dumb? A little stupid? >>>>>> What do you think?

    How can you compare them if they are not even in the same
    dimension? It seems that instead of comparing the real number line
    to the complex plane (or the Cartesian plane for that matter), you
    might as well compare a unit of length to a square unit of area.
    Numerically they might be the same, but they are not identical,
    because a line has no area, so a unit of length 1 has an area of 0
    units squared.

    Are the complex numbers just as infinitely dense as the reals are? Or
    are there somehow "more" of them wrt the density of the reals vs, say, >>>> the rationals and/or the naturals? Is the "density" of an uncountable
    infinity the same for every uncountable infinity? The density of the
    complex numbers and the reals is the same?

    How do you define sets exactly?

    By the axioms of set theory.

    Is there a specific set that corresponds to sqrt(2)?

    There exists a Dedekind cut of the set of rational numbers which is
    sqrt(2).

    Does this set have an infinite number of elements analogous to the
    sqrt(2) having an infinite decimal expansion?

    No. There is no such analogy. The infinite decimal expansion is
    entirely irrelevant.

    It seems that the existence of something like sqrt(2) is already rather
    dubious.

    Not at all. You remind me of John Gabriel, who continually asserted the
    non-existence of mathematical entities, without being able to say what he
    meant by this non-existence. The real number sqrt(2) exists by the
    axioms of set theory and real numbers.

    In reality, things are finite and space and time might also be finite
    (composed of atoms of space and time that can't be subdivided with
    the parts retaining their original spatial and temporal properties).

    So if the concept of irrational numbers like sqrt(2) turns out to be
    nonsense, ....

    You're several hundred years too late for that debate. The concept of
    irrational numbers is fully formed, without known inconsistency.

    .... that means the concept of the number line is nonsense likewise and
    we don't even need to consider higher dimensional nonsense.

    The number line isn't nonsense. You're in danger of aligning yourself
    with this newsgroup's cranks, past and present.


    So basically what you're saying is that reality is irrelevant with
    respect to the concepts in the mathematical realm?

    The concepts in the mathematical realm are an integral part of reality.

    Can we really expect a concept of continuity to exist in the
    mathematical realm even if it turns out that we find solid evidence for
    the claim that everything in the empirical realm (energy, matter, time, space, information) turns out to be discrete?

    Yes. Just as we have 2 + 2 = 4 (in the abstract) we have continuity
    (again, in the abstract). There's a well developed theory of continuity lacking any inconsistency, so far as people are aware.

    Are you saying N J Wildberger is a crank? https://www.youtube.com/watch?v=jlnBo3APRlU

    No, I'm not familiar with the said lady/gentleman. I don't have access
    to youtube.

    I'm not a mathematician myself, but I'm interested in science and math
    and the arguments given by N J Wildberger seem reasonable.

    OK, that's fair enough. I have a degree in maths, although I'm not
    otherwise a mathematician. Sometimes it needs to be said that the
    mathematical basics are firmly established as being true, and are not at
    all a matter of opinion. Just like Newton's laws of motion or the
    roundness of the Earth or the Theory of Special Relativity are no longer matters of opinion.

    --
    Alan Mackenzie (Nuremberg, Germany).

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Wed Jul 10 00:33:21 2024
    Am 09.07.2024 um 21:08 schrieb Chris M. Thomasson:

    Seems to boil down to:

    Is uncountable infinity the same "size", as any other uncountable
    infinity? Say reals vs. complex numbers...

    Nope.

    IR and Q do have the same "size", since card(IR) = card(Q).

    But there are "larger infinities" than just card(IR) = card(Q) = c.
    (There’s a whole hierarchy of them, in fact.)

    For example, P(IR) (i.e. {X: X c IR}.

    See: https://en.wikipedia.org/wiki/Aleph_number

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Wed Jul 10 00:35:47 2024
    Am 09.07.2024 um 21:08 schrieb Chris M. Thomasson:

    Corrected:

    Seems to boil down to:

    Is uncountable infinity the same "size", as any other uncountable
    infinity? Say reals vs. complex numbers...

    Nope.

    IR and C do have the same "size", since card(IR) = card(C).

    But there are "larger infinities" than just card(IR) = card(C) = c.
    (There’s a whole hierarchy of them, in fact.)

    For example, P(IR) (i.e. {X: X c IR}.

    See: https://en.wikipedia.org/wiki/Aleph_number

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From sobriquet@21:1/5 to All on Wed Jul 10 01:44:10 2024
    Op 10/07/2024 om 00:20 schreef Alan Mackenzie:
    sobriquet <dohduhdah@yahoo.com> wrote:
    Op 09/07/2024 om 23:33 schreef Alan Mackenzie:
    sobriquet <dohduhdah@yahoo.com> wrote:
    Op 09/07/2024 om 22:05 schreef Chris M. Thomasson:
    On 7/9/2024 12:38 PM, sobriquet wrote:
    Op 09/07/2024 om 07:24 schreef Chris M. Thomasson:
    Are there "more" complex numbers than reals? It seems so, every real >>>>>>> has its y, or imaginary, component set to zero. Therefore for each >>>>>>> real there is an infinity of infinite embedding's for it wrt any real >>>>>>> with a non-zero y axis? Fair enough, or really dumb? A little stupid? >>>>>>> What do you think?

    How can you compare them if they are not even in the same
    dimension? It seems that instead of comparing the real number line >>>>>> to the complex plane (or the Cartesian plane for that matter), you >>>>>> might as well compare a unit of length to a square unit of area.
    Numerically they might be the same, but they are not identical,
    because a line has no area, so a unit of length 1 has an area of 0 >>>>>> units squared.

    Are the complex numbers just as infinitely dense as the reals are? Or >>>>> are there somehow "more" of them wrt the density of the reals vs, say, >>>>> the rationals and/or the naturals? Is the "density" of an uncountable >>>>> infinity the same for every uncountable infinity? The density of the >>>>> complex numbers and the reals is the same?

    How do you define sets exactly?

    By the axioms of set theory.

    Is there a specific set that corresponds to sqrt(2)?

    There exists a Dedekind cut of the set of rational numbers which is
    sqrt(2).

    Does this set have an infinite number of elements analogous to the
    sqrt(2) having an infinite decimal expansion?

    No. There is no such analogy. The infinite decimal expansion is
    entirely irrelevant.

    It seems that the existence of something like sqrt(2) is already rather >>>> dubious.

    Not at all. You remind me of John Gabriel, who continually asserted the >>> non-existence of mathematical entities, without being able to say what he >>> meant by this non-existence. The real number sqrt(2) exists by the
    axioms of set theory and real numbers.

    In reality, things are finite and space and time might also be finite
    (composed of atoms of space and time that can't be subdivided with
    the parts retaining their original spatial and temporal properties).

    So if the concept of irrational numbers like sqrt(2) turns out to be
    nonsense, ....

    You're several hundred years too late for that debate. The concept of
    irrational numbers is fully formed, without known inconsistency.

    .... that means the concept of the number line is nonsense likewise and >>>> we don't even need to consider higher dimensional nonsense.

    The number line isn't nonsense. You're in danger of aligning yourself
    with this newsgroup's cranks, past and present.


    So basically what you're saying is that reality is irrelevant with
    respect to the concepts in the mathematical realm?

    The concepts in the mathematical realm are an integral part of reality.

    Can we really expect a concept of continuity to exist in the
    mathematical realm even if it turns out that we find solid evidence for
    the claim that everything in the empirical realm (energy, matter, time,
    space, information) turns out to be discrete?

    Yes. Just as we have 2 + 2 = 4 (in the abstract) we have continuity
    (again, in the abstract). There's a well developed theory of continuity lacking any inconsistency, so far as people are aware.

    Are you saying N J Wildberger is a crank?
    https://www.youtube.com/watch?v=jlnBo3APRlU

    No, I'm not familiar with the said lady/gentleman. I don't have access
    to youtube.

    I'm not a mathematician myself, but I'm interested in science and math
    and the arguments given by N J Wildberger seem reasonable.

    OK, that's fair enough. I have a degree in maths, although I'm not
    otherwise a mathematician. Sometimes it needs to be said that the mathematical basics are firmly established as being true, and are not at
    all a matter of opinion. Just like Newton's laws of motion or the
    roundness of the Earth or the Theory of Special Relativity are no longer matters of opinion.


    Except, not really, since science doesn't yield certainty, only
    preliminary conclusions that are the best way to account for
    observations so far.
    We have also uncovered observations about 'reality' that kind of subvert
    our most basic logical assumptions (like the law of the excluded middle
    or the pigeon hole principle). For instance in the way that particles
    can exist in two places simultaneously in the double slit experiment as
    an additional possibility besides the intuitive two possible ways for a
    single particle to traverse a barrier with two holes when we detect
    which way it went through the barrier.
    So our understanding of reality is far from established on a solid
    conceptual basis.

    Math provides the conceptual underpinnings of science and I think AI
    might soon debug that mathematical framework to come up with a more
    unified conceptual framework to distinguish between reality and
    fantasy.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From sobriquet@21:1/5 to All on Wed Jul 10 01:53:15 2024
    Op 10/07/2024 om 00:43 schreef FromTheRafters:
    sobriquet was thinking very hard :
    Op 09/07/2024 om 23:33 schreef Alan Mackenzie:
    sobriquet <dohduhdah@yahoo.com> wrote:
    Op 09/07/2024 om 22:05 schreef Chris M. Thomasson:
    On 7/9/2024 12:38 PM, sobriquet wrote:
    Op 09/07/2024 om 07:24 schreef Chris M. Thomasson:
    Are there "more" complex numbers than reals? It seems so, every real >>>>>>> has its y, or imaginary, component set to zero. Therefore for each >>>>>>> real there is an infinity of infinite embedding's for it wrt any >>>>>>> real
    with a non-zero y axis? Fair enough, or really dumb? A little
    stupid?
    What do you think?

    How can you compare them if they are not even in the same dimension? >>>>>> It seems that instead of comparing the real number line to the
    complex
    plane (or the Cartesian plane for that matter), you might as well
    compare a unit of length to a square unit of area.
    Numerically they might be the same, but they are not identical,
    because
    a line has no area, so a unit of length 1 has an area of 0 units
    squared.

    Are the complex numbers just as infinitely dense as the reals are? Or >>>>> are there somehow "more" of them wrt the density of the reals vs, say, >>>>> the rationals and/or the naturals? Is the "density" of an uncountable >>>>> infinity the same for every uncountable infinity? The density of the >>>>> complex numbers and the reals is the same?

    How do you define sets exactly?

    By the axioms of set theory.

    Is there a specific set that corresponds to sqrt(2)?

    There exists a Dedekind cut of the set of rational numbers which is
    sqrt(2).

    Does this set have an infinite number of elements analogous to the
    sqrt(2) having an infinite decimal expansion?

    No.  There is no such analogy.  The infinite decimal expansion is
    entirely irrelevant.

    It seems that the existence of something like sqrt(2) is already rather >>>> dubious.

    Not at all.  You remind me of John Gabriel, who continually asserted the >>> non-existence of mathematical entities, without being able to say
    what he
    meant by this non-existence.  The real number sqrt(2) exists by the
    axioms of set theory and real numbers.

    In reality, things are finite and space and time might also be finite
    (composed of atoms of space and time that can't be subdivided with
    the parts retaining their original spatial and temporal properties).

    So if the concept of irrational numbers like sqrt(2) turns out to be
    nonsense, ....

    You're several hundred years too late for that debate.  The concept of
    irrational numbers is fully formed, without known inconsistency.

    .... that means the concept of the number line is nonsense likewise and >>>> we don't even need to consider higher dimensional nonsense.

    The number line isn't nonsense.  You're in danger of aligning yourself
    with this newsgroup's cranks, past and present.


    So basically what you're saying is that reality is irrelevant with
    respect to the concepts in the mathematical realm?
    Can we really expect a concept of continuity to exist in the
    mathematical realm even if it turns out that we find solid evidence
    for the claim that everything in the empirical realm (energy, matter,
    time, space, information) turns out to be discrete?

    Are you saying N J Wildberger is a crank?
    https://www.youtube.com/watch?v=jlnBo3APRlU

    I'm not a mathematician myself, but I'm interested in science and math
    and the arguments given by N J Wildberger seem reasonable.

    One should keep in mind that we are not building reality from
    mathematical objects.

    Reality is the basis for our abstractions (concepts). We have to fit the concepts to the observations.

    For instance we could have a naive concept of heat as a kind of
    substance that might account for some initial observations, but as we
    observe a wider variety of situations, it might become evident that
    there are other ways to conceptualize temperature (as vibratory motion
    on a molecular scale) that are more suitable to account for our
    observations.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Ben Bacarisse@21:1/5 to Chris M. Thomasson on Wed Jul 10 00:45:15 2024
    "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> writes:

    On 7/9/2024 10:30 AM, Ben Bacarisse wrote:
    WM <wolfgang.mueckenheim@tha.de> writes:

    Le 09/07/2024 14:37, Ben Bacarisse a crit :

    A mathematician, to whom this is a whole new topic, would start by
    asking you what you mean by "more". Without that, they could not
    possibly answer you.

    Good mathematicians could.

    So, what do you mean by "more" when applied to
    sets like C and R?

    Proper subsets have less elements than their supersets.

    Let's see if Chris is using that definition. I think he's cleverer than
    you so he will probably want to be able to say that {1,2,3} has "more"
    elements than {4,5}.

    I was just thinking that there seems to be "more" reals than natural
    numbers. Every natural number is a real, but not all reals are natural numbers.

    You are repeating yourself. What do you mean by "more"? Can you think
    if a general rule -- a test maybe -- that could be applied to any two
    set to find one which has more elements?

    So, wrt the complex. Well... Every complex number has a x, or real
    component. However, not every real has a y, or imaginary component...

    Fair enough? Or still crap? ;^o

    So you are using WM's definition based on subsets? That's a shame. WM
    is not a reasonable person to agree with!

    One consequence is that you can't say if the set of even numbers has
    more or fewer elements than {1,3,5} because {1,3,5} is not a subset of
    the even numbers, and the set of even numbers is not a subset of
    {1,3,5}. They just can't be compared using your (and WM's) notion of
    "more".

    --
    Ben.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From =?UTF-8?B?RWFybGU=?=@21:1/5 to All on Wed Jul 10 00:40:25 2024
    On Thu Jan 1 00:00:00 1970 WM wrote:
    Le 09/07/2024 14:37, Ben Bacarisse a crit :

    A mathematician, to whom this is a whole new topic, would start by
    asking you what you mean by "more". Without that, they could not
    possibly answer you.

    Good mathematicians could.

    So, what do you mean by "more" when applied to
    sets like C and R?

    Proper subsets have less elements than their supersets.

    Regards, WM

    *** Englich Correction:
    You mean "fewer" elements....

    earle
    *

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Stefan Ram@21:1/5 to sobriquet on Wed Jul 10 13:11:04 2024
    sobriquet <dohduhdah@yahoo.com> wrote or quoted:
    Either spacetime is continuous or it's not.

    I wouldn't put it that way. For starters, continuity is something
    that's defined for mappings (functions) of topological spaces.
    Spacetime isn't a function, it's not even a mathematical object!
    So what's the deal with "continuity of spacetime" anyway?

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From sobriquet@21:1/5 to All on Wed Jul 10 17:46:34 2024
    Op 10/07/2024 om 15:11 schreef Stefan Ram:
    sobriquet <dohduhdah@yahoo.com> wrote or quoted:
    Either spacetime is continuous or it's not.

    I wouldn't put it that way. For starters, continuity is something
    that's defined for mappings (functions) of topological spaces.
    Spacetime isn't a function, it's not even a mathematical object!
    So what's the deal with "continuity of spacetime" anyway?

    https://en.wikipedia.org/wiki/Spacetime

    "In physics, spacetime is a mathematical model that fuses the three
    dimensions of space and the one dimension of time into a single four-dimensional continuum."

    Quantities like matter and energy initially seemed to be continuous,
    since they typically consist of extremely large collections of discrete elements (like molecules, atoms or particles).
    So gradually we came to realize that the concept of a continuous
    quantity that can be subdivided indefinitely is unrealistic.

    We don't know if this holds as well for time and space, but it might be
    that everything in reality that can be quantified ultimately consists of discrete elements. If that turns out to be the case, that renders
    discussions about the concept of continuity irrelevant, because at that
    point it seems to be about a concept that only exists in our imagination.
    So it's a bit like discussing how many angels can dance on the head of a
    pin (assuming that angels don't really exist).

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Wed Jul 10 15:51:16 2024
    Le 09/07/2024 à 19:50, FromTheRafters a écrit :
    WM explained on 7/9/2024 :
    Le 09/07/2024 à 14:37, Ben Bacarisse a écrit :

    A mathematician, to whom this is a whole new topic, would start by
    asking you what you mean by "more". Without that, they could not
    possibly answer you.

    Good mathematicians could.

    So, what do you mean by "more" when applied to
    sets like C and R?

    Proper subsets have less elements than their supersets.

    Proper subsets do not have all of the elements that are in their
    supersets. This is not the same as "less" or fewer elements

    It is precisely this. Cantor's bijections are nonsense. They concern only elements which belong to the first percent of the concerned sets.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Wed Jul 10 15:48:21 2024
    Le 09/07/2024 à 19:30, Ben Bacarisse a écrit :
    WM <wolfgang.mueckenheim@tha.de> writes:

    Le 09/07/2024 à 14:37, Ben Bacarisse a écrit :

    A mathematician, to whom this is a whole new topic, would start by
    asking you what you mean by "more". Without that, they could not
    possibly answer you.

    Good mathematicians could.

    So, what do you mean by "more" when applied to
    sets like C and R?

    Proper subsets have less elements than their supersets.

    Let's see if Chris is using that definition. I think he's cleverer than
    you

    I am satisfied with being cleverer than all who believe that the set of
    even numbers has not less elements than the set of all integers.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Wed Jul 10 16:14:20 2024
    Le 10/07/2024 à 01:45, Ben Bacarisse a écrit :
    "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> writes:

    On 7/9/2024 10:30 AM, Ben Bacarisse wrote:
    WM <wolfgang.mueckenheim@tha.de> writes:

    Le 09/07/2024 à 14:37, Ben Bacarisse a écrit :

    A mathematician, to whom this is a whole new topic, would start by
    asking you what you mean by "more". Without that, they could not
    possibly answer you.

    Good mathematicians could.

    So, what do you mean by "more" when applied to
    sets like C and R?

    Proper subsets have less elements than their supersets.

    Let's see if Chris is using that definition. I think he's cleverer than >>> you so he will probably want to be able to say that {1,2,3} has "more"
    elements than {4,5}.

    I was just thinking that there seems to be "more" reals than natural
    numbers. Every natural number is a real, but not all reals are natural
    numbers.

    You are repeating yourself. What do you mean by "more"? Can you think
    if a general rule -- a test maybe -- that could be applied to any two
    set to find one which has more elements?

    No rule is better than a foolish rule, if it yields nonsense like Cantor's "bijections".

    So, wrt the complex. Well... Every complex number has a x, or real
    component. However, not every real has a y, or imaginary component...

    Fair enough? Or still crap? ;^o

    So you are using WM's definition based on subsets? That's a shame.

    It is a reliable rule.

    One consequence is that you can't say if the set of even numbers has
    more or fewer elements than {1,3,5} because {1,3,5} is not a subset of
    the even numbers, and the set of even numbers is not a subset of
    {1,3,5}. They just can't be compared using your (and WM's) notion of
    "more".

    There are further rules. Every finite set has less elements than an
    infinite set. The set of rational numbers has 2|N|^2 + 1 elements. The set
    of real numbers is much larger than the set of rational numbers (but not because of Cantor's nonsense).

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Stefan Ram@21:1/5 to sobriquet on Wed Jul 10 16:26:57 2024
    sobriquet <dohduhdah@yahoo.com> wrote or quoted:
    [Spacetime from Wikipedia]
    "In physics, spacetime is a mathematical model that fuses the three

    Yes, it's a model! And that model usually uses real numbers
    for the four dimensions. So we could study the real numbers for
    their topological properties. But we would learn something about
    physics only to a limited extend, because it's a model, not the
    real thing. So, we would learn something about our model. To study
    the real world, one needs experimental devices like the LHC.

    The model of space as R^3 or spacetime as R^4 is fine for
    intermediate orders of magnitude the size of a man. But it
    probably is not accurate anymore on a scale very much larger
    or very much smaller than that.

    Quantities like matter and energy initially seemed to be continuous,

    Yes. To the bare eye and hands they seem to be continuous.

    since they typically consist of extremely large collections of discrete >elements (like molecules, atoms or particles).

    This is also only true on a certain scale. You could look at
    a particle. What is it? Is it like a ball with a hard border,
    with something continuous inside, or is it a kind of a cloud
    with a soft border? Measurements seems to indicate that it
    is neither of these two (see books at the end).

    The crucial point is: mathematics knows no limits when
    decending down the scale: [0,1] is an intervall, but the tiny
    [0, 10^(-10)] is also in interval that has topologically the
    same properties. In mathematics, you can the go on to study
    [0, 10^-(10^10)], and you get to study [0, 10^-(10^10^10)] and you
    can dive down as deep as possible and it all makes perfect sense.

    But it physics, we need high energy particle accelerators to study
    small distances. Maybe we can study distances of 10^-15 m there.
    But not very much smaller. Even with future technologies, there will
    always be some limit beyond which you cannot study the structure of
    the real space-time. So it makes no sense to talk about it as if it
    would be a mathematical space like the R^4 (the model) where one
    can always go down arbitrarily to any scale (size) one chooses.

    So gradually we came to realize that the concept of a continuous
    quantity that can be subdivided indefinitely is unrealistic.

    The indefinite subdivision is possible mentally and maybe
    in mathematical models, but we do not have instruments to
    inspect the real world to arbitrary small scales. There is
    and will always be a scale below which we cannot see anything.
    So, from the POV of physics, it makes no sense to wonder
    about something that is not observable and will never be.

    We don't know if this holds as well for time and space, but it might be
    that everything in reality that can be quantified ultimately consists of >discrete elements. If that turns out to be the case, that renders
    discussions about the concept of continuity irrelevant, because at that
    point it seems to be about a concept that only exists in our imagination.
    So it's a bit like discussing how many angels can dance on the head of a
    pin (assuming that angels don't really exist).

    To think of space like a kind of a cellular automaton (as
    did Zuse and later Wolfram) is satisfying because it's an
    explanation by something that seems to be easy to understand,
    but currently there is no indication that reality works this
    way. Lattice gauge theories are a tool for computations and
    deliver some useful results, but they are a model.

    To learn more about reality one has to look at reality; it does
    not help to look at mathematical models. And when we study
    reality, there are certain limits beyond which we cannot pass.

    Here are two recommendable popular science books that give
    two nice perspectives on contemporary physics:

    "Quantum Field Theory, As Simple As Possible" (2023), A. Zee and
    "Why String Theory" (2016), Joseph Conlon.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Wed Jul 10 16:28:19 2024
    Le 10/07/2024 à 00:20, Alan Mackenzie a écrit :

    Sometimes it needs to be said that the
    mathematical basics are firmly established as being true, and are not at
    all a matter of opinion.

    One of them is this ∀n ∈ ℕ: 1/n - 1/(n+1) > 0 (*).
    The Number of UnitFractions between 0 and x can only increase by 1 at
    every x.
    Between 0 and 0 it is 0. Hence there must be an x where the Number of UnitFractions between 0 and x is 1.
    Hence either (*) is wrong or Peano.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Wed Jul 10 18:35:03 2024
    Am 10.07.2024 um 18:28 schrieb WM:
    Le 10/07/2024 à 00:20, Alan Mackenzie a écrit :

    Sometimes it needs to be said that the
    mathematical basics are firmly established as being true,
    and are not at all a matter of opinion.

    One of them is this ∀n ∈ ℕ: 1/n - 1/(n+1) > 0.
    Yeeeeees.

    The Number of UnitFractions between 0 and x can only increase by 1 at
    every x.

    No, "the number of unit fractions between 0 and x" is aleph_0 for each
    and every x > 0 (and 0 at 0). There is no increase, but a jump "at" 0.
    Meaning: NUF(0) = 0 and NUF(x) = aleph_0 for all x e IR, x > 0.

    [...] Hence there must be <bla>

    Ex falso quodlibet, Du Depp!

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Stefan Ram@21:1/5 to Stefan Ram on Wed Jul 10 16:45:26 2024
    ram@zedat.fu-berlin.de (Stefan Ram) wrote or quoted:
    "Why String Theory" (2016), Joseph Conlon.

    And this book also has some math content! Read it to learn why Edward
    Witten is the only physicist so far who was awarded the Fields Medal.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Wed Jul 10 16:51:07 2024
    Le 10/07/2024 à 18:35, Moebius a écrit :
    Am 10.07.2024 um 18:28 schrieb WM:
    Le 10/07/2024 à 00:20, Alan Mackenzie a écrit :

    Sometimes it needs to be said that the
    mathematical basics are firmly established as being true,
    and are not at all a matter of opinion.

    One of them is this ∀n ∈ ℕ: 1/n - 1/(n+1) > 0.
    Yeeeeees.

    The Number of UnitFractions between 0 and x can only increase by 1 at
    every x.

    No,

    Yes. It can increase from 0 only to 1 because the next unit fraction
    follwos only at a later x.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Wed Jul 10 18:54:30 2024
    Am 10.07.2024 um 18:35 schrieb Moebius:
    Am 10.07.2024 um 18:28 schrieb WM:
    Le 10/07/2024 à 00:20, Alan Mackenzie a écrit :

    Sometimes it needs to be said that the
    mathematical basics are firmly established as being true, and are not
    at all a matter of opinion.

    One of them is this ∀n ∈ ℕ: 1/n - 1/(n+1) > 0.

    Yeeeeees.

    Here's another one:

    A x e IR, x > 0: E^ℵo u e {1/n : n e IN}: u <= x

    In other words, A x e IR, x > 0: NUF(x) = ℵo.

    Hint: If x e IR, x > 0 then there's a natural number n which is larger
    than 1/x (by the archimedean property of the reals). Let n_0 the
    smallest such number. Then we have: x > 1/n_0 and hence, of course, x >
    1/n_0 > 1/(n_0+1) > 1/(n_0+2) > ... ad infinitum.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Jim Burns@21:1/5 to sobriquet on Wed Jul 10 13:08:43 2024
    On 7/9/2024 4:51 PM, sobriquet wrote:
    Op 09/07/2024 om 22:33 schreef Chris M. Thomasson:

    Either spacetime is continuous or it's not.
    So far it seems things usually are not continuous
    (stuff like energy and space can't be subdivided indefinitely).
    So it seems reasonable to assume that
    the concept of continuity is nonsense.

    If spacetime is not continuous,
    what basis do we have to the concept of continuity?

    Referring to spacetime _sounds like_ physics,
    but the rest of what you're saying doesn't match
    my own experience with physics.

    Baby physicists cut their teeth on
    continuous vibrating strings.
    And yet, we know that,
    at smaller.than.atomic dimensions,
    there are no continuous vibrating strings.

    Continuous vibrating strings are useful descriptions for
    actual guitar strings, actual Tacoma Narrows Bridges. https://www.youtube.com/watch?v=KRutAt0FlGA

    Is spacetime _actually_ continuous?
    We don't think so, because
    our current best theories develop problems
    at small enough scale.

    We expect some so.far.unknown theory
    to make itself felt somewhere around
    distances = 1 in natural units,
    that is, units in which c = G = ℏ = 1,
    the Planck length 1.6×10⁻³⁵ meter

    That's far smaller than we can currently measure,
    although physicists have a proud history of
    measuring impossible.to.measure things,
    so we'll just have to see what the future brings.

    Even if we cleverly measure effects down to 10⁻³⁵m,
    continuous spacetime is still a useful description of
    all the things it is currently usefully describing,
    just as it's still useful to describe a guitar string
    as continuous.

    If you're trolling, you got me.
    I took you seriously.
    If you're objecting in good faith,
    I don't see what you're objecting to.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Stefan Ram@21:1/5 to Stefan Ram on Wed Jul 10 19:14:51 2024
    ram@zedat.fu-berlin.de (Stefan Ram) wrote or quoted:
    But it physics, we need high energy particle accelerators to study
    small distances.

    (read "But in physics, . . .")

    I keep coming across that explanation, but when I actually
    needed it, it wasn't front and center in my noggin,
    and I couldn't dig it up right away. But check this
    out - I stumbled on this quote that sheds some light:

    |If we intend to use accelerators as large "microscopes", the
    |spatial resolution increases with beam energy. According to
    |the de Broglie equation, the relation between momentum p and
    |wavelength l of a wave packet is given by l = h/p. Therefore,
    |larger momenta correspond to shorter wavelengths and access
    |to smaller structures.
    (from a PDF file where the author was not given).

    So here's the deal: To scope out those itty-bitty details, we
    generally need to crank up the juice. It's not just a tech limitation
    thing. Once you hit a certain level of teensy-weensy, even if you had
    all the energy from the Universe, you still couldn't make out squat.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Wed Jul 10 23:16:03 2024
    Am 10.07.2024 um 18:51 schrieb WM:
    Le 10/07/2024 à 18:35, Moebius a écrit :
    Am 10.07.2024 um 18:28 schrieb WM:
    Le 10/07/2024 à 00:20, Alan Mackenzie a écrit :

    Sometimes it needs to be said that the
    mathematical basics are firmly established as being true, and are
    not at all a matter of opinion.

    One of them is this ∀n ∈ ℕ: 1/n - 1/(n+1) > 0.

    Yeeeeees.

    The Number of UnitFractions between 0 and x can only increase by 1 at
    every x.

    No,

    Yes.
    No. :-)
    It can increase from 0 only to 1 because <bla>

    Mückenheim, there is NO x e IR, x > 0 such that NFU(x) = 1, Du Depp.

    Hint: "the number of unit fractions between 0 and x" is aleph_0 for each
    and every x > 0 (and 0 at 0). There is no increase, but a jump "at" 0.
    Meaning: NUF(0) = 0 and NUF(x) = aleph_0 for all x e IR, x > 0.

    Bitte geh doch endlich mal zu Psychiater!

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Wed Jul 10 23:39:59 2024
    Am 10.07.2024 um 23:23 schrieb Chris M. Thomasson:

    Well, it missed an infinite number of reals between 1 and 2. So, the
    reals are denser than the naturals. Fair enough?

    In a certain sense, yes.

    On the other hand, the rational numbers are "denser than the naturals"
    too (in this sense). Still, the set of rational numbers has the same
    "size" as the set of natural numbers.

    Man, try to comprehend that once and for all. :-P

    (Mückenheim never succeeded concerning this point. Please try to avoid
    this rabbit hole.)

    It just seems to have "more", so to speak.

    Exactly!

    The real numbers actually do, while the rational numbers don't.

    Perhaps using the word "more" is just wrong.

    EXACTLY. Well, it's certainly "misleading" when dealing with INFIITE SETS!

    That's the very point Mückenheim can't comprehend.

    However, the density of an infinity makes sense to me. Not sure why, it
    just does...

    It does.

    Hint: Between any two (different) rational or real numbers there's
    another rational / real number.

    That's not the case for natural numbers. They are not "dense".

    The set of evens and odds has an [countably] infinite number of elements. Just like
    the set of naturals.

    Exactly.

    Thats why we accept (in set theory) that these sets have "the same
    size". (Of course, this is by convention. But so what?)

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Wed Jul 10 23:42:01 2024
    Am 10.07.2024 um 23:26 schrieb Chris M. Thomasson:

    Well, can we zoom out forever? Zooming in forever,

    In the comtext of the real and/or complex numbers we can!

    That's just the beauty of math! Isn't it?

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From sobriquet@21:1/5 to All on Wed Jul 10 23:46:34 2024
    Op 10/07/2024 om 23:42 schreef Moebius:
    Am 10.07.2024 um 23:26 schrieb Chris M. Thomasson:

    Well, can we zoom out forever? Zooming in forever,

    In the comtext of the real and/or complex numbers we can!

    That's just the beauty of math! Isn't it?


    In our imagination we can cook and eat ourselves. In practice, it
    wouldn't really work out.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Wed Jul 10 23:53:23 2024
    Am 10.07.2024 um 23:44 schrieb Chris M. Thomasson:
    On 7/10/2024 2:42 PM, Moebius wrote:
    Am 10.07.2024 um 23:26 schrieb Chris M. Thomasson:

    Well, can we zoom out forever? Zooming in forever,

    In the comtext of the real and/or complex numbers we can!

    That's just the beauty of math! Isn't it?

    Yeah, I know we can zoom in forever in math for sure; fractals are neat
    and fun all in one. No doubt. However, wrt the physical world... Can we
    zoom in forever?

    Hint: I'm a trained physicist.

    Still I'd say: "Who knows?" Reality MIGHT be "quantized" (or not).

    But to be honest, "I give a shit about that".

    Let's do math, not physics. Ok?

    Or for that matter, zoom out forever?

    Who nows?! See above.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From sobriquet@21:1/5 to All on Thu Jul 11 00:00:13 2024
    Op 10/07/2024 om 23:44 schreef Chris M. Thomasson:
    On 7/10/2024 2:42 PM, Moebius wrote:
    Am 10.07.2024 um 23:26 schrieb Chris M. Thomasson:

    Well, can we zoom out forever? Zooming in forever,

    In the comtext of the real and/or complex numbers we can!

    That's just the beauty of math! Isn't it?


    Yeah, I know we can zoom in forever in math for sure; fractals are neat
    and fun all in one. No doubt. However, wrt the physical world... Can we
    zoom in forever? Or for that matter, zoom out forever?


    We might think we're zooming in forever.. but we're just stuck in a loop.

    https://www.desmos.com/calculator/4mivqc0iht

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Wed Jul 10 23:55:23 2024
    Am 10.07.2024 um 23:46 schrieb sobriquet:
    Op 10/07/2024 om 23:42 schreef Moebius:
    Am 10.07.2024 um 23:26 schrieb Chris M. Thomasson:

    Well, can we zoom out forever? Zooming in forever,

    In the comtext of the real and/or complex numbers we can!

    That's just the beauty of math! Isn't it?

    In our imagination we can cook and eat ourselves. In practice, it
    wouldn't really work out.

    If you say so.

    May I comment that it seems that you know nothing about mathematics (by experience)?

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Thu Jul 11 00:16:14 2024
    Am 11.07.2024 um 00:10 schrieb Chris M. Thomasson:
    On 7/10/2024 2:53 PM, Moebius wrote:
    Am 10.07.2024 um 23:44 schrieb Chris M. Thomasson:

    [So] let's do math, not physics. Ok?

    Or for that matter, zoom out forever?

    Who nows?! [...]

    Touche! Thanks for your patience with my questions. Your are a nice
    person to converse with. Thanks.

    Actually, I'm a brutal (but honest) one (sorry abot that).

    "He who has ears to hear, let him hear. Anyone with ears to hear should
    listen and understand!"

    :-P

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Thu Jul 11 00:34:26 2024
    Am 11.07.2024 um 00:33 schrieb Chris M. Thomasson:
    On 7/10/2024 3:16 PM, Moebius wrote:
    Am 11.07.2024 um 00:10 schrieb Chris M. Thomasson:
    On 7/10/2024 2:53 PM, Moebius wrote:
    Am 10.07.2024 um 23:44 schrieb Chris M. Thomasson:

    [So] let's do math, not physics. Ok?

    Or for that matter, zoom out forever?

    Who nows?! [...]

    Touche! Thanks for your patience with my questions. Your are a nice
    person to converse with. Thanks.

    Actually, I'm a brutal (but honest) one (sorry abot that).

    "He who has ears to hear, let him hear. Anyone with ears to hear
    should listen and understand!"

    :-P

    Fair enough! Hey, at least you have not annihilated me to a point where
    I have two assholes instead of one... You do have the ability for
    patience. Thanks again.

    lol. :-P

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From sobriquet@21:1/5 to All on Thu Jul 11 01:29:05 2024
    Op 11/07/2024 om 00:12 schreef Chris M. Thomasson:
    On 7/10/2024 3:00 PM, sobriquet wrote:
    Op 10/07/2024 om 23:44 schreef Chris M. Thomasson:
    On 7/10/2024 2:42 PM, Moebius wrote:
    Am 10.07.2024 um 23:26 schrieb Chris M. Thomasson:

    Well, can we zoom out forever? Zooming in forever,

    In the comtext of the real and/or complex numbers we can!

    That's just the beauty of math! Isn't it?


    Yeah, I know we can zoom in forever in math for sure; fractals are
    neat and fun all in one. No doubt. However, wrt the physical world...
    Can we zoom in forever? Or for that matter, zoom out forever?


    We might think we're zooming in forever.. but we're just stuck in a loop.

    https://www.desmos.com/calculator/4mivqc0iht

    Now, that makes my brain want to bleed a little bit. We hit a "limit"
    and loop back on it? Something akin to that?

    Computers have finite computational resources. So if you keep zooming in
    (or out), you eventually run into these computational limitations (or
    perhaps it just takes too long, but lets assume that science has solved
    the issue of aging and you can keep living as long as you please).

    A loop can give the impression of zooming in indefinitely, but you're
    not really zooming in indefinitely in that case.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Ben Bacarisse@21:1/5 to All on Thu Jul 11 00:47:28 2024
    WM <wolfgang.mueckenheim@tha.de> writes:
    (AKA Dr. Wolfgang Mckenheim or Mueckenheim who teaches "Geschichte des Unendlichen" at Hochschule Augsburg.)

    No rule is better than a foolish rule, if it yields nonsense like Cantor's "bijections".

    Is that why you still can't define set membership, difference and
    equality in WMaths such that you could prove one of the most surprising
    results of WMaths: that sets E and P exist such that E in P and P \ {E}
    = P?

    --
    Ben.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Ben Bacarisse@21:1/5 to Chris M. Thomasson on Thu Jul 11 00:53:25 2024
    "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> writes:

    On 7/9/2024 4:45 PM, Ben Bacarisse wrote:
    "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> writes:

    On 7/9/2024 10:30 AM, Ben Bacarisse wrote:
    WM <wolfgang.mueckenheim@tha.de> writes:

    Le 09/07/2024 14:37, Ben Bacarisse a crit :

    A mathematician, to whom this is a whole new topic, would start by >>>>>> asking you what you mean by "more". Without that, they could not
    possibly answer you.

    Good mathematicians could.

    So, what do you mean by "more" when applied to
    sets like C and R?

    Proper subsets have less elements than their supersets.

    Let's see if Chris is using that definition. I think he's cleverer than >>>> you so he will probably want to be able to say that {1,2,3} has "more" >>>> elements than {4,5}.

    I was just thinking that there seems to be "more" reals than natural
    numbers. Every natural number is a real, but not all reals are natural
    numbers.

    You are repeating yourself. What do you mean by "more"? Can you think
    if a general rule -- a test maybe -- that could be applied to any two
    set to find one which has more elements?

    natural numbers: 1, 2, 3, ...

    Well, it missed an infinite number of reals between 1 and 2. So, the reals are denser than the naturals. Fair enough? It just seems to have "more", so to speak. Perhaps using the word "more" is just wrong. However, the density of an infinity makes sense to me. Not sure why, it just does...

    I am trying to get you to come up with a definition. If it is all about "missing" things then you can't compare the sizes of sets like {a,b,c}
    and {3,4,5} as both "miss" all of the members of the others.

    So, wrt the complex. Well... Every complex number has a x, or real
    component. However, not every real has a y, or imaginary component...

    Fair enough? Or still crap? ;^o

    So you are using WM's definition based on subsets? That's a shame. WM
    is not a reasonable person to agree with!
    One consequence is that you can't say if the set of even numbers has
    more or fewer elements than {1,3,5} because {1,3,5} is not a subset of
    the even numbers, and the set of even numbers is not a subset of
    {1,3,5}. They just can't be compared using your (and WM's) notion of
    "more".

    The set of evens and odds has an infinite number of elements. Just like the set of naturals.

    This sentence has nothing to do with what I wrote. The set of evens and
    the set {1,3,5} have no elements in common. Both "miss out" all of the elements of the other. Which has "more" elements and why? Can you
    generalise to come up with a rule of |X| > |Y| if and only if ...?

    --
    Ben.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Thu Jul 11 01:52:38 2024
    Am 11.07.2024 um 01:47 schrieb Ben Bacarisse:
    WM <wolfgang.mueckenheim@tha.de> writes:
    (AKA Dr. Wolfgang Mückenheim or Mueckenheim who teaches "Geschichte des Unendlichen" at [Technische] Hochschule Augsburg.)

    No rule is better than a foolish rule, if it yields nonsense like Cantor's >> "bijections".

    Is that why you still can't define set membership, difference and
    equality in WMaths such that you could prove one of the most surprising results of WMaths: that sets E and P exist such that E in P and P \ {E}
    = P?

    :-) Good one!

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Thu Jul 11 02:24:29 2024
    Am 11.07.2024 um 02:16 schrieb Chris M. Thomasson:

    {a, b, c} vs { 3, 4, 5 }

    Both have the same number of elements, [...]

    HOW do you know that? Please define (for any sets A, B):

    A and B /have the same number of elements/ iff ___________________ .

    (i.e. fill out the blanks). :-)

    Hint: That's what Ben Bacarisse is asking for.

    Sure, it's "obvious" for us. But how would you define "have the same
    number of elements" (in mathematical terms) such that it can be DEDUCED
    (!) für certain sets A and B?

    ________________________________________

    Ok, I'm slighty vicious now... :-)

    If a = b = c, {a, b, c} still has "the same number of elements" as {3,
    4, 5 }? :-P

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Thu Jul 11 02:31:15 2024
    Am 11.07.2024 um 02:28 schrieb Chris M. Thomasson:
    On 7/10/2024 5:24 PM, Moebius wrote:
    Am 11.07.2024 um 02:16 schrieb Chris M. Thomasson:

    {a, b, c} vs { 3, 4, 5 }

    Both have the same number of elements, [...]

    HOW do you know that? Please define (for any sets A, B):

         A and B /have the same number of elements/ iff ___________________ .

    (i.e. fill out the blanks). :-)

    Hint: That's what Ben Bacarisse is asking for.

    Sure, it's "obvious" for us. But how would you define "have the same
    number of elements" (in mathematical terms) such that it can be
    DEDUCED (!) für certain sets A and B?

    ________________________________________

    Ok, I'm slighty vicious now... :-)

    If a = b = c, {a, b, c} still has "the same number of elements" as {3,
    4, 5 }? :-P

    I see {a, b, c} and {3, 4, 5} and think three elements.

    Even if a = b = c = 1?

    C'mon man! :-P

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Ben Bacarisse@21:1/5 to Moebius on Thu Jul 11 01:35:49 2024
    Moebius <invalid@example.invalid> writes:

    Am 11.07.2024 um 02:28 schrieb Chris M. Thomasson:
    On 7/10/2024 5:24 PM, Moebius wrote:
    Am 11.07.2024 um 02:16 schrieb Chris M. Thomasson:

    {a, b, c} vs { 3, 4, 5 }

    Both have the same number of elements, [...]

    HOW do you know that? Please define (for any sets A, B):

    A and B /have the same number of elements/ iff ___________________ . >>>
    (i.e. fill out the blanks). :-)

    Hint: That's what Ben Bacarisse is asking for.

    Sure, it's "obvious" for us. But how would you define "have the same
    number of elements" (in mathematical terms) such that it can be DEDUCED
    (!) fr certain sets A and B?

    ________________________________________

    Ok, I'm slighty vicious now... :-)

    If a = b = c, {a, b, c} still has "the same number of elements" as {3,
    4, 5 }? :-P
    I see {a, b, c} and {3, 4, 5} and think three elements.

    Even if a = b = c = 1?

    C'mon man! :-P

    Please, that's a red herring, and you know it! No where did I say that
    a, b and c stood for anything (i.e. that they might be variables in the
    maths sense). I this sort of context they are just distinct symbols.

    --
    Ben.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Thu Jul 11 02:36:28 2024
    Am 11.07.2024 um 02:31 schrieb Moebius:
    Am 11.07.2024 um 02:28 schrieb Chris M. Thomasson:
    On 7/10/2024 5:24 PM, Moebius wrote:

    Ok, I'm slighty vicious now... :-)

    If a = b = c, {a, b, c} still has "the same number of elements" as
    {3, 4, 5}? :-P

    I see {a, b, c} and {3, 4, 5} and think three elements.

    Even if a = b = c = 1?

    C'mon man! :-P

    I'm not joking here!

    You know, you may have 3 variables a, b, c with

    a = 1 ,
    b = 1 ,
    c = 1 .

    How many entries would a "dictionary" (Python) with keys a, b, c have?

    3 or 1?

    :-P

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Thu Jul 11 02:43:38 2024
    Am 11.07.2024 um 02:35 schrieb Ben Bacarisse:
    Moebius <invalid@example.invalid> writes:

    Am 11.07.2024 um 02:28 schrieb Chris M. Thomasson:
    On 7/10/2024 5:24 PM, Moebius wrote:
    Am 11.07.2024 um 02:16 schrieb Chris M. Thomasson:

    {a, b, c} vs { 3, 4, 5 }

    Both have the same number of elements, [...]

    HOW do you know that? Please define (for any sets A, B):

         A and B /have the same number of elements/ iff ___________________ .

    (i.e. fill out the blanks). :-)

    Hint: That's what Ben Bacarisse is asking for.

    Sure, it's "obvious" for us. But how would you define "have the same
    number of elements" (in mathematical terms) such that it can be DEDUCED >>>> (!) für certain sets A and B?

    ________________________________________

    Ok, I'm slighty vicious now... :-)

    If a = b = c, {a, b, c} still has "the same number of elements" as {3, >>>> 4, 5 }? :-P
    I see {a, b, c} and {3, 4, 5} and think three elements.

    Even if a = b = c = 1?

    C'mon man! :-P

    Please, that's a red herring, and you know it! No where did I say that
    a, b and c stood for anything (i.e. that they might be variables in the
    maths sense). I this sort of context they are just distinct symbols.

    Of course, "a", "b" and "c" are three distinct symols. (Hell!)

    But you dont't think that they should DENOTE some mathematical objects
    (in a mathematical context)?*)

    Huh?!

    Are you doing math with symbols without any denotaton? Strange!
    (Really.) [I'm sort of clueless now.]

    Ok, let's reformulate my statement:

    | Even if a = b = c?

    Satisfied now?!

    _____________________________

    *) Say some numbers or wehatever.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Ben Bacarisse@21:1/5 to Chris M. Thomasson on Thu Jul 11 01:46:20 2024
    "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> writes:

    On 7/10/2024 4:53 PM, Ben Bacarisse wrote:
    "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> writes:

    On 7/9/2024 4:45 PM, Ben Bacarisse wrote:
    "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> writes:

    On 7/9/2024 10:30 AM, Ben Bacarisse wrote:
    WM <wolfgang.mueckenheim@tha.de> writes:

    Le 09/07/2024 14:37, Ben Bacarisse a crit :

    A mathematician, to whom this is a whole new topic, would start by >>>>>>>> asking you what you mean by "more". Without that, they could not >>>>>>>> possibly answer you.

    Good mathematicians could.

    So, what do you mean by "more" when applied to
    sets like C and R?

    Proper subsets have less elements than their supersets.

    Let's see if Chris is using that definition. I think he's cleverer than >>>>>> you so he will probably want to be able to say that {1,2,3} has "more" >>>>>> elements than {4,5}.

    I was just thinking that there seems to be "more" reals than natural >>>>> numbers. Every natural number is a real, but not all reals are natural >>>>> numbers.

    You are repeating yourself. What do you mean by "more"? Can you think >>>> if a general rule -- a test maybe -- that could be applied to any two
    set to find one which has more elements?

    natural numbers: 1, 2, 3, ...

    Well, it missed an infinite number of reals between 1 and 2. So, the reals >>> are denser than the naturals. Fair enough? It just seems to have "more", so >>> to speak. Perhaps using the word "more" is just wrong. However, the density >>> of an infinity makes sense to me. Not sure why, it just does...
    I am trying to get you to come up with a definition. If it is all about
    "missing" things then you can't compare the sizes of sets like {a,b,c}
    and {3,4,5} as both "miss" all of the members of the others.

    {a, b, c} vs { 3, 4, 5 }

    Both have the same number of elements,

    That will fall down for infinite sets unless, by decree, you state that
    your meaning of "more" makes all infinite sets have the same number of elements. You can do that if you want -- the definition is yours -- but
    it does not match your initial suspicions. For example, you probably
    think, intuitively, that there are "more" reals then integers.

    both have a monotonically increasing
    value wrt its elements wrt, ect...

    Now that's an interesting start, more interesting than you probably know
    right now. You are tying "more" to the idea of an ordering. But what
    happens when there is no obvious first element? For example are there
    more reals in (0,1) than in (1,2)? What about (0,1) and (1,3)?

    --
    Ben.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Thu Jul 11 02:51:29 2024
    Am 11.07.2024 um 02:43 schrieb Moebius:

    Ok, let's reformulate my statement:

    | Even if a = b = c?

    Satisfied now?!

    I didn't know that math excludes denotation of A = denotation of B =
    denotation of C if A, B, C are three distinct symbols. (Note that "A".
    "B", "C" here are "metavariables", denoting some symbols.)

    Is this some sort of "new math" (or crank math)?

    Hint: In the context of set theory, any "variables" (or arbitraty names,
    terms, etc.) denote/refer to some sets.

    If we refer to, say, "{a, b}" (in the context of set theory), either a =
    b or a =/= b.

    (sigh)

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Thu Jul 11 03:00:07 2024
    Am 11.07.2024 um 02:59 schrieb Ben Bacarisse: [nonsense]

    Fuck you!

    EOD.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Thu Jul 11 02:59:02 2024
    Am 11.07.2024 um 02:46 schrieb Ben Bacarisse:

    For example, you probably
    think, intuitively, that there are "more" reals then integers.

    Which -in a certain sense- is quite true. :-P

    Here I agree with my math professor. :-)

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Ben Bacarisse@21:1/5 to Moebius on Thu Jul 11 01:59:08 2024
    Moebius <invalid@example.invalid> writes:

    Am 11.07.2024 um 02:35 schrieb Ben Bacarisse:
    Moebius <invalid@example.invalid> writes:

    Am 11.07.2024 um 02:28 schrieb Chris M. Thomasson:
    On 7/10/2024 5:24 PM, Moebius wrote:
    Am 11.07.2024 um 02:16 schrieb Chris M. Thomasson:

    {a, b, c} vs { 3, 4, 5 }

    Both have the same number of elements, [...]

    HOW do you know that? Please define (for any sets A, B):

    A and B /have the same number of elements/ iff ___________________ .

    (i.e. fill out the blanks). :-)

    Hint: That's what Ben Bacarisse is asking for.

    Sure, it's "obvious" for us. But how would you define "have the same >>>>> number of elements" (in mathematical terms) such that it can be DEDUCED >>>>> (!) fr certain sets A and B?

    ________________________________________

    Ok, I'm slighty vicious now... :-)

    If a = b = c, {a, b, c} still has "the same number of elements" as {3, >>>>> 4, 5 }? :-P
    I see {a, b, c} and {3, 4, 5} and think three elements.

    Even if a = b = c = 1?

    C'mon man! :-P
    Please, that's a red herring, and you know it! No where did I say that
    a, b and c stood for anything (i.e. that they might be variables in the
    maths sense). I this sort of context they are just distinct symbols.

    Of course, "a", "b" and "c" are three distinct symols. (Hell!)

    But you dont't think that they should DENOTE some mathematical objects (in
    a mathematical context)?*)

    No, not without the context that says they are variables.

    Huh?!

    Are you doing math with symbols without any denotaton? Strange! (Really.) [I'm sort of clueless now.]

    Unless we allow symbols that just denote themselves, the only examples
    we can conveniently give will be sets of numbers as, conventionally,
    numerals are symbols that denote numbers.

    Ok, let's reformulate my statement:

    | Even if a = b = c?

    Satisfied now?!

    Not really. We must be able write sets of things that are not numbers
    without having to assume they are variables and therefore denote
    something. Otherwise we will always have to say a != b != c. And in
    this specific example we'd have to say even more since I wanted the two
    sets to have no elements in common, so I'd have to have said a, b and c
    don't stand for any of the numbers 1, 2 or 3.

    I suppose since most people now know more about programming than maths,
    I could have used strings:

    { "a", "b", "c" }

    but to a mathematician that just looks clumsy and overly specific.

    --
    Ben.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Thu Jul 11 03:06:05 2024
    Am 11.07.2024 um 02:51 schrieb Chris M. Thomasson:

    What about dropping the word more in favor of density, or granularity of
    an infinite set? The reals are denser, or more granular than the
    rationals and naturals?

    Yeah, makes sense.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Thu Jul 11 03:08:18 2024
    Am 11.07.2024 um 03:06 schrieb Moebius:
    Am 11.07.2024 um 02:51 schrieb Chris M. Thomasson:

    What about dropping the word more in favor of density, or granularity
    of an infinite set? The reals are denser, or more granular than the
    rationals and naturals?

    Yeah, makes sense.

    On the other hand there are (indeed) "more" reals (in a certain sense)
    than naturals and/or rationals. :-)

    So this "more" allows for more "granularity". :-P

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From sobriquet@21:1/5 to All on Thu Jul 11 03:06:58 2024
    Op 11/07/2024 om 02:09 schreef Chris M. Thomasson:
    On 7/10/2024 4:29 PM, sobriquet wrote:
    Op 11/07/2024 om 00:12 schreef Chris M. Thomasson:
    On 7/10/2024 3:00 PM, sobriquet wrote:
    Op 10/07/2024 om 23:44 schreef Chris M. Thomasson:
    On 7/10/2024 2:42 PM, Moebius wrote:
    Am 10.07.2024 um 23:26 schrieb Chris M. Thomasson:

    Well, can we zoom out forever? Zooming in forever,

    In the comtext of the real and/or complex numbers we can!

    That's just the beauty of math! Isn't it?


    Yeah, I know we can zoom in forever in math for sure; fractals are
    neat and fun all in one. No doubt. However, wrt the physical
    world... Can we zoom in forever? Or for that matter, zoom out forever? >>>>

    We might think we're zooming in forever.. but we're just stuck in a
    loop.

    https://www.desmos.com/calculator/4mivqc0iht

    Now, that makes my brain want to bleed a little bit. We hit a "limit"
    and loop back on it? Something akin to that?

    Computers have finite computational resources. So if you keep zooming
    in (or out), you eventually run into these computational limitations
    (or perhaps it just takes too long, but lets assume that science has
    solved the issue of aging and you can keep living as long as you please).

    A loop can give the impression of zooming in indefinitely, but you're
    not really zooming in indefinitely in that case.

    I think I kind of see what you are getting at. Humm... We have got
    pretty deep zooms with fractals. Humm... You seem to be saying
    interpolate from a deep zoom A to a deep zoom B if B is close enough to
    a limit where B can "run out of resources" on a computer? If the
    closeness factor exceeds a certain threshold, we simply loop from A to
    B? The viewer might not be able to notice this aspect wrt the fact that
    we are looping and not zooming anymore, so to speak? Fractal experts
    should be able to detect this. I think I would be able to. Fwiw, here is
    a deepish zoom:

    https://youtu.be/Xjy_HSUujaw


    Deep zoom is kind of relative compared to infinity.
    10^9 iterations seems deep, but even 10^(googleplex^googleplex)
    iterations is insignificantly small in comparison to infinity.

    There are tricks to work with big numbers on computers, but that doesn't
    mean that you magically can get beyond any limitations. If the numbers
    get big/small enough, you run out of memory or you run out of time.
    Infinite zoom would only work on a hypothetical computer that has
    unlimited memory and unlimited time and those only exist in our imagination.


    I do not notice any artificial looping things in there...

    Also, be sure to check this one out:

    https://youtu.be/S530Vwa33G0

    So elegant! No artificial looping.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Thu Jul 11 03:13:57 2024
    Am 11.07.2024 um 03:08 schrieb Moebius:
    Am 11.07.2024 um 03:06 schrieb Moebius:
    Am 11.07.2024 um 02:51 schrieb Chris M. Thomasson:

    What about dropping the word more in favor of density, or granularity
    of an infinite set? The reals are denser, or more granular than the
    rationals and naturals?

    Just to make that clear, in math we say that the _cardinality_ of IR is
    larger than the _cardinality_ of Q or IN.

    See: https://en.wikipedia.org/wiki/Cardinality

    Read it, man!

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Thu Jul 11 03:20:52 2024
    Am 11.07.2024 um 03:06 schrieb sobriquet:

    Deep zoom is kind of relative compared to infinity.
    10^9 iterations seems deep, but even 10^(googleplex^googleplex)
    iterations is insignificantly small in comparison to infinity.

    There are tricks to work with big numbers on computers, but that doesn't
    mean that you magically can get beyond any limitations. If the numbers
    get big/small enough, you run out of memory or you run out of time.
    Infinite zoom would only work on a hypothetical computer that has
    unlimited memory and unlimited time and those only exist in our
    imagination.

    Exacty!

    So what?

    Hint: Mathematical objects "only exist in our imagination", imho. (You
    see, I'm not a platonist/mathematical realist.)

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Thu Jul 11 03:27:15 2024
    Am 11.07.2024 um 03:00 schrieb Moebius:
    Am 11.07.2024 um 02:59 schrieb Ben Bacarisse: [nonsense]

    Fuck you!

    EOD.

    See: https://www.youtube.com/watch?v=GxmqAkNQP8c

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Thu Jul 11 03:17:12 2024
    Am 11.07.2024 um 03:13 schrieb Moebius:
    Am 11.07.2024 um 03:08 schrieb Moebius:
    Am 11.07.2024 um 03:06 schrieb Moebius:
    Am 11.07.2024 um 02:51 schrieb Chris M. Thomasson:

    What about dropping the word more in favor of density, or
    granularity of an infinite set? The reals are denser, or more
    granular than the rationals and naturals?

    Just to make that clear, in math we say that the _cardinality_ of IR is larger than the _cardinality_ of Q or IN.

    See: https://en.wikipedia.org/wiki/Cardinality

    Read it, man!

    "Our intuition gained from finite sets breaks down when dealing with
    infinite sets. In the late 19th century Georg Cantor, Gottlob Frege,
    Richard Dedekind and others rejected the view that the whole cannot be
    the same size as the part. One example of this is Hilbert's paradox of
    the Grand Hotel. Indeed, Dedekind defined an infinite set as one that
    can be placed into a one-to-one correspondence with a strict subset
    (that is, having the same size in Cantor's sense); this notion of
    infinity is called Dedekind infinite. Cantor introduced the cardinal
    numbers, and showed—according to his bijection-based definition of size—that some infinite sets are greater than others. The smallest
    infinite cardinality is that of the natural numbers (ℵ0)."

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Thu Jul 11 03:42:02 2024
    Am 11.07.2024 um 03:06 schrieb sobriquet:

    Infinite zoom would only work on a hypothetical computer that has
    unlimited memory and unlimited time and [...]

    Right.

    Hint: These (hypothetical) computers are called "Turing machines".

    See: https://en.wikipedia.org/wiki/Turing_machine

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Ben Bacarisse@21:1/5 to Chris M. Thomasson on Thu Jul 11 02:34:36 2024
    "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> writes:

    On 7/10/2024 5:46 PM, Ben Bacarisse wrote:
    "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> writes:

    On 7/10/2024 4:53 PM, Ben Bacarisse wrote:
    "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> writes:

    On 7/9/2024 4:45 PM, Ben Bacarisse wrote:
    "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> writes:

    On 7/9/2024 10:30 AM, Ben Bacarisse wrote:
    WM <wolfgang.mueckenheim@tha.de> writes:

    Le 09/07/2024 14:37, Ben Bacarisse a crit :

    A mathematician, to whom this is a whole new topic, would start by >>>>>>>>>> asking you what you mean by "more". Without that, they could not >>>>>>>>>> possibly answer you.

    Good mathematicians could.

    So, what do you mean by "more" when applied to
    sets like C and R?

    Proper subsets have less elements than their supersets.

    Let's see if Chris is using that definition. I think he's cleverer than
    you so he will probably want to be able to say that {1,2,3} has "more" >>>>>>>> elements than {4,5}.

    I was just thinking that there seems to be "more" reals than natural >>>>>>> numbers. Every natural number is a real, but not all reals are natural >>>>>>> numbers.

    You are repeating yourself. What do you mean by "more"? Can you think >>>>>> if a general rule -- a test maybe -- that could be applied to any two >>>>>> set to find one which has more elements?

    natural numbers: 1, 2, 3, ...

    Well, it missed an infinite number of reals between 1 and 2. So, the reals
    are denser than the naturals. Fair enough? It just seems to have "more", so
    to speak. Perhaps using the word "more" is just wrong. However, the density
    of an infinity makes sense to me. Not sure why, it just does...
    I am trying to get you to come up with a definition. If it is all about >>>> "missing" things then you can't compare the sizes of sets like {a,b,c} >>>> and {3,4,5} as both "miss" all of the members of the others.

    {a, b, c} vs { 3, 4, 5 }

    Both have the same number of elements,
    That will fall down for infinite sets unless, by decree, you state that
    your meaning of "more" makes all infinite sets have the same number of
    elements.

    What about dropping the word more in favor of density, or granularity of an infinite set? The reals are denser, or more granular than the rationals and reals? Crap?

    Changing one as yet undefined word for another won't help. And surely,
    even if you don't know exactly what you want the words to mean, "more"
    is probably a simpler notion than "density". Anyway, my point was only
    to try to push you towards defining /something/.

    --
    Ben.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From sobriquet@21:1/5 to All on Thu Jul 11 04:30:31 2024
    Op 11/07/2024 om 03:20 schreef Moebius:
    Am 11.07.2024 um 03:06 schrieb sobriquet:

    Deep zoom is kind of relative compared to infinity.
    10^9 iterations seems deep, but even 10^(googleplex^googleplex)
    iterations is insignificantly small in comparison to infinity.

    There are tricks to work with big numbers on computers, but that doesn't
    mean that you magically can get beyond any limitations. If the numbers
    get big/small enough, you run out of memory or you run out of time.
    Infinite zoom would only work on a hypothetical computer that has
    unlimited memory and unlimited time and those only exist in our
    imagination.

    Exacty!

    So what?

    Well, some people would claim that the human mind has capabilities
    beyond what a computer can do. I would argue that the human mind has
    finite cognitive resources, just like a computer has finite
    computational resources.
    So if a computer can't subdivide a number indefinitely into smaller
    numbers, I don't see why a human would be able to do this.
    It's just a naive concept of a number as something you can keep
    subdividing into smaller numbers if we ignore aspects like how we would represent these numbers in a way that allows us to keep track of where
    we are exactly in this process of indefinitely subdividing the number.
    Even if we start with 1 and we just keep dividing the number by 10.
    10^-1, 10^-2, 10^-3, ..., etc..
    how is that going to work if that negative exponent is a number beyond
    the number of elementary particles in the universe?
    How are we supposed to represent such a number in our mind or otherwise
    to keep track of which number we're subdividing?


    Hint: Mathematical objects "only exist in our imagination", imho. (You
    see, I'm not a platonist/mathematical realist.)


    We don't really know that. For instance, take an abstraction like a
    binary pattern. Let's say a digital photo on a memory stick.
    We identify that digital photo as an abstract pattern and if we copy
    it to another usb stick, it has a kind of distributed existence.
    So the existence of the abstract pattern is just a way of recognizing a
    pattern in the structure of reality and we can imagine a robot that is
    able to identify a picture on a usb stick likewise, so the abstraction
    exists by virtue of any information processing system that is able to
    recognize patterns on an abstract level regardless of concrete
    manifestations like a pattern of distributed electrical charge on a usb
    stick or a pattern of electromagnetic radiation in a wifi signal.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Richard Damon@21:1/5 to All on Wed Jul 10 22:36:51 2024
    On 7/9/24 12:40 PM, WM wrote:
    Le 09/07/2024 à 14:37, Ben Bacarisse a écrit :

    A mathematician, to whom this is a whole new topic, would start by
    asking you what you mean by "more".  Without that, they could not
    possibly answer you.

    Good mathematicians could.

     So, what do you mean by "more" when applied to
    sets like C and R?

    Proper subsets have less elements than their supersets.

    Regards, WM



    But that logic leads to inconsistencies with infinite sets.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Thu Jul 11 06:08:19 2024
    Am 11.07.2024 um 03:00 schrieb Moebius:
    Am 11.07.2024 um 02:59 schrieb Ben Bacarisse: [nonsense]

    Fuck you!

    EOD.

    What did that silly asshole smoke?

    For any a, b, c, a = b = c does not imply card({a, b, c}) = 1?

    Using different symbols (namely "a", "b" and "c") as terms does not
    allow for a = b = c?! WTF?!

    On drugs, or what?

    Hint: If we want to refer to/talk about the (three different) symbols
    "a", "b" and "c" we should write

    "a", "b" and "c"

    (or at least mentioen that we refer to that symbols by using "a", "b"
    and "c").

    For example

    card({"a", "b", "c"}) = 3 .

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Ben Bacarisse@21:1/5 to Chris M. Thomasson on Thu Jul 11 10:27:26 2024
    "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> writes:

    On 7/9/2024 3:29 PM, FromTheRafters wrote:
    Chris M. Thomasson formulated the question :
    On 7/9/2024 10:30 AM, Ben Bacarisse wrote:
    WM <wolfgang.mueckenheim@tha.de> writes:

    Le 09/07/2024 14:37, Ben Bacarisse a crit :

    A mathematician, to whom this is a whole new topic, would start by >>>>>> asking you what you mean by "more". Without that, they could not
    possibly answer you.

    Good mathematicians could.

    So, what do you mean by "more" when applied to
    sets like C and R?

    Proper subsets have less elements than their supersets.

    Let's see if Chris is using that definition. I think he's cleverer than >>>> you so he will probably want to be able to say that {1,2,3} has "more" >>>> elements than {4,5}.


    I was just thinking that there seems to be "more" reals than natural
    numbers. Every natural number is a real, but not all reals are natural
    numbers.
    Seems is a funny word. Does there not 'seem' to be 'more' naturals than
    primes? Intuition fails, these sets are of the same cardinality.
    [...]

    I do think that the number of primes is infinite in the sense that they are all in the naturals.

    Eh? There are lots of finite sets of numbers that "all in the naturals".

    Every prime is a natural, but not every natural is a prime? Strange
    thoughts? Is there a countable number of infinite primes, just like
    there is a countable number of infinite naturals? Fair enough?

    I think you need to take more care with words. There are no "infinite
    primes" just as there are no "infinite naturals". All naturals (and
    thus all primes) are finite. There are an infinite number of them, but
    none are infinite.

    --
    Ben.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Stefan Ram@21:1/5 to sobriquet on Thu Jul 11 11:38:29 2024
    sobriquet <dohduhdah@yahoo.com> wrote or quoted:
    Well, some people would claim that the human mind has capabilities
    beyond what a computer can do.

    Language and the mind can refer to something like "infinity" and
    speak about it. When writing numbers using the notation 10^-10, then
    10^-(10^10), and so on, you never will arrive at something that is
    infinitesimally small. But what mathematicians do instead, they say:
    "let epsilon > 0.". That is /any/ epsilon (it just have to be > 0).

    So, for any given /fixed/ number > 0 (like 10^-(10^10)), you now
    can choose an epsilon that is much smaller! And computers can
    do that too - it just depends on how they are programmed.

    Then, in topology, we have "open neighborhoods". They have no
    specific size at all, yet they capture properties of a topological
    space like the continuity of functions, convergence etc.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From sobriquet@21:1/5 to All on Thu Jul 11 14:16:53 2024
    Op 11/07/2024 om 12:49 schreef FromTheRafters:
    sobriquet pretended :
    Op 11/07/2024 om 00:12 schreef Chris M. Thomasson:
    On 7/10/2024 3:00 PM, sobriquet wrote:
    Op 10/07/2024 om 23:44 schreef Chris M. Thomasson:
    On 7/10/2024 2:42 PM, Moebius wrote:
    Am 10.07.2024 um 23:26 schrieb Chris M. Thomasson:

    Well, can we zoom out forever? Zooming in forever,

    In the comtext of the real and/or complex numbers we can!

    That's just the beauty of math! Isn't it?


    Yeah, I know we can zoom in forever in math for sure; fractals are
    neat and fun all in one. No doubt. However, wrt the physical
    world... Can we zoom in forever? Or for that matter, zoom out forever? >>>>

    We might think we're zooming in forever.. but we're just stuck in a
    loop.

    https://www.desmos.com/calculator/4mivqc0iht

    Now, that makes my brain want to bleed a little bit. We hit a "limit"
    and loop back on it? Something akin to that?

    Computers have finite computational resources. So if you keep zooming
    in (or out), you eventually run into these computational limitations
    (or perhaps it just takes too long, but lets assume that science has
    solved the issue of aging and you can keep living as long as you please).

    A loop can give the impression of zooming in indefinitely, but you're
    not really zooming in indefinitely in that case.

    Why not? Doesn't the scope of displayable pixels shrink commensurate
    with the amount of zoom?

    Because if you actually zoom in (so stopping the variable that is
    looping) by using the + button on the right, eventually you will see
    that the graphics get messed up as a result of running into the
    computational limitations.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From sobriquet@21:1/5 to All on Thu Jul 11 14:36:08 2024
    Op 11/07/2024 om 13:38 schreef Stefan Ram:
    sobriquet <dohduhdah@yahoo.com> wrote or quoted:
    Well, some people would claim that the human mind has capabilities
    beyond what a computer can do.

    Language and the mind can refer to something like "infinity" and
    speak about it. When writing numbers using the notation 10^-10, then
    10^-(10^10), and so on, you never will arrive at something that is
    infinitesimally small. But what mathematicians do instead, they say:
    "let epsilon > 0.". That is /any/ epsilon (it just have to be > 0).

    So, for any given /fixed/ number > 0 (like 10^-(10^10)), you now
    can choose an epsilon that is much smaller! And computers can
    do that too - it just depends on how they are programmed.

    You can do that, but then you can't specify what it is you're talking
    about exactly. So if two people are talking about an epsilon and a delta
    that are positive numbers that are so small we can't represent them numerically, we can't really figure out which of the two is smaller.


    Then, in topology, we have "open neighborhoods". They have no
    specific size at all, yet they capture properties of a topological
    space like the continuity of functions, convergence etc.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Thu Jul 11 14:40:56 2024
    Am 11.07.2024 um 12:34 schrieb FromTheRafters:
    Ben Bacarisse was thinking very hard :
    Moebius <invalid@example.invalid> writes:

    Am 11.07.2024 um 02:28 schrieb Chris M. Thomasson:
    On 7/10/2024 5:24 PM, Moebius wrote:
    Am 11.07.2024 um 02:16 schrieb Chris M. Thomasson:

    {a, b, c} vs { 3, 4, 5 }

    Both have the same number of elements, [...]

    HOW do you know that? Please define (for any sets A, B):

         A and B /have the same number of elements/ iff
    ___________________ .

    (i.e. fill out the blanks). :-)

    Hint: That's what Ben Bacarisse is asking for.

    Sure, it's "obvious" for us. But how would you define "have the same >>>>> number of elements" (in mathematical terms) such that it can be
    DEDUCED
    (!) für certain sets A and B?

    ________________________________________

    Ok, I'm slighty vicious now... :-)

    If a = b = c, {a, b, c} still has "the same number of elements" as {3, >>>>> 4, 5 }? :-P

    I see {a, b, c} and {3, 4, 5} and think three elements.

    Even if a = b = c?

    C'mon man! :-P

    Please, that's a red herring, and you know it!  No where did I say that
    a, b and c stood for anything (i.e. that they might be variables in the
    maths sense).  I this sort of context they are just distinct symbols.

    Indeed!

    Nonsense. (See below.)

    I sometimes try to steer WM away from 'math' symbols in sets
    like asking for a bijection of something like {elephant, rhinoceros,
    dune buggy} and {circle, square, megaphone}.

    Here you used well estabished /names/ (constants) for certain objects
    which - as is well known - are not identical. With other words,

    elephant =/= rhinoceros
    elephant =/= dune buggy
    rhinoceros =/= dune buggy,

    etc.

    Just using DIFFERENT (but arbitrary) symbols, say "a", "b", "c", does
    not ensure for that (i.e. a =/= b, a =/= c, b =/= c).

    Actually, even a = b = c is POSSIBLE in this case. (Leading to card({a,
    b, c}) = 1.)

    Now consider the two (different) names ("symbols") "turtle", "chelonian".

    Does {turtle, chelonian} contain 2 elements, huh?!

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Thu Jul 11 14:44:20 2024
    Am 11.07.2024 um 07:33 schrieb Chris M. Thomasson:

    Is there a countable number of infinite[ly many] primes, just like there is a countable number of infinite[ly many] naturals?

    Yes.

    Hint: "In mathematics, a set is countable if either it is finite or it
    can be made in one to one correspondence with the set of natural numbers."

    https://en.wikipedia.org/wiki/Countable_set

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Stefan Ram@21:1/5 to sobriquet on Thu Jul 11 13:03:28 2024
    sobriquet <dohduhdah@yahoo.com> wrote or quoted:
    You can do that, but then you can't specify what it is you're talking
    about exactly. So if two people are talking about an epsilon and a delta
    that are positive numbers that are so small we can't represent them >numerically, we can't really figure out which of the two is smaller.

    We can sometimes figure out which of the two is smaller.
    The word "delta" in isolation does not have a meaning.
    The name "delta" has to be properly introduced somehow into a text.
    And sometimes this way of introduction gives us a relationship to
    epsilon that will allow us to figure out which of the two is smaller.
    Other times, delta may be helpful to show something where one is
    not required to know whether it's larger or smaller than epsilon.

    For example, let f(x):=x. Then I can show that for every
    epsilon > 0, I can find a delta>0, so that x<delta implies
    f(x)<epsilon. To prove this, I choose delta:=epsilon/2;
    then x<delta implies x<epsilon/2, so f(x)<f(epsilon/2)=
    epsilon/2<epsilon. My choice "delta:=epsilon/2" makes it
    clear that in this case delta is smaller than epsilon.

    So, we can talk about numbers without the need to represent
    them numerically, and computers can do that too. It's called
    "symbolic mathematics" and can be done with software such as
    Maxima or using modern AI chatbots.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Thu Jul 11 14:46:07 2024
    Am 11.07.2024 um 08:24 schrieb Chris M. Thomasson:
    On 7/10/2024 6:08 PM, Moebius wrote:
    Am 11.07.2024 um 03:06 schrieb Moebius:
    Am 11.07.2024 um 02:51 schrieb Chris M. Thomasson:

    What about dropping the word more in favor of density, or
    granularity of an infinite set? The reals are denser, or more
    granular than the rationals and naturals?

    Yeah, makes sense.

    On the other hand there are (indeed) "more" reals (in a certain sense)
    than naturals and/or rationals. :-)

    So this "more" allows for more "granularity". :-P

    Can there be a granularity "score" for any infinite set?

    Well, there is one for "density". :-)

    See: https://en.wikipedia.org/wiki/Dense_set

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Thu Jul 11 15:31:34 2024
    Am 11.07.2024 um 15:03 schrieb Stefan Ram:
    sobriquet <dohduhdah@yahoo.com> wrote or quoted:

    You can do that, but then you can't specify what it is you're talking
    about exactly. So if two people are talking about an epsilon and a delta
    that are positive numbers that are so small we can't represent them
    numerically, we can't really figure out which of the two is smaller.

    We can sometimes figure out which of the two is smaller.
    The word "delta" in isolation does not have a meaning.
    The name "delta" has to be properly introduced somehow into a text.
    And sometimes this way of introduction gives us a relationship to
    epsilon that will allow us to figure out which of the two is smaller.
    Other times, delta may be helpful to show something where one is
    not required to know whether it's larger or smaller than epsilon.

    For example, let f(x):=x. Then I can show that for every
    epsilon > 0, I can find a delta>0, so that x<delta implies
    f(x)<epsilon. To prove this, I choose delta:=epsilon/2;
    then x<delta implies x<epsilon/2, so f(x)<f(epsilon/2)=
    epsilon/2<epsilon. My choice "delta:=epsilon/2" makes it
    clear that in this case delta is smaller than epsilon.

    So, we can talk about numbers without the need to represent
    them numerically, and computers can do that too. It's called
    "symbolic mathematics" and can be done with software such as
    Maxima or using modern AI chatbots.

    Right.

    Again, sobriquet wrote: "if two people are talking about an epsilon and
    a delta that are positive numbers that are so small we can't represent
    them numerically, we can't really figure out which of the two is smaller."

    Not necessarily (as already mentioned above).

    Person A: Let epsilon a real number > 0.

    Person B: Ok. Let delta epsilon/2.

    Me: Then delta < epsilon.

    [ Oh shit, that's just what Stefan mentioned above. :-) ]

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Thu Jul 11 15:17:54 2024
    Am 11.07.2024 um 02:33 schrieb Chris M. Thomasson:
    On 7/10/2024 5:31 PM, Moebius wrote:
    Am 11.07.2024 um 02:28 schrieb Chris M. Thomasson:
    On 7/10/2024 5:24 PM, Moebius wrote:
    Am 11.07.2024 um 02:16 schrieb Chris M. Thomasson:

    {a, b, c} vs { 3, 4, 5 }

    Both have the same number of elements, [...]

    HOW do you know that? Please define (for any sets A, B):

         A and B /have the same number of elements/ iff _______________ . >>>>
    (i.e. fill out the blanks). :-)

    Hint: That's what Ben Bacarisse is asking for.

    Sure, it's "obvious" for us.

    Actually, it's not, since we don't know if a, b, c are "pairwise
    distinct" (see below). Sorry about that.


    But how would you define "have the same number of elements" (in mathematical
    terms) such that it can be DEDUCED (!) für certain sets A and B?
    Yes?

    ________________________________________

    Ok, I'm slighty wicked now... :-)

    If a = b = c, {a, b, c} still has "the same number of elements" as
    {3, 4, 5 }? :-P

    I see {a, b, c} and {3, 4, 5} and think three elements.

    Even if a = b = c?

    C'mon man! :-P

    Well, In my programming mind, { a, b, c } and { 3, 4, 5 } have the same number of elements. Is this bad?

    Yes it's bad. :-)

    If a = b = c, then {a, b, c} only contains 1 element.

    Don't mix up the symbols used for denoting some objects with the objects denoted by the symbols.

    In this case there are 3 (different) symbols, namely "a", "b", "c", but
    it is not excluded that they all denote the same object, say, the number
    1. Then {a, b, c} = {1}.

    I hope "In my programming mind" knows the difference beween using

    a, b, b

    and

    "a", "b", "c".

    :-)

    Hint (Python):

    a = 1

    print(a)

    print("a")

    :-P

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Thu Jul 11 15:21:20 2024
    Am 11.07.2024 um 15:17 schrieb Moebius:
    Am 11.07.2024 um 02:33 schrieb Chris M. Thomasson:
    On 7/10/2024 5:31 PM, Moebius wrote:
    Am 11.07.2024 um 02:28 schrieb Chris M. Thomasson:
    On 7/10/2024 5:24 PM, Moebius wrote:
    Am 11.07.2024 um 02:16 schrieb Chris M. Thomasson:

    {a, b, c} vs { 3, 4, 5 }

    Both have the same number of elements, [...]

    HOW do you know that? Please define (for any sets A, B):

         A and B /have the same number of elements/ iff _______________ . >>>>>
    (i.e. fill out the blanks). :-)

    Hint: That's what Ben Bacarisse is asking for.

    Sure, it's "obvious" for us.

    Actually, it's not, since we don't know if a, b, c are "pairwise
    distinct" (see below). Sorry about that.


    But how would you define "have the same  number of elements" (in
    mathematical terms) such that it can be  DEDUCED (!) für certain
    sets A and B?
    Yes?

    ________________________________________

    Ok, I'm slighty wicked now... :-)

    If a = b = c, {a, b, c} still has "the same number of elements" as
    {3, 4, 5 }? :-P

    I see {a, b, c} and {3, 4, 5} and think three elements.

    Even if a = b = c?

    C'mon man! :-P

    Well, In my programming mind, { a, b, c } and { 3, 4, 5 } have the
    same number of elements. Is this bad?

    Yes it's bad. :-)

    If a = b = c, then {a, b, c} only contains 1 element.

    Don't mix up the symbols used for denoting some objects with the objects denoted by the symbols.

    In this case there are 3 (different) symbols, namely "a", "b", "c", but
    it is not excluded that they all denote the same object, say, the number
    1. Then {a, b, c} = {1}.

    Correction:

    I hope "in [your] programming mind" [you] know the difference beween using

          a, b, b

    and

          "a", "b", "c".

    :-)

    Hint (Python):

    a = 1

    print(a)

    print("a")

    :-P



    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Thu Jul 11 17:14:05 2024
    Am 11.07.2024 um 02:29 schrieb Chris M. Thomasson:
    On 7/10/2024 5:28 PM, Chris M. Thomasson wrote:
    On 7/10/2024 5:24 PM, Moebius wrote:

    If a = b = c, {a, b, c} still has "the same number of elements" as
    {3, 4, 5 }? :-P

    Hint: In this case card({a, b, c}) = 1.

    Or with other words: Ex(x e {a, b, c} & Ay(y e {a, b, c} -> x = y)).

    Using a special quantifier: E!x(x e {a, b, c}) ("There is exactly one x
    such that x is in {a, b, c}.")

    I see {a, b, c} and {3, 4, 5} and think three elements.

    You see (!) there terms in "{a, b, c}" (namely "a", "b" and "c") and 3
    terms in "{3, 4, 5}" (namely "3", "4" and "5").

    Then I start to examine how the elements are different and their
    potential similarities, if any.

    Right. In this case (i.e. an arithmetic context) we may safely assume
    that 3 =/= 3, 3 =/= 5 and 4 =/= 5. :-P

    On the other hand, since we don't know anything concerning a, b and c,
    all we can state/say is:

    1 <= card({a, b, c}) <= 3

    (while card({3, 4, 5}) = 3.)

    For some reason, { a, b, c } and { 3, 4, 5 } makes me think of monotonically increasing.

    Concerning { 3, 4, 5 } the reason is, that indeed 3 < 4 < 5, though { 3,
    4, 5 } = { 5, 4, 3 } = ... etc.

    But concerning { a, b, c } there simply is NO (rational) reason for
    assuming that.

    a may be pi
    b may be 0
    c may be -i

    Then {a, b, c} = {pi, 0, -i}. See?!

    Or:

    a may be 0
    b may be 0
    c may be 0

    Then {a, b, c} = {0}. etc.

    So how can we "compare" sets concerning their "size" (""number of
    elements"")? :-)

    How about using a "measuring stick" (sort of)?

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Thu Jul 11 17:16:11 2024
    Am 11.07.2024 um 17:14 schrieb Moebius:
    Am 11.07.2024 um 02:29 schrieb Chris M. Thomasson:
    On 7/10/2024 5:28 PM, Chris M. Thomasson wrote:
    On 7/10/2024 5:24 PM, Moebius wrote:

    If a = b = c, {a, b, c} still has "the same number of elements" as
    {3, 4, 5 }? :-P

    Hint: In this case card({a, b, c}) = 1.

    Or with other words: Ex(x e {a, b, c} & Ay(y e {a, b, c} -> x = y)).

    Using a special quantifier: E!x(x e {a, b, c}) ("There is exactly one x
    such that x is in {a, b, c}.")

    I see {a, b, c} and {3, 4, 5} and think three elements.

    You see (!) there

    3 <<< correction

    terms in "{a, b, c}" (namely "a", "b" and "c") and 3
    terms in "{3, 4, 5}" (namely "3", "4" and "5").

    Then I start to examine how the elements are different and their
    potential similarities, if any.

    Right. In this case (i.e. an arithmetic context) we may safely assume
    that 3 =/= 3, 3 =/= 5 and 4 =/= 5. :-P

    On the other hand, since we don't know anything concerning a, b and c,
    all we can state/say is:

    1 <= card({a, b, c}) <= 3

    (while card({3, 4, 5}) = 3.)

    For some reason, { a, b, c } and { 3, 4, 5 } makes me think of
    monotonically increasing.

    Concerning { 3, 4, 5 } the reason is, that indeed 3 < 4 < 5, though { 3,
    4, 5 }  = { 5, 4, 3 } = ... etc.

    But concerning { a, b, c } there simply is NO (rational) reason for
    assuming that.

    a may be pi
    b may be 0
    c may be -i

    Then {a, b, c} = {pi, 0, -i}. See?!

    Or:

    a may be 0
    b may be 0
    c may be 0

    Then {a, b, c} = {0}. etc.

    So how can we "compare" sets concerning their "size" (""number of elements"")? :-)

    How about using a "measuring stick" (sort of)?

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Thu Jul 11 19:43:21 2024
    Am 11.07.2024 um 19:04 schrieb FromTheRafters:
    After serious thinking Moebius wrote :
    Am 11.07.2024 um 12:34 schrieb FromTheRafters:
    Ben Bacarisse was thinking very hard :
    Moebius <invalid@example.invalid> writes:

    Am 11.07.2024 um 02:28 schrieb Chris M. Thomasson:
    On 7/10/2024 5:24 PM, Moebius wrote:
    Am 11.07.2024 um 02:16 schrieb Chris M. Thomasson:

    {a, b, c} vs { 3, 4, 5 }

    Both have the same number of elements, [...]

    HOW do you know that? Please define (for any sets A, B):

         A and B /have the same number of elements/ iff
    ___________________ .

    (i.e. fill out the blanks). :-)

    Hint: That's what Ben Bacarisse is asking for.

    Sure, it's "obvious" for us. But how would you define "have the same >>>>>>> number of elements" (in mathematical terms) such that it can be
    DEDUCED
    (!) für certain sets A and B?

    ________________________________________

    Ok, I'm slighty vicious now... :-)

    If a = b = c, {a, b, c} still has "the same number of elements"
    as {3,
    4, 5 }? :-P

    I see {a, b, c} and {3, 4, 5} and think three elements.

    Even if a = b = c?

    C'mon man! :-P

    Please, that's a red herring, and you know it!  No where did I say that >>>> a, b and c stood for anything (i.e. that they might be variables in the >>>> maths sense).  I this sort of context they are just distinct symbols.

    Indeed!

    Nonsense. (See below.)

    You have stated this nonsense before, I simply disagree with a set in
    roster form having duplicates.

    Yes, you are an idiot. *plonk*

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Jim Burns@21:1/5 to Chris M. Thomasson on Thu Jul 11 14:53:30 2024
    On 7/10/2024 5:26 PM, Chris M. Thomasson wrote:
    On 7/10/2024 10:08 AM, Jim Burns wrote:

    Is spacetime _actually_ continuous?
    We don't think so, because
    our current best theories develop problems
    at small enough scale.

    We expect some so.far.unknown theory
    to make itself felt somewhere around
    distances = 1 in natural units,
    that is, units in which c = G = ℏ = 1,
    the Planck length 1.6×10⁻³⁵ meter

    Well, can we zoom out forever?
    Zooming in forever, well
    not sure if that is possible with
    our current state of the art of
    our understanding of the universe.

    I don't think continuity is about zooming in.

    Split the rationals at an irrational.
    Rationals on one side and on the other side.
    Zoom in.
    Let's suppose more rationals "come into view".
    Zoomed in, again, there are
    rationals on one side and on the other side.
    Lather, rinse, and repeat.

    There are rationals across the split which
    are closer than any nonzero distance,
    at any zoom.level.

    That's not continuity.

    Continuity has a point _at the split_

    For each split,
    there is either
    a rightmost point in its left side or
    a leftmost point in its right side.
    That point is _at the split_

    The rationals "are fractal".
    They allow for unbounded zooming.
    However,
    not all splits of rationals
    are situated (have a point at)
    in the rationals.

    All splits of the reals
    are situated in the reals.
    In that sense, the reals are complete.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From sobriquet@21:1/5 to All on Thu Jul 11 21:57:09 2024
    Op 11/07/2024 om 15:03 schreef Stefan Ram:
    sobriquet <dohduhdah@yahoo.com> wrote or quoted:
    You can do that, but then you can't specify what it is you're talking
    about exactly. So if two people are talking about an epsilon and a delta
    that are positive numbers that are so small we can't represent them
    numerically, we can't really figure out which of the two is smaller.

    We can sometimes figure out which of the two is smaller.
    The word "delta" in isolation does not have a meaning.
    The name "delta" has to be properly introduced somehow into a text.
    And sometimes this way of introduction gives us a relationship to
    epsilon that will allow us to figure out which of the two is smaller.
    Other times, delta may be helpful to show something where one is
    not required to know whether it's larger or smaller than epsilon.

    For example, let f(x):=x. Then I can show that for every
    epsilon > 0, I can find a delta>0, so that x<delta implies
    f(x)<epsilon. To prove this, I choose delta:=epsilon/2;
    then x<delta implies x<epsilon/2, so f(x)<f(epsilon/2)=
    epsilon/2<epsilon. My choice "delta:=epsilon/2" makes it
    clear that in this case delta is smaller than epsilon.

    So, we can talk about numbers without the need to represent
    them numerically, and computers can do that too. It's called
    "symbolic mathematics" and can be done with software such as
    Maxima or using modern AI chatbots.

    Ok, in some cases we can, but in other cases we might not be able to do
    that if the only way to really say anything about how they relate to one another would be to actually inspect their representation.
    Not everything can be done with symbolic math and often we're forced
    to work with numerical approximations instead.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Jim Burns@21:1/5 to Chris M. Thomasson on Thu Jul 11 16:31:08 2024
    On 7/11/2024 3:47 PM, Chris M. Thomasson wrote:
    On 7/11/2024 11:53 AM, Jim Burns wrote:

    The rationals "are fractal".
    They allow for unbounded zooming.
    However,
    not all splits of rationals
    are situated (have a point at)
    in the rationals.

    Well, I use reals for my fractals.
    If I am using complex numbers,
    both of their parts (x, y) or
    (real, imaginary) if you will,
    use reals...
    ;^)

    In computing,
    floating point numbers are often called real numbers.
    I don't know if you mean "floating point" here.

    Floating point numbers aren't real numbers.
    They don't even include all of the rationals.

    All splits of the reals
    are situated in the reals.
    In that sense, the reals are complete.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Thu Jul 11 22:35:54 2024
    Am 11.07.2024 um 21:47 schrieb Chris M. Thomasson:

    Well, I use reals for my fractals. If I am using complex numbers, both
    of their parts (x, y) or (real, imaginary) if you will, use reals...

    Still, the complex numbers allow for more profound results in certain (mathematical) fields.

    See: https://en.wikipedia.org/wiki/Complex_analysis

    Moreover, there are some quite interesting results in the context of
    physics, btw.:

    "Quantum Physics Falls Apart without Imaginary Numbers" https://www.scientificamerican.com/article/quantum-physics-falls-apart-without-imaginary-numbers/

    "Quantum physics needs complex numbers" https://www.researchgate.net/publication/348802613_Quantum_physics_needs_complex_numbers

    "Quantum theory based on real numbers can be experimentally falsified" https://www.nature.com/articles/s41586-021-04160-4

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Thu Jul 11 22:26:55 2024
    Am 11.07.2024 um 21:39 schrieb Chris M. Thomasson:

    Are the gaps [between] prime numbers "random" wrt their various length's?

    In a certain sense (maybe) "yes", but there are "rules". :-P

    For example, for each and ever natural number n > 1 there's a prime
    between n and 2n. :-)

    See: https://en.wikipedia.org/wiki/Bertrand%27s_postulate

    Moreover: "The prime number theorem, proven in 1896, says that the
    average length of the gap between a prime p and the next prime will asymptotically approach ln(p), the natural logarithm of p, for
    sufficiently large primes. The actual length of the gap might be much
    more or less than this. However, one can deduce from the prime number
    theorem an upper bound on the length of prime gaps[.]"

    Source: https://en.wikipedia.org/wiki/Prime_gap

    (2, 3) has no gap wrt the naturals, however, (3, 5) does [...].

    For all n e IN, n > 1, there is a prime between n and 2n.

    Let's check it for some n:

    n = 2: 2, *3*, 4
    n = 3: 3, 4, *5*, 6
    n = 4: 4, *5*, 6, *7*, 8
    n = 5: 5, 6, *7*, 8, 9, 10
    :

    On the other hand, it's NOT known if for all natural number n there is a
    prime between n^2 and (n+1)^2.

    See: https://en.wikipedia.org/wiki/Legendre%27s_conjecture

    Fascinating, isn't it?

    _______________

    Back to countably infinite sets. :-)

    https://en.wikipedia.org/wiki/Countable_set

    We can index the primes:

    [0] = 2
    [1] = 3
    [2] = 5
    [3] = 7
    ...

    Exactly.

    This means (using math terminology) that there is a bijektion between IN
    and P (the set of primes).

    Hence the set of primes is countably infinite.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Thu Jul 11 22:42:54 2024
    Am 11.07.2024 um 21:50 schrieb Chris M. Thomasson:
    On 7/11/2024 5:16 AM, sobriquet wrote:
    Op 11/07/2024 om 12:49 schreef FromTheRafters:
    sobriquet pretended :
    Op 11/07/2024 om 00:12 schreef Chris M. Thomasson:
    On 7/10/2024 3:00 PM, sobriquet wrote:
    Op 10/07/2024 om 23:44 schreef Chris M. Thomasson:
    On 7/10/2024 2:42 PM, Moebius wrote:
    Am 10.07.2024 um 23:26 schrieb Chris M. Thomasson:

    Well, can we zoom out forever? Zooming in forever,

    In the comtext of the real and/or complex numbers we can!

    That's just the beauty of math! Isn't it?


    Yeah, I know we can zoom in forever in math for sure; fractals
    are neat and fun all in one. No doubt. However, wrt the physical >>>>>>> world... Can we zoom in forever? Or for that matter, zoom out
    forever?


    We might think we're zooming in forever.. but we're just stuck in
    a loop.

    https://www.desmos.com/calculator/4mivqc0iht

    Now, that makes my brain want to bleed a little bit. We hit a
    "limit" and loop back on it? Something akin to that?

    Computers have finite computational resources. So if you keep
    zooming in (or out), you eventually run into these computational
    limitations (or perhaps it just takes too long, but lets assume that
    science has solved the issue of aging and you can keep living as
    long as you please).

    A loop can give the impression of zooming in indefinitely, but
    you're not really zooming in indefinitely in that case.

    Why not? Doesn't the scope of displayable pixels shrink commensurate
    with the amount of zoom?

    Because if you actually zoom in (so stopping the variable that is
    looping) by using the + button on the right, eventually you will see
    that the graphics get messed up as a result of running into the
    computational limitations.


    Right. Zooming in using floats vs doubles is a pretty big difference
    right off the bat. For really deep zooms that doubles cannot handle, we
    tend to use arbitrary precision libraries, slow, but doable. Then of
    course we can run into memory issues wrt said libraries...

    Yes. Physical computers do have limitations a "Turing machine" does not
    have.

    See: https://en.wikipedia.org/wiki/Turing_machine

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Fri Jul 12 00:08:58 2024
    Am 11.07.2024 um 23:42 schrieb Chris M. Thomasson:
    On 7/11/2024 1:31 PM, Jim Burns wrote:

    Floating point numbers aren't real numbers.
    They don't even include all of the rationals.

    Floating point numbers are what I use on the good ol' computer to create
    a bunch of my work. Sometimes I can get away with using floats, other
    times I need to use doubles to get the higher precision needed.
    Sometimes, I need to bust out an arbitrary precision lib... ;^)

    Yeah, it's a simple fact that we don't have a real /real/ type on
    computers. :-P

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Fri Jul 12 00:05:39 2024
    Am 11.07.2024 um 23:40 schrieb Chris M. Thomasson:
    On 7/11/2024 1:35 PM, Moebius wrote:
    Am 11.07.2024 um 21:47 schrieb Chris M. Thomasson:

    Well, I use reals for my fractals. If I am using complex numbers,
    both of their parts (x, y) or (real, imaginary) if you will, use
    reals...

    Still, the complex numbers allow for more profound results in certain
    (mathematical) fields.

    See: https://en.wikipedia.org/wiki/Complex_analysis

    Moreover, there are some quite interesting results in the context of
    physics, btw.:

    "Quantum Physics Falls Apart without Imaginary Numbers"
    https://www.scientificamerican.com/article/quantum-physics-falls-
    apart-without-imaginary-numbers/

    "Quantum physics needs complex numbers"
    https://www.researchgate.net/
    publication/348802613_Quantum_physics_needs_complex_numbers

    "Quantum theory based on real numbers can be experimentally falsified"
    https://www.nature.com/articles/s41586-021-04160-4

    Absolutely. By the way, have you ever played around with the so-called triplex numbers that can be used to generate the Mandelbulb?

    Nope. I have to admit, I'm a rather lazy guy. :-P

    Knowing a lot, doing (almost) nothing. :-)

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Fri Jul 12 00:17:21 2024
    Am 11.07.2024 um 23:40 schrieb Chris M. Thomasson:

    Fwiw, here is a result I got from using Mandelbulbs as a base object for
    one of my experimental biomorphic algorithms:

    https://youtu.be/XpbPzrSXOgk

    Here is another experiment using the same biomorphic algorithm, just
    using different base shapes:

    https://youtu.be/TLd64a4gdZQ

    Pretty interesting results... :^)

    Absolutely! Incredible!

    Both approaches ARE GREAT: "applied mathematics" as well as "pure
    mathematics". :-P

    It seems to me that cranks can't "see" the beauty of ALL mathematics.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Stefan Ram@21:1/5 to sobriquet on Fri Jul 12 10:12:48 2024
    sobriquet <dohduhdah@yahoo.com> wrote or quoted:
    Op 11/07/2024 om 15:03 schreef Stefan Ram:
    . . .
    So, we can talk about numbers without the need to represent
    them numerically, and computers can do that too. It's called
    "symbolic mathematics" and can be done with software such as
    Maxima or using modern AI chatbots.
    Ok, in some cases we can, but in other cases we might not be able to do
    that if the only way to really say anything about how they relate to one >another would be to actually inspect their representation.
    Not everything can be done with symbolic math and often we're forced
    to work with numerical approximations instead.

    All the math stuff gets talked about without caring how numbers are
    written down in any specific system. Individual numbers are pinned
    down by their characteristics. For instance, say, e^( i pi )+ 1 = 0.

    It doesn't matter that hardly anyone can write out the full decimal
    representation of e or pi. (Chuck Norris probably can, but I can't
    think of anyone else who could pull that off.)

    The engineers with their "numerical mathematics" are the exception.
    They're the ones who actually deal with how numbers are represented.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Jim Burns@21:1/5 to Chris M. Thomasson on Fri Jul 12 07:34:44 2024
    On 7/11/2024 5:42 PM, Chris M. Thomasson wrote:
    On 7/11/2024 1:31 PM, Jim Burns wrote:
    On 7/11/2024 3:47 PM, Chris M. Thomasson wrote:
    On 7/11/2024 11:53 AM, Jim Burns wrote:

    The rationals "are fractal".
    They allow for unbounded zooming.
    However,
    not all splits of rationals
    are situated (have a point at)
    in the rationals.

    Well, I use reals for my fractals.
    If I am using complex numbers,
    both of their parts (x, y) or
    (real, imaginary) if you will,
    use reals...
    ;^)

    In computing,
    floating point numbers are often called real numbers.
    I don't know if you mean "floating point" here.

    Floating point numbers aren't real numbers.
    They don't even include all of the rationals.

    Floating point numbers are
    what I use on the good ol' computer
    to create a bunch of my work.
    Sometimes I can get away with using floats,
    other times I need to use doubles
    to get the higher precision needed.
    Sometimes,
    I need to bust out an arbitrary precision lib...
    ;^)

    Then you don't use reals for your fractals.
    Arbitrary precision is not continuity.

    I don't intend that remark as a criticism of your work.
    Not everything needs reals.

    Each.split.situated and
    each.point.jumpless (the function continuous there)
    must have
    no.jumps.at.all (all crossed curves intersect)

    No.jumps.at.all
    is what.we.want for continuous functions.


    Only.arbitrary.precision and
    each.point.jumpless (the function continuous there)
    might have
    a jump between sides of an unsituated split.

    Such a jumpy.function is still continuous.everywhere
    because
    there is no there where it jumps.

    A jump --
    even between sides of an unsituated split --
    is not what.we.want for continuous functions.

    That's why only.arbitrary.precision
    aren't the reals.
    Without each.split.situated
    a continuous.everywhere function
    might jump
    where there is no there.
    And we don't want that.

    All splits of the reals
    are situated in the reals.
    In that sense, the reals are complete.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Fri Jul 12 16:54:13 2024
    Le 11/07/2024 à 04:36, Richard Damon a écrit :
    On 7/9/24 12:40 PM, WM wrote:
    Le 09/07/2024 à 14:37, Ben Bacarisse a écrit :

    A mathematician, to whom this is a whole new topic, would start by
    asking you what you mean by "more".  Without that, they could not
    possibly answer you.

    Good mathematicians could.

     So, what do you mean by "more" when applied to
    sets like C and R?

    Proper subsets have less elements than their supersets.

    But that logic leads to inconsistencies with infinite sets.

    No, it is the only basic rule of infinite sets that can be trusted unconditionally.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Fri Jul 12 17:13:09 2024
    Le 11/07/2024 à 02:46, Ben Bacarisse a écrit :
    "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> writes:

    {a, b, c} vs { 3, 4, 5 }

    Both have the same number of elements,

    That will fall down for infinite sets unless, by decree, you state that
    your meaning of "more" makes all infinite sets have the same number of elements.

    There are some rules for comparing sets which are not subset and superset, namely symmetry:

    The real numbers in intervals of same length like (n, n+1] are
    equinumerous.

    Further there is a rule of construction: The rational numbers are |ℚ| = 2|ℕ|^2 + 1.
    The real numbers are infinitely more than the rational numbers because
    every rational multiplied by an irrational is irrational.
    Of course the complex numbers are infinitely many more than the reals.
    That's the subset rule.

    These rules have not lead to any contradiction, to my knowledge. Please
    try.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Fri Jul 12 17:17:27 2024
    Le 11/07/2024 à 02:35, Ben Bacarisse a écrit :
    Moebius <invalid@example.invalid> writes:

    Am 11.07.2024 um 02:28 schrieb Chris M. Thomasson:
    On 7/10/2024 5:24 PM, Moebius wrote:
    Am 11.07.2024 um 02:16 schrieb Chris M. Thomasson:

    {a, b, c} vs { 3, 4, 5 }

    Both have the same number of elements, [...]

    HOW do you know that? Please define (for any sets A, B):

         A and B /have the same number of elements/ iff ___________________ .

    (i.e. fill out the blanks). :-)

    Hint: That's what Ben Bacarisse is asking for.

    Sure, it's "obvious" for us. But how would you define "have the same
    number of elements" (in mathematical terms) such that it can be DEDUCED >>>> (!) für certain sets A and B?

    ________________________________________

    Ok, I'm slighty vicious now... :-)

    If a = b = c, {a, b, c} still has "the same number of elements" as {3, >>>> 4, 5 }? :-P
    I see {a, b, c} and {3, 4, 5} and think three elements.

    Even if a = b = c = 1?

    C'mon man! :-P

    Please, that's a red herring, and you know it! No where did I say that
    a, b and c stood for anything (i.e. that they might be variables in the
    maths sense). I this sort of context they are just distinct symbols.

    Franz Fritsche cannot understand that and thinks that the whole world has
    to apply his
    quotation mark rule, because some adored logician has taught it.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Ben Bacarisse@21:1/5 to All on Sat Jul 13 01:12:22 2024
    WM <wolfgang.mueckenheim@tha.de> writes:
    (AKA Dr. Wolfgang Mckenheim or Mueckenheim who teaches "Geschichte des Unendlichen" at Hochschule Augsburg.)

    Le 11/07/2024 02:46, Ben Bacarisse a crit :
    "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> writes:

    {a, b, c} vs { 3, 4, 5 }

    Both have the same number of elements,
    That will fall down for infinite sets unless, by decree, you state that
    your meaning of "more" makes all infinite sets have the same number of
    elements.

    There are some rules for comparing sets which are not subset and superset, namely symmetry:

    Still nothing about defining set membership, equality and difference in
    WMaths though. You've been dodging that one for years. Without sound definitions of those things WMaths is pretty useless.

    --
    Ben.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Sat Jul 13 05:09:25 2024
    Am 12.07.2024 um 21:10 schrieb Chris M. Thomasson:

    [...] we can use fractals to store/load data...

    See:
    https://math.stackexchange.com/questions/1104660/patterns-in-pi-in-contact

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Sat Jul 13 15:50:55 2024
    Le 13/07/2024 à 02:12, Ben Bacarisse a écrit :
    WM <wolfgang.mueckenheim@tha.de> writes:
    (AKA Dr. Wolfgang Mückenheim or Mueckenheim who teaches "Geschichte des Unendlichen"

    and "Kleine Geschichte der Mathematik"

    at Hochschule Augsburg.)

    Meanwhile Technische Hochschule Augsburg.

    Le 11/07/2024 à 02:46, Ben Bacarisse a écrit :
    "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> writes:

    {a, b, c} vs { 3, 4, 5 }

    Both have the same number of elements,
    That will fall down for infinite sets unless, by decree, you state that
    your meaning of "more" makes all infinite sets have the same number of
    elements.

    There are some rules for comparing sets which are not subset and superset, >> namely symmetry:

    Still nothing about defining set membership, equality and difference in WMaths though.

    Are my rules appearing too reasonable for a believer in equinumerosity of
    prime numbers and algebraic numbers?

    You've been dodging that one for years. Without sound
    definitions of those things WMaths is pretty useless.

    Dark elements cannot be defined individually.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From joes@21:1/5 to All on Sat Jul 13 22:55:13 2024
    Am Fri, 12 Jul 2024 17:13:09 +0000 schrieb WM:
    Le 11/07/2024 à 02:46, Ben Bacarisse a écrit :
    "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> writes:

    {a, b, c} vs { 3, 4, 5 }
    Both have the same number of elements,
    That will fall down for infinite sets unless, by decree, you state that
    your meaning of "more" makes all infinite sets have the same number of
    elements.
    There are some rules for comparing sets which are not subset and
    superset, namely symmetry:
    The real numbers in intervals of same length like (n, n+1] are
    equinumerous.
    What is their number?
    In fact every interval contains uncountably many numbers.
    Of course you can assign this the useless measure 1.

    Further there is a rule of construction: The rational numbers are |ℚ| = 2|ℕ|^2 + 1.
    No, they are countable: bijective to the naturals.
    And what would this expression mean if you can't manipulate it?
    The real numbers are infinitely more than the rational numbers because
    every rational multiplied by an irrational is irrational.

    Of course the complex numbers are infinitely many more than the reals.
    That's the subset rule.
    These rules have not lead to any contradiction, to my knowledge. Please
    try.
    Consider the set of even numbers. Clearly they are bijective to the
    naturals, yet a subset of them. How many are there?

    --
    Am Fri, 28 Jun 2024 16:52:17 -0500 schrieb olcott:
    Objectively I am a genius.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Sun Jul 14 02:10:23 2024
    Am 14.07.2024 um 00:55 schrieb joes:

    Consider the set of even numbers. Clearly they are bijective to the
    naturals, yet a subset of them. How many are there?

    |IN|/2 of course. :-P

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Ben Bacarisse@21:1/5 to wolfgang.mueckenheim@tha.de on Sun Jul 14 02:30:50 2024
    WM <wolfgang.mueckenheim@tha.de> writes:

    Le 13/07/2024 02:12, Ben Bacarisse a crit :
    WM <wolfgang.mueckenheim@tha.de> writes:
    (AKA Dr. Wolfgang Mckenheim or Mueckenheim who teaches "Geschichte des
    Unendlichen"

    and "Kleine Geschichte der Mathematik"

    Optional, I hope.

    at Hochschule Augsburg.)

    Meanwhile Technische Hochschule Augsburg.

    A sound name change that reflects the technical college's focus.

    Le 11/07/2024 02:46, Ben Bacarisse a crit :
    "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> writes:

    {a, b, c} vs { 3, 4, 5 }

    Both have the same number of elements,
    That will fall down for infinite sets unless, by decree, you state that >>>> your meaning of "more" makes all infinite sets have the same number of >>>> elements.

    There are some rules for comparing sets which are not subset and superset, >>> namely symmetry:
    Still nothing about defining set membership, equality and difference in
    WMaths though.

    Are my rules appearing too reasonable for a believer in equinumerosity of prime numbers and algebraic numbers?

    You can define equinumerosity any way you like. But you can't claim the "surprising" result of WMaths that E in P and P \ {E} = P whilst
    admitting that you have no workable definition of set membership,
    difference or equality.

    Presumably that's why you teach history courses now -- you can avoid
    having to write down even the most basic definitions of WMaths sets.

    --
    Ben.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Sun Jul 14 13:09:25 2024
    Le 14/07/2024 à 03:30, Ben Bacarisse a écrit :
    WM <wolfgang.mueckenheim@tha.de> writes:

    Le 13/07/2024 à 02:12, Ben Bacarisse a écrit :
    WM <wolfgang.mueckenheim@tha.de> writes:
    (AKA Dr. Wolfgang Mückenheim or Mueckenheim who teaches "Geschichte des >>> Unendlichen"

    and "Kleine Geschichte der Mathematik"

    Optional, I hope.

    at Hochschule Augsburg.)

    Meanwhile Technische Hochschule Augsburg.

    A sound name change that reflects the technical college's focus.

    Le 11/07/2024 à 02:46, Ben Bacarisse a écrit :
    "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> writes:

    {a, b, c} vs { 3, 4, 5 }

    Both have the same number of elements,
    That will fall down for infinite sets unless, by decree, you state that >>>>> your meaning of "more" makes all infinite sets have the same number of >>>>> elements.

    There are some rules for comparing sets which are not subset and superset, >>>> namely symmetry:
    Still nothing about defining set membership, equality and difference in
    WMaths though.

    Are my rules appearing too reasonable for a believer in equinumerosity of
    prime numbers and algebraic numbers?

    You can define equinumerosity any way you like.

    And I can prove that Cantor's way leads astray.

    But you can't claim the
    "surprising" result of WMaths that E in P and P \ {E} = P

    That refers to potential infinity and dark elements. Visible elements form
    only a potentially infinite collection.

    Presumably that's why you teach history courses now -- you can avoid
    having to write down even the most basic definitions of WMaths sets.

    At the end of the course I talk about the present state of the art. For instance this argument which is in general understood without ado:

    All positive fractions

    1/1, 1/2, 1/3, 1/4, ...
    2/1, 2/2, 2/3, 2/4, ...
    3/1, 3/2, 3/3, 3/4, ...
    4/1, 4/2, 4/3, 4/4, ...
    ...

    can be indexed by the Cantor function k = (m + n - 1)(m + n - 2)/2 + m
    which attaches the index k to the fraction m/n in Cantor's sequence

    1/1, 1/2, 2/1, 1/3, 2/2, 3/1, 1/4, 2/3, 3/2, 4/1, 1/5, 2/4, 3/3, 4/2, 5/1, 1/6, 2/5, 3/4, ... .

    Its terms can be represented by matrices. When we attach all indeXes k =
    1, 2, 3, ..., for clarity represented by X, to the integer fractions m/1
    and indicate missing indexes by hOles O, then we get the matrix M(0) as starting position:

    XOOO... XXOO... XXOO... XXXO... ... XXXX...
    XOOO... OOOO... XOOO... XOOO... ... XXXX...
    XOOO... XOOO... OOOO... OOOO... ... XXXX...
    XOOO... XOOO... XOOO... OOOO... ... XXXX...
    ... ... ... ... ...
    M(0) M(2) M(3) M(4) M(∞)

    M(1) is the same as M(0) because index 1 remains at 1/1. In M(2) index 2
    from 2/1 has been attached to 1/2. In M(3) index 3 from 3/1 has been
    attached to 2/1. In M(4) index 4 from 4/1 has been attached to 1/3. Successively all fractions of the sequence get indexed. In the limit,
    denoted by M(∞), we see no fraction without index remaining. Note that
    the only difference to Cantor's enumeration is that Cantor does not render account for the source of the indices.

    Every X, representing the index k, when taken from its present fraction
    m/n, is replaced by the O taken from the fraction to be indexed by this k.
    Its last carrier m/n will be indexed later by another index. Important is
    that, when continuing, no O can leave the matrix as long as any index X
    blocks the only possible drain, i.e., the first column. And if leaving,
    where should it settle?

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From joes@21:1/5 to All on Sun Jul 14 13:45:17 2024
    Am Sun, 14 Jul 2024 13:28:49 +0000 schrieb WM:
    Le 14/07/2024 à 00:55, joes a écrit :
    Am Fri, 12 Jul 2024 17:13:09 +0000 schrieb WM:

    There are some rules for comparing sets which are not subset and
    superset, namely symmetry:
    The real numbers in intervals of same length like (n, n+1] are
    equinumerous.
    What is their number?
    It is dark, cannot be expressed in finite numbers. But certainly it is
    larger than |ℕ|.
    That's fucking useless. I want SOME number.

    In fact every interval contains uncountably many numbers.
    Countable and uncountable are nonsense notions.

    Further there is a rule of construction: The rational numbers are
    |ℚ| = 2|ℕ|^2 + 1.
    No, they are countable: bijective to the naturals.
    All sets have the same number of elements? Laughable.
    No, the reals for example are uncountable.

    And what would this expression mean if you can't manipulate it?
    We have some measure for relative size.
    Only if you wrongly regard |N| as a natural number itself.

    Of course the complex numbers are infinitely many more than the reals.
    That's the subset rule.
    These rules have not lead to any contradiction, to my knowledge.
    Please try.
    Consider the set of even numbers. Clearly they are bijective to the
    naturals,
    This proves the bijection wrong. The reason is that all elements of the bijection have ℵo successors. The bijection concerns only the
    potentially infinite collections, they are the same for all well-ordered sets.
    I don't understand. What is the same?
    What is the matter with the successors?

    yet a subset of them. How many are there?
    Even integers |ℕ|, even naturals |ℕ|/2, both with precision of one or two.
    Can you define the division? What does precision have to do with it?

    --
    Am Fri, 28 Jun 2024 16:52:17 -0500 schrieb olcott:
    Objectively I am a genius.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Sun Jul 14 13:28:49 2024
    Le 14/07/2024 à 00:55, joes a écrit :
    Am Fri, 12 Jul 2024 17:13:09 +0000 schrieb WM:

    There are some rules for comparing sets which are not subset and
    superset, namely symmetry:
    The real numbers in intervals of same length like (n, n+1] are
    equinumerous.
    What is their number?

    It is dark, cannot be expressed in finite numbers. But certainly it is
    larger than |ℕ|.

    In fact every interval contains uncountably many numbers.

    Countable and uncountable are nonsense notions.

    Further there is a rule of construction: The rational numbers are |ℚ| =
    2|ℕ|^2 + 1.
    No, they are countable: bijective to the naturals.

    All sets have the same number of elements? Laughable.

    And what would this expression mean if you can't manipulate it?

    We have some measure for relative size.

    The real numbers are infinitely more than the rational numbers because
    every rational multiplied by an irrational is irrational.

    Of course the complex numbers are infinitely many more than the reals.
    That's the subset rule.
    These rules have not lead to any contradiction, to my knowledge. Please
    try.
    Consider the set of even numbers. Clearly they are bijective to the
    naturals,

    This proves the bijection wrong. The reason is that all elements of the bijection have ℵo successors. The bijection concerns only the
    potentially infinite collections, they are the same for all well-ordered
    sets.

    yet a subset of them. How many are there?

    Even integers |ℕ|, even naturals |ℕ|/2, both with precision of one or
    two.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Sun Jul 14 14:22:29 2024
    Le 14/07/2024 à 15:45, joes a écrit :
    Am Sun, 14 Jul 2024 13:28:49 +0000 schrieb WM:
    Le 14/07/2024 à 00:55, joes a écrit :
    Am Fri, 12 Jul 2024 17:13:09 +0000 schrieb WM:

    There are some rules for comparing sets which are not subset and
    superset, namely symmetry:
    The real numbers in intervals of same length like (n, n+1] are
    equinumerous.
    What is their number?
    It is dark, cannot be expressed in finite numbers. But certainly it is
    larger than |ℕ|.
    That's fucking useless. I want SOME number.

    Then try to find it. Research has just started some years ago.

    In fact every interval contains uncountably many numbers.
    Countable and uncountable are nonsense notions.

    Further there is a rule of construction: The rational numbers are
    |ℚ| = 2|ℕ|^2 + 1.
    No, they are countable: bijective to the naturals.
    All sets have the same number of elements? Laughable.
    No, the reals for example are uncountable.

    Every infinite set is uncountable.

    The bijection concerns only the
    potentially infinite collections, they are the same for all well-ordered
    sets.
    I don't understand. What is the same?

    The potentially infinite number.


    yet a subset of them. How many are there?
    Even integers |ℕ|, even naturals |ℕ|/2, both with precision of one or
    two.
    Can you define the division? What does precision have to do with it?

    If the elements of |ℕ| are distributed equally into two sets, then each
    one has |ℕ|/2 elements, +/- 1.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Sun Jul 14 17:25:14 2024
    Am 14.07.2024 um 16:22 schrieb WM:
    Le 14/07/2024 à 15:45, joes a écrit :
    Am Sun, 14 Jul 2024 13:28:49 +0000 schrieb WM:

    even naturals |ℕ|/2, [...] with precision of one or [...]

    Can you define the division? What does precision have to do with it?

    If the elements of ℕ are distributed equally into two sets, then each
    one has |ℕ|/2 elements, +/- 1.

    Faszinierend, Mückenheim.

    Und wenn wir IN in abzählbar unendlich viele anzählbar unendliche
    Teilmengen zerlegen, wieviele Elemente hat dann so eine Teilmenge im
    Schnitt?

    Also
    T_1 = {1, 2, 4, 7, ...}
    T_2 = {3, 5, 8, 12, ...}
    T_3 = {6, 9, 13,18 ...}
    :

    |T_1| = ?
    |T_2| = ?
    |T_3| = ?
    usw.

    Und sollte dann nicht auch

    |T_1| + |T_2| + |T_3| + ... = |IN| gelten?

    ____________________________


    Wir können es aber auch einfacher machen:

    Sei P die Menge der Primzahlen. |P| = ? und |IN \ P| = ?

    Auch hier sollte dann wohl

    |P| + |IN \ P| = |IN|

    sein. :-)

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Sun Jul 14 17:47:16 2024
    Am 14.07.2024 um 15:09 schrieb WM:
    Le 14/07/2024 à 03:30, Ben Bacarisse a écrit :

    the "surprising" result of WMaths that E in P and P \ {E} = P

    The "surprising" result of Ben Bacarisse's math: card({a, b, c}) = 3,
    even for a = b = c.

    The "surprising" result of FromTheRafters's math: From Ex(x = {a, b, c})
    we can conclude that a =/= b, a =/= c and b =/= c. (Actually, {6, 3+3}
    contains zwo elements, namely 6 and 3+3. Hence card({6, 3+3}) = 2.)

    Names/Terms in these new math approaches have magical power!

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Sun Jul 14 17:32:21 2024
    Am 14.07.2024 um 16:22 schrieb WM:
    Le 14/07/2024 à 15:45, joes a écrit :
    Am Sun, 14 Jul 2024 13:28:49 +0000 schrieb WM:
    Le 14/07/2024 à 00:55, joes a écrit :

    [The rational numbers] are countable: bijective to the naturals.

    All sets have the same number of elements? [WM]

    No, the reals for example are uncountable.

    Every infinite set is uncountable.

    Nope. The set of natural numbers is countable infinite.

    See: https://en.wikipedia.org/wiki/Countable_set
    and: https://en.wikipedia.org/wiki/Uncountable_set

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Ben Bacarisse@21:1/5 to Moebius on Sun Jul 14 23:40:32 2024
    Moebius <invalid@example.invalid> writes:

    The "surprising" result of Ben Bacarisse's math: card({a, b, c}) = 3, even for a = b = c.

    You know perfectly well that I've said no such thing.

    --
    Ben.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Ben Bacarisse@21:1/5 to wolfgang.mueckenheim@tha.de on Sun Jul 14 23:39:25 2024
    WM <wolfgang.mueckenheim@tha.de> writes:

    Le 14/07/2024 03:30, Ben Bacarisse a crit :
    WM <wolfgang.mueckenheim@tha.de> writes:

    Le 13/07/2024 02:12, Ben Bacarisse a crit :
    WM <wolfgang.mueckenheim@tha.de> writes:
    (AKA Dr. Wolfgang Mckenheim or Mueckenheim who teaches "Geschichte des >>>> Unendlichen"

    and "Kleine Geschichte der Mathematik"
    Optional, I hope.

    at Hochschule Augsburg.)

    Meanwhile Technische Hochschule Augsburg.
    A sound name change that reflects the technical college's focus.

    Le 11/07/2024 02:46, Ben Bacarisse a crit :
    "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> writes:

    {a, b, c} vs { 3, 4, 5 }

    Both have the same number of elements,
    That will fall down for infinite sets unless, by decree, you state that >>>>>> your meaning of "more" makes all infinite sets have the same number of >>>>>> elements.

    There are some rules for comparing sets which are not subset and superset,
    namely symmetry:
    Still nothing about defining set membership, equality and difference in >>>> WMaths though.

    Are my rules appearing too reasonable for a believer in equinumerosity of >>> prime numbers and algebraic numbers?
    You can define equinumerosity any way you like.

    And I can prove that Cantor's way leads astray.

    But no journal will touch it. I can't remember which crank excuse you
    use to explain that.

    But you can't claim the
    "surprising" result of WMaths that E in P and P \ {E} = P

    That refers to potential infinity and dark elements. Visible elements form only a potentially infinite collection.

    You cut the end of the sentence of course because you want to divert
    attention from that fact that you can't define set membership,
    difference and equality in WMaths. The waffle words will not get you
    past that fact that without those definitions you have no alternative to
    offer.

    Presumably that's why you teach history courses now -- you can avoid
    having to write down even the most basic definitions of WMaths sets.

    At the end of the course I talk about the present state of the art.

    Do you cite the journal that has published your proof that Cantor is
    wrong? Do you give the "proper" definitions for set membership,
    difference and equality once you admit that those in your textbook are
    only approximations? Do you present a proof of the "surprising" result
    that sets E and P exist with E in P and P \ {E} = P?

    Fortunately for you, your college has no degree program in mathematics
    so none of your students know better. Unfortunately for your students,
    you don't know better.

    --
    Ben.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Mon Jul 15 03:03:31 2024
    Am 14.07.2024 um 17:25 schrieb Moebius:
    Am 14.07.2024 um 16:22 schrieb WM:

    If the elements of ℕ are distributed equally into two sets, then each
    one has |ℕ|/2 elements, +/- 1.

    Faszinierend, Mückenheim.

    Und wenn wir IN in abzählbar unendlich viele abzählbar unendliche Teilmengen zerlegen, wieviele Elemente hat dann so eine Teilmenge im
    Schnitt?

    Also
    T_1 = {1, 2, 4, 7, ...}
    T_2 = {3, 5, 8, 12, ...}
    T_3 = {6, 9, 13,18 ...}
     :

    |T_1| = ?
    |T_2| = ?
    |T_3| = ?
    usw.

    Und sollte dann nicht auch

    |T_1| + |T_2| + |T_3| + ... = |IN| gelten?


    |T_i| ist dann wohl |IN|/oo (für alle i e IN), oder so etwas, also
    vermutlich recht klein!

    0 kann es schlecht sein, denn 0 + 0 + 0 + ... ist vermutlich (selbst in Mückenhausen) immer noch 0, nein?

    Wenn es aber > 0 ist, so ist

    |T_1| + |T_2| + |T_3| + ...

    vermutlich ziemlich groß. Wie groß ist eigentlich |IN|, und was genau
    für ein mathematisches Objekt soll das sein, Mückenheim?

    Haben Sie das schon iw. definiert? Ist es eine natürliche, reelle oder anderswie geartete Zahl? Viell. sogar eine Kardinalzahl? Wo genau haben
    Sie diese Art von Zahlen denn definiert?

    Oder ist es nicht viel eher so, dass Sie einfach nur saudummen
    Scheißdreck daherreden?

    Wir können es aber auch einfacher machen:

    Sei P die Menge der Primzahlen. |P| = ? und |IN \ P| = ?

    Auch hier sollte dann wohl

    |P| + |IN \ P| = |IN|

    sein. :-)

    Hier erheben sich die gleichen Fragen. (a) Welche mathem. Objekte werden
    denn durch |P| und |IN \ P| bezeichnet? (b) Wie sind denn diese Objekte DEFINIERT? (c) Wie beweisen Sie dann (auf der Basis dieser
    Definitionen), dass |P| + |IN \ P| = |IN| ist?

    Wie soll ich es sagen, Mückenheim: Ihr dummes Geschwalle reicht als
    Beweis dafür nicht aus.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Mon Jul 15 04:09:15 2024
    Am 15.07.2024 um 03:03 schrieb Moebius:
    Am 14.07.2024 um 17:25 schrieb Moebius:
    Am 14.07.2024 um 16:22 schrieb WM:

    If the elements of ℕ are distributed equally into two sets, then each
    one has |ℕ|/2 elements, +/- 1.

    Faszinierend, Mückenheim.

    Und wenn wir IN in abzählbar unendlich viele abzählbar unendliche
    Teilmengen zerlegen, wieviele Elemente hat dann so eine Teilmenge im
    Schnitt?

    Also
    T_1 = {1, 2, 4, 7, ...}
    T_2 = {3, 5, 8, 12, ...}
    T_3 = {6, 9, 13,18 ...}
      :

    |T_1| = ?
    |T_2| = ?
    |T_3| = ?
    usw.

    Und sollte dann nicht auch

    |T_1| + |T_2| + |T_3| + ... = |IN| gelten?


    |T_i| ist dann wohl |IN|/oo (für alle i e IN), oder so etwas, also vermutlich recht klein!

    0 kann es schlecht sein, denn 0 + 0 + 0 + ... ist vermutlich (selbst in Mückenhausen) immer noch 0, nein?

    Wenn es aber > 0 ist, so ist

    |T_1| + |T_2| + |T_3| + ...

    vermutlich ziemlich groß. Wie groß ist eigentlich |IN|, und was genau
    für ein mathematisches Objekt soll das sein, Mückenheim?

    Haben Sie das schon iw. definiert? Ist es eine natürliche, reelle oder anderswie geartete Zahl? Viell. sogar eine Kardinalzahl? Wo genau haben
    Sie diese Art von Zahlen denn definiert?

    Oder ist es nicht viel eher so, dass Sie einfach nur saudummen
    Scheißdreck daherreden?

    Wir können es aber auch einfacher machen:

    Sei P die Menge der Primzahlen. |P| = ? und |IN \ P| = ?

    Auch hier sollte dann wohl

    |P| + |IN \ P| = |IN|

    sein. :-)

    Hier erheben sich die gleichen Fragen. (a) Welche mathem. Objekte werden
    denn durch |P| und |IN \ P| bezeichnet? (b) Wie sind denn diese Objekte DEFINIERT? (c) Wie beweisen Sie dann (auf der Basis dieser
    Definitionen), dass |P| + |IN \ P| = |IN| ist?

    Wie soll ich es sagen, Mückenheim: Ihr dummes Geschwalle reicht als
    Beweis dafür nicht aus.

    Wo wir gerade dabei sind:

    Sie sagten doch, dass mit IN = {1, 2, 3, ...} gilt:

    |IN \ {1}| = |IN| - 1

    Demnach müsste wohl gelten:

    |IN \ {1} \ {3}| = |IN|- 1 - 1 = |IN| - {1 + 1}

    usw.

    Also schließlich:

    |IN \ {1} \ {3} \ {5} \ ... | = |IN| - 1 - 1 - 1 - ... = |IN| - {1 + 1 +
    1 + ...}.

    Andererseits behaupten Sie auch, dass

    |IN \ {1} \ {3} \ {5} \ ... | = |G| = |IN/2| ist.

    Demnach müsste also

    1 + 1 + 1 + ... = |IN|/2 sein.

    Das ist interessant!

    Müsste dann aber nicht auch

    |IN \ {1} \ {4} \ {6} \ ... | = |P| = |IN/2| sein?

    Wegen:

    |IN \ {1} \ {4} \ {6} \ ... | = |IN| - 1 - 1 - 1 - ... = |IN| - {1 + 1 +
    1 + ...} = |IN| - |IN|/2 = |IN|/2.

    Mehr noch, müsste dann nicht auch |IN| = |IN|/2 sein?

    Wegen:

    |{} u {1} u {2} u {3} u ...| = 0 + 1 + 1 + 1 + ... = 1 + 1 + 1 + ... =
    |IN|/2.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Mon Jul 15 12:38:31 2024
    Le 14/07/2024 à 17:25, Moebius a écrit :
    Am 14.07.2024 um 16:22 schrieb WM:
    Le 14/07/2024 à 15:45, joes a écrit :
    Am Sun, 14 Jul 2024 13:28:49 +0000 schrieb WM:

    even naturals |ℕ|/2, [...] with precision of one or [...]

    Can you define the division? What does precision have to do with it?

    If the elements of ℕ are distributed equally into two sets, then each
    one has |ℕ|/2 elements, +/- 1.

    Faszinierend, Mückenheim.

    Und wenn wir IN in abzählbar unendlich viele anzählbar unendliche Teilmengen zerlegen, wieviele Elemente hat dann so eine Teilmenge im
    Schnitt?

    Countable is not a fixed number. |ℕ| is counable, |ℕ|^2 is also
    countable, and much larger sets of |ℕ|^n elements are countable too.

    Also
    T_1 = {1, 2, 4, 7, ...}
    T_2 = {3, 5, 8, 12, ...}
    T_3 = {6, 9, 13,18 ...}
    :

    |T_1| = ?
    |T_2| = ?
    |T_3| = ?
    usw.

    Rechen kann ich |{1, 4, 7, ...}| = |{2, 5, 8, }| = |ℕ|/3.

    Und sollte dann nicht auch

    |T_1| + |T_2| + |T_3| + ... = |IN| gelten?

    Nein, denn es fehlen die Zahlen 10, 14, 15, 19, 20, ...

    ____________________________


    Wir können es aber auch einfacher machen:

    Sei P die Menge der Primzahlen. |P| = ? und |IN \ P| = ?

    P << |ℕ|/2.
    P < |ℕ|/n für sehr viele definierbare natürliche Zahlen n.

    Auch hier sollte dann wohl

    |P| + |IN \ P| = |IN|

    sein. :-)

    Ja, unbedingt.

    Gruß, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Mon Jul 15 13:26:25 2024
    Le 15/07/2024 à 00:39, Ben Bacarisse a écrit :
    WM <wolfgang.mueckenheim@tha.de> writes:

    You can define equinumerosity any way you like.

    And I can prove that Cantor's way leads astray.

    But no journal will touch it. I can't remember which crank excuse you
    use to explain that.

    Simple: The journals are owned by matheologians and stupids. I have never
    tried to address them.
    Further all that stuff including this proof has been published as a book.

    Presumably that's why you teach history courses now -- you can avoid
    having to write down even the most basic definitions of WMaths sets.

    At the end of the course I talk about the present state of the art.

    Do you cite the journal that has published your proof that Cantor is
    wrong?

    I could do so:

    "Does Set Theory Cause Perceptual Problems?", viXra 2017-02-26
    "Not enumerating all positive rational numbers", viXra 2017-02-26
    "The union is not the limit.", viXra 2017-03-06
    "Failure of the Diagonal Argument", viXra 2017-03-13
    "Set Theory or Slipper Animalcule: Who Wins?", viXra 2017-03-13
    "Proof of the existence of dark numbers (bilingual version)", viXra (Nov
    2022)
    "Shortest Proof of Dark Numbers", viXra (May 2023)
    "Seven Internal Contradictions of Set Theory", viXra (Dec 2023)
    "Transfinity - A Source Book", SSRN-Elsevier (April 2024)
    "Proof of the existence of dark numbers (bilingual version)", OSFPREPRINTS
    (Nov 2022)
    "Dark natural numbers in set theory", ResearchGate, October 2019
    "Dark natural numbers in set theory" II, ResearchGate, October 2019 "Transfinity - A Source Book", ResearchGate, October 2019
    "What scatters the space?", MResearchGate, May 2020
    "Countability Contradicted", ResearchGate, February 2022
    "Proof of the existence of dark numbers (bilingual version)",
    ResearchGate, Nov 2022
    "The seven deadly sins of set theory", ResearchGate, Dec 2023
    "Dark numbers", Academia.edu (2020)
    "Transfinity - A Source Book", Academia.edu (31 Dec 2020)
    "Countability contradicted", Academia.edu (Feb 2022)
    "Proof of the existence of dark numbers (bilingual version)", Academia.edu
    (Nov 2022)
    "The seven deadly sins of set theory", Academia.edu (Dec 2023)
    "Dark numbers", Quora (May 2023)
    "Sequences and Limits", Advances in Pure Mathematics 5, 2015, pp. 59 - 61. "Transfinity - A Source Book", ELIVA Press, Chisinau 2024.


    But I do not quote all that (some of the above with over 1000 reads - more
    than usual for maths journals) like I do not quote Newton's or Euler's or Gauss' or Cauchy's original essays.

    Do you give the "proper" definitions for set membership,

    That cannot be done for potentially infinite collections because they have
    no fixed membership.

    difference and equality once you admit that those in your textbook are
    only approximations? Do you present a proof of the "surprising" result
    that sets E and P exist with E in P and P \ {E} = P?

    Fortunately for you, your college has no degree program in mathematics
    so none of your students know better. Unfortunately for your students,
    you don't know better.

    There has not yet been any disprove of my simplest proof (that I told you recently and that you were wise enaugh to let it uncommented). The only daredevil who tried it, Jim Burns, has to assume that by exchangig one of
    the elements can disappear. No reason to pay attention. And the nonsense
    you once tried to sell to my former students has been rejected by them
    flatly.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Mon Jul 15 14:08:10 2024
    Le 15/07/2024 à 04:09, Moebius a écrit :

    Sie sagten doch, dass mit IN = {1, 2, 3, ...} gilt:

    |IN \ {1}| = |IN| - 1

    Demnach müsste wohl gelten:

    |IN \ {1} \ {3}| = |IN|- 1 - 1 = |IN| - {1 + 1}

    usw.

    Natürlich.

    Also schließlich:

    |IN \ {1} \ {3} \ {5} \ ... | = |IN| - 1 - 1 - 1 - ... = |IN| - {1 + 1 +
    1 + ...}.

    Andererseits behaupten Sie auch, dass

    |IN \ {1} \ {3} \ {5} \ ... | = |G| = |IN/2| ist.

    Demnach müsste also

    1 + 1 + 1 + ... = |IN|/2 sein.

    Natürlich, da |ℕ|/2 Einsen dort auftreten, wie aus der Konstruktion hervorgeht.

    Das ist interessant!

    Das finde ich auch.

    Müsste dann aber nicht auch

    |IN \ {1} \ {4} \ {6} \ ... | = |P| = |IN/2| sein?

    Nein, es gibt bekanntlich beliebig große Primzahllücken.

    Wegen:

    |IN \ {1} \ {4} \ {6} \ ... | = |IN| - 1 - 1 - 1 - ... = |IN| - {1 + 1 +
    1 + ...} = |IN| - |IN|/2 = |IN|/2.

    Du musst angeben, wieviele Elemente Du subtrahierst. |P| << |ℕ|.

    Gruß, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From joes@21:1/5 to All on Mon Jul 15 13:41:59 2024
    Am Mon, 15 Jul 2024 13:26:25 +0000 schrieb WM:
    Le 15/07/2024 à 00:39, Ben Bacarisse a écrit :
    WM <wolfgang.mueckenheim@tha.de> writes:

    You can define equinumerosity any way you like.
    And I can prove that Cantor's way leads astray.
    But no journal will touch it. I can't remember which crank excuse you
    use to explain that.
    Simple: The journals are owned by matheologians and stupids. I have
    never tried to address them.
    Further all that stuff including this proof has been published as a
    book.
    Standing in the face of the establishment is a sure sign of a crackpot.

    Presumably that's why you teach history courses now -- you can avoid
    having to write down even the most basic definitions of WMaths sets.
    At the end of the course I talk about the present state of the art.
    Do you cite the journal that has published your proof that Cantor is
    wrong?
    "Does Set Theory Cause Perceptual Problems?", viXra 2017-02-26
    "Transfinity - A Source Book", SSRN-Elsevier (April 2024)
    "Proof of the existence of dark numbers (bilingual version)",
    OSFPREPRINTS (Nov 2022)
    "Dark numbers", Academia.edu (2020)
    "Dark numbers", Quora (May 2023)
    "Sequences and Limits", Advances in Pure Mathematics 5, 2015, pp. 59 -
    61.
    "Transfinity - A Source Book", ELIVA Press, Chisinau 2024.
    Cutting down to different platforms, I see only one book and one article.
    The others count as selfpublished and haha, quora.

    Do you give the "proper" definitions for set membership,
    That cannot be done for potentially infinite collections because they
    have no fixed membership.
    And that is why no one uses it.

    difference and equality once you admit that those in your textbook are
    only approximations? Do you present a proof of the "surprising" result
    that sets E and P exist with E in P and P \ {E} = P?
    There has not yet been any disprove of my simplest proof (that I told
    you recently and that you were wise enaugh to let it uncommented). The
    only daredevil who tried it, Jim Burns, has to assume that by exchangig
    one of the elements can disappear. No reason to pay attention. And the nonsense you once tried to sell to my former students has been rejected
    by them flatly.
    Oh really? What do your students say?

    --
    Am Fri, 28 Jun 2024 16:52:17 -0500 schrieb olcott:
    Objectively I am a genius.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Mon Jul 15 14:46:34 2024
    Le 15/07/2024 à 15:41, joes a écrit :
    Am Mon, 15 Jul 2024 13:26:25 +0000 schrieb WM:

    Presumably that's why you teach history courses now -- you can avoid >>>>> having to write down even the most basic definitions of WMaths sets.
    At the end of the course I talk about the present state of the art.
    Do you cite the journal that has published your proof that Cantor is
    wrong?
    "Does Set Theory Cause Perceptual Problems?", viXra 2017-02-26
    "Transfinity - A Source Book", SSRN-Elsevier (April 2024)
    "Proof of the existence of dark numbers (bilingual version)",
    OSFPREPRINTS (Nov 2022)
    "Dark numbers", Academia.edu (2020)
    "Dark numbers", Quora (May 2023)
    "Sequences and Limits", Advances in Pure Mathematics 5, 2015, pp. 59 -
    61.
    "Transfinity - A Source Book", ELIVA Press, Chisinau 2024.
    Cutting down to different platforms, I see only one book and one article.
    The others count as selfpublished and haha, quora.

    Then I am in good company. Cantor self-published his results too. And he
    even paid for that.

    Do you give the "proper" definitions for set membership,
    That cannot be done for potentially infinite collections because they
    have no fixed membership.
    And that is why no one uses it.

    You are not aware that you use it?

    "there is no single fixed number less than all/every other number.
    However, every number has a smaller one. Do you understand the
    difference?"

    Do you? That is potential infinity. For every number you _construct_ a
    smaller one. If it would be there already, then you could have chosen it.

    And the
    nonsense you once tried to sell to my former students has been rejected
    by them flatly.
    Oh really? What do your students say?

    That was some years ago. I don't remember the details, only the result. Probably the idea was discussed that an inclusion-monotonic sequence of infinite terms could have an empty intersection. Every sensible student recognizes that this is impossible. As long as all terms contain an
    infinite subset of the first set.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Mon Jul 15 18:02:06 2024
    Am 15.07.2024 um 14:38 schrieb WM:
    Le 14/07/2024 à 17:25, Moebius a écrit :

    Nochmal, Da Du offenbar selbst zum Scheißen zu blöde bist.

    Und wenn wir IN in abzählbar unendlich viele abzählbar unendliche
    Teilmengen _zerlegen_, wieviele Elemente hat dann so eine Teilmenge im
    Schnitt?

    Also [z. B.]

    T_1 = {1, 2, 4, 7, ...}
    T_2 = {3, 5, 8, 12, ...}
    T_3 = {6, 9, 13,18 ...}
      :

    Die PUNKTE (:) hier bedeuten, dass wir über eine UNENDLICHE Menge
    (Folge) von Teilmengen sprechen, Du Depp.

    Also T_1, T_2, T_3, und so weiter, ad infinitum.

    Also über eine Folge (T_n)_(n e IN), wo T_n c IN für jedes n e IN und
    für alle n e IN, m e IN: n =/= m -> T_n n T_m = { }.

    |T_1| = ?
    |T_2| = ?
    |T_3| = ?
    usw. [ad infinitum.]

    Rech[n]en kann ich

    Ja, schön, Mückenheim, aber lass uns beim Thema bleiben.

    Und sollte dann nicht auch

    |T_1| + |T_2| + |T_3| + ... = |IN| gelten?

    Nein, denn es fehlen die Zahlen 10, 14, 15, 19, 20, ...

    Nein, die fehlen, nicht Du Depp.

    Gefragt ist hier nach SUM_(n=1..oo) |T_n|.

    Und für jedes n e IN gibt es ein k e IN, so dass n e T_k ist - nach der
    zwar nicht explizit angegebenen aber offensichtlichen Konstruktion der
    T_i (i e IN).

    Hinweis:

    T_1 = {1, 2, 4, 7, 11, 16, ...}
    T_2 = {3, 5, 8, 12, 17, ..}
    T_3 = {6, 9, 13, 18 ...}
    T_4 = {10, 14, 19, ...}
    T_5 = {15, 20, ...}
    :

    Das Schema ist offensichtlich, und ziemlich trivial.

    Das kleinste Element der Menge T_i ist i*(+1)/2.

    Nenen wir das kleinste Element der Menge T_i: T_i_1 und das
    nächstgrößere T_i_2 usw.

    Dann gilt für alle i e IN: T_i_2 = T_i_1 + i.

    Den Rest überlasse ich Dir zur Übung.

    ___________________________________________________________

    ALSO nochmal:

    Wegen

    1. U_(n e IN) T_n = IN, und
    2. T_i n T_j = {} für alle i =/= j

    sollte also wohl

    |T_1| + |T_2| + |T_3| + ... = SUM_(n=1..oo) |T_n| = |IN| gelten.

    UND WEITER:

    |T_i| ist dann wohl |IN|/oo (für alle i e IN), oder so etwas, also
    vermutlich recht klein!

    0 kann es schlecht sein, denn 0 + 0 + 0 + ... ist vermutlich (selbst in Mückenhausen) immer noch 0, nein?

    Wenn es aber > 0 ist, so ist

    |T_1| + |T_2| + |T_3| + ... = SUM_(n=1..oo) |T_n|

    vermutlich ziemlich groß. Wie groß ist eigentlich |IN| [und wie groß
    sind die |T_i| für i e IN], und was genau für ein mathematisches Objekt [mathematische Objekte] soll das [sollen die] sein, Mückenheim?

    Haben Sie das schon iw. definiert? Ist es eine [sind es] natürliche,
    reelle oder anderswie geartete Zahl[en]? Viell. sogar eine Kardinalzahl [Kardinalzahlen]? Wo genau haben Sie diese Art von Zahlen denn definiert?

    Oder ist es nicht viel eher so, dass Sie einfach nur saudummen
    Scheißdreck daherreden?

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Jim Burns@21:1/5 to All on Mon Jul 15 13:04:41 2024
    On 7/15/2024 9:26 AM, WM wrote:
    Le 15/07/2024 à 00:39, Ben Bacarisse a écrit :

    [...]

    The only daredevil who tried it, Jim Burns,
    has to assume that
    by exchangig one of the elements can disappear.

    Assume that ℕⁿᵒᵗᐧᵂᴹ is the set of finiteⁿᵒᵗᐧᵂᴹ ordinals.

    If α is finiteⁿᵒᵗᐧᵂᴹ, then α⁺¹ = α∪{α} is finiteⁿᵒᵗᐧᵂᴹ.
    If α ∈ ℕⁿᵒᵗᐧᵂᴹ, then α⁺¹ ∈ ℕⁿᵒᵗᐧᵂᴹ.

    f(α) = α⁺¹ is 1.to.1
    ¬∃β≠α: β⁺¹ = α⁺¹

    f: ℕⁿᵒᵗᐧᵂᴹ → ℕⁿᵒᵗᐧᵂᴹ\{0}: 1.to.1 ℕⁿᵒᵗᐧᵂᴹ ∋ 0 ∉ f(ℕⁿᵒᵗᐧᵂᴹ)
    'Bye, Bob!

    No reason to pay attention.

    E pur si muove.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Jim Burns@21:1/5 to Jim Burns on Mon Jul 15 13:39:07 2024
    On 7/15/2024 1:04 PM, Jim Burns wrote:
    On 7/15/2024 9:26 AM, WM wrote:
    Le 15/07/2024 à 00:39, Ben Bacarisse a écrit :

    [...]

    The only daredevil who tried it, Jim Burns,
    has to assume that
    by exchangig one of the elements can disappear.

    Assume that ℕⁿᵒᵗᐧᵂᴹ is the set of finiteⁿᵒᵗᐧᵂᴹ ordinals.

    If α is finiteⁿᵒᵗᐧᵂᴹ, then α⁺¹ = α∪{α} is finiteⁿᵒᵗᐧᵂᴹ.
    If α ∈ ℕⁿᵒᵗᐧᵂᴹ, then α⁺¹ ∈ ℕⁿᵒᵗᐧᵂᴹ.

    f(α) = α⁺¹ is 1.to.1
    ¬∃β≠α:  β⁺¹ = α⁺¹

    f: ℕⁿᵒᵗᐧᵂᴹ → ℕⁿᵒᵗᐧᵂᴹ\{0}: 1.to.1 ℕⁿᵒᵗᐧᵂᴹ ∋ 0 ∉ f(ℕⁿᵒᵗᐧᵂᴹ)
    'Bye, Bob!

    No reason to pay attention.

    E pur si muove.

    | What do you say to the leading philosophers of the faculty here,
    | to whom I have offered a thousand times of my own accord
    | to show my studies, but
    | who with the lazy obstinacy of a serpent who has eaten his fill
    | have never consented to look at planets, nor moon, nor telescope?
    | Verily, just as serpents close their ears,
    | so do these men close their eyes to the light of truth.
    |
    -- Karl Von Gebler, _Galileo Galilei_ p. 26 (1879),
    quoting Galileo's August 1610 letter to Kepler

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Python@21:1/5 to All on Mon Jul 15 20:31:17 2024
    Le 15/07/2024 à 16:46, WM a écrit :
    Le 15/07/2024 à 15:41, joes a écrit :
    Am Mon, 15 Jul 2024 13:26:25 +0000 schrieb WM:

    As usual Crank Wolfgang Mückenheim completely messed up with
    the quotes...

    ...
    And the
    nonsense you once tried to sell to my former students has been rejected
    by them flatly.
    Oh really? What do your students say?

    That was some years ago. I don't remember the details, only the result. Probably the idea was discussed that an inclusion-monotonic sequence of infinite terms could have an empty intersection. Every sensible student recognizes that this is impossible. As long as all terms contain an
    infinite subset of the first set.

    For the record, Ben proposed YOU to confront your idiotic so-called
    course (which is a shameful piece of shit) with this article :

    http://bsb.me.uk/dd-wealth.pdf

    This article is clearly and fully debunking your nonsense.

    Either you used your (fake) authority to shut down your students or
    you are lying here.

    I presented this article and your posts and "books" to students in
    a math course about math and CS. Then I asked (after a few weeks)
    what was their conclusion. Results: 100% recognized you, crank
    Wolfgang Mückenheim, as such.

    You are a shameful disgrace to German Academy, Mückenheim, you should
    be prosecuted for your lies and frauds.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Mon Jul 15 20:38:22 2024
    Am 15.07.2024 um 19:04 schrieb Jim Burns:
    On 7/15/2024 9:26 AM, WM wrote:

    No reason to pay attention.

    That's why he's reading (parts of) all your posts, of course.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Mon Jul 15 21:08:25 2024
    Am 15.07.2024 um 20:53 schrieb Moebius:
    Am 15.07.2024 um 20:31 schrieb Python:
    Le 15/07/2024 à 16:46, WM a écrit :

    Probably the idea was discussed that an inclusion-monotonic sequence
    of infinite terms could have an empty intersection.

    Which is an extremely trivial state of afairs, Mückenheim.

    Hint: There is no natural number in the intersection of all "endsegments".

    Extremely trivial reason: For each and every n e IN: n !e {n+1, n+2,
    n+3, ...}. In other words, An e IN: n !e INTERSECTION_(n e IN) {n+1,
    n+2, n+3, ...}.

    Hint: In (classical) mathematics {n+1, n+2, n+3, ...} is an infinite set
    for all n in IN.

    Did you ever meet a "sensible student" who claimed that there is an n in
    IN such that {n+1, n+2, n+3, ...} is finite?

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Mon Jul 15 20:53:26 2024
    Am 15.07.2024 um 20:31 schrieb Python:
    Le 15/07/2024 à 16:46, WM a écrit :

    Probably the idea was discussed that an inclusion-monotonic
    sequence of infinite terms could have an empty intersection.

    Which is an extremely trivial state of afairs, Mückenheim.

    Hint: There is no natural number in the intersection of all "endsegments".

    Extremely trivial reason: For each and every n e IN: n !e {n+1, n+2,
    n+3, ...}. In other words, An e IN: n !e INTERSECTION_(n e IN) {n+1,
    n+2, n+3, ...}.

    Every sensible student

    should be able to comprehend this simple fact.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Jim Burns@21:1/5 to Moebius on Mon Jul 15 15:28:39 2024
    On 7/15/2024 2:38 PM, Moebius wrote:
    Am 15.07.2024 um 19:04 schrieb Jim Burns:
    On 7/15/2024 9:26 AM, WM wrote:

    No reason to pay attention.

    That's why
    he's reading (parts of) all your posts,
    of course.

    Argumentum ad "LA LA LA LA LA! I CAN'T HEAR YOU!"
    Sad.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Tue Jul 16 12:54:05 2024
    Le 15/07/2024 à 19:04, Jim Burns a écrit :
    On 7/15/2024 9:26 AM, WM wrote:

    No reason to pay attention.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Tue Jul 16 13:03:56 2024
    Le 15/07/2024 à 20:53, Moebius a écrit :
    Am 15.07.2024 um 20:31 schrieb Python:
    Le 15/07/2024 à 16:46, WM a écrit :

    Probably the idea was discussed that an inclusion-monotonic
    sequence of infinite terms could have an empty intersection.

    Which is an extremely trivial state of afairs,

    Hint: There is no natural number in the intersection of all "endsegments".

    True. But you claim an empty intersection of all infinite endsegments,
    i.e. endsegments which keep an infinite number of naturals in common with
    E(1). That is false.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Tue Jul 16 13:09:45 2024
    Le 15/07/2024 à 20:38, Moebius a écrit :
    Am 15.07.2024 um 19:04 schrieb Jim Burns:
    On 7/15/2024 9:26 AM, WM wrote:

    No reason to pay attention.

    That's why he's reading (parts of) all your posts, of course.

    I am reading some in the hope of seeing him recover.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Tue Jul 16 13:08:25 2024
    Le 15/07/2024 à 21:08, Moebius a écrit :

    Hint: In (classical) mathematics {n+1, n+2, n+3, ...} is an infinite set
    for all n in IN.

    If always infinitely many numbers remain, then it is impossible to remove infinitely many numbers, namely all numbers.

    Did you ever meet a "sensible student" who claimed that there is an n in
    IN such that {n+1, n+2, n+3, ...} is finite?

    There are many students and matematicians who believe that all natural
    numbrs can be removed or simply applied, for instance for enzmerating
    purposes.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Tue Jul 16 16:06:44 2024
    Am 16.07.2024 um 15:08 schrieb WM:
    Le 15/07/2024 à 21:08, Moebius a écrit :

    Hint: In (classical) mathematics {n+1, n+2, n+3, ...} is an infinite
    set for all n in IN.

    If always <bla bla bla>

    Yeah whatever, Mückenheim.

    Question:

    Did you ever meet a "sensible student" who claimed that there is an n
    in IN such that {n+1, n+2, n+3, ...} is finite?

    There are many students and matematicians who believe that all natural
    numbrs can be removed or simply applied, for instance for enzmerating purposes.

    MAN, my question was: Did you ever meet a "sensible student" who claimed
    that there is an n in IN such that {n+1, n+2, n+3, ...} is finite?

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Tue Jul 16 16:08:52 2024
    Am 16.07.2024 um 15:03 schrieb WM:
    Le 15/07/2024 à 20:53, Moebius a écrit :
    Am 15.07.2024 um 20:31 schrieb Python:
    Le 15/07/2024 à 16:46, WM a écrit :

    Probably the idea was discussed that an inclusion-monotonic sequence
    of infinite terms could have an empty intersection.

    Which is an extremely trivial state of afairs,

    Hint: There is no natural number in the intersection of all
    "endsegments".

    True.

    Indeed!

    <nonsense deleted>

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Tue Jul 16 14:15:55 2024
    Le 16/07/2024 à 16:06, Moebius a écrit :
    Am 16.07.2024 um 15:08 schrieb WM:

    Question:

    Did you ever meet a "sensible student" who claimed that there is an n
    in IN such that {n+1, n+2, n+3, ...} is finite?

    There are many students and mathematicians who believe that all natural
    numbrs can be removed or simply applied, for instance for enzmerating
    purposes.

    MAN, my question was: Did you ever meet a "sensible student" who claimed
    that there is an n in IN such that {n+1, n+2, n+3, ...} is finite?

    {n+1, n+2, n+3, ...} is what remains.

    joes: IN UNENDLICH VIELEN SCHRITTEN wird jede Zahl erreicht.
    Cantor: "so erhält man den Inbegriff (ω) aller reellen algebraischen
    Zahlen [...] und kann mit Rücksicht auf diese Anordnung von der nten algebraischen Zahl reden, wobei keine einzige aus dem Inbegriffe (ω)
    vergessen ist."
    Natürlich könnte ich auch Studenten und Studentinnen nennen, die das verstanden haben, aber ich darf es nicht.

    Jedenfalls ist klar: Es bleibt keine übrig, let alone unendlich viele.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Tue Jul 16 16:21:25 2024
    Am 16.07.2024 um 16:15 schrieb WM:
    Le 16/07/2024 à 16:06, Moebius a écrit :
    Am 16.07.2024 um 15:08 schrieb WM:

    Question:

    Did you ever meet a "sensible student" who claimed that there is an
    n in IN such that {n+1, n+2, n+3, ...} is finite?

    There are many students and mathematicians who believe that all
    natural numbrs can be removed or simply applied, for instance for
    enzmerating purposes.

    MAN, my question was: Did you ever meet a "sensible student" who
    claimed that there is an n in IN such that {n+1, n+2, n+3, ...} is
    finite?

    {n+1, n+2, n+3, ...} is what remains.

    Ich nehme das für ein Nein. :-)

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Tue Jul 16 17:37:36 2024
    Am 15.07.2024 um 18:02 schrieb Moebius:
    Am 15.07.2024 um 14:38 schrieb WM:
    Le 14/07/2024 à 17:25, Moebius a écrit :

    Kommt da nochmal etwas, Mückenheim?

    Und wenn wir IN in abzählbar unendlich viele abzählbar unendliche
    Teilmengen _zerlegen_, wie viele Elemente hat dann so eine Teilmenge
    im Schnitt?

    Also [z. B.]

    T_1 = {1, 2, 4, 7, ...}
    T_2 = {3, 5, 8, 12, ...}
    T_3 = {6, 9, 13,18 ...}
     :

    Die PUNKTE (:) hier bedeuten, dass wir über eine UNENDLICHE Menge
    (Folge) von Teilmengen sprechen, Du Depp.

    Also T_1, T_2, T_3, und so weiter, ad infinitum.

    Also über eine Folge (T_n)_(n e IN), wo T_n c IN für jedes n e IN und
    für alle n e IN, m e IN: n =/= m -> T_n n T_m = { }.

    |T_1| = ?
    |T_2| = ?
    |T_3| = ?
    usw. [ad infinitum.]

    Rech[n]en kann ich

    Ja, schön, Mückenheim, aber lass uns beim Thema bleiben.

    Und sollte dann nicht auch

    |T_1| + |T_2| + |T_3| + ... = |IN| gelten?

    Nein, denn es fehlen die Zahlen 10, 14, 15, 19, 20, ...

    Nein, die fehlen nicht, Du Depp.

    Gefragt ist hier nach SUM_(n=1..oo) |T_n|.

    Und für jedes n e IN gibt es ein k e IN, so dass n e T_k ist - nach der
    zwar nicht explizit angegebenen aber offensichtlichen Konstruktion der
    T_i (i e IN).

    Hinweis:

    T_1 = {1, 2, 4, 7, 11, 16, ...}
    T_2 = {3, 5, 8, 12, 17, ..}
    T_3 = {6, 9, 13, 18 ...}
    T_4 = {10, 14, 19, ...}
    T_5 = {15, 20, ...}
    :

    Das Schema ist offensichtlich, und ziemlich trivial.

    Das kleinste Element der Menge T_i ist i*(i+1)/2.

    Nennen wir das kleinste Element der Menge T_i "T_i_1" und das nächstgrößere "T_i_2" usw.

    Dann gilt für alle i e IN: T_i_2 = T_i_1 + i.

    Den Rest überlasse ich Dir zur Übung.

    ___________________________________________________________

    ALSO nochmal:

    Wegen

    1. U_(n e IN) T_n = IN, und
    2. T_i n T_j = {} für alle i =/= j

    sollte also wohl

          |T_1| + |T_2| + |T_3| + ... = SUM_(n=1..oo) |T_n| = |IN| gelten.

    |T_i| ist dann wohl |IN|/oo (für alle i e IN), oder so etwas, also vermutlich recht klein!

    0 kann es schlecht sein, denn 0 + 0 + 0 + ... ist vermutlich (selbst in Mückenhausen) immer noch 0, nein?

    Wenn es aber > 0 ist, so ist

    |T_1| + |T_2| + |T_3| + ... = SUM_(n=1..oo) |T_n|

    vermutlich ziemlich groß. Wie groß ist eigentlich |IN| [und wie groß
    sind die |T_i| für i e IN], und was genau für ein mathematisches Objekt [mathematische Objekte] soll das [sollen die] sein, Mückenheim?

    Haben Sie das schon iw. definiert? Ist es eine [sind es] natürliche,
    reelle oder anderswie geartete Zahl[en]? Viell. sogar eine Kardinalzahl [Kardinalzahlen]? Wo genau haben Sie diese Art von Zahlen denn definiert?

    Oder ist es nicht viel eher so, dass Sie einfach nur saudummen
    Scheißdreck daherreden?

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Jim Burns@21:1/5 to All on Tue Jul 16 14:58:51 2024
    On 7/16/2024 9:03 AM, WM wrote:
    Le 15/07/2024 à 20:53, Moebius a écrit :
    Am 15.07.2024 um 20:31 schrieb Python:
    Le 15/07/2024 à 16:46, WM a écrit :

    Probably the idea was discussed that
    an inclusion-monotonic sequence of infinite terms
    could have an empty intersection.

    Which is an extremely trivial state of afairs,
    Hint:
    There is no natural number in
    the intersection of all "endsegments".

    True.

    And each end segment is infiniteⁿᵒᵗᐧᵂᴹ.

    There is no natural number in
    the intersection of all infiniteⁿᵒᵗᐧᵂᴹ end segments.

    But you claim an empty intersection of
    all infinite endsegments,

    Each natural number is not.in at least one infiniteⁿᵒᵗᐧᵂᴹ end segments.
    Each natural number is not.in the intersection of infinitesⁿᵒᵗᐧᵂᴹ. Only natural numbers are in natural.number end segments.
    The intersection of infinitesⁿᵒᵗᐧᵂᴹ is empty.

    Each end segment is infiniteⁿᵒᵗᐧᵂᴹ.

    i.e. endsegments which keep
    an infinite number of naturals in common with E(1).
    That is false.

    An infiniteᵂᴹ set is finiteⁿᵒᵗᐧᵂᴹ.but.humongousᴶᴮ.
    The finiteⁿᵒᵗᐧᵂᴹ.but.humongousᴶᴮ elements are darkᵂᴹ. 'Humongousᴶᴮ' is intentionally vague, as vague and wobbly as
    the distinction between 'darkᵂᴹ' and 'visibleᵂᴹ'.

    An infiniteⁿᵒᵗᐧᵂᴹ set is not something you (WM) address.
    It is not finiteⁿᵒᵗᐧᵂᴹ, not even finiteⁿᵒᵗᐧᵂᴹ.but.humongousᴶᴮ.

    ----
    ℕⁿᵒᵗᐧᵂᴹ is the set of finiteⁿᵒᵗᐧᵂᴹ.ordinals.

    For each finiteⁿᵒᵗᐧᵂᴹ set A
    there is a finiteⁿᵒᵗᐧᵂᴹ ordinal j ∈ ℕⁿᵒᵗᐧᵂᴹ such that
    {i:i<j} bijects with A

    No finiteⁿᵒᵗᐧᵂᴹ ordinal bijects with ℕⁿᵒᵗᐧᵂᴹ ℕⁿᵒᵗᐧᵂᴹ isn't a finiteⁿᵒᵗᐧᵂᴹ set.

    ----
    Define ordinal j = {i:i<j}

    For each finite ordinal j ∈ ℕⁿᵒᵗᐧᵂᴹ
    finite successor j⁺¹ = j∪{j} ∈ ℕⁿᵒᵗᐧᵂᴹ

    For each finite non.0 ordinal k ∈ ℕⁿᵒᵗᐧᵂᴹ
    finite predecessor k⁻¹ = ⋃k ∈ ℕⁿᵒᵗᐧᵂᴹ

    For each nonempty subset A ⊆ ℕⁿᵒᵗᐧᵂᴹ
    ⋂A ∈ A and is first in A

    ----
    Define
    f(j) = j⁺¹ = j∪{j}
    f: ℕⁿᵒᵗᐧᵂᴹ → ℕⁿᵒᵗᐧᵂᴹ\{0}: 1.to.1 ℕⁿᵒᵗᐧᵂᴹ ∋ 0 ∉ f(ℕⁿᵒᵗᐧᵂᴹ)
    'Bye, Bob!

    ℕⁿᵒᵗᐧᵂᴹ is an infiniteⁿᵒᵗᐧᵂᴹ set.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Tue Jul 16 19:33:54 2024
    Le 16/07/2024 à 20:58, Jim Burns a écrit :
    On 7/16/2024 9:03 AM, WM wrote:
    Le 15/07/2024 à 20:53, Moebius a écrit :
    Am 15.07.2024 um 20:31 schrieb Python:
    Le 15/07/2024 à 16:46, WM a écrit :

    Probably the idea was discussed that
    an inclusion-monotonic sequence of infinite terms
    could have an empty intersection.

    Which is an extremely trivial state of afairs,
    Hint:
    There is no natural number in
    the intersection of all "endsegments".

    True.

    And each end segment is infiniteⁿᵒᵗᐧᵂᴹ.

    Each number that can be used for bijections has an infinite endsegment. Therefore the following statements are false:
    joes: IN UNENDLICH VIELEN SCHRITTEN wird jede Zahl erreicht.
    Cantor: "such that every element of the set stands at a definite position
    of this sequence"

    The ℵo terms of the infinite endsegments cannot be deleted in steps.

    There is no natural number in
    the intersection of all infiniteⁿᵒᵗᐧᵂᴹ end segments.

    What about the infinitely many numbers which are remainimg from E(1)?

    But you claim an empty intersection of
    all infinite endsegments,

    Each natural number is not.in at least one infiniteⁿᵒᵗᐧᵂᴹ end segments.

    What numbers constitute the infinite endsegment which is common to all
    infinity endsegments.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Wed Jul 17 01:07:24 2024
    Am 17.07.2024 um 00:35 schrieb Moebius:

    Ach, Mückenheim, wie kann ein (halbwegs) gebildeter Mensch so dumm sein
    wie Sie?

    Manchmal komme ich mir wirklich vor, wie ein Psychiater, der versucht,
    Sie "in die richtige Spur" zurückzubringen. Leider bin ich kein
    Psychiater. :-/

    Bitte gehen Sie doch mal zu einem _richtigen_ Psychiater.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Wed Jul 17 00:35:39 2024
    Am 16.07.2024 um 21:33 schrieb WM:

    What numbers constitute the [...] endsegment which is common to all
    infinity endsegments.

    Hint: No numbers, since there is no endsegment "which which is common to
    all infinity endsegments".*)

    <facepalm>

    Ach, Mückenheim, wie kann ein (halbwegs) gebildeter Mensch so dumm sein
    wie Sie?

    ___________________________________

    *) The only set "which is common to all infinity endsegments" is the
    empty set.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Wed Jul 17 10:33:54 2024
    Le 17/07/2024 à 00:35, Moebius a écrit :
    Am 16.07.2024 um 21:33 schrieb WM:

    What numbers constitute the [...] endsegment which is common to all
    infinite endsegments.

    Hint: No numbers, since there is no endsegment "which which is common to
    all infinity endsegments".

    How can all be infinite without containg numbers inherited from E(1)?

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Wed Jul 17 13:41:09 2024
    Am 16.07.2024 um 17:37 schrieb Moebius:
    Am 15.07.2024 um 18:02 schrieb Moebius:
    Am 15.07.2024 um 14:38 schrieb WM:
    Le 14/07/2024 à 17:25, Moebius a écrit :

    Kommt da nochmal etwas, Mückenheim?

    Kommt da nochmal etwas, Mückenheim?

    Und wenn wir IN in abzählbar unendlich viele abzählbar unendliche
    Teilmengen _zerlegen_, wie viele Elemente hat dann so eine Teilmenge
    im Schnitt?

    Also [z. B.]

    T_1 = {1, 2, 4, 7, ...}
    T_2 = {3, 5, 8, 12, ...}
    T_3 = {6, 9, 13,18 ...}
     :

    Die PUNKTE (:) hier bedeuten, dass wir über eine UNENDLICHE Menge
    (Folge) von Teilmengen sprechen, Du Depp.

    Also T_1, T_2, T_3, und so weiter, ad infinitum.

    Also über eine Folge (T_n)_(n e IN), wo T_n c IN für jedes n e IN und
    für alle n e IN, m e IN: n =/= m -> T_n n T_m = { }.

    |T_1| = ?
    |T_2| = ?
    |T_3| = ?
    usw. [ad infinitum.]

    Rech[n]en kann ich

    Ja, schön, Mückenheim, aber lass uns beim Thema bleiben.

    Und sollte dann nicht auch

    |T_1| + |T_2| + |T_3| + ... = |IN| gelten?

    Nein, denn es fehlen die Zahlen 10, 14, 15, 19, 20, ...

    Nein, die fehlen nicht, Du Depp.

    Gefragt ist hier nach SUM_(n=1..oo) |T_n|.

    Und für jedes n e IN gibt es ein k e IN, so dass n e T_k ist - nach
    der zwar nicht explizit angegebenen aber offensichtlichen Konstruktion
    der T_i (i e IN).

    Hinweis:

    T_1 = {1, 2, 4, 7, 11, 16, ...}
    T_2 = {3, 5, 8, 12, 17, ..}
    T_3 = {6, 9, 13, 18 ...}
    T_4 = {10, 14, 19, ...}
    T_5 = {15, 20, ...}
     :

    Das Schema ist offensichtlich, und ziemlich trivial.

    Das kleinste Element der Menge T_i ist i*(i+1)/2.

    Nennen wir das kleinste Element der Menge T_i "T_i_1" und das
    nächstgrößere "T_i_2" usw.

    Dann gilt für alle i e IN: T_i_2 = T_i_1 + i.

    Den Rest überlasse ich Dir zur Übung.

    ___________________________________________________________

    ALSO nochmal:

    Wegen

    1. U_(n e IN) T_n = IN, und
    2. T_i n T_j = {} für alle i =/= j

    sollte also wohl

           |T_1| + |T_2| + |T_3| + ... = SUM_(n=1..oo) |T_n| = |IN| gelten.

    |T_i| ist dann wohl |IN|/oo (für alle i e IN), oder so etwas, also
    vermutlich recht klein!

    0 kann es schlecht sein, denn 0 + 0 + 0 + ... ist vermutlich (selbst
    in Mückenhausen) immer noch 0, nein?

    Wenn es aber > 0 ist, so ist

           |T_1| + |T_2| + |T_3| + ... = SUM_(n=1..oo) |T_n|

    vermutlich ziemlich groß. Wie groß ist eigentlich |IN| [und wie groß
    sind die |T_i| für i e IN], und was genau für ein mathematisches
    Objekt [mathematische Objekte] soll das [sollen die] sein, Mückenheim?

    Haben Sie das schon iw. definiert? Ist es eine [sind es] natürliche,
    reelle oder anderswie geartete Zahl[en]? Viell. sogar eine
    Kardinalzahl [Kardinalzahlen]? Wo genau haben Sie diese Art von Zahlen
    denn definiert?

    Oder ist es nicht viel eher so, dass Sie einfach nur saudummen
    Scheißdreck daherreden?

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Wed Jul 17 17:12:55 2024
    Am 17.07.2024 um 17:03 schrieb WM:

    <ziemlich wirres Zeugs> (Saudummer Scheißdreck.)

    Ja, danke, Mückenheim. Nur hast Du die eigentlichen Fragen nicht
    beantwortet.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Wed Jul 17 15:03:48 2024
    Le 17/07/2024 à 13:41, Moebius a écrit :

    T_1 = {1, 2, 4, 7, 11, 16, ...}
    T_2 = {3, 5, 8, 12, 17, ..}
    T_3 = {6, 9, 13, 18 ...}
    T_4 = {10, 14, 19, ...}
    T_5 = {15, 20, ...}
     :


    Wegen

    1. U_(n e IN) T_n = IN, und
    2. T_i n T_j = {} für alle i =/= j

    sollte also wohl

           |T_1| + |T_2| + |T_3| + ... = SUM_(n=1..oo) |T_n| = |IN| gelten.

    Natürlich. Die definierbaren natürlichen Zahlen wie 12 oder 19, also diejenigen, die Du als Ziffernfolgen angeben kannst, sind eine potentiell unendliche Kollektion, so wie jede Zeile und jede Spalte mit angebbarem
    Inhalt, ebenso wie die geraden Zahlen, die ungeraden Zahlen, die Dreieckszahlen, die Quadratzahlen, die Primzahlen usw. Diese Matrix
    (Cantors Abzählung liegt ja zugrunde) ist rechts und unten umgeben von
    einem unendlichen Rahmen aus dunklen Zahlen. Alles zusammen ergibt die
    Menge aller natürlichen Zahlen |ℕ|.

    Natürlich ist die Anzahl in einer Zeile oder Spalte viel kleiner als
    |ℕ|/2, die Anzahl der geraden oder ungeraden Zahlen. Aufgrund der Form
    der Matrix ist die Anzahl in einer Zeile oder Spalte sqrt(|ℕ|).

    Die Matrix aller positiven Brüche, die hier zwar nicht gefragt, aber interessant ist, hätte die Kantenlänge |ℕ|.

    Gruß, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Wed Jul 17 17:07:18 2024
    Am 17.07.2024 um 13:41 schrieb Moebius:
    Am 16.07.2024 um 17:37 schrieb Moebius:
    Am 15.07.2024 um 18:02 schrieb Moebius:
    Am 15.07.2024 um 14:38 schrieb WM:
    Le 14/07/2024 à 17:25, Moebius a écrit :

    Kommt da nochmal etwas, Mückenheim?

    Offenbar nicht. Du scheinst auf einfache Fragen, keine Antworten geben
    zu können. Findest Du das nicht merkwürdig? Ob es viell. damit zusammenhängt, dass Du hier und in dsm nur saudummen Scheißdreck
    daherredest?

    Kommt da nochmal etwas, Mückenheim?

    Und wenn wir IN in abzählbar unendlich viele abzählbar unendliche
    Teilmengen _zerlegen_, wie viele Elemente hat dann so eine
    Teilmenge im Schnitt?

    Also [z. B.]

    T_1 = {1, 2, 4, 7, ...}
    T_2 = {3, 5, 8, 12, ...}
    T_3 = {6, 9, 13,18 ...}
     :

    Die PUNKTE (:) hier bedeuten, dass wir über eine UNENDLICHE Menge
    (Folge) von Teilmengen sprechen, Du Depp.

    Also T_1, T_2, T_3, und so weiter, ad infinitum.

    Also über eine Folge (T_n)_(n e IN), wo T_n c IN für jedes n e IN und
    für alle n e IN, m e IN: n =/= m -> T_n n T_m = { }.

    |T_1| = ?
    |T_2| = ?
    |T_3| = ?
    usw. [ad infinitum.]

    Rech[n]en kann ich

    Ja, schön, Mückenheim, aber lass uns beim Thema bleiben.

    Und sollte dann nicht auch

    |T_1| + |T_2| + |T_3| + ... = |IN| gelten?

    Nein, denn es fehlen die Zahlen 10, 14, 15, 19, 20, ...

    Nein, die fehlen nicht, Du Depp.

    Gefragt ist hier nach SUM_(n=1..oo) |T_n|.

    Und für jedes n e IN gibt es ein k e IN, so dass n e T_k ist - nach
    der zwar nicht explizit angegebenen aber offensichtlichen
    Konstruktion der T_i (i e IN).

    Hinweis:

    T_1 = {1, 2, 4, 7, 11, 16, ...}
    T_2 = {3, 5, 8, 12, 17, ..}
    T_3 = {6, 9, 13, 18 ...}
    T_4 = {10, 14, 19, ...}
    T_5 = {15, 20, ...}
     :

    Das Schema ist offensichtlich, und ziemlich trivial.

    Das kleinste Element der Menge T_i ist i*(i+1)/2.

    Nennen wir das kleinste Element der Menge T_i "T_i_1" und das
    nächstgrößere "T_i_2" usw.

    Dann gilt für alle i e IN: T_i_2 = T_i_1 + i.

    Den Rest überlasse ich Dir zur Übung.

    ___________________________________________________________

    ALSO nochmal:

    Wegen

    1. U_(n e IN) T_n = IN, und
    2. T_i n T_j = {} für alle i =/= j

    sollte also wohl

           |T_1| + |T_2| + |T_3| + ... = SUM_(n=1..oo) |T_n| = |IN| gelten.

    |T_i| ist dann wohl |IN|/oo (für alle i e IN), oder so etwas, also
    vermutlich recht klein!

    0 kann es schlecht sein, denn 0 + 0 + 0 + ... ist vermutlich (selbst
    in Mückenhausen) immer noch 0, nein?

    Wenn es aber > 0 ist, so ist

           |T_1| + |T_2| + |T_3| + ... = SUM_(n=1..oo) |T_n|

    vermutlich ziemlich groß. Wie groß ist eigentlich |IN| [und wie groß
    sind die |T_i| für i e IN], und was genau für ein mathematisches
    Objekt [mathematische Objekte] soll das [sollen die] sein, Mückenheim?

    Haben Sie das schon iw. definiert? Ist es eine [sind es] natürliche,
    reelle oder anderswie geartete Zahl[en]? Viell. sogar eine
    Kardinalzahl [Kardinalzahlen]? Wo genau haben Sie diese Art von
    Zahlen denn definiert?

    Oder ist es nicht viel eher so, dass Sie einfach nur saudummen
    Scheißdreck daherreden?


    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Jim Burns@21:1/5 to All on Wed Jul 17 13:11:12 2024
    On 7/16/2024 3:33 PM, WM wrote:
    Le 16/07/2024 à 20:58, Jim Burns a écrit :
    On 7/16/2024 9:03 AM, WM wrote:
    Le 15/07/2024 à 20:53, Moebius a écrit :
    Am 15.07.2024 um 20:31 schrieb Python:
    Le 15/07/2024 à 16:46, WM a écrit :

    Probably the idea was discussed that
    an inclusion-monotonic sequence of
    infinite terms
    could have an empty intersection.

    Which is an extremely trivial state of afairs,
    Hint:
    There is no natural number in
    the intersection of all "endsegments".

    True.

    And each end segment is infiniteⁿᵒᵗᐧᵂᴹ.

    Each number that can be used for bijections
    has an infinite endsegment.

    You (WM) have described ℕᵂᴹ well enough that
    it is clear that ℕᵂᴹ isn't ℕⁿᵒᵗᐧᵂᴹ

    ⎛ Each j in ℕⁿᵒᵗᐧᵂᴹ has in ℕⁿᵒᵗᐧᵂᴹ
    ⎜ non.0 j⁺¹ immediately.after j

    ⎜ Each non.0 k in ℕⁿᵒᵗᐧᵂᴹ has in ℕⁿᵒᵗᐧᵂᴹ
    ⎜ k⁻¹ immediately.before k

    ⎜ Each nonempty subset B ⊆ ℕⁿᵒᵗᐧᵂᴹ holds
    ⎝ min.B smallest in B.

    You (WM) deny some or all of that,
    which means
    you (WM) aren't referring to ℕⁿᵒᵗᐧᵂᴹ

    For ℕⁿᵒᵗᐧᵂᴹ (ℕⁿᵒᵗᐧᵂᴹ is not ℕᵂᴹ),
    each end segment is infiniteⁿᵒᵗᐧᵂᴹ.

    ⎛ The set 𝒟 of
    ⎜ finiteⁿᵒᵗᐧᵂᴹ end segments of ℕⁿᵒᵗᐧᵂᴹ
    ⎜ is empty or nonempty.

    ⎜ If 𝒟 is empty,
    ⎜ then
    ⎜ each end segment is infiniteⁿᵒᵗᐧᵂᴹ.

    ⎜ If 𝒟 is nonempty,
    ⎜ then
    ⎜ each nonempty E ∈ 𝒟 holds min.E and
    ⎜ the set 𝒟ᵐⁱⁿ = {min.E: E ∈ 𝒟}
    ⎜ is nonempty and
    ⎜ exists d = min.𝒟ᵐⁱⁿ ≠ 0 such that
    ⎜ {j∈ℕⁿᵒᵗᐧᵂᴹ:d≤j} finiteⁿᵒᵗᐧᵂᴹ
    ⎜ {j∈ℕⁿᵒᵗᐧᵂᴹ:d⁻¹≤j} infiniteⁿᵒᵗᐧᵂᴹ
    ⎜ {j∈ℕⁿᵒᵗᐧᵂᴹ:d⁻¹≤j} = {j∈ℕⁿᵒᵗᐧᵂᴹ:d≤j}∪{d⁻¹}

    ⎜ However,
    ⎜ (lemma)
    ⎜ Infiniteⁿᵒᵗᐧᵂᴹ doesn't mean humongous.
    ⎜ No sets A and {x} exist such that
    ⎜ A is finiteⁿᵒᵗᐧᵂᴹ and
    ⎜ A∪{x} is infiniteⁿᵒᵗᐧᵂᴹ.
    ⎝ Contradiction.

    Therefore,
    𝒟 is empty, and
    each end segment of ℕⁿᵒᵗᐧᵂᴹ is infiniteⁿᵒᵗᐧᵂᴹ.

    ⎛ Each element i of ℕⁿᵒᵗᐧᵂᴹ
    ⎜ is not.in infiniteⁿᵒᵗᐧᵂᴹ {j∈ℕⁿᵒᵗᐧᵂᴹ:i⁺¹≤j} and
    ⎜ i is not in all.infiniteⁿᵒᵗᐧᵂᴹ end.segments and
    ⎜ i is not in the intersection of all.infinites (all).

    ⎝ The intersection of all.infinites (all) is empty.

    The ℵo terms of the infinite endsegments
    cannot be deleted in steps.

    You (WM) are confused about
    what an intersection is.

    There is no natural number in the intersection of
    all infiniteⁿᵒᵗᐧᵂᴹ end segments.

    What about
    the infinitely many numbers which are remainimg from E(1)?

    None of them remain in all.infiniteⁿᵒᵗᐧᵂᴹ (all) end segments.

    But you claim an empty intersection of
    all infinite endsegments,

    Each natural number is
    not.in at least one infiniteⁿᵒᵗᐧᵂᴹ end segments.

    What numbers constitute
    the infinite endsegment which is
    common to all infinity endsegments.

    All end segments are infiniteⁿᵒᵗᐧᵂᴹ.
    ∀i ∈ ℕⁿᵒᵗᐧᵂᴹ:
    ¬∃m ∈ {j∈ℕⁿᵒᵗᐧᵂᴹ:i≤j}:
    ∀k ∈ {j∈ℕⁿᵒᵗᐧᵂᴹ:i≤j}:
    k≤m

    proof.
    for k=m⁺¹: ¬(k≤m)

    No number is common to
    all infiniteⁿᵒᵗᐧᵂᴹ end segments
    ¬∃m ∈ ℕⁿᵒᵗᐧᵂᴹ:
    ∀i ∈ ℕⁿᵒᵗᐧᵂᴹ:
    m ∈ {j∈ℕⁿᵒᵗᐧᵂᴹ:i≤j}

    proof.
    for i=m⁺¹: ¬(m ∈ {j∈ℕⁿᵒᵗᐧᵂᴹ:i≤j})

    An infiniteⁿᵒᵗᐧᵂᴹ end segment
    common to all infiniteⁿᵒᵗᐧᵂᴹ end segments
    not.exists.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Wed Jul 17 20:04:13 2024
    Am 17.07.2024 um 19:57 schrieb WM:
    Le 17/07/2024 à 19:11, Jim Burns a écrit :

    An infiniteⁿᵒᵗᐧᵂᴹ end segment
    common to all infiniteⁿᵒᵗᐧᵂᴹ end segments
    not.exists.

    Because

    THE ONLY set "common to all infiniteⁿᵒᵗᐧᵂᴹ end segments" is the empty
    set, Mückenheim (and the empty set is NOT an infiniteⁿᵒᵗᐧᵂᴹ end segment).

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Wed Jul 17 17:57:42 2024
    Le 17/07/2024 à 19:11, Jim Burns a écrit :
    On 7/16/2024 3:33 PM, WM wrote:

    What about
    the infinitely many numbers which are remainimg from E(1)?

    None of them remain in all.infiniteⁿᵒᵗᐧᵂᴹ (all) end segments.

    What remains to keep the endsegments infinite?

    An infiniteⁿᵒᵗᐧᵂᴹ end segment
    common to all infiniteⁿᵒᵗᐧᵂᴹ end segments
    not.exists.

    Because of inclusion monotony this is a wrong result. Your formalism
    sucks. Try better.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Ben Bacarisse@21:1/5 to wolfgang.mueckenheim@tha.de on Thu Jul 18 00:54:48 2024
    WM <wolfgang.mueckenheim@tha.de> writes:

    Le 15/07/2024 00:39, Ben Bacarisse a crit :
    WM <wolfgang.mueckenheim@tha.de> writes:

    You can define equinumerosity any way you like.

    And I can prove that Cantor's way leads astray.
    But no journal will touch it. I can't remember which crank excuse you
    use to explain that.

    Simple: The journals are owned by matheologians and stupids. I have never tried to address them.

    *ticks crank excuse bingo card*

    Further all that stuff including this proof has been published as a book.

    Presumably that's why you teach history courses now -- you can avoid
    having to write down even the most basic definitions of WMaths sets.

    At the end of the course I talk about the present state of the art.
    Do you cite the journal that has published your proof that Cantor is
    wrong?

    I could do so:

    "Does Set Theory Cause Perceptual Problems?", viXra 2017-02-26 "Not enumerating all positive rational numbers", viXra 2017-02-26 "The union is not the limit.", viXra 2017-03-06 "Failure of the Diagonal Argument",
    viXra 2017-03-13 "Set Theory or Slipper Animalcule: Who Wins?", viXra 2017-03-13 "Proof of the existence of dark numbers (bilingual version)", viXra (Nov 2022)
    "Shortest Proof of Dark Numbers", viXra (May 2023)
    "Seven Internal Contradictions of Set Theory", viXra (Dec 2023)
    "Transfinity - A Source Book", SSRN-Elsevier (April 2024)
    "Proof of the existence of dark numbers (bilingual version)", OSFPREPRINTS (Nov 2022)
    "Dark natural numbers in set theory", ResearchGate, October 2019
    "Dark natural numbers in set theory" II, ResearchGate, October 2019 "Transfinity - A Source Book", ResearchGate, October 2019 "What scatters
    the space?", MResearchGate, May 2020 "Countability Contradicted", ResearchGate, February 2022
    "Proof of the existence of dark numbers (bilingual version)", ResearchGate, Nov 2022
    "The seven deadly sins of set theory", ResearchGate, Dec 2023
    "Dark numbers", Academia.edu (2020) "Transfinity - A Source Book", Academia.edu (31 Dec 2020) "Countability contradicted", Academia.edu (Feb 2022) "Proof of the existence of dark numbers (bilingual version)", Academia.edu (Nov 2022)
    "The seven deadly sins of set theory", Academia.edu (Dec 2023)
    "Dark numbers", Quora (May 2023)
    "Sequences and Limits", Advances in Pure Mathematics 5, 2015, pp. 59 - 61. "Transfinity - A Source Book", ELIVA Press, Chisinau 2024.

    So no peer reviewed publications. We knew that, of course.

    But I do not quote all that (some of the above with over 1000 reads - more than usual for maths journals) like I do not quote Newton's or Euler's or Gauss' or Cauchy's original essays.

    Do you give the "proper" definitions for set membership,

    That cannot be done for potentially infinite collections because they have
    no fixed membership.

    Ah, OK. So there is no way to prove any theorems about WMaths sets
    because there are no definitions of even the most basic terms.

    difference and equality once you admit that those in your textbook are
    only approximations? Do you present a proof of the "surprising" result
    that sets E and P exist with E in P and P \ {E} = P?

    So how did you know that for the E and P we talked about six years ago
    that E in P and P \ {E} = P? Was it all just how you felt at the time?
    Is it still true today, or have the sets changed in the last six years
    and it's no longer true? I have to ask because in WMaths set membership difference and equality can't be defined, so all anyone can do to find
    out what you laughingly call "proper mathematics" says is to ask you.
    You (apparently) "know" (or knew) that E in P even though you can't
    prove it.

    --
    Ben.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Python@21:1/5 to All on Thu Jul 18 13:41:50 2024
    Le 18/07/2024 à 01:54, Ben Bacarisse a écrit :
    WM <wolfgang.mueckenheim@tha.de> writes:

    Le 15/07/2024 à 00:39, Ben Bacarisse a écrit :
    WM <wolfgang.mueckenheim@tha.de> writes:

    You can define equinumerosity any way you like.

    And I can prove that Cantor's way leads astray.
    But no journal will touch it. I can't remember which crank excuse you
    use to explain that.

    Simple: The journals are owned by matheologians and stupids. I have never
    tried to address them.

    *ticks crank excuse bingo card*

    Further all that stuff including this proof has been published as a book.

    Presumably that's why you teach history courses now -- you can avoid >>>>> having to write down even the most basic definitions of WMaths sets.

    At the end of the course I talk about the present state of the art.
    Do you cite the journal that has published your proof that Cantor is
    wrong?

    I could do so:

    "Does Set Theory Cause Perceptual Problems?", viXra 2017-02-26 "Not
    enumerating all positive rational numbers", viXra 2017-02-26 "The union is >> not the limit.", viXra 2017-03-06 "Failure of the Diagonal Argument",
    viXra 2017-03-13 "Set Theory or Slipper Animalcule: Who Wins?", viXra
    2017-03-13 "Proof of the existence of dark numbers (bilingual version)",
    viXra (Nov 2022)
    "Shortest Proof of Dark Numbers", viXra (May 2023)
    "Seven Internal Contradictions of Set Theory", viXra (Dec 2023)
    "Transfinity - A Source Book", SSRN-Elsevier (April 2024)
    "Proof of the existence of dark numbers (bilingual version)", OSFPREPRINTS >> (Nov 2022)
    "Dark natural numbers in set theory", ResearchGate, October 2019
    "Dark natural numbers in set theory" II, ResearchGate, October 2019
    "Transfinity - A Source Book", ResearchGate, October 2019 "What scatters
    the space?", MResearchGate, May 2020 "Countability Contradicted",
    ResearchGate, February 2022
    "Proof of the existence of dark numbers (bilingual version)", ResearchGate, >> Nov 2022
    "The seven deadly sins of set theory", ResearchGate, Dec 2023
    "Dark numbers", Academia.edu (2020) "Transfinity - A Source Book",
    Academia.edu (31 Dec 2020) "Countability contradicted", Academia.edu (Feb
    2022) "Proof of the existence of dark numbers (bilingual version)",
    Academia.edu (Nov 2022)
    "The seven deadly sins of set theory", Academia.edu (Dec 2023)
    "Dark numbers", Quora (May 2023)
    "Sequences and Limits", Advances in Pure Mathematics 5, 2015, pp. 59 - 61. >> "Transfinity - A Source Book", ELIVA Press, Chisinau 2024.

    So no peer reviewed publications. We knew that, of course.

    But I do not quote all that (some of the above with over 1000 reads - more >> than usual for maths journals) like I do not quote Newton's or Euler's or
    Gauss' or Cauchy's original essays.

    Do you give the "proper" definitions for set membership,

    That cannot be done for potentially infinite collections because they have >> no fixed membership.

    Ah, OK. So there is no way to prove any theorems about WMaths sets
    because there are no definitions of even the most basic terms.

    difference and equality once you admit that those in your textbook are
    only approximations? Do you present a proof of the "surprising" result
    that sets E and P exist with E in P and P \ {E} = P?

    So how did you know that for the E and P we talked about six years ago
    that E in P and P \ {E} = P? Was it all just how you felt at the time?
    Is it still true today, or have the sets changed in the last six years
    and it's no longer true? I have to ask because in WMaths set membership difference and equality can't be defined, so all anyone can do to find
    out what you laughingly call "proper mathematics" says is to ask you.
    You (apparently) "know" (or knew) that E in P even though you can't
    prove it.


    The main issue here is that an academic institution is still allowing
    such a fraudster to *teach* and is defending itself invoking "academic freedom"!

    I've seen a post on Facebook group "Meme for mathematicians" today
    that reminds me Wolfgang Mückenheim's sophistries:

    - 1 isn't prime !
    - Name all prime factors of 1 then.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Jim Burns@21:1/5 to All on Thu Jul 18 07:18:04 2024
    On 7/17/2024 1:57 PM, WM wrote:
    Le 17/07/2024 à 19:11, Jim Burns a écrit :
    On 7/16/2024 3:33 PM, WM wrote:

    What about the infinitely many numbers
    which are remainimg from E(1)?

    None of them remain in
    all.infiniteⁿᵒᵗᐧᵂᴹ (all) end segments.

    What remains to keep the endsegments infinite?

    | For each number, there is a number after
    proves false
    | There is a number after all numbers.

    An infiniteⁿᵒᵗᐧᵂᴹ end segment
    common to all infiniteⁿᵒᵗᐧᵂᴹ end segments
    not.exists.

    Because of inclusion monotony
    this is a wrong result.

    You (WM) aren't referring to ℕⁿᵒᵗᐧᵂᴹ

    ⎛ Each j in ℕⁿᵒᵗᐧᵂᴹ has in ℕⁿᵒᵗᐧᵂᴹ
    ⎜ non.0 j⁺¹ immediately.after j

    ⎜ Each non.0 k in ℕⁿᵒᵗᐧᵂᴹ has in ℕⁿᵒᵗᐧᵂᴹ
    ⎜ k⁻¹ immediately.before k

    ⎜ Each nonempty subset B ⊆ ℕⁿᵒᵗᐧᵂᴹ holds
    ⎝ min.B smallest in B.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Thu Jul 18 13:09:27 2024
    Le 18/07/2024 à 13:18, Jim Burns a écrit :
    On 7/17/2024 1:57 PM, WM wrote:

    What remains to keep the endsegments infinite?

    | For each number, there is a number after
    proves false
    | There is a number after all numbers.

    The claim is that after every n defining the endsegment E(n) there are
    ℵo natnumbers remaining from E(1) in all infinite endsegments.

    You (WM) aren't referring to ℕⁿᵒᵗᐧᵂᴹ

    I am referring to mathematics. The sequence of endsegments is inclusion monotonic. Every infinite endsegment has an infinite intersection with all infinite endsegments. Most of my "peers" are too stupid to comprehend
    this, not all, fortunately, and no students.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Thu Jul 18 12:59:19 2024
    Le 18/07/2024 à 01:54, Ben Bacarisse a écrit :
    WM <wolfgang.mueckenheim@tha.de> writes:

    So no peer reviewed publications. We knew that, of course.

    I refuse to call contemporaries my peers who are too stupid to understand questions like the following:
    If it is impossible to explain the increase of NUF(x) in agreement with
    basic mathematics (i.e. by not more than 1 at any x > 0), then the axioms
    of natural numbers are incompatible with basic mathematics. We can change
    this basic mathematics
    ∀n ∈ ℕ: 1/n - 1/(n+1) > 0
    or the axiom
    ∀n ∈ ℕ: ∃ n+1 ∈ ℕ
    or pursue inconsistent mathematics.
    What would you propose?

    But I do not quote all that (some of the above with over 1000 reads - more >> than usual for maths journals) like I do not quote Newton's or Euler's or
    Gauss' or Cauchy's original essays.

    Do you give the "proper" definitions for set membership,

    That cannot be done for potentially infinite collections because they have >> no fixed membership.

    Ah, OK. So there is no way to prove any theorems about WMaths sets
    because there are no definitions of even the most basic terms.

    The set in the above example is complete.

    Regards, WM



    difference and equality once you admit that those in your textbook are
    only approximations? Do you present a proof of the "surprising" result
    that sets E and P exist with E in P and P \ {E} = P?

    So how did you know that for the E and P we talked about six years ago
    that E in P and P \ {E} = P? Was it all just how you felt at the time?
    Is it still true today, or have the sets changed in the last six years
    and it's no longer true? I have to ask because in WMaths set membership difference and equality can't be defined, so all anyone can do to find
    out what you laughingly call "proper mathematics" says is to ask you.
    You (apparently) "know" (or knew) that E in P even though you can't
    prove it.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Python@21:1/5 to All on Thu Jul 18 15:23:38 2024
    Le 18/07/2024 à 14:59, WM a écrit :
    Le 18/07/2024 à 01:54, Ben Bacarisse a écrit :
    WM <wolfgang.mueckenheim@tha.de> writes:

    So no peer reviewed publications.  We knew that, of course.

    I refuse to call contemporaries my peers

    Neither do they. Because you are a FRAUD, Pr. Wolfgang Mückenheim,
    from Hochschule Augsburg.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Jim Burns@21:1/5 to All on Thu Jul 18 14:49:07 2024
    On 7/18/2024 9:09 AM, WM wrote:
    Le 18/07/2024 à 13:18, Jim Burns a écrit :
    On 7/17/2024 1:57 PM, WM wrote:

    What remains to keep the endsegments infinite?

    | For each number, there is a number after
     proves false
    | There is a number after all numbers.

    The claim is that
    after every n defining the endsegment E(n)
    there are ℵo natnumbers remaining from E(1)
    in all infinite endsegments.

    ℵ₀.many remain in E(n)
    0.many remain in all.infinite (all) end segments

    n is in E(n) and not.in E(n+1) and not in.all
    n+1 is in E(n) and not.in E(n+2) and not in.all
    n+2 is in E(n) and not.in E(n+3) and not in.all
    n+3 is in E(n) and not.in E(n+4) and not in.all
    ...

    The claim is that
    ⎛ Each j in E(n) has in E(n)
    ⎜ non.n j⁺¹ immediately.after j

    ⎜ Each non.n k in E(n) has in E(n)
    ⎜ k⁻¹ immediately.before k

    ⎜ Each nonempty subset B ⊆ E(n) holds
    ⎝ min.B smallest in B.

    It follows not.first.false.ly from that claim
    and the claim about ℕ that
    ⎛ Each j in ℕ has in ℕ
    ⎜ non.0 j⁺¹ immediately.after j

    ⎜ Each non.0 k in ℕ has in ℕ
    ⎜ k⁻¹ immediately.before k

    ⎜ Each nonempty subset B ⊆ ℕ holds
    ⎝ min.B smallest in B.

    that
    for fₙ(j) = j+n
    fₙ: ℕ → E(n): 1.to.1
    |ℕ| ≤ |E(n)|

    Plus
    ℕ ⊇ E(n)
    |ℕ| ≥ |E(n)|
    |ℕ| = |E(n)|

    |ℕ|.many remain in E(n)

    For each n ∈ ℕ
    fₙ(j) = j+n is 1.to.1 and
    |ℕ|.many remain in E(n)

    Infiniteⁿᵒᵗᐧᵂᴹ does not mean humongous.

    You (WM) aren't referring to ℕⁿᵒᵗᐧᵂᴹ

    I am referring to mathematics.

    But you aren't referring to mathematicsⁿᵒᵗᐧᵂᴹ.

    Most of my "peers" are too stupid to comprehend this,
    not all, fortunately, and no students.

    Thus, not mathematicsⁿᵒᵗᐧᵂᴹ.

    The sequence of endsegments is inclusion monotonic.

    The sequence of
    step.up non.0.step.down well.order ℕ
    end.segments is inclusion.monotonic.

    Every infinite endsegment has
    an infinite intersection with all infinite endsegments.

    No number in
    step.up non.0.step.down well.order ℕ
    is in every
    step.up non.0.step.down well.order ℕ
    end.segment.

    'Intersection' means that
    no number in
    step.up non.0.step.down well.order ℕ
    is in the intersection of all
    step.up non.0.step.down well.order ℕ
    end.segments.

    'For each, exists' does not imply 'exists, for each'

    'Infinite' does not mean 'humongous'.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Thu Jul 18 20:50:20 2024
    Le 18/07/2024 à 20:49, Jim Burns a écrit :

    ℵ₀.many remain in E(n)
    0.many remain in all.infinite (all) end segments

    Each infinite endsegment has infinitely many numbers.
    How many are not in all predecessors?

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Jim Burns@21:1/5 to All on Thu Jul 18 17:51:12 2024
    On 7/18/2024 4:50 PM, WM wrote:
    Le 18/07/2024 à 20:49, Jim Burns a écrit :

    ℵ₀.many remain in E(n)
    0.many remain in all.infinite (all) end segments

    Each infinite endsegment has infinitely many numbers.
    How many are not in all predecessors?

    You are confused about
    the intersection of all end segments.

    Each infinite end.segment has infinitely many numbers.
    Each is not in all.infinite (all) end segments.

    It is insufficient to be in all _predecessor_ end.segments.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Thu Jul 18 23:56:30 2024
    Am 18.07.2024 um 23:51 schrieb Jim Burns:
    On 7/18/2024 4:50 PM, WM wrote:

    It is insufficient to be in all _predecessor_ end.segments.

    Exactly. Imho WM is a *psychotic* crank.

    See: https://en.wikipedia.org/wiki/Thought_disorder

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Fri Jul 19 02:12:51 2024
    Am 18.07.2024 um 23:51 schrieb Jim Burns:
    On 7/18/2024 4:50 PM, WM wrote:

    Each infinite endsegment has infinitely many numbers.

    Wow! What an incredible insight!!!

    "Each infinite endsegment has infinitely many numbers." (!!!)

    How should he know?

    How many are not in all predecessors?>
    You are confused about
    the intersection of all endsegments.

    ALL = finitely many "predecessors" (, itself) and infinitely many
    "successors".

    It's "strange" that WM "forgets" about the infinitely man "successors".

    <facepalm>

    See: https://en.wikipedia.org/wiki/Thought_disorder

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Ben Bacarisse@21:1/5 to All on Fri Jul 19 00:33:40 2024
    WM <wolfgang.mueckenheim@tha.de> writes:
    (AKA Dr. Wolfgang Mückenheim or Mueckenheim who teaches "Geschichte
    des Unendlichen" and "Kleine Geschichte der Mathematik" at Technische Hochschule Augsburg.)

    Le 18/07/2024 à 01:54, Ben Bacarisse a écrit :
    WM <wolfgang.mueckenheim@tha.de> writes:

    So no peer reviewed publications. We knew that, of course.

    I refuse to call contemporaries my peers who are too stupid to understand questions like the following:
    If it is impossible to explain the increase of NUF(x) in agreement with
    basic mathematics (i.e. by not more than 1 at any x > 0), then the axioms
    of natural numbers are incompatible with basic mathematics. We can change this basic mathematics

    You pretend to offer an alternative but you admit that even the most
    basic operations can't be defined because WMsets have no fixed
    membership. And you have no rules about how set change -- the only way
    to find out what is in a WMset next Thursday is to ask you.

    ∀n ∈ ℕ: 1/n - 1/(n+1) > 0
    or the axiom
    ∀n ∈ ℕ: ∃ n+1 ∈ ℕ
    or pursue inconsistent mathematics.
    What would you propose?

    I would propose that you prove an inconsistency. Decades have gone
    past, and all you have is waffle. You dislike axioms and rules of
    deduction either because you know you can't prove an inconsistency or
    maybe just because you don't understand them at all. Either way, you
    never show a proof.

    Of course there are also the lies -- for example that you book does not
    show how to calculate the limit of a non-constant sequence of sets. You
    denied these exist, but forgot that functions are just sets and you
    explain how to find the limit of certain sequences of functions. Your
    answer was simply to deny the facts.

    --
    Ben.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Fri Jul 19 02:43:42 2024
    Am 19.07.2024 um 02:12 schrieb Moebius:

    It's "strange" that WM "forgets" about the infinitely man "successors".

    Actually, not really.

    See: https://en.wikipedia.org/wiki/Psychosis

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Fri Jul 19 13:49:05 2024
    Le 19/07/2024 à 01:33, Ben Bacarisse a écrit :
    WM <wolfgang.mueckenheim@tha.de> writes:
    (AKA Dr. Wolfgang Mückenheim or Mueckenheim who teaches "Geschichte
    des Unendlichen" and "Kleine Geschichte der Mathematik" at Technische Hochschule Augsburg.)

    Le 18/07/2024 à 01:54, Ben Bacarisse a écrit :
    WM <wolfgang.mueckenheim@tha.de> writes:

    So no peer reviewed publications. We knew that, of course.

    I refuse to call contemporaries my peers who are too stupid to understand
    questions like the following:
    If it is impossible to explain the increase of NUF(x) in agreement with
    basic mathematics (i.e. by not more than 1 at any x > 0), then the axioms
    of natural numbers are incompatible with basic mathematics. We can change
    this basic mathematics

    You pretend to offer an alternative

    Above all I have disproved set theory.

    but you admit that even the most
    basic operations can't be defined because WMsets have no fixed
    membership.

    On the contrary, actually infinite sets have an absolute fixed membership.
    Only the definable elements of potentially infinite collection have none.
    An example is Hilbert's hotel which can expand.

    ∀n ∈ ℕ: 1/n - 1/(n+1) > 0
    or the axiom
    ∀n ∈ ℕ: ∃ n+1 ∈ ℕ
    or pursue inconsistent mathematics.
    What would you propose?

    I would propose that you prove an inconsistency.

    Try to excplain how NUF(x) can increase from 0 to infinity without
    violating ∀n ∈ ℕ: 1/n - 1/(n+1) > 0.
    Then you will understand the inconsistency.

    You dislike axioms and rules of
    deduction

    ∀n ∈ ℕ: 1/n - 1/(n+1) > 0

    is all you need. Do you believe it without deriving it from axioms?

    Either way, you
    never show a proof.

    Try to understand and repeat the above. Then you will understand.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Fri Jul 19 14:09:42 2024
    Le 19/07/2024 à 02:12, Moebius a écrit :

    It's "strange" that WM "forgets" about the infinitely man "successors".

    No, we can take every endsegment of the infinitely many.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Fri Jul 19 14:07:43 2024
    Le 18/07/2024 à 23:51, Jim Burns a écrit :
    On 7/18/2024 4:50 PM, WM wrote:

    Each infinite endsegment has infinitely many numbers.
    How many are not in all predecessors?

    Each infinite end.segment has infinitely many numbers.
    Each is not in all.infinite (all) end segments.

    It is insufficient to be in all _predecessor_ end.segments.

    Infinitely many numbers are in all predecessors and in all *infinite* successors. Infinitely many of them are the same because of inclusion
    monotony. Infinite endsegments with empty intersection would require an complete exchange of thenumbers. But that is excluded by inclusion
    montony.

    You are wrong.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Fri Jul 19 16:18:49 2024
    Am 19.07.2024 um 16:07 schrieb WM:
    Le 18/07/2024 à 23:51, Jim Burns a écrit :

    It is insufficient to be in all _predecessor_ end.segments.

    Infinitely many numbers are in all predecessors and in all *infinite* successors.

    Nope.

    1. ALL end.segments are infinite (by definition).
    2. NO natural number is in all (infinite) end.segments.

    Hint: For each and every natural number n: n is not in the (infinite) end.segment {n+1, n+2, n+3, ...}.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Fri Jul 19 17:01:12 2024
    Am 19.07.2024 um 16:18 schrieb Moebius:
    Am 19.07.2024 um 16:07 schrieb WM:
    Le 18/07/2024 à 23:51, Jim Burns a écrit :

    It is insufficient to be in all _predecessor_ end.segments.

    Infinitely many numbers are in all predecessors and in all *infinite*
    successors.

    Nope.

    1. ALL end.segments are infinite (by definition).
    2. NO natural number is in all (infinite) end.segments.

    Hint: For each and every natural number n: n is not in the (infinite) end.segment {n+1, n+2, n+3, ...}.

    Hier eigens nochmal für die geistig-mental etwas gehandicapten:

    | Wenn n eine natürliche Zahl ist, dann ist {n+1, n+2, n+3, ...} ein
    | *unendliches* Endsegment, aber n ist nicht in {n+1, n+2, n+3, ...}.

    Das gilt FÜR ALLE natürlichen Zahlen n.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Fri Jul 19 18:14:52 2024
    Am 19.07.2024 um 17:51 schrieb Richard Damon:

    Because NUF(x) doesn't have a finite value of ANY finite x > 0, and thus
    is just UNDEFINED, [...]

    Nonsense. It's defined (in the context of set theory) with

    NUF: IR --> {0, aleph_0}
    x |-> card({u e {1/n : n e IN} : u <= x}) .

    Then NUF(x) = 0 for all x e IR, x <= 0
    and NUF(x) = aleph_0 for all x e IR, x > 0.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Richard Damon@21:1/5 to All on Fri Jul 19 11:51:33 2024
    On 7/19/24 9:49 AM, WM wrote:
    Le 19/07/2024 à 01:33, Ben Bacarisse a écrit :
    WM <wolfgang.mueckenheim@tha.de> writes:
    (AKA Dr. Wolfgang Mückenheim or Mueckenheim who teaches "Geschichte
    des Unendlichen" and "Kleine Geschichte der Mathematik" at Technische
    Hochschule Augsburg.)

    Le 18/07/2024 à 01:54, Ben Bacarisse a écrit :
    WM <wolfgang.mueckenheim@tha.de> writes:

    So no peer reviewed publications.  We knew that, of course.

    I refuse to call contemporaries my peers who are too stupid to
    understand
    questions like the following:
    If it is impossible to explain the increase of NUF(x) in agreement with
    basic mathematics (i.e. by not more than 1 at any x > 0), then the
    axioms
    of natural numbers are incompatible with basic mathematics. We can
    change
    this basic mathematics

    You pretend to offer an alternative

    Above all I have disproved set theory.

    but you admit that even the most
    basic operations can't be defined because WMsets have no fixed
    membership.

    On the contrary, actually infinite sets have an absolute fixed
    membership. Only the definable elements of potentially infinite
    collection have none. An example is Hilbert's hotel which can expand.

    ∀n ∈ ℕ: 1/n - 1/(n+1) > 0
    or the axiom
    ∀n ∈ ℕ: ∃ n+1 ∈ ℕ
    or pursue inconsistent mathematics.
    What would you propose?

    I would propose that you prove an inconsistency.

    Try to excplain how NUF(x) can increase from 0 to infinity without
    violating ∀n ∈ ℕ: 1/n - 1/(n+1) > 0.
    Then you will understand the inconsistency.

    Because NUF(x) doesn't have a finite value of ANY finite x > 0, and thus
    is just UNDEFINED, because its verbal definition makes in incorrect
    assumption that there *IS* a smallest unit fraction, and thus a largest
    natural number, but if there was then NUF(1) would be finite.


    You dislike axioms and rules of
    deduction

    ∀n ∈ ℕ: 1/n - 1/(n+1) > 0

    is all you need. Do you believe it without deriving it from axioms?

    Which means that there can not be a smallest unit fraction, as if you
    think think that 1/n is the smallest unit fraction, it shows that
    1/(n+1) will be smaller, but still greater than 0.

    The only way for 1/n to be these smallest unit fraction is for n to be
    the largest natural number, but EVERY natural number has a successor n+1.


    Either way, you
    never show a proof.

    Try to understand and repeat the above. Then you will understand.

    And you logic only works if you assume that there must be a largest
    natural number, even if you don't know what it is.

    Your "Darkness" is just your inability to handle the unboundedness of
    the infinite set of Natural Numbers.


    Regards, WM



    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Richard Damon@21:1/5 to Moebius on Fri Jul 19 13:10:29 2024
    On 7/19/24 12:14 PM, Moebius wrote:
    Am 19.07.2024 um 17:51 schrieb Richard Damon:

    Because NUF(x) doesn't have a finite value of ANY finite x > 0, and
    thus is just UNDEFINED, [...]

    Nonsense. It's defined (in the context of set theory) with

         NUF: IR --> {0, aleph_0}
               x |-> card({u e {1/n : n e IN} : u <= x}) .

    Then NUF(x) = 0 for all x e IR, x <= 0
    and NUF(x) = aleph_0 for all x e IR, x > 0.
    But aleph_0 isn't a finite value, which are the only sorts of numbers
    that WMs system can use.

    Once you allow transfinite values, then between 0 and the unit fractions
    is a space of infinitesimal values where the "verbal" definition of NUF
    breaks and NUF(x) can jump from 0 to aleph_0.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Fri Jul 19 19:58:32 2024
    Am 19.07.2024 um 19:10 schrieb Richard Damon:
    On 7/19/24 12:14 PM, Moebius wrote:
    Am 19.07.2024 um 17:51 schrieb Richard Damon:

    Because NUF(x) doesn't have a finite value of ANY finite x > 0, and
    thus is just UNDEFINED, [...]

    [...] It's defined (in the context of set theory) with

          NUF: IR --> {0, aleph_0}
                x |-> card({u e {1/n : n e IN} : u <= x}) .

    Then NUF(x) = 0 for all x e IR, x <= 0
    and NUF(x) = aleph_0 for all x e IR, x > 0.

    But aleph_0 isn't a finite value, which are the only sorts of numbers
    that WMs system can use.

    I see. He would argue for

    NUF: IR --> IN u {0} ,

    I guess, right.

    But this, of course, would conflict with

    x |-> card({u e {1/n : n e IN} : u <= x}) .

    Once you allow transfinite values, then [...] NUF(x) can jump from 0 to aleph_0.

    Right.

    To avoid this (Mückenheim related) problem we might simply define NUF
    (in the context of set theory) as an "operation" (or just an abbreviation):

    NUF(x) =df card({u e {1/n : n e IN} : u <= x}) (x e IR)

    Now we can PROVE (without further ado) that

    NUF(x) = 0 for all x e IR, x <= 0 and
    NUF(x) = aleph_0 for all x e IR, x > 0.

    No matter if WM likes this outcome or not.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Sat Jul 20 12:28:55 2024
    Le 19/07/2024 à 17:01, Moebius a écrit :

    Hint: For each and every natural number n: n is not in the (infinite)
    end.segment {n+1, n+2, n+3, ...}.

    Das gilt FÜR ALLE natürlichen Zahlen n.

    Not for the infinitely many remaining in all infinite endsegments.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Sat Jul 20 12:35:31 2024
    Le 19/07/2024 à 17:51, Richard Damon a écrit :
    On 7/19/24 9:49 AM, WM wrote:

    Try to excplain how NUF(x) can increase from 0 to infinity without
    violating ∀n ∈ ℕ: 1/n - 1/(n+1) > 0.
    Then you will understand the inconsistency.

    Because NUF(x) doesn't have a finite value of ANY finite x > 0,

    That is your desired result, not an argment.

    and thus
    is just UNDEFINED,

    Not at all. NUF(x) is the number of unit fractions between 0 and x.

    because its verbal definition makes in incorrect
    assumption that there *IS* a smallest unit fraction,

    No, there is no assumption but only a result from mathematics.


    ∀n ∈ ℕ: 1/n - 1/(n+1) > 0

    is all you need. Do you believe it without deriving it from axioms?

    Which means that there can not be a smallest unit fraction, as if you
    think think that 1/n is the smallest unit fraction, it shows that
    1/(n+1) will be smaller, but still greater than 0.

    It is not guarantedd that n+1 exists for every n.


    Try to understand and repeat the above. Then you will understand.

    And you logic only works if you assume that there must be a largest
    natural number, even if you don't know what it is.

    I do not assume it but derive it from mathematics.

    Your "Darkness" is just your inability to handle the unboundedness of
    the infinite set of Natural Numbers.

    You can't handle it either. NUF(x) is well defined. Your denial is wrong.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Sat Jul 20 12:37:45 2024
    Le 19/07/2024 à 19:10, Richard Damon a écrit :
    On 7/19/24 12:14 PM, Moebius wrote:
    Am 19.07.2024 um 17:51 schrieb Richard Damon:

    Because NUF(x) doesn't have a finite value of ANY finite x > 0, and
    thus is just UNDEFINED, [...]

    Nonsense. It's defined (in the context of set theory) with

         NUF: IR --> {0, aleph_0}
               x |-> card({u e {1/n : n e IN} : u <= x}) .

    Then NUF(x) = 0 for all x e IR, x <= 0
    and NUF(x) = aleph_0 for all x e IR, x > 0.
    But aleph_0 isn't a finite value, which are the only sorts of numbers
    that WMs system can use.

    No, NUF(x) = ℵo for every definable x > 0.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Jim Burns@21:1/5 to All on Sat Jul 20 08:40:26 2024
    On 7/19/2024 10:07 AM, WM wrote:
    Le 18/07/2024 à 23:51, Jim Burns a écrit :
    On 7/18/2024 4:50 PM, WM wrote:

    Each infinite endsegment has infinitely many numbers.
    How many are not in all predecessors?

    Each infinite end.segment has infinitely many numbers.
    Each is not in all.infinite (all) end segments.

    It is insufficient to be in all _predecessor_ end.segments.

    Infinitely many numbers are
    in all predecessors and
    in all *infinite* successors.
    Infinitely many of them are the same
    because of inclusion monotony.
    Infinite endsegments with empty intersection
    would require an complete exchange of thenumbers.
    But that is excluded by inclusion montony.

    You are wrong.

    The natural numbers ℕⁿᵒᵗᐧᵂᴹ are
    well.ordered with step.up and non.0.step.down.
    If you say I am wrongᵂᴹ about that,
    what you (WM) are calling "the natural numbers"
    aren't the natural numbers.

    ----
    Each set B ⊆ ℕ has a set {j∈ℕ:Bᴬ≤j} of upper.bounds, {j∈ℕ:Bᴬ≤j} is non.empty or empty.

    {j∈ℕ:Bᴬ≤j} ⊆ ℕ
    If {j∈ℕ:Bᴬ≤j} is nonempty,
    {j∈ℕ:Bᴬ≤j} holds a minimum min.{j∈ℕ:Bᴬ≤j}

    If min.{j∈ℕ:Bᴬ≤j} = 0
    then B is empty or {0}

    If min.{j∈ℕ:Bᴬ≤j} ≠ 0
    then
    (min.{j∈ℕ:Bᴬ≤j})-1 isn't an upper.bound of B
    but min.{j∈ℕ:Bᴬ≤j} is an upper.bound.

    Only min.{j∈ℕ:Bᴬ≤j} is bounded by min.{j∈ℕ:Bᴬ≤j}
    and not bounded by (min.{j∈ℕ:Bᴬ≤j})-1

    min.{j∈ℕ:Bᴬ≤j} ∈ B
    min.{j∈ℕ:Bᴬ≤j} = max.B

    If B ⊆ ℕ is bounded and nonempty,
    B holds a maximum and a minimum, and
    each nonempty subset (also bounded)
    holds a maximum and a minimum.

    If B ⊆ ℕ is bounded and nonempty,
    then B is finiteⁿᵒᵗᐧᵂᴹ

    ----
    For each j ∈ ℕ
    ℕ well.ordered with step.up and non.0.step.down
    {i∈ℕ:i≤j} is bounded and nonempty,
    {i∈ℕ:i≤j} = {0,1,…,j} is finiteⁿᵒᵗᐧᵂᴹ

    Infinitely many numbers are
    in all predecessors and
    in all *infinite* successors.

    For each end segment E(j)
    each number k does not bound max{j,k+1} ∈ E(j)
    each number k does not bound E(j)
    E(j) is infiniteⁿᵒᵗᐧᵂᴹ

    For each j ∈ ℕ
    ℕ well.ordered with step.up and non.0.step.down
    j is only in end segments with minima in {0,1,…,j}
    j is only in finitely.many end segments
    (There are infinitely.many end segments)
    j is not in all.infinite (all) end segments
    j is not in the intersection of all.infinite (all)

    Infinitely many of them are the same
    because of inclusion monotony.

    Quantifier shift.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Sat Jul 20 13:01:52 2024
    Le 20/07/2024 à 14:40, Jim Burns a écrit :
    On 7/19/2024 10:07 AM, WM wrote:

    Infinitely many numbers are
    in all predecessors and
    in all *infinite* successors.
    Infinitely many of them are the same
    because of inclusion monotony.
    Infinite endsegments with empty intersection
    would require an complete exchange of the numbers.
    But that is excluded by inclusion montony.

    You are wrong.

    The natural numbers ℕⁿᵒᵗᐧᵂᴹ are
    well.ordered with step.up and non.0.step.down.
    If you say I am wrongᵂᴹ about that,
    what you (WM) are calling "the natural numbers"
    aren't the natural numbers.

    Infinite endsegments without infinite sets of natural numbers are
    impossible.
    Exchanging natural numbers is impossible for endsegments.
    What you call the natural numbers does not exist (as a set, but only as a collection).

    Infinitely many of them are the same
    because of inclusion monotony.

    Quantifier shift.

    Call it as you like. As long as endsegments have lost only few numbers and
    kept infinitely many, they are infinite and have an infinite intersection
    with endsegments of this kind.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Richard Damon@21:1/5 to All on Sat Jul 20 09:07:15 2024
    On 7/20/24 8:37 AM, WM wrote:
    Le 19/07/2024 à 19:10, Richard Damon a écrit :
    On 7/19/24 12:14 PM, Moebius wrote:
    Am 19.07.2024 um 17:51 schrieb Richard Damon:

    Because NUF(x) doesn't have a finite value of ANY finite x > 0, and
    thus is just UNDEFINED, [...]

    Nonsense. It's defined (in the context of set theory) with

          NUF: IR --> {0, aleph_0}
                x |-> card({u e {1/n : n e IN} : u <= x}) .

    Then NUF(x) = 0 for all x e IR, x <= 0
    and NUF(x) = aleph_0 for all x e IR, x > 0.
    But aleph_0 isn't a finite value, which are the only sorts of numbers
    that WMs system can use.

    No, NUF(x) = ℵo for every definable x > 0.

    Regards, WM


    Which means your logic includes transfinite numbers, so there is the gap between 0 and the finite numbers where NUF(x) increases from 0 to ℵo.

    So, NUF can jump from 0 to 1 at 1/ℵo which if you consider ℵo to be a number that represents a count, then 1/ℵo is close enough to a unit
    fraction.

    It also means that you logic can't use the need to be able to count to a
    number for that number to be "defined", as you accepted ℵo as a defined number.

    This throws all you logic to the wind.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Sat Jul 20 12:19:26 2024
    Le 19/07/2024 à 16:18, Moebius a écrit :
    Am 19.07.2024 um 16:07 schrieb WM:
    Le 18/07/2024 à 23:51, Jim Burns a écrit :

    It is insufficient to be in all _predecessor_ end.segments.

    Infinitely many numbers are in all predecessors and in all *infinite*
    successors.

    Nope.

    Which infinite successors has less elements of E(1).

    1. ALL end.segments are infinite (by definition).

    If they are infinite, then they are infinite because they contain
    infinitely many elements of E(1) = ℕ. There is no other possibility.

    2. NO natural number is in all (infinite) end.segments.

    But infinitely many are in all those endsegments which contain infinitely
    many natnumbers.

    Hint: For each and every natural number n: n is not in the (infinite) end.segment {n+1, n+2, n+3, ...}.

    Of course. But that does not concern infinite endsegments.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From joes@21:1/5 to All on Sat Jul 20 13:28:19 2024
    Am Sat, 20 Jul 2024 12:19:26 +0000 schrieb WM:
    Le 19/07/2024 à 16:18, Moebius a écrit :
    Am 19.07.2024 um 16:07 schrieb WM:
    Le 18/07/2024 à 23:51, Jim Burns a écrit :

    2. NO natural number is in all (infinite) end.segments.
    But infinitely many are in all those endsegments which contain
    infinitely many natnumbers.
    They are not the same ones.

    Hint: For each and every natural number n: n is not in the (infinite)
    end.segment {n+1, n+2, n+3, ...}.
    Of course. But that does not concern infinite endsegments.
    Quoted for contradiction.

    --
    Am Fri, 28 Jun 2024 16:52:17 -0500 schrieb olcott:
    Objectively I am a genius.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From joes@21:1/5 to All on Sat Jul 20 13:35:40 2024
    Am Sat, 20 Jul 2024 12:35:31 +0000 schrieb WM
    <wolfgang.mueckenheim@tha.de>:
    It is not guarantedd that n+1 exists for every n.
    Le 19/07/2024 à 17:51, Richard Damon a écrit :
    On 7/19/24 9:49 AM, WM wrote:

    Try to excplain how NUF(x) can increase from 0 to infinity without
    violating ∀n ∈ ℕ: 1/n - 1/(n+1) > 0.
    Then you will understand the inconsistency.
    Because NUF(x) doesn't have a finite value of ANY finite x > 0,
    That is your desired result, not an argment.
    If that were a result, NUF can't be defined and is useless.
    Same if NUF were finite.

    and thus is just UNDEFINED,
    Not at all. NUF(x) is the number of unit fractions between 0 and x.
    How do you know that number?

    ∀n ∈ ℕ: 1/n - 1/(n+1) > 0
    is all you need. Do you believe it without deriving it from axioms?
    Which means that there can not be a smallest unit fraction, as if you
    think think that 1/n is the smallest unit fraction, it shows that
    1/(n+1) will be smaller, but still greater than 0.
    It is not guarantedd that n+1 exists for every n.
    I am left speechless.

    Your "Darkness" is just your inability to handle the unboundedness of
    the infinite set of Natural Numbers.
    You can't handle it either. NUF(x) is well defined. Your denial is
    wrong.
    Yes we can.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Sat Jul 20 13:37:01 2024
    Le 20/07/2024 à 15:07, Richard Damon a écrit :
    On 7/20/24 8:37 AM, WM wrote:
    Le 19/07/2024 à 19:10, Richard Damon a écrit :

    But aleph_0 isn't a finite value, which are the only sorts of numbers
    that WMs system can use.

    No, NUF(x) = ℵo for every definable x > 0.

    Which means your logic includes transfinite numbers,

    That is my premise.

    so there is the gap
    between 0 and the finite numbers where NUF(x) increases from 0 to ℵo.

    Yes, between 0 and the definable numbers x > 0 there is a gap.

    So, NUF can jump from 0 to 1 at 1/ℵo which if you consider ℵo to be a number that represents a count, then 1/ℵo is close enough to a unit fraction.

    I would not call it 1/ℵo because in my system ℵo means infinitely many
    with respect to all infinites, but it is not forbidden. The dark number x
    where NUF(x) = 1 is certainly in the range of 1/ℵo.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Sat Jul 20 13:48:44 2024
    Le 20/07/2024 à 15:28, joes a écrit :
    Am Sat, 20 Jul 2024 12:19:26 +0000 schrieb WM:

    But infinitely many are in all those endsegments which contain
    infinitely many natnumbers.
    They are not the same ones.

    But infinitely many of them are the same natural numbers for all infinite endsegments, because they stem from E(1) and have not been lost as long as
    the endsegments are infinite.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Sat Jul 20 13:44:06 2024
    Le 20/07/2024 à 15:35, joes a écrit :
    Am Sat, 20 Jul 2024 12:35:31 +0000 schrieb WM

    Not at all. NUF(x) is the number of unit fractions between 0 and x.
    How do you know that number?

    I don't know it. But I know its laws of increase from basic mathematics.

    ∀n ∈ ℕ: 1/n - 1/(n+1) > 0
    is all you need. Do you believe it without deriving it from axioms?
    Which means that there can not be a smallest unit fraction, as if you
    think think that 1/n is the smallest unit fraction, it shows that
    1/(n+1) will be smaller, but still greater than 0.
    It is not guarantedd that n+1 exists for every n.
    I am left speechless.

    If some set in a linear system has no elements beyond a given threshold,
    then it ends before or at this threshold. Simple logic.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Richard Damon@21:1/5 to All on Sat Jul 20 10:00:00 2024
    On 7/20/24 9:37 AM, WM wrote:
    Le 20/07/2024 à 15:07, Richard Damon a écrit :
    On 7/20/24 8:37 AM, WM wrote:
    Le 19/07/2024 à 19:10, Richard Damon a écrit :

    But aleph_0 isn't a finite value, which are the only sorts of
    numbers that WMs system can use.

    No, NUF(x) = ℵo for every definable x > 0.

    Which means your logic includes transfinite numbers,

    That is my premise.

    And thus in includes all the natural numbers as defined.


    so there is the gap between 0 and the finite numbers where NUF(x)
    increases from 0 to ℵo.

    Yes, between 0 and the definable numbers x > 0 there is a gap.

    So, NUF can jump from 0 to 1 at 1/ℵo which if you consider ℵo to be a
    number that represents a count, then 1/ℵo is close enough to a unit
    fraction.

    I would not call it 1/ℵo because in my system ℵo means infinitely many with respect to all infinites, but it is not forbidden. The dark number
    x where NUF(x) = 1 is certainly in the range of 1/ℵo.

    Regards, WM



    But the point is that the number isn't in the range of the finite
    numbers, like the conventional unit fractions.

    Your "Dark numbers" are just the transfinite numbers, NOT FINITE numbers
    that are not "defined".

    ALL the members of the Natural, Rational, and Real numbers are
    definable. (admittedly the definitons of Real numbers that are not
    rational are by limits). Thus, your "dark numbers" are NOT parts of
    those numbers.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Sat Jul 20 15:05:42 2024
    Le 20/07/2024 à 16:00, Richard Damon a écrit :
    On 7/20/24 9:37 AM, WM wrote:
    Le 20/07/2024 à 15:07, Richard Damon a écrit :
    On 7/20/24 8:37 AM, WM wrote:
    Le 19/07/2024 à 19:10, Richard Damon a écrit :

    But aleph_0 isn't a finite value, which are the only sorts of
    numbers that WMs system can use.

    No, NUF(x) = ℵo for every definable x > 0.

    Which means your logic includes transfinite numbers,

    That is my premise.

    And thus in includes all the natural numbers as defined.

    No. It includes all, because we can manipulate them.
    |ℕ \ {1, 2, 3, ...}| = 0
    But not all are defined, bevause when we manipulate a defined one, most
    remain not manipulated
    ∀n ∈ ℕ_def: |ℕ \ {1, 2, 3, ..., n}| = ℵo

    I would not call it 1/ℵo because in my system ℵo means infinitely many >> with respect to all infinites, but it is not forbidden. The dark number
    x where NUF(x) = 1 is certainly in the range of 1/ℵo.

    But the point is that the number isn't in the range of the finite
    numbers, like the conventional unit fractions.

    All unit fractions are in the range of finite numbers.

    Your "Dark numbers" are just the transfinite numbers,

    No, all numbers less than ω are finite numbers.

    ALL the members of the Natural, Rational, and Real numbers are
    definable.

    Subtract all numbers from ℕ. Nothig remains.
    Subtract the greatest number that can be defined from ℕ. ℵo numbers
    remain.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Sat Jul 20 18:07:38 2024
    Am 20.07.2024 um 15:35 schrieb joes:
    Am Sat, 20 Jul 2024 12:35:31 +0000 schrieb WM
    <wolfgang.mueckenheim@tha.de>:

    NUF(x) is the number of unit fractions between 0 and x.

    Using the usual formal/symbolic language of set theory:

    NUF(x) =df card({u e {1/n : n e IN} : u <= x}) (x e IR)

    How do you know that number?

    It's not that hard (in the context of set theory).

    Actually, we get

    NUF(x) = 0 for all x e IR, x <= 0
    and NUF(x) = aleph_0 for all x e IR, x > 0.

    ____________________________________________________

    ∀n ∈ ℕ: 1/n - 1/(n+1) > 0 is all you need. [WM]

    Which means that there can not be a smallest unit fraction, as if you
    think that 1/n is the smallest unit fraction, it shows that
    1/(n+1) will be smaller [...]

    Indeed!

    It is not guarantedd that n+1 exists for every n.

    Well...

    I am left speechless.

    Yes, this man is crazy.

    (Or an ultrafinitist, but then the whole "discussion" is moot, since our context here is classical mathematics / set theory.)

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Sat Jul 20 18:11:25 2024
    Am 20.07.2024 um 16:00 schrieb Richard Damon:
    On 7/20/24 9:37 AM, WM wrote:
    Le 20/07/2024 à 15:07, Richard Damon a écrit :
    On 7/20/24 8:37 AM, WM wrote:
    Le 19/07/2024 à 19:10, Richard Damon a écrit :
    ...

    Two guys writing a lot of nonsense.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Sat Jul 20 17:21:17 2024
    Am 20.07.2024 um 15:07 schrieb Richard Damon:

    Seems that you like to talk nonsense, just like WM.

    Hint:

    NUF(x) =df card({u e {1/n : n e IN} : u <= x}) (x e IR)

    Note the condition "x e IR".

    More hints: {1/n : n e IN} c IR and "<=" refers to the usual <= defined
    on the real numbers (i.e. on IR).

    Then (by definition):

    NUF(x) = 0 for all x e IR, x <= 0
    and NUF(x) = aleph_0 for all x e IR, x > 0.

    Which means your logic includes transfinite numbers, so there is the gap between 0 and the finite numbers where NUF(x) increases from 0 to ℵo.

    No, there is no "gap".

    So, NUF can jump from 0 to 1 at 1/ℵo which

    No, it can't. because 1. "1/ℵo" is not defined in the context of set
    theory, and even if it were, it would 2. most likely not be a real
    number. <facepalm>

    if you consider ℵo to be a number that represents a count, then 1/ℵo is close enough to a unit
    fraction.

    You are talking nonsense.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Sat Jul 20 17:25:43 2024
    Am 20.07.2024 um 15:28 schrieb joes:
    Am Sat, 20 Jul 2024 12:19:26 +0000 schrieb WM:
    Le 19/07/2024 à 16:18, Moebius a écrit :

    Hint: For each and every natural number n: n is not in the (infinite)
    end.segment {n+1, n+2, n+3, ...}.

    Of course. But that does not concern infinite endsegments.

    Man muss wohl von einer ausgesprochenen "Leseschwäche" sprechen, wenn Da steht:

    For each and every natural number n: n is not in the
    (infinite) endsegment {n+1, n+2, n+3, ...}.

    Und die "Antwort" darauf lautet:

    Of course. But that does not concern infinite endsegments. (WM)

    WtF?!

    Quoted for contradiction.

    Der Typ gehört in eine Klapse, das ist alles.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Richard Damon@21:1/5 to All on Sat Jul 20 12:16:51 2024
    On 7/20/24 11:05 AM, WM wrote:
    Le 20/07/2024 à 16:00, Richard Damon a écrit :
    On 7/20/24 9:37 AM, WM wrote:
    Le 20/07/2024 à 15:07, Richard Damon a écrit :
    On 7/20/24 8:37 AM, WM wrote:
    Le 19/07/2024 à 19:10, Richard Damon a écrit :

    But aleph_0 isn't a finite value, which are the only sorts of
    numbers that WMs system can use.

    No, NUF(x) = ℵo for every definable x > 0.

    Which means your logic includes transfinite numbers,

    That is my premise.

    And thus in includes all the natural numbers as defined.

    No. It includes all, because we can manipulate them.
    |ℕ \ {1, 2, 3, ...}| = 0
    But not all are defined, bevause when we manipulate a defined one, most remain not manipulated
    ∀n ∈ ℕ_def: |ℕ \ {1, 2, 3, ..., n}| = ℵo


    But then ℵo isn't "defined" because you can't "manipulate" it

    Baseically, your definion of "defined" is inconsistant with your system,
    which is what causes you "dark" numbers.


    I would not call it 1/ℵo because in my system ℵo means infinitely
    many with respect to all infinites, but it is not forbidden. The dark
    number x where NUF(x) = 1 is certainly in the range of 1/ℵo.

    But the point is that the number isn't in the range of the finite
    numbers, like the conventional unit fractions.

    All unit fractions are in the range of finite numbers.

    And NUF is undefined because it presumes doing something that can not be
    done.

    Since there is not finite number x such that NUF(x) is 1, it shows that
    either its definition is just internally inconsistant, or it includes,
    by necessisty, a broader class of values as "unit fractions" then you
    are thinking of.

    The lowest value of x where NUF(x) == 1 must be a "unit fraction" and it
    can not be a "unit fraction of a natural number", as you agree that for
    all of those NUF(x) is ℵo, so it must be in that range of the
    transfinite infinitesimals that it counts as unit fractions for NUF(x).

    since 1/ℵo is sort of a unit fraction, and can be thought of as the
    value of epsilon, the base infinitesimal, we can also get othes at
    values like 1/(ℵo/2), 1/(ℵo/3), ...


    Your "Dark numbers" are just the transfinite numbers,

    No, all numbers less than ω are finite numbers.

    Nope, the infintisimals, which are part of the transfinite, are not
    finite, they are smaller than finite (but bigger than 0)


    ALL the members of the Natural, Rational, and Real numbers are definable.

    Subtract all numbers from ℕ. Nothig remains.
    Subtract the greatest number that can be defined from ℕ. ℵo numbers remain.

    Only because you have a broken definition of "defined" that can't handle
    the rest of your system.


    Regards, WM


    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Sat Jul 20 18:25:34 2024
    Am 20.07.2024 um 18:16 schrieb Richard Damon:

    since 1/ℵo is sort of a unit fraction

    No, it isn't. It's undefined nonsense.

    Subtract the greatest number that can be defined from ℕ. ℵo numbers
    remain.

    Two idiots, talking nonsense.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Sat Jul 20 18:53:07 2024
    Am 20.07.2024 um 15:35 schrieb joes:
    Am Sat, 20 Jul 2024 12:35:31 +0000 schrieb WM
    <wolfgang.mueckenheim@tha.de>:

    Nochmal etwas dazu:

    ∀n ∈ ℕ: 1/n - 1/(n+1) > 0 is all you need. [WM]

    Which means that there can not be a smallest unit fraction, as if you
    think think that 1/n is the smallest unit fraction, it shows that
    1/(n+1) will be smaller [...]

    Ja, denn aus der oben VON WM angeführten Formel ergibt sich sofort:

    ∀n ∈ ℕ: 1/n > 1/(n+1).

    It is not guarantedd that n+1 exists for every n. [WM]

    @WM:

    Hör mal, Mückenheim, Du Spinner: Doch das ist (im gegenwärtigen Kontext) garantiert. WENN dem NICHT so WÄRE, dann dürftest Du Deine Formel erst
    gar nicht verwenden. Denn dann könnte es ein n_0 e IN geben, so dass
    "n_0 + 1" nicht definiert ist; aus Deiner Formel lässt sich aber durch Spezialisierung ableiten:

    1/n_0 - 1/(n_0 + 1) > 0 .

    Mit "n_0 + 1" hätten wir dann aber einen undefinierten Ausdruck in der Aussage. So was ist in der Mathematik nicht zulässig.

    Des weiteren schwafest Du oben auch etwas von Axiomen. ("Do you believe
    it without deriving it from axioms?") Ja, Mückenheim, es sind genau
    diese Axiome (und Definitionen), die (im Kontext der klassischen
    Mathematik / Mengenlehre) garantieren (sicherstellen), dass "n + 1" für
    alle n e IN definiert ist. D. h. dass man den Ausdruck "n + 1"
    bedenkenlos verwenden kann, wenn sich das "n" als Variable oder
    Konstante auf natürliche Zahlen bezieht.

    Daher ergibt sich aus Deiner Formel (in diesem Kontext) in der Tat, (mit
    der Def. des Begriffs /Stammbruchs/ und dem Umstand, dass mit n e IN
    auch n+1 e IN ist [->Pean0 und Def. von +]) dass es zu jedem Stammbruch
    einen kleineren Stammbruch gibt.

    Den Beweis dafür habe ich ich auch schon zig. Mal gepostet.

    I am left speechless.

    Ach, das gibt sich mit der Zeit, wenn man sich klar macht, dass WM im
    wahrsten Sinne des Wortes geistekrank ist. Sein Geschwafel basiert offensichtlich auf einem Wahnsystem.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Sat Jul 20 19:16:55 2024
    Am 19.07.2024 um 17:01 schrieb Moebius:
    Am 19.07.2024 um 16:18 schrieb Moebius:
    Am 19.07.2024 um 16:07 schrieb WM:
    Le 18/07/2024 à 23:51, Jim Burns a écrit :

    It is insufficient to be in all _predecessor_ end.segments.

    Infinitely many numbers are in all predecessors and in all *infinite* successors.

    Nope.

    No number is "in all predecessors and in all *infinite* successors".

    Hint: For each end every natural number n: the endsegment {m e IN : m >
    n} is *infinite*, but n !e {m e IN : m > n}.

    Wie schwer kann es sein, das zu begreifen, Mückenheim?

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Richard Damon@21:1/5 to All on Sat Jul 20 16:02:14 2024
    On 7/20/24 8:35 AM, WM wrote:
    Le 19/07/2024 à 17:51, Richard Damon a écrit :
    On 7/19/24 9:49 AM, WM wrote:

    Try to excplain how NUF(x) can increase from 0 to infinity without
    violating ∀n ∈ ℕ: 1/n - 1/(n+1) > 0.
    Then you will understand the inconsistency.

    Because NUF(x) doesn't have a finite value of ANY finite x > 0,

    That is your desired result, not an argment.

    No, it is just a provable fact.


    and thus is just UNDEFINED,

    Not at all. NUF(x) is the number of unit fractions between 0 and x.

    Which is something that can't be defined as to have any value other than
    0 or ℵo since there is no finite value that has a finite non-zero number
    of unit fractions below it.

    The fact that you think there must be a value where it is 1 just shows
    you don't understand how unbounded number works


    because its verbal definition makes in incorrect assumption that there
    *IS* a smallest unit fraction,

    No, there is no assumption but only a result from mathematics.

    Except since you aren't (see below) your logic is just lies.



    ∀n ∈ ℕ: 1/n - 1/(n+1) > 0

    is all you need. Do you believe it without deriving it from axioms?

    Which means that there can not be a smallest unit fraction, as if you
    think think that 1/n is the smallest unit fraction, it shows that
    1/(n+1) will be smaller, but still greater than 0.

    It is not guarantedd that n+1 exists for every n.

    Then you aren't using the Natural Numbers.



    Try to understand and repeat the above. Then you will understand.

    And you logic only works if you assume that there must be a largest
    natural number, even if you don't know what it is.

    I do not assume it but derive it from mathematics.

    It seems not.


    Your "Darkness" is just your inability to handle the unboundedness of
    the infinite set of Natural Numbers.

    You can't handle it either. NUF(x) is well defined. Your denial is wrong.

    But only to have the values of 0 or ℵo. You can't actually talk about a
    value of x where it has the value of 1, because such a number doesn't
    exist in the finites, and you seem to want to reject the infintesimals, probably because you logic breaks even more with them than with the
    unbound set of Naturals.


    Regards, WM



    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Sat Jul 20 22:25:40 2024
    Am 20.07.2024 um 20:52 schrieb Chris M. Thomasson:

    ROFL!!!! WM's racist numbers, of course he calls them dark! lol.

    Right, even worse, some of them are brown! (->brownshirts)

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From joes@21:1/5 to All on Sat Jul 20 20:56:15 2024
    Am Sat, 20 Jul 2024 13:48:44 +0000 schrieb WM:
    Le 20/07/2024 à 15:28, joes a écrit :
    Am Sat, 20 Jul 2024 12:19:26 +0000 schrieb WM:

    But infinitely many are in all those endsegments which contain
    infinitely many natnumbers.
    They are not the same ones.
    But infinitely many of them are the same natural numbers for all
    infinite endsegments, because they stem from E(1) and have not been lost
    as long as the endsegments are infinite.
    No number n is included in all segments, in particular no E(m) for m>n.

    --
    Am Sat, 20 Jul 2024 12:35:31 +0000 schrieb WM in sci.math:
    It is not guarantedd that n+1 exists for every n.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Sat Jul 20 23:02:48 2024
    Am 20.07.2024 um 22:56 schrieb joes:
    Am Sat, 20 Jul 2024 13:48:44 +0000 schrieb WM:

    But infinitely many of them [bla, bla, bla] for all infinite endsegments [blu blu blu]

    No number n is included in all segments, in particular no[t in] E(m) for m > n.

    Hint@WM: ALL endsegments are infinite:

    An e IN: E(n) is infinite.

    In other words, for all X: X is an infinite endsegment iff X is an
    endsegment.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Sun Jul 21 14:02:43 2024
    Le 20/07/2024 à 18:53, Moebius a écrit :
    Am 20.07.2024 um 15:35 schrieb joes:
    Am Sat, 20 Jul 2024 12:35:31 +0000 schrieb WM

    ∀n ∈ ℕ: 1/n - 1/(n+1) > 0 is all you need. [WM]

    Which means that there can not be a smallest unit fraction, as if you
    think think that 1/n is the smallest unit fraction, it shows that
    1/(n+1) will be smaller [...]

    Ja, denn aus der oben VON WM angeführten Formel ergibt sich sofort:

    ∀n ∈ ℕ: 1/n > 1/(n+1).

    Natürlich.

    It is not guaranteed that n+1 exists for every n. [WM]

    Doch das ist (im gegenwärtigen Kontext)
    garantiert. WENN dem NICHT so WÄRE, dann dürftest Du Deine Formel erst
    gar nicht verwenden. Denn dann könnte es ein n_0 e IN geben, so dass
    "n_0 + 1" nicht definiert ist; aus Deiner Formel lässt sich aber durch Spezialisierung ableiten:

    1/n_0 - 1/(n_0 + 1) > 0 .

    Die Formel garantiert nicht die Existenz aller Stammbrüche.

    Daher ergibt sich aus Deiner Formel (in diesem Kontext) in der Tat, (mit
    der Def. des Begriffs /Stammbruchs/ und dem Umstand, dass mit n e IN
    auch n+1 e IN ist [->Pean0 und Def. von +]) dass es zu jedem Stammbruch
    einen kleineren Stammbruch gibt.

    Peano oder alle Stammbrüche, die existieren sind separiert. Das ist ein ausschließendes oder.

    Gruß, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Sun Jul 21 14:07:00 2024
    Le 20/07/2024 à 19:16, Moebius a écrit :

    No number is "in all predecessors and in all *infinite* successors".

    What are the infinite sets remainig from E(1) in infinite endsegments?
    Note inclusion monotony!

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Sun Jul 21 13:55:45 2024
    Le 20/07/2024 à 18:16, Richard Damon a écrit :
    On 7/20/24 11:05 AM, WM wrote:

    All unit fractions are in the range of finite numbers.

    And NUF is undefined because it presumes doing something that can not be done.

    It is counting the unit fractions. If they all are existing, then NUF is defined.

    Since there is not finite number x such that NUF(x) is 1, it shows that either its definition is just internally inconsistant, or it includes,
    by necessisty, a broader class of values as "unit fractions" then you
    are thinking of.

    The broader class are dark numbers.

    The lowest value of x where NUF(x) == 1 must be a "unit fraction" and it
    can not be a "unit fraction of a natural number", as you agree that for
    all of those NUF(x) is ℵo,

    No.

    since 1/ℵo is sort of a unit fraction,

    No.

    Subtract all numbers from ℕ. Nothig remains.
    Subtract the greatest number that can be defined from ℕ. ℵo numbers remain.

    Only because you have a broken definition of "defined" that can't handle
    the rest of your system.

    Defined means having a decimal representation.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Sun Jul 21 14:13:41 2024
    Le 20/07/2024 à 22:02, Richard Damon a écrit :
    On 7/20/24 8:35 AM, WM wrote:
    Le 19/07/2024 à 17:51, Richard Damon a écrit :
    On 7/19/24 9:49 AM, WM wrote:

    Try to excplain how NUF(x) can increase from 0 to infinity without
    violating ∀n ∈ ℕ: 1/n - 1/(n+1) > 0.
    Then you will understand the inconsistency.

    Because NUF(x) doesn't have a finite value of ANY finite x > 0,

    That is your desired result, not an argment.

    No, it is just a provable fact.

    This too: ∀n ∈ ℕ: 1/n - 1/(n+1) > 0.


    and thus is just UNDEFINED,

    Not at all. NUF(x) is the number of unit fractions between 0 and x.

    Which is something that can't be defined as to have any value other than
    0 or ℵo since there is no finite value that has a finite non-zero number
    of unit fractions below it.

    If all are separated and if none is smaller than zero, then according to
    logic there must be a first one or more than one first ones.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Sun Jul 21 14:15:45 2024
    Le 20/07/2024 à 22:56, joes a écrit :
    Am Sat, 20 Jul 2024 13:48:44 +0000 schrieb WM:
    Le 20/07/2024 à 15:28, joes a écrit :
    Am Sat, 20 Jul 2024 12:19:26 +0000 schrieb WM:

    But infinitely many are in all those endsegments which contain
    infinitely many natnumbers.
    They are not the same ones.
    But infinitely many of them are the same natural numbers for all
    infinite endsegments, because they stem from E(1) and have not been lost
    as long as the endsegments are infinite.
    No number n is included in all segments, in particular no E(m) for m>n.

    But infinitely many numbers are included in all infinite endsegments. All endsegments are claimed to be infinite. Contradiction.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Sun Jul 21 14:17:34 2024
    Le 20/07/2024 à 23:02, Moebius a écrit :

    An e IN: E(n) is infinite.

    In other words, for all X: X is an infinite endsegment iff X is an endsegment.

    Then infinitely many numbers from E(1) are contained in all endsegments.
    Or what else makes them infinite?

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From joes@21:1/5 to All on Sun Jul 21 14:48:46 2024
    Am Sun, 21 Jul 2024 14:15:45 +0000 schrieb WM:
    Le 20/07/2024 à 22:56, joes a écrit :
    Am Sat, 20 Jul 2024 13:48:44 +0000 schrieb WM:
    Le 20/07/2024 à 15:28, joes a écrit :
    Am Sat, 20 Jul 2024 12:19:26 +0000 schrieb WM:

    But infinitely many are in all those endsegments which contain
    infinitely many natnumbers.
    They are not the same ones.
    But infinitely many of them are the same natural numbers for all
    infinite endsegments, because they stem from E(1) and have not been
    lost as long as the endsegments are infinite.
    No number n is included in all segments, in particular no E(m) for m>n.
    But infinitely many numbers are included in all infinite endsegments.
    All endsegments are claimed to be infinite. Contradiction.
    I don't see it. What does your first sentence mean?
    No number is a part of all segments.

    --
    Am Sat, 20 Jul 2024 12:35:31 +0000 schrieb WM in sci.math:
    It is not guaranteed that n+1 exists for every n.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Sun Jul 21 15:02:30 2024
    Le 21/07/2024 à 16:48, joes a écrit :
    Am Sun, 21 Jul 2024 14:15:45 +0000 schrieb WM:
    Le 20/07/2024 à 22:56, joes a écrit :
    Am Sat, 20 Jul 2024 13:48:44 +0000 schrieb WM:
    Le 20/07/2024 à 15:28, joes a écrit :
    Am Sat, 20 Jul 2024 12:19:26 +0000 schrieb WM:

    But infinitely many are in all those endsegments which contain
    infinitely many natnumbers.
    They are not the same ones.
    But infinitely many of them are the same natural numbers for all
    infinite endsegments, because they stem from E(1) and have not been
    lost as long as the endsegments are infinite.
    No number n is included in all segments, in particular no E(m) for m>n.
    But infinitely many numbers are included in all infinite endsegments.
    All endsegments are claimed to be infinite. Contradiction.
    I don't see it. What does your first sentence mean?

    Every infinite endsegment has infinitely many elements from E(1) = ℕ.

    No number is a part of all segments.

    What numbers are filling the endsegments?

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Sun Jul 21 15:00:01 2024
    Le 21/07/2024 à 16:44, joes a écrit :
    Am Sun, 21 Jul 2024 14:02:43 +0000 schrieb WM:
    Le 20/07/2024 à 18:53, Moebius a écrit :
    Am 20.07.2024 um 15:35 schrieb joes:
    Am Sat, 20 Jul 2024 12:35:31 +0000 schrieb WM

    It is not guaranteed that n+1 exists for every n. [WM]
    Doch das ist (im gegenwärtigen Kontext)
    garantiert. WENN dem NICHT so WÄRE, dann dürftest Du Deine Formel erst >>> gar nicht verwenden. Denn dann könnte es ein n_0 e IN geben, so dass
    "n_0 + 1" nicht definiert ist; aus Deiner Formel lässt sich aber durch
    Spezialisierung ableiten:
    1/n_0 - 1/(n_0 + 1) > 0 .
    Die Formel garantiert nicht die Existenz aller Stammbrüche.
    Was würde das heißen, dass ein Stammbruch nicht "existiert"?

    Das würde heißen, dass es einen letzten gibt, den man
    selbstverständlich nicht auffinden kann. Aber seine Existenz kann man
    beweisen unter den folgenden Prämissen:
    1) Alle Stammbrüche existieren aktual (also nicht nur potentiell, wo
    immer weitere erschaffen werden können).
    2) Der Bereich, in dem Stammbrüche befinden können ist durch 0 und 1 begrenzt.

    Daraus (lineares Problem) folgt, dass zu beiden Seiten ein erster oder
    mehrere erste existieren.

    Gruß, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From joes@21:1/5 to All on Sun Jul 21 14:44:25 2024
    Am Sun, 21 Jul 2024 14:02:43 +0000 schrieb WM:
    Le 20/07/2024 à 18:53, Moebius a écrit :
    Am 20.07.2024 um 15:35 schrieb joes:
    Am Sat, 20 Jul 2024 12:35:31 +0000 schrieb WM

    It is not guaranteed that n+1 exists for every n. [WM]
    Doch das ist (im gegenwärtigen Kontext)
    garantiert. WENN dem NICHT so WÄRE, dann dürftest Du Deine Formel erst
    gar nicht verwenden. Denn dann könnte es ein n_0 e IN geben, so dass
    "n_0 + 1" nicht definiert ist; aus Deiner Formel lässt sich aber durch
    Spezialisierung ableiten:
    1/n_0 - 1/(n_0 + 1) > 0 .
    Die Formel garantiert nicht die Existenz aller Stammbrüche.
    Was würde das heißen, dass ein Stammbruch nicht "existiert"?

    --
    Am Sat, 20 Jul 2024 12:35:31 +0000 schrieb WM in sci.math:
    It is not guaranteed that n+1 exists for every n.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Sun Jul 21 17:06:24 2024
    Am 21.07.2024 um 16:48 schrieb joes:
    Am Sun, 21 Jul 2024 14:15:45 +0000 schrieb WM:
    Le 20/07/2024 à 22:56, joes a écrit :

    No number n is included in all segments, in particular no[t in] E(m) for m > n. [joes]

    But infinitely many numbers are included in all infinite endsegments. [...]

    I don't see it. What does your first sentence mean?

    It means that "infinitely many numbers are included in all *infinite* endsegments".

    Hint: IN WMs world there are finite endsegments.

    No number is a part of all segments.

    Right. That's because (due to WM) there are *finite* endsegments they
    are not in.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Sun Jul 21 17:20:44 2024
    Am 21.07.2024 um 16:48 schrieb joes:
    Am Sun, 21 Jul 2024 14:15:45 +0000 schrieb WM:
    Le 20/07/2024 à 22:56, joes a écrit :

    No number n is included in all segments, in particular no[t in] E(m) for m > n.

    <Some Mückenbla>

    No number is a part of all segments.

    Try this argument:

    | For each end every natural number n: the endsegment {m e IN : m > n}
    | is *infinite*, but n !e {m e IN : m > n}.

    Hence for each and every natural number there is an *infinite*
    endsegment it's not in.

    Disproving WM's claim "infinitely many numbers are included in all
    infinite endsegments" (since NOT EVEN ONE natural number is included in
    all infinite endsegments).

    Of course, for WM this result dispoves set theory. :-P

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Sun Jul 21 15:50:10 2024
    Le 21/07/2024 à 17:20, Moebius a écrit :

    Try this argument:

    | For each end every natural number n: the endsegment {m e IN : m > n}
    | is *infinite*, but n !e {m e IN : m > n}.

    Hereby you confess that infinitely many numbers cannot be used in
    bijections.

    Hence for each and every natural number there is an *infinite*
    endsegment it's not in.

    But these infinite endsegments are much larger than the finite initial
    segments (1, 2, 3, ..., n). If they are in every endsegment, then they
    yield an infinite intersection.

    Disproving WM's claim "infinitely many numbers are included in all
    infinite endsegments" (since NOT EVEN ONE natural number is included in
    all infinite endsegments).

    How can all endsegments remain infinite if all natnumbers leave?

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Sun Jul 21 15:44:43 2024
    Le 21/07/2024 à 17:13, FromTheRafters a écrit :
    on 7/21/2024, Moebius supposed :
    Am 21.07.2024 um 16:48 schrieb joes:
    Am Sun, 21 Jul 2024 14:15:45 +0000 schrieb WM:
    Le 20/07/2024 à 22:56, joes a écrit :

    No number n is included in all segments, in particular no[t in] E(m) for >>>>> m > n. [joes]

    But infinitely many numbers are included in all infinite endsegments.
    [...]

    I don't see it. What does your first sentence mean?

    It means that "infinitely many numbers are included in all *infinite*
    endsegments".

    Hint: IN WMs world there are finite endsegments.

    No number is a part of all segments.

    Right. That's because (due to WM) there are *finite* endsegments they are not
    in.

    Right, due to his not having an n+1 for each and every n guaranteed.
    Kind of a wishy-washy logic.

    All infinite endsegments E(n) and E(k) and E(m) and so on have an infinite intersection, whatever natnumbers n, k, j are. How can infinite
    endsegments have no natnumber in common?

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Sun Jul 21 15:42:03 2024
    Le 21/07/2024 à 17:06, Moebius a écrit :
    Am 21.07.2024 um 16:48 schrieb joes:
    Am Sun, 21 Jul 2024 14:15:45 +0000 schrieb WM:
    Le 20/07/2024 à 22:56, joes a écrit :

    No number n is included in all segments, in particular no[t in] E(m) for m > n.
    [joes]

    But infinitely many numbers are included in all infinite endsegments. [...]

    I don't see it. What does your first sentence mean?

    It means that "infinitely many numbers are included in all *infinite* endsegments".

    How can they have an empty intersection? Are some only even, others only multiples of 3, others only multiples of 5?

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Sun Jul 21 19:19:01 2024
    Am 21.07.2024 um 17:20 schrieb Moebius:

    Hence for each and every natural number there is an *infinite*
    endsegment it's not in.

    Disproving WM's claim "infinitely many numbers are included in all
    infinite endsegments" (since NOT EVEN ONE natural number is included in
    all infinite endsegments).

    But why does he still claim this nonsense?

    Weil er nicht zwischen Ax Ey und Ey Ax unterscheiden kann.

    Offenbar stimmt:

    A IE e SET_OF_INFINITE_ENDSEGMENTS: E^oo n e IN: n e IE

    also stimmt "in Mückenheims Welt" auch

    E^oo n e IN: A IE e SET_OF_INFINITE_ENDSEGMENTS: n e IE .

    Quantifier dyslexia.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Sun Jul 21 19:34:00 2024
    Am 21.07.2024 um 19:19 schrieb Moebius:
    Am 21.07.2024 um 17:20 schrieb Moebius:

    Hence for each and every natural number there is an *infinite*
    endsegment it's not in.

    Disproving WM's claim "infinitely many numbers are included in all
    infinite endsegments" (since NOT EVEN ONE natural number is included
    in all infinite endsegments).

    But why does he still claim this nonsense?

    Weil er nicht zwischen Ax Ey und Ey Ax unterscheiden kann.

    Offenbar stimmt:

        A IE e SET_OF_INFINITE_ENDSEGMENTS: E^oo n e IN: n e IE

    also stimmt "in Mückenheims Welt" auch

        E^oo n e IN: A IE e SET_OF_INFINITE_ENDSEGMENTS: n e IE .

    Quantifier dyslexia.

    Andererseits hat WM gelegentlich schon eingestanden, dass

    ~E^oo n e IN: A E e SET_OF_ENDSEGMENTS: n e E

    gilt, weil ja bewiesen wurde (oder für ihn einsichtig ist), dass

    ~E n e IN: A E e SET_OF_ENDSEGMENTS: n e E

    gilt. (Es ist ja für jedes n e IN n nicht im Endsegment {m e IN : m > n}.)

    Also gibt es (in seiner Welt) nur die Möglichkeit, dass

    SET_OF_ENDSEGMENTS =/= SET_OF_INFINITE_ENDSEGMENTS

    ist. Es muss also endliche Endsegmente geben! :-P

    ANDERE würden vielleicht aus dem Umstand, dass man auch

    A E e SET_OF_ENDSEGMENTS: E is infinite

    beweisen kann, eher den Schluss ziehen, dass etwas mit Mückenheims
    "Schluss" (Gleichsetzung) von

    A IE e SET_OF_INFINITE_ENDSEGMENTS: E^oo n e IN: n e IE

    auf (mit)

    E^oo n e IN: A IE e SET_OF_INFINITE_ENDSEGMENTS: n e IE

    "nicht stimmt"; d h. dass dieser (diese) nicht korrekt sein kann (ist).

    Mückenheim würde daraus vielleicht den Schluss ziehen, dass er damit die Mengenlehre widerlegt habe! :-)

    ML: Alle Endsegmente sind unendlich.

    WM: Es gibt endliche Endsegmente.

    Ein Widerspruch! Also ist die ML widerlegt!

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From joes@21:1/5 to All on Sun Jul 21 18:24:20 2024
    Am Sun, 21 Jul 2024 15:50:10 +0000 schrieb WM:
    Le 21/07/2024 à 17:20, Moebius a écrit :

    | For each end every natural number n: the endsegment {m e IN : m > n}
    | is *infinite*, but n !e {m e IN : m > n}.
    Hereby you confess that infinitely many numbers cannot be used in
    bijections.
    I have no idea how you got that from the above.

    Hence for each and every natural number there is an *infinite*
    endsegment it's not in.
    Infinitely many, even.
    But these infinite endsegments are much larger than the finite initial segments (1, 2, 3, ..., n). If they are in every endsegment, then they
    yield an infinite intersection.
    What is in every segment?

    Disproving WM's claim "infinitely many numbers are included in all
    infinite endsegments" (since NOT EVEN ONE natural number is included in
    all infinite endsegments).
    How can all endsegments remain infinite if all natnumbers leave?
    What? They are countable.

    --
    Am Sat, 20 Jul 2024 12:35:31 +0000 schrieb WM in sci.math:
    It is not guaranteed that n+1 exists for every n.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From joes@21:1/5 to All on Sun Jul 21 18:27:03 2024
    Am Sun, 21 Jul 2024 15:44:43 +0000 schrieb WM:
    Le 21/07/2024 à 17:13, FromTheRafters a écrit :
    on 7/21/2024, Moebius supposed :
    Am 21.07.2024 um 16:48 schrieb joes:
    Am Sun, 21 Jul 2024 14:15:45 +0000 schrieb WM:
    Le 20/07/2024 à 22:56, joes a écrit :

    No number n is included in all segments, in particular not in
    E(m) for m > n.
    But infinitely many numbers are included in all infinite
    endsegments.
    I don't see it. What does your first sentence mean?
    It means that "infinitely many numbers are included in all *infinite*
    endsegments". Hint: IN WMs world there are finite endsegments.

    No number is a part of all segments.
    Right. That's because (due to WM) there are *finite* endsegments they
    are not in.
    Right, due to his not having an n+1 for each and every n guaranteed.
    Kind of a wishy-washy logic.
    All infinite endsegments E(n) and E(k) and E(m) and so on have an
    infinite intersection, whatever natnumbers n, k, j are. How can infinite endsegments have no natnumber in common?
    Only the finite intersections are not empty.

    --
    Am Sat, 20 Jul 2024 12:35:31 +0000 schrieb WM in sci.math:
    It is not guaranteed that n+1 exists for every n.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From joes@21:1/5 to All on Sun Jul 21 18:32:47 2024
    Am Sun, 21 Jul 2024 15:00:01 +0000 schrieb WM:
    Le 21/07/2024 à 16:44, joes a écrit :
    Am Sun, 21 Jul 2024 14:02:43 +0000 schrieb WM:
    Le 20/07/2024 à 18:53, Moebius a écrit :
    Am 20.07.2024 um 15:35 schrieb joes:
    Am Sat, 20 Jul 2024 12:35:31 +0000 schrieb WM

    It is not guaranteed that n+1 exists for every n. [WM]
    Doch das ist (im gegenwärtigen Kontext)
    garantiert. WENN dem NICHT so WÄRE, dann dürftest Du Deine Formel
    erst gar nicht verwenden. Denn dann könnte es ein n_0 e IN geben, so
    dass "n_0 + 1" nicht definiert ist; aus Deiner Formel lässt sich aber >>>> durch Spezialisierung ableiten:
    1/n_0 - 1/(n_0 + 1) > 0 .
    Die Formel garantiert nicht die Existenz aller Stammbrüche.
    Was würde das heißen, dass ein Stammbruch nicht "existiert"?
    Das würde heißen, dass es einen letzten gibt, den man selbstverständlich nicht auffinden kann. Aber seine Existenz kann man beweisen unter den folgenden Prämissen:
    Nein, ich meine, wie kann man von etwas nicht Existentem sprechen?
    1) Alle Stammbrüche existieren aktual (also nicht nur potentiell, wo
    immer weitere erschaffen werden können).
    2) Der Bereich, in dem Stammbrüche befinden können ist durch 0 und 1 begrenzt.
    Daraus (lineares Problem) folgt, dass zu beiden Seiten ein erster oder mehrere erste existieren.
    Nur, wenn die Abstände konstant wären.

    --
    Am Sat, 20 Jul 2024 12:35:31 +0000 schrieb WM in sci.math:
    It is not guaranteed that n+1 exists for every n.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From joes@21:1/5 to All on Sun Jul 21 18:29:02 2024
    Am Sun, 21 Jul 2024 15:02:30 +0000 schrieb WM:
    Le 21/07/2024 à 16:48, joes a écrit :
    Am Sun, 21 Jul 2024 14:15:45 +0000 schrieb WM:
    Le 20/07/2024 à 22:56, joes a écrit :
    Am Sat, 20 Jul 2024 13:48:44 +0000 schrieb WM:
    Le 20/07/2024 à 15:28, joes a écrit :
    Am Sat, 20 Jul 2024 12:19:26 +0000 schrieb WM:

    But infinitely many are in all those endsegments which contain
    infinitely many natnumbers.
    They are not the same ones.
    But infinitely many of them are the same natural numbers for all
    infinite endsegments, because they stem from E(1) and have not been
    lost as long as the endsegments are infinite.
    No number n is included in all segments, in particular no E(m) for
    n.
    But infinitely many numbers are included in all infinite endsegments.
    All endsegments are claimed to be infinite. Contradiction.
    I don't see it. What does your first sentence mean?
    Every infinite endsegment has infinitely many elements from E(1) = ℕ.
    But not the same ones.

    No number is a part of all segments.
    What numbers are filling the endsegments?
    What do you mean "filling"?

    --
    Am Sat, 20 Jul 2024 12:35:31 +0000 schrieb WM in sci.math:
    It is not guaranteed that n+1 exists for every n.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Sun Jul 21 20:47:40 2024
    Am 21.07.2024 um 20:24 schrieb joes:

    How can all endsegments remain infinite if all natnumbers leave?

    What?

    Quantifier dyslexia:

    Our claim: An: Em: n !e E(m) (*)

    WM reads: Em: An: n !e E(m). (**)

    For WM there simply is no difference between (*) and (**). For WM "this"
    just means "all natnumbers leave".

    __________________________________________

    @WM: An: Em: n !e E(m) is true, but Em: An: n !e E(m) is false.

    The natural numbers do not "leave", but for each and every natural
    number n there is an endsegment E, such that n !e E, namely the
    endsegment {m e IN : m > n}.

    Hint: THIS DOES NOT MEAN (or imply) that there is an endsegment E such
    that for each and every natural number n: n !e E.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Sun Jul 21 21:11:29 2024
    Am 21.07.2024 um 20:32 schrieb joes:
    Am Sun, 21 Jul 2024 15:00:01 +0000 schrieb WM:

    2) Der Bereich, in dem Stammbrüche befinden können ist durch 0 und 1
    begrenzt.
    Daraus (lineares Problem) folgt, dass [...] ein erster oder
    mehrere erste existieren.

    Mückenheim liebt die inkorrekte Argumentationsform "False dilemma".

    Man würde nämlich meinen, dass es neben GENAU EIN oder MEHRERE X auch
    die Möglichkeit von KEIN X gibt. :-P

    Also (für jede Menge X): card(X) = 0 | card(X) = 1 | card(X) > 1.

    Also so sehe ich das wenigstens. :-P

    Tatsächlich lässt sich das - außerhalb der Mückenmatik - auch beweisen!

    In Bezug auf die Stammbrüche heißt das, dass es weder (genau) einen
    ERSTEN, noch MEHRERE ERSTE gibt, sondern (beweisbar) KEINEN ERSTEN.*)

    Und ja, die befinden sich alle in (0, 1]. :-)

    Bekanntlich haben (per Def) die Stammbrüche die Form 1/n mit n e IN.

    Jedem - außer WM - sollte klar sein, dass (wie man leicht zeigen kann)
    für alle n e IN gilt: 0 < 1/n < 1. Kurz: Alle Stammbrüche "liegen"
    zwischen 0 und (inkl.) 1.

    Außerdem gilt für An,m e IN: n =/= m -> 1/n =/= 1/m. Also, lieber WM,
    keine Angst, zwei verschiedene Stammbrüche liegen schon nicht "auf dem
    selben Punkt". In jedem Fall gilt als card({1/n : n e IN}) = aleph_0. Es
    gibt also unendlich viele Stammbrüche zwischen 0 und (inkl) 1.

    ______________________________________________________

    *) Wenn s ein Stammbruch ist, dann gibt es (per definitionem) eine
    natürliche Zahl, so dass s = 1/n ist. Sei n_0 eine natürliche Zahl mit s
    = 1/n_0. Dann gibt es außerhalb der Mückenmatik (also z. B. im Kontext
    der klassischen Mathematik) eine natürliche Zahl, die größer ist als
    n_0, z. B. n_0 + 1 (->Peano und Def. der Addition sowie der Zahl 1).
    Damit ist dann aber 1/(n_0 + 1) ein Stammbruch, der kleiner ist als s =
    1/n_0. qed

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Sun Jul 21 21:15:13 2024
    Am 21.07.2024 um 21:11 schrieb Moebius:

    *) Wenn s ein Stammbruch ist, dann gibt es (per definitionem) eine natürliche Zahl, so dass s = 1/n ist. Sei n_0 eine natürliche Zahl mit s
    = 1/n_0. Dann gibt es außerhalb der Mückenmatik (also z. B. im Kontext
    der klassischen Mathematik) eine natürliche Zahl, die größer ist als
    n_0, z. B. n_0 + 1 (->Peano und Def. der Addition sowie der Zahl 1).
    Damit ist dann aber 1/(n_0 + 1) ein Stammbruch, der kleiner ist als s = 1/n_0. qed

    Korrektur: (->Peano und Def. der Addition sowie der Relation > und der
    Zahl 1)

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Sun Jul 21 21:27:53 2024
    Am 21.07.2024 um 21:20 schrieb Jim Burns:
    On 7/20/2024 9:01 AM, WM wrote:

    As long as endsegments have
    ["]lost["] only few numbers and
    ["]kept["] infinitely many,
    they are infinite

    Indeed!

    and have an infinite intersection with
    endsegments of this kind.

    They only have an infinite intersection with FINITELY MANY of this kind.

    The intersection of INFINITELY MANY "such" endsegments (hint: all
    endsegments are "of this kind") is empty.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Jim Burns@21:1/5 to All on Sun Jul 21 15:20:57 2024
    On 7/20/2024 9:01 AM, WM wrote:
    Le 20/07/2024 à 14:40, Jim Burns a écrit :
    On 7/19/2024 10:07 AM, WM wrote:

    Infinitely many numbers are
    in all predecessors and
    in all *infinite* successors.
    Infinitely many of them are the same
    because of inclusion monotony.
    Infinite endsegments with empty intersection
    would require an complete exchange of the numbers.
    But that is excluded by inclusion montony.
    You are wrong.

    The natural numbers ℕⁿᵒᵗᐧᵂᴹ are
    well.ordered with step.up and non.0.step.down.
    If you say I am wrongᵂᴹ about that,
    what you (WM) are calling "the natural numbers"
    aren't the natural numbers.

    What you call the natural numbers
    does not exist
    (as a set, but only as a collection).

    Are your (WM's) natural.numbersᵂᴹ
    well.ordered with step.up and non.min.step.down?
    Or aren't they?

    Our natural.numbersⁿᵒᵗᐧᵂᴹ are.
    Apparently, your natural.numbersᵂᴹ aren't,
    and you (WM) are saying that
    I call the wrongᵂᴹ things natural.numbers.

    Apparently, ours are wrongᵂᴹ because
    ours make you (WM) wrong,
    and you (WM) can't be wrongᵂᴹ.

    Infinite endsegments without
    infinite sets of natural numbers are impossible.

    The intersection of the SET.of.ALL.end.segments of
    well.ordered with step.up and non.min.step.down
    is empty.

    ⎛ The intersection of a SET.of.end.segments of
    ⎜ well.ordered with step.up and non.min.step.down
    ⎜ is either
    ⎜ well.ordered with step.up and non.min.step.down
    ⎜ or
    ⎜ empty.

    ⎜ The intersection of a SET.of.end.segments of
    ⎜ well.ordered with step.up and non.min.step.down
    ⎜ which is nonempty
    ⎜ has a proper.subset which is
    ⎜ well.ordered with step.up and non.min.step.down
    ⎜ and which is an end.segment NOT.IN that SET
    ⎜ and thus
    ⎜ that SET is NOT the SET.of.ALL.end.segments

    ⎜ The intersection of a SET.of.end.segments of
    ⎜ well.ordered with step.up and non.min.step.down
    ⎜ which is nonempty
    ⎜ is NOT the intersection of the SET.of.ALL.end.segments

    ⎜ The intersection of the SET.of.ALL.end.segments of
    ⎜ well.ordered with step.up and non.min.step.down
    ⎝ is empty.

    Exchanging natural numbers is impossible
    for endsegments.

    ⎛ The intersection of a set.of.sets holds
    ⎜ exactly those elements which are common
    ⎜ to all those sets.

    ⎜ An element not.in one of the sets of
    ⎜ a set.of.sets
    ⎜ is not.in the intersection of
    ⎝ that set.of.sets.

    Infinitely many of them are the same
    because of inclusion monotony.

    Quantifier shift.

    Call it as you like.

    Zero of them are the same.

    ⎛ for eachᴺ j: existsᴺ k≠j: j < k

    ⎜ not existsᴺ j: not existsᴺ k≠j: j < k

    ⎜ not existsᴺ j: for eachᴺ k≠j: not j < k

    ⎜ not existsᴺ j: for eachᴺ k≠j: k < j

    ⎜ not existsᴺ k: for eachᴺ j≠k: j < k
    ⎜ not (quantifier shift)

    ⎝ Zero of them are the same.

    As long as endsegments have
    lost only few numbers and
    kept infinitely many,
    they are infinite and have
    an infinite intersection with
    endsegments of this kind.

    The intersection of the SET.of.ALL.end.segments of
    well.ordered with step.up and non.min.step.down
    is empty.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Sun Jul 21 22:33:17 2024
    Am 21.07.2024 um 21:52 schrieb Chris M. Thomasson:
    On 7/21/2024 7:13 AM, WM wrote:

    If all are separated and if none is smaller than zero, then according
    to logic there must be a first one or more than one first ones.

    Huh? That "logic" makes NO sense whatsoever.

    Of course, in Mückenmath the infinite sequence (1/n)_(n e IN) does not
    exist, after all if this sequence were infinite, there would not be a
    smallest (first) unit fraction, since it is a strictly decreasing sequence.

    Actually, it seems that in Mückenmath NO infinite strictly decreasing sequences with limit 0 exist. What a shame!

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Sun Jul 21 22:22:20 2024
    Am 21.07.2024 um 21:52 schrieb Chris M. Thomasson:
    On 7/21/2024 7:13 AM, WM wrote:

    If all are separated and if none is smaller than zero, then according
    to logic there must be a first one or more than one first ones.

    Huh? That "logic" makes NO sense whatsoever.

    We may consider a line segment AB and the midpoints p_1, p_2, p_3, ...

    Where p_1 is the midpoint between A and B, p_2 is the midpoint between A
    and p_1, p_3 is the midpoint between A and p_2, and so an (ad infinitum).

    All middpoints are separated and for none the distance between A and it
    is zero, then according to Mückenheim-logic there must be a first one or
    more than one first ones. (And since more than one first one is not
    possible, there just is one first one.)

    Actually, that's the reason why Achilles will never reach the tortoise!
    So Mückenheim could finally solve this long-standing problem!

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Sun Jul 21 22:47:39 2024
    Am 21.07.2024 um 16:17 schrieb WM:
    Le 20/07/2024 à 23:02, Moebius a écrit :

    An e IN: E(n) is infinite.

    In other words, for all X: X is an infinite endsegment iff X is an
    endsegment.

    Then infinitely many numbers from E(1) are contained in all endsegments.
    Or what else makes them infinite?

    Mückenheim: Ax Ey <=/=> Ey Ax (in general).

    Yes: "For all endsegments E there are infinitely many numbers n in E(1)
    such that n e E"

    No: "There are infinitely many numbers n in E(1) such that for all
    endsegments E: n e E"

    Hint: There is NOT EVEN ONE numbers n in E(1) such that for all
    endsegments E: n e E

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Sun Jul 21 22:55:49 2024
    Am 21.07.2024 um 22:47 schrieb Moebius:
    Am 21.07.2024 um 16:17 schrieb WM:
    Le 20/07/2024 à 23:02, Moebius a écrit :

    An e IN: E(n) is infinite.

    In other words, for all X: X is an infinite endsegment iff X is an
    endsegment.

    Then infinitely many numbers from E(1) are contained in all
    endsegments. Or what else makes them infinite?

    Mückenheim: Ax Ey <=/=> Ey Ax (in general).

    Yes: "For all endsegments E there are infinitely many numbers n in E(1)
    such that n e E"

    Hint: E(1) n E(n) is infinite for all n e IN.

    No: "There are infinitely many numbers n in E(1) such that for all endsegments E: n e E"

    Hint: E(1) n E(2) n E(3) ... is empty.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Mon Jul 22 00:35:33 2024
    Am 21.07.2024 um 23:29 schrieb Chris M. Thomasson:
    On 7/21/2024 1:22 PM, Moebius wrote:
    Am 21.07.2024 um 21:52 schrieb Chris M. Thomasson:
    On 7/21/2024 7:13 AM, WM wrote:

    If all are separated and if none is smaller than zero, then
    according to logic there must be a first one or more than one first
    ones.

    Huh? That "logic" makes NO sense whatsoever.

    We may consider a line segment AB and the midpoints p_1, p_2, p_3, ...

    Where p_1 is the midpoint between A and B, p_2 is the midpoint between
    A and p_1, p_3 is the midpoint between A and p_2, and so an (ad
    infinitum).

    All midpoints are separated and for none the distance between A and
    it is zero, then according to Mückenheim-logic there must be a first
    one or more than one first ones. (And since more than one first one is
    not possible, there just is one first one.)

    Actually, that's the reason why Achilles will never reach the
    tortoise! So Mückenheim could finally solve this long-standing problem!

    Here is a quick little example of AB:

    https://i.ibb.co/M2f37Md/ct-pov.png

    The line is red is AB

    Your diagram proves that there _is_ a first/smallest midpoint. See
    (sic!)? :-)

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Mon Jul 22 01:22:58 2024
    Am 22.07.2024 um 01:01 schrieb Chris M. Thomasson:
    On 7/21/2024 3:57 PM, Chris M. Thomasson wrote:

    Also, from the unit circle, all circles and ellipses can be created.
    The ellipse aspect is that of a circle rotated in 3d is an ellipse
    when viewed on the projected plane. Check this out in VR:

    https://skfb.ly/6RozT

    Think of a circle in 3d. Looking at it dead on as a circle. Then,
    change the camera view. It becomes an ellipse.

    A screenshot:

    https://i.ibb.co/BcX7yQW/image.png

    It's clear that you are a "visual type". :-P

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Mon Jul 22 01:33:50 2024
    Am 22.07.2024 um 01:31 schrieb Chris M. Thomasson:

    From any circle we can view it in a 3d realm such that it can create
    any ellipse? Fair enough?

    Right. Depends on "the point of view". (lol)

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Mon Jul 22 02:05:38 2024
    Am 22.07.2024 um 01:40 schrieb Chris M. Thomasson:
    On 7/21/2024 4:33 PM, Moebius wrote:
    Am 22.07.2024 um 01:31 schrieb Chris M. Thomasson:

    From any circle we can view it in a 3d realm such that it can create
    any ellipse? Fair enough?

    Right. Depends on "the point of view". (lol)

    Exactly. It's always a circle in the 3d realm, but from different points
    of view, it can take the form of any ellipse... Fun to me! :^)

    Take the "point of view" as the "center" of the circle. All you will see
    (in all directions) is just a line. :-P

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Mon Jul 22 01:25:19 2024
    Am 22.07.2024 um 00:57 schrieb Chris M. Thomasson:

    Think of a circle in 3d. Looking at it dead on as a circle. Then, change
    the camera view. It becomes an ellipse.

    Right. Provable in the context of "linear algebra".

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Mon Jul 22 10:03:59 2024
    Le 21/07/2024 à 19:19, Moebius a écrit :
    Am 21.07.2024 um 17:20 schrieb Moebius:

    Hence for each and every natural number there is an *infinite*
    endsegment it's not in.

    What is in the infinite endsegment? Infinitely many natnumbers not yet
    lost.

    Disproving WM's claim "infinitely many numbers are included in all
    infinite endsegments" (since NOT EVEN ONE natural number is included in
    all infinite endsegments).

    Offenbar stimmt:

    A IE e SET_OF_INFINITE_ENDSEGMENTS: E^oo n e IN: n e IE

    also stimmt "in Mückenheims Welt" auch

    E^oo n e IN: A IE e SET_OF_INFINITE_ENDSEGMENTS: n e IE .

    Quantifier dyslexia.

    No, simple logic derived from inclusion monotony. Endsegments lose
    natnumbers one by one. As long as infinitely many remain, they have not
    been lost. This is not contradicted by the fact that quantifier cannot
    always exchanged.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Mon Jul 22 10:09:54 2024
    Le 21/07/2024 à 19:43, FromTheRafters a écrit :
    WM submitted this idea :

    All infinite endsegments E(n) and E(k) and E(m) and so on have an infinite >> intersection, whatever natnumbers n, k, j are. How can infinite endsegments >> have no natnumber in common?

    Infinity has some wierdness, you are still thinking finite where there
    is a largest element every endsegment would have in common.

    No, simple logic derived from inclusion monotony is valid in every
    consistent system, finite or not. Endsegments lose natnumbers one by one.
    As long as infinitely many natnumbers remain, they have not been lost. If
    not infinitely many remain, then at least one endsegments must have less. Otherwise infinitely many natnumbers remain in all cases. This is not contradicted by the fact that quantifier cannot always exchanged.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Mon Jul 22 10:13:06 2024
    Le 21/07/2024 à 20:24, joes a écrit :
    Am Sun, 21 Jul 2024 15:50:10 +0000 schrieb WM:
    Le 21/07/2024 à 17:20, Moebius a écrit :

    | For each end every natural number n: the endsegment {m e IN : m > n}
    | is *infinite*, but n !e {m e IN : m > n}.
    Hereby you confess that infinitely many numbers cannot be used in
    bijections.
    I have no idea how you got that from the above.

    If all endsegments keep infinitely man natnumbers then these natnumbers
    can never be lost and never be used anyway.

    Hence for each and every natural number there is an *infinite*
    endsegment it's not in.
    Infinitely many, even.
    But these infinite endsegments are much larger than the finite initial
    segments (1, 2, 3, ..., n). If they are in every endsegment, then they
    yield an infinite intersection.
    What is in every segment?

    Nothing. But in every infinite endsegment there are infinitely many
    natnumbers.
    Simple logic derived from inclusion monotony shows endsegments lose
    natnumbers one by one. As long as infinitely many natnumbers remain, they
    have not been lost. This is not contradicted by the fact that quantifier
    cannot always exchanged.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Mon Jul 22 10:32:47 2024
    Le 21/07/2024 à 20:29, joes a écrit :
    Am Sun, 21 Jul 2024 15:02:30 +0000 schrieb WM:

    Every infinite endsegment has infinitely many elements from E(1) = ℕ.
    But not the same ones.

    By inclusion monotony infinitely many are the same.

    No number is a part of all segments.
    What numbers are filling the endsegments?
    What do you mean "filling"?

    What numbers are the elements of infinite endsegments which are not in all infinite endsegments?
    Note that infinite endsegments can have lost only finitely many
    natnumbers.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Mon Jul 22 10:35:23 2024
    Le 21/07/2024 à 20:32, joes a écrit :
    Am Sun, 21 Jul 2024 15:00:01 +0000 schrieb WM:
    Le 21/07/2024 à 16:44, joes a écrit :
    Am Sun, 21 Jul 2024 14:02:43 +0000 schrieb WM:
    Le 20/07/2024 à 18:53, Moebius a écrit :
    Am 20.07.2024 um 15:35 schrieb joes:
    Am Sat, 20 Jul 2024 12:35:31 +0000 schrieb WM

    It is not guaranteed that n+1 exists for every n. [WM]
    Doch das ist (im gegenwärtigen Kontext)
    garantiert. WENN dem NICHT so WÄRE, dann dürftest Du Deine Formel
    erst gar nicht verwenden. Denn dann könnte es ein n_0 e IN geben, so >>>>> dass "n_0 + 1" nicht definiert ist; aus Deiner Formel lässt sich aber >>>>> durch Spezialisierung ableiten:
    1/n_0 - 1/(n_0 + 1) > 0 .
    Die Formel garantiert nicht die Existenz aller Stammbrüche.
    Was würde das heißen, dass ein Stammbruch nicht "existiert"?
    Das würde heißen, dass es einen letzten gibt, den man selbstverständlich >> nicht auffinden kann. Aber seine Existenz kann man beweisen unter den
    folgenden Prämissen:
    Nein, ich meine, wie kann man von etwas nicht Existentem sprechen?

    Sehr einfach. Spiderman.

    1) Alle Stammbrüche existieren aktual (also nicht nur potentiell, wo
    immer weitere erschaffen werden können).
    2) Der Bereich, in dem Stammbrüche befinden können ist durch 0 und 1
    begrenzt.
    Daraus (lineares Problem) folgt, dass zu beiden Seiten ein erster oder
    mehrere erste existieren.
    Nur, wenn die Abstände konstant wären.

    Warum? Es genügt, dass die Abstände endlich sind.
    Do you understand the function NUF(x)? How will it increase from NUF(0) =
    0 to more? Either there is a first unit fraction at an x > 0, or there are
    more at one and the same x > 0. But the latter would violate the positive distances. What is your idea of this function?

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From joes@21:1/5 to like Moebius on Mon Jul 22 11:29:46 2024
    Am Mon, 22 Jul 2024 10:13:06 +0000 schrieb WM:
    Le 21/07/2024 à 20:24, joes a écrit :
    Am Sun, 21 Jul 2024 15:50:10 +0000 schrieb WM:
    Le 21/07/2024 à 17:20, Moebius a écrit :

    | For each end every natural number n:
    | the endsegment {m e IN : m > n}
    | is *infinite*, but n !e {m e IN : m > n}.
    Hereby you confess that infinitely many numbers cannot be used in
    bijections.
    I have no idea how you got that from the above.
    If all endsegments keep infinitely man natnumbers then these natnumbers
    can never be lost and never be used anyway.
    Every number is "lost", like Moebius said at the top.

    Hence for each and every natural number there is an *infinite*
    endsegment it's not in.
    Infinitely many, even.
    But these infinite endsegments are much larger than the finite initial
    segments (1, 2, 3, ..., n). If they are in every endsegment, then they
    yield an infinite intersection.
    They are not the fucking same.
    What is in every segment?
    Nothing. But in every infinite endsegment there are infinitely many natnumbers.
    Nevermind.
    Simple logic derived from inclusion monotony shows endsegments lose natnumbers one by one. As long as infinitely many natnumbers remain,
    they have not been lost. This is not contradicted by the fact that
    quantifier cannot always exchanged.
    I don't know what you wanted to say here.

    --
    Am Sat, 20 Jul 2024 12:35:31 +0000 schrieb WM in sci.math:
    It is not guaranteed that n+1 exists for every n.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From joes@21:1/5 to All on Mon Jul 22 11:24:59 2024
    Am Mon, 22 Jul 2024 10:03:59 +0000 schrieb WM:
    Le 21/07/2024 à 19:19, Moebius a écrit :
    Am 21.07.2024 um 17:20 schrieb Moebius:

    Hence for each and every natural number there is an *infinite*
    endsegment it's not in.
    For every number there are even infinitely many segments that don't
    contain it (=numbers that are larger). It is only part of finitely
    many.
    What is in the infinite endsegment? Infinitely many natnumbers not yet
    lost.


    Disproving WM's claim "infinitely many numbers are included in all
    infinite endsegments" (since NOT EVEN ONE natural number is included
    in all infinite endsegments).
    Offenbar stimmt:
    A IE e SET_OF_INFINITE_ENDSEGMENTS: E^oo n e IN: n e IE
    also stimmt "in Mückenheims Welt" auch
    E^oo n e IN: A IE e SET_OF_INFINITE_ENDSEGMENTS: n e IE .
    Quantifier dyslexia.

    No, simple logic derived from inclusion monotony. Endsegments lose
    natnumbers one by one. As long as infinitely many remain, they have not
    been lost. This is not contradicted by the fact that quantifier cannot
    always exchanged.
    The sentence starting with E^oo is false.
    What is this "inclusion monotony"?

    --
    Am Sat, 20 Jul 2024 12:35:31 +0000 schrieb WM in sci.math:
    It is not guaranteed that n+1 exists for every n.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From joes@21:1/5 to All on Mon Jul 22 11:34:50 2024
    Am Mon, 22 Jul 2024 10:32:47 +0000 schrieb WM:
    Le 21/07/2024 à 20:29, joes a écrit :
    Am Sun, 21 Jul 2024 15:02:30 +0000 schrieb WM:

    Every infinite endsegment has infinitely many elements from E(1) = ℕ.
    But not the same ones.
    By inclusion monotony infinitely many are the same.
    Every SINGLE segment has infinitely many in common with N.
    Every pair of segments has an infinite intersection.

    No number is a part of all segments.
    What numbers are filling the endsegments?
    What do you mean "filling"?
    What numbers are the elements of infinite endsegments which are not in
    all infinite endsegments?
    [which = the numbers?]
    All numbers? I don't get the question.
    Note that infinite endsegments can have lost only finitely many
    natnumbers.
    There are infinitely many of them.

    --
    Am Sat, 20 Jul 2024 12:35:31 +0000 schrieb WM in sci.math:
    It is not guaranteed that n+1 exists for every n.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Mon Jul 22 13:12:31 2024
    Le 22/07/2024 à 13:24, joes a écrit :
    Am Mon, 22 Jul 2024 10:03:59 +0000 schrieb WM:
    Le 21/07/2024 à 19:19, Moebius a écrit :
    Am 21.07.2024 um 17:20 schrieb Moebius:

    Hence for each and every natural number there is an *infinite*
    endsegment it's not in.
    For every number there are even infinitely many segments that don't
    contain it (=numbers that are larger).

    But not infinite endsegments. Endsegments that contain infinitely many
    numbers have lost olny finitely many and belong to a finite set.

    What is this "inclusion monotony"?

    E(2) c E(1), E(3) c E(2), and so on. That proves that all infinite
    endsegments are subsets of their predecessors and therefore have an
    infinite intersection with them. All endsegments are subsets of their predecessors. All non-empty endsegments have a non-empty intersection.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Mon Jul 22 13:14:32 2024
    Le 22/07/2024 à 13:29, joes a écrit :
    Am Mon, 22 Jul 2024 10:13:06 +0000 schrieb WM:

    If all endsegments keep infinitely man natnumbers then these natnumbers
    can never be lost and never be used anyway.
    Every number is "lost", like Moebius said at the top.

    Not in infinite endsegments.

    Hence for each and every natural number there is an *infinite*
    endsegment it's not in.
    Infinitely many, even.
    But these infinite endsegments are much larger than the finite initial >>>> segments (1, 2, 3, ..., n). If they are in every endsegment, then they >>>> yield an infinite intersection.
    They are not the fucking same.

    Infinitely many are the same because of inclusion monotony.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Mon Jul 22 13:18:42 2024
    Le 22/07/2024 à 13:34, joes a écrit :
    Am Mon, 22 Jul 2024 10:32:47 +0000 schrieb WM:

    Every infinite endsegment has infinitely many elements from E(1) = ℕ. >>> But not the same ones.
    By inclusion monotony infinitely many are the same.
    Every SINGLE segment has infinitely many in common with N.
    Every pair of segments has an infinite intersection.

    Every finite set of endsegments has an infinite intersection.

    There are infinitely many of them.

    There are only finitely many infinite endsegments. Infinitely many
    endsegments E(n) have lost infinitely many numers n. They can contain only finitely many numbers.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Mon Jul 22 13:25:06 2024
    Le 21/07/2024 à 21:20, Jim Burns a écrit :
    On 7/20/2024 9:01 AM, WM wrote:

    Infinite endsegments without
    infinite sets of natural numbers are impossible.

    The intersection of the SET.of.ALL.end.segments of
    well.ordered with step.up and non.min.step.down
    is empty.

    Infinitely many endsegments must have lost infinitely many numbers. There cannot remain infinitely many numbers in all of them.



    Exchanging natural numbers is impossible
    for endsegments.

    ⎛ The intersection of a set.of.sets holds
    ⎜ exactly those elements which are common
    ⎜ to all those sets.

    Inclusion monotony proves that all infinite endsegments have not yet lost infinitely many numbers but have them in common.

    Infinitely many of them are the same
    because of inclusion monotony.

    Quantifier shift.

    Proved correct here by inclusion monotony.

    Call it as you like.

    Zero of them are the same.

    They only lose. They do not acquire .
    Inclusion momotony.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From joes@21:1/5 to All on Mon Jul 22 13:30:39 2024
    Am Mon, 22 Jul 2024 13:18:42 +0000 schrieb WM:
    Le 22/07/2024 à 13:34, joes a écrit :
    Am Mon, 22 Jul 2024 10:32:47 +0000 schrieb WM:

    Every infinite endsegment has infinitely many elements from E(1) =
    ℕ.
    But not the same ones.
    By inclusion monotony infinitely many are the same.
    Every SINGLE segment has infinitely many in common with N.
    Every pair of segments has an infinite intersection.
    Every finite set of endsegments has an infinite intersection.
    But the intersection of all infinitely many segments is empty.

    There are infinitely many of them.
    There are only finitely many infinite endsegments. Infinitely many endsegments E(n) have lost infinitely many numers n. They can contain
    only finitely many numbers.
    The fuck? All segments are "missing" only finitely many numbers.
    There is no finite end segment, precisely because every natural number
    in E(1) has a corresponding segment.

    --
    Am Sat, 20 Jul 2024 12:35:31 +0000 schrieb WM in sci.math:
    It is not guaranteed that n+1 exists for every n.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From joes@21:1/5 to All on Mon Jul 22 13:52:00 2024
    Am Mon, 22 Jul 2024 13:12:31 +0000 schrieb WM:
    Le 22/07/2024 à 13:24, joes a écrit :
    Am Mon, 22 Jul 2024 10:03:59 +0000 schrieb WM:
    Le 21/07/2024 à 19:19, Moebius a écrit :
    Am 21.07.2024 um 17:20 schrieb Moebius:

    Hence for each and every natural number there is an *infinite*
    endsegment it's not in.
    For every number there are even infinitely many segments that don't
    contain it (=numbers that are larger).
    But not infinite endsegments. Endsegments that contain infinitely many numbers have lost olny finitely many and belong to a finite set.
    All segments are infinite.
    How large is your finite set of infinite segments?

    What is this "inclusion monotony"?
    E(2) c E(1), E(3) c E(2), and so on. That proves that all infinite endsegments are subsets of their predecessors and therefore have an
    infinite intersection with them. All endsegments are subsets of their predecessors. All non-empty endsegments have a non-empty intersection.
    Intersection with what?

    --
    Am Sat, 20 Jul 2024 12:35:31 +0000 schrieb WM in sci.math:
    It is not guaranteed that n+1 exists for every n.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Mon Jul 22 16:24:22 2024
    Am 22.07.2024 um 15:30 schrieb joes:
    Am Mon, 22 Jul 2024 13:18:42 +0000 schrieb WM:
    Le 22/07/2024 à 13:34, joes a écrit :
    Am Mon, 22 Jul 2024 10:32:47 +0000 schrieb WM:

    Every infinite endsegment has infinitely many elements from E(1) = ℕ. [WM]
    But not the same ones.[joes]
    By inclusion monotony infinitely many are the same.
    Every SINGLE segment has infinitely many in common with N.
    Every pair of segments has an infinite intersection.
    Every finite set of endsegments has an infinite intersection.
    But the intersection of all infinitely many segments is empty.

    There are infinitely many of them. [joes]

    There are only finitely many infinite endsegments. Infinitely many
    endsegments E(n) have lost infinitely many numers n. They can contain
    only finitely many numbers.

    I've already told you that, man: "Hint: IN WM's world there are finite endsegments."

    Daher ist es für ihn sehr wichtig, zwischen "unendlichen Endsegmenten"
    und "Endsegmenten" zu unterscheiden. :-)

    Aber so schön klar habe ich es selten gelesen:

    "There are only finitely many infinite endsegments." (W. Mückenheim)

    The fuck? All segments are "missing" only finitely many numbers.
    There is no finite end segment, precisely because every natural number
    in E(1) has a corresponding segment.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Mon Jul 22 17:31:59 2024
    Le 22/07/2024 à 16:24, Moebius a écrit :
    Am 22.07.2024 um 15:30 schrieb joes:
    Am Mon, 22 Jul 2024 13:18:42 +0000 schrieb WM:

    There are only finitely many infinite endsegments. Infinitely many
    endsegments E(n) have lost infinitely many numers n. They can contain
    only finitely many numbers.

    I've already told you that, man: "Hint: IN WM's world there are finite endsegments."

    There are only finitely many endsegments as long as only finitely many natnumbers have been lost (and infinitely many are remaining). Two
    consecutive infinite sets in |N are impossible.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Mon Jul 22 21:33:38 2024
    Am 22.07.2024 um 21:29 schrieb Chris M. Thomasson:
    On 7/22/2024 6:25 AM, WM wrote:
    Le 21/07/2024 à 21:20, Jim Burns a écrit :
    On 7/20/2024 9:01 AM, WM wrote:

    Infinite endsegments without
    infinite sets of natural numbers are impossible.

    The intersection of the SET.of.ALL.end.segments of
      well.ordered with step.up and non.min.step.down
    is empty.

    Infinitely many endsegments must have lost infinitely many numbers.
    There cannot remain infinitely many numbers in all of them.
    [...]

    Lost? Where did they go?

    https://www.youtube.com/watch?v=PSE03QVnXg0

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Python@21:1/5 to All on Tue Jul 23 00:16:54 2024
    Le 22/07/2024 à 15:25, WM a écrit :
    Le 21/07/2024 à 21:20, Jim Burns a écrit :
    On 7/20/2024 9:01 AM, WM wrote:

    Infinite endsegments without
    infinite sets of natural numbers are impossible.

    The intersection of the SET.of.ALL.end.segments of
      well.ordered with step.up and non.min.step.down
    is empty.

    Infinitely many endsegments must have lost infinitely many numbers.
    There cannot remain infinitely many numbers in all of them.



    Exchanging natural numbers is impossible
    for endsegments.

    ⎛ The intersection of a set.of.sets holds
    ⎜ exactly those elements which are common
    ⎜ to all those sets.

    Inclusion monotony proves that all infinite endsegments have not yet
    lost infinitely many numbers but have them in common.

    Infinitely many of them are the same
    because of inclusion monotony.

    Quantifier shift.

    Proved correct here by inclusion monotony.

    Call it as you like.

    Zero of them are the same.

    They only lose. They do not acquire .
    Inclusion momotony.

    Momotony?

    Oh shut the fuck up, Crank Wolfgang Mückenheim, with your idiotic
    "inclusion monotony, inclusion monotony, inclusion monotony !" mantra.

    You are a demented liar, fraud and imbecile. WE DON'T CARE.

    BUT you are teaching!!! Come one people in Germany: this demented
    criminal is TEACHING in one of your state-owned school!!! Wake up!!!

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Jim Burns@21:1/5 to All on Mon Jul 22 20:32:15 2024
    On 7/22/2024 9:25 AM, WM wrote:
    Le 21/07/2024 à 21:20, Jim Burns a écrit :
    On 7/20/2024 9:01 AM, WM wrote:

    Infinite endsegments without
    infinite sets of natural numbers are impossible.

    The intersection of the SET.of.ALL.end.segments of
      well.ordered with step.up and non.min.step.down
    is empty.

    Infinitely many endsegments must have lost
    infinitely many numbers.

    Each end.segment has lost only finitely.many numbers.
    No end.segment has lost infinitely.many numbers.

    ⎛ 'Finite' doesn't mean 'small'.
    ⎜ A finite order is trichotomous and
    ⎜ each nonempty subset B is 2.ended
    ⎜ (holds both min.B and max.B)

    ⎝ A set with a finite order is a finite set.

    ⎛ 'Infinite' doesn't mean 'big'.
    ⎜ An infinite order is trichotomous and not.finite:
    ⎜ some subset B is 0.ended or 1.ended
    ⎜ (holds no min.B or no max.B).

    ⎜ Lemma 1.
    ⎜ No set has both a finite order and an infinite order.

    ⎝ A set with an infinite order is an infinite set.

    ⎛ ℕⁿᵒᵗᐧᵂᴹ is
    ⎜ well.ordered with step.up and non.min.step.down.
    ⎜ E is an end.segment of ℕⁿᵒᵗᐧᵂᴹ.
    ⎜ B ⊆ ℕⁿᵒᵗᐧᵂᴹ\E is a non.{} subset of numbers lost from E ⎜
    ⎜ B is nonempty.
    ⎜ ℕⁿᵒᵗᐧᵂᴹ is well.ordered.
    ⎜ B holds min.B

    ⎜ E is an end.segment of ℕⁿᵒᵗᐧᵂᴹ.
    ⎜ min.E is a B.upper.bound.
    ⎜ The non.{} set of B.upper.bounds holds
    ⎜ min.B.upper.bound.

    ⎜ B holds min.B.upper.bound
    ⎜ Otherwise, (step.down)
    ⎜ (min.B.upper.bound)-1 is
    ⎜ a smaller.than.min B.upper.bound.
    ⎜ Contradiction.

    ⎜ B holds max.B = min.B.upper.bound

    ⎜ Each nonempty B ⊆ ℕⁿᵒᵗᐧᵂᴹ\E is 2.ended.
    ⎜ The standard order of ℕⁿᵒᵗᐧᵂᴹ\E is finite (≠small).
    ⎝ ℕⁿᵒᵗᐧᵂᴹ\E is finite.

    Therefore,
    no end.segment has lost infinitely.many numbers.

    There cannot remain
    infinitely many numbers in all of them.

    Each end.segment of ℕⁿᵒᵗᐧᵂᴹ is infinite.

    ⎛ E is an end.segment of ℕⁿᵒᵗᐧᵂᴹ.
    ⎜ j is in E

    ⎜ Step.up.
    ⎜ j+1 > j and j+1 is in E
    ⎜ j ≠ max.E
    ⎜ No j in E is max.E
    ⎜ max.E doesn't exist.
    ⎜ E isn't 2.ended.
    ⎜ The familiar order of E is an infinite order.
    ⎝ E is an infinite set.

    Therefore,
    each end.segment of ℕⁿᵒᵗᐧᵂᴹ is infinite.

    ----
    ⎛ Lemma 4.
    ⎜ Another x into 2.ended set B gives
    ⎜ 2.ended set B∪{x}

    ⎜ Either x is between max.B and min.B
    ⎜ and B∪{x} is also 2.ended,
    ⎜ or not, and x replaces max.B or min.B as an end,
    ⎝ and B∪{x} is also 2.ended.

    ⎛ Lemma 3.
    ⎜ Another x into finite.ordered set A gives
    ⎜ finite.ordered set A∪{x}

    ⎜ Each non.{} subset B of A is 2.ended.

    ⎜ Each non.{} subset of A∪{x}
    ⎜ is B ⊆ A and is 2.ended, or
    ⎜ is B∪{x} and is 2.ended (lemma 4), or
    ⎜ is {x} and is 2.ended,
    ⎜ and
    ⎝ A∪{x} is also finite.ordered.

    ⎛ Lemma 2.
    ⎜ For set A with finite < and trichotomous ≪
    ⎜ trichotomous ≪ is also a finite order.

    ⎜ Ordered by '<'
    ⎜ there is no firstᑉ jₓ ∈ A such that
    ⎜ ≪ is an infinite order on {i∈A: i ≤ jₓ}
    ⎜ because
    ⎜ that would require that inserting jₓ into
    ⎜ finite.ordered {i∈A: i ≤ jₓ-1} would give
    ⎜ infinite.ordered {i∈A: i ≤ jₓ}
    ⎜ which would contradicts lemma 3.

    ⎜ Ordered by '<'
    ⎜ there is no j ∈ A such that
    ⎜ ≪ is an infinite order on {i∈A: i ≤ j}
    ⎜ because
    ⎜ < is a finite order, and
    ⎜ that require firstᑉ jₓ ∈ A such that
    ⎜ ≪ is an infinite order on {i∈A: i ≤ jₓ}

    ⎝ ≪ is a finite order on A

    ⎛ Lemma 1.
    ⎜ No set has both a finite order and an infinite order.

    ⎜ An infinite order is trichotomous and not.infinite.
    ⎜ But the first order is finite.
    ⎝ By lemma 2, the second order must be finite.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Tue Jul 23 02:21:06 2024
    Am 23.07.2024 um 00:16 schrieb Python:

    Momotony?

    He's talking about his psychotic babbling.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Tue Jul 23 17:01:30 2024
    Le 23/07/2024 à 02:32, Jim Burns a écrit :
    On 7/22/2024 9:25 AM, WM wrote:

    Infinitely many endsegments must have lost
    infinitely many numbers.

    Each end.segment has lost only finitely.many numbers.
    No end.segment has lost infinitely.many numbers.

    Infinitely many numbers cannot be lost individually because they cannot be named as individuals.
    The function (E(n)) can only followed over nameable natural numbers.
    Infinitely many numbers remain in the terms. The intersection over all
    terms that you can distinguish is infinite. The intersection over all
    non-empty terms is non-empty. Only when the last natnumber is lost the intersection is empty.

    There cannot remain
    infinitely many numbers in all of them.

    Each end.segment of ℕⁿᵒᵗᐧᵂᴹ is infinite.

    It is hat we call visible endsegment. All visible endsegments contain ℵo natnumbers, ℵo of them in common because endsegments cannot acquire
    other numbers than are remaining from E(1).

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Jim Burns@21:1/5 to All on Tue Jul 23 14:17:11 2024
    On 7/23/2024 1:01 PM, WM wrote:
    Le 23/07/2024 à 02:32, Jim Burns a écrit :
    On 7/22/2024 9:25 AM, WM wrote:

    Infinitely many endsegments must have lost
    infinitely many numbers.

    Each end.segment has lost only finitely.many numbers.
    No end.segment has lost infinitely.many numbers.

    Infinitely many numbers cannot be lost individually
    because they cannot be named as individuals.

    Without naming individuals,
    we can make claims
    which we know are true for each natural number,
    because we know what we mean by 'natural number'
    (well.ordered with step.up and non.min.step.down)
    and
    which we know are true for each finite order,
    because we know what we mean by 'finite order'
    (each non.{} subset is 2.ended)

    Without naming individuals,
    we can make further claims about
    each natural number and each finite order
    which we know are true because
    we only make claims which are not.first.false,
    and
    we know that there can't be a false claim
    without a first.false claim.

    We know that,
    for each end.segment E
    each non.{} numbers.lost.subset B ⊆ ℕⁿᵒᵗᐧᵂᴹ\E is 2.ended.
    We know that,
    for each end.segment E: ℕⁿᵒᵗᐧᵂᴹ\E is finite.

    We know that,
    for each end.segment E
    by standard '<' E is 1.ended
    standard '<' is not all.2.ended
    no other trichotomous '≪' is all.2.ended
    We know that,
    for each end.segment E: E is infinite.

    The intersection over all non-empty terms is non-empty.

    The intersection over all nonempty terms is
    the set of elements which
    each nonempty term holds in common.

    In the natural numbers
    (well.ordered with step.up and non.min.step.down)
    there are no elements which
    each nonempty term holds in common.

    The intersection over all nonempty terms is empty.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Wed Jul 24 20:04:03 2024
    Le 23/07/2024 à 20:17, Jim Burns a écrit :
    On 7/23/2024 1:01 PM, WM wrote:

    The intersection over all non-empty terms is non-empty.

    The intersection over all nonempty terms is
    the set of elements which
    each nonempty term holds in common.

    Of two endsegments A and B either A c B or B c A.

    In the natural numbers
    (well.ordered with step.up and non.min.step.down)
    there are no elements which
    each nonempty term holds in common.

    Name two non-empty endsegments without common numbers.

    The intersection over all nonempty terms is empty.

    The intersection over finitely many endsgements is infinite.
    Infinited segments have reserved infinitely many numbers for their
    contents. Only finitely many are available as indices. ==> There are only finitely many infinite endsements.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From joes@21:1/5 to All on Wed Jul 24 21:13:02 2024
    Am Wed, 24 Jul 2024 20:04:03 +0000 schrieb WM:
    Le 23/07/2024 à 20:17, Jim Burns a écrit :
    On 7/23/2024 1:01 PM, WM wrote:

    The intersection over all non-empty terms is non-empty.
    The intersection over all nonempty terms is the set of elements which
    each nonempty term holds in common.
    Of two endsegments A and B either A c B or B c A.

    In the natural numbers (well.ordered with step.up and
    non.min.step.down) there are no elements which each nonempty term holds
    in common.
    Name two non-empty endsegments without common numbers.
    "Each"

    The intersection over all nonempty terms is empty.
    The intersection over finitely many endsgements is infinite.
    Infinited segments have reserved infinitely many numbers for their
    contents.
    What does this mean?
    Only finitely many are available as indices.
    And this?
    There are only finitely many infinite endsements.
    1 The first segment is infinite.
    2 Each segment has a "tail".
    3 There are infinitely many segments.

    --
    Am Sat, 20 Jul 2024 12:35:31 +0000 schrieb WM in sci.math:
    It is not guaranteed that n+1 exists for every n.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Thu Jul 25 03:51:11 2024
    Am 25.07.2024 um 03:25 schrieb Jim Burns:
    On 7/24/2024 4:04 PM, WM wrote:

    There are only finitely many infinite endsements. [WM]

    No, there are infinitely many infinite endsements.

    <facepalm>

    Proof: IN is infinite. There are infinitely many FISONs (since there is
    a simple bijection from IN onto the set of FISONs: n |-> {1, ..., n}).

    Now an endsegment is just IN \ F, where F is a FISON. (E is an
    endsegment iff there is a FISON F such that E = IN \ F.)

    (1) Since IN is infinite and each and evere FISON is finite, each and
    every endesgement is infinite.

    (2) Moreover there are infinitely many endsegments (since there is a
    simple bijection from the set of FISONs onto the set of endsegment: F
    IN \ F).

    qed

    Mückenheim, Du bist wirklich für jede Art von Mathematik zu dumm und zu blöde.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Jim Burns@21:1/5 to All on Wed Jul 24 21:25:11 2024
    On 7/24/2024 4:04 PM, WM wrote:
    Le 23/07/2024 à 20:17, Jim Burns a écrit :

    The intersection over all nonempty terms is empty.

    The intersection over finitely many endsgements
    is infinite.
    Infinited segments have reserved
    infinitely many numbers for their contents.
    Only finitely many are available as indices.
    There are only finitely many infinite endsements.

    ⎛ In a finite order, each non.{}.subset is 2.ended.
    ⎝ Finite doesn't have to be small.

    ⎛ An infinite order is trichotomous and not.finite.
    ⎝ Infinite is beyond big.

    ⎛ The natural numbers are
    ⎝ well.ordered with step.up and non.min.step.down.

    Each non.{}.subset B of numbers not.in end.segment E
    has upper.bounds in E and
    has a least.upper.bound which
    is the second end of B

    Each non.{}.subset B of numbers not.in end.segment E
    is 2.ended.

    The numbers not.in end.segment E
    have a finite order.

    Finite doesn't have to be small.

    Each natural number is not
    the second end of any end.segment.
    Each end.segment is only 1.ended.
    Each end.segment has an infinite order.

    Infinite is beyond big.

    In the natural numbers
    (well.ordered with step.up and non.min.step.down)
    there are no elements which
    each nonempty term holds in common.

    Name two non-empty endsegments without common numbers.

    There are more than two end.segments.

    In the natural numbers
    each element is not held in common by
    all (which are more than two) end.segments.

    The intersection over all non-empty terms is non-empty.

    The intersection over all nonempty terms is
    the set of elements which
    each nonempty term holds in common.

    Of two endsegments A and B either A c B or B c A.

    For any two end.segments A and B
    the elements in A\B aren't in
    the intersection of all end segments.

    For each natural number j
    (well.ordered with step.up and non.min.step.down)
    there are two end segments A and B such that
    j is in A\B and
    j is not.in the intersection of all end segments.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Thu Jul 25 15:01:50 2024
    Le 24/07/2024 à 23:13, joes a écrit :
    Am Wed, 24 Jul 2024 20:04:03 +0000 schrieb WM:

    Name two non-empty endsegments without common numbers.
    "Each"

    Name two.

    The intersection over all nonempty terms is empty.
    The intersection over finitely many endsgements is infinite.
    Infinited segments have reserved infinitely many numbers for their
    contents.
    What does this mean?
    Only finitely many are available as indices.
    And this?
    There are only finitely many infinite endsements.
    1 The first segment is infinite.

    Every endsegment E(n) has an index n. As long as infinitely many numbers
    are in all infinite endsegments, only finitely many numbers have been used
    as indices.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Thu Jul 25 15:08:39 2024
    Le 25/07/2024 à 03:51, Moebius a écrit :
    Am 25.07.2024 um 03:25 schrieb Jim Burns:
    On 7/24/2024 4:04 PM, WM wrote:

    There are only finitely many infinite endsements. [WM]

    No, there are infinitely many infinite endsements.

    Nonsense. The natural numbers cannot be split into two ℵo-sets.

    Proof: IN is infinite.

    It is an ℵo-set where the first finitely many numbers can be split off
    as indices of endsegments.

    There are infinitely many FISONs (since there is
    a simple bijection from IN onto the set of FISONs: n |-> {1, ..., n}).

    No, all FISONs have ℵo successors. Hence there can be only finittely
    many.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Thu Jul 25 15:18:29 2024
    Le 25/07/2024 à 03:25, Jim Burns a écrit :
    On 7/24/2024 4:04 PM, WM wrote:

    Name two non-empty endsegments without common numbers.

    There are more than two end.segments.

    In the natural numbers
    each element is not held in common by
    all (which are more than two) end.segments.

    If infinite endsegments have an empty intersection, then no number must be
    in all endsegments, but all must contain infinitely many numbers. That is possible only when endegments do not only lose numbers but alos acquire numbers. That however is impossible.

    Of two endsegments A and B either A c B or B c A.

    For any two end.segments A and B
    the elements in A\B aren't in
    the intersection of all end segments.

    As long as numbers remain in endsegments, the intersection is not empty. Inclusion monotony.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Jim Burns@21:1/5 to All on Thu Jul 25 13:37:16 2024
    On 7/25/2024 11:18 AM, WM wrote:
    Le 25/07/2024 à 03:25, Jim Burns a écrit :
    On 7/24/2024 4:04 PM, WM wrote:

    Name two non-empty endsegments without common numbers.

    There are more than two end.segments.
    In the natural numbers
    each element is not held in common by
    all (which are more than two) end.segments.

    If infinite endsegments have an empty intersection,
    then no number must be in all endsegments,
    but all must contain infinitely many numbers.

    ⎛ The natural numbers are
    ⎝ well.ordered with step.up and non.min.step.down.

    For each natural number j
    each non.{}.subset B of numbers.before.j is 2.ended:
    ⎛ The set ⤒B ∋ j of B.upper.bounds is non.{}
    ⎜ (min.⤒B)-1 is not a B.upper.bound
    ⎜ (min.⤒B)-1 < min.⤒B ∈ B
    ⎜ min.⤒B = max.B
    ⎝ B is 2.ended

    For each natural number j
    NOT each non.{}.set C of numbers.after.j is 2.ended:
    ⎛ For example,
    ⎜ no number in the set of all numbers.after.j
    ⎜ is the second end of all numbers.after.j
    ⎝ The set of all numbers.after.j is not 2.ended.

    ⎛ In a finite order, each non.{}.subset is 2.ended.
    ⎝ Finite doesn't have to be small.

    Each non.{}.subset of numbers.before.j is 2.ended.

    The numbers.before.j are finitely.many.

    ⎛ An infinite order is trichotomous and not.finite.
    ⎝ Infinite is beyond big.

    NOT each non.{}.subset of numbers.after.j is 2.ended.

    The numbers.after.j are infinitely.many.

    If infinite endsegments have an empty intersection,
    then no number must be in all endsegments,
    but all must contain infinitely many numbers.
    That is possible only
    when endegments do not only lose numbers
    but alos acquire numbers.

    No.
    It is possible for the numbers to be
    well.ordered with step.up and non.min.step.down

    That however is impossible.

    Of two endsegments A and B either A c B or B c A.

    For any two end.segments A and B
    the elements in A\B aren't in
    the intersection of all end segments.

    As long as numbers remain in endsegments,
    the intersection is not empty.

    As long as the intersection holds numbers,
    NOT ALL end.segments are intersected.

    The intersection of ALL end.segments
    holds no numbers.

    Inclusion monotony.

    Well.ordered with step.up and non.min.step.down.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Thu Jul 25 22:58:09 2024
    Am 25.07.2024 um 19:37 schrieb Jim Burns:
    On 7/25/2024 11:18 AM, WM wrote:

    If infinite endsegments have an empty intersection,
    then no number [is] in all endsegments,
    but all [have] infinitely many numbers.

    Right.

    That is possible only
    when endegments do not only lose numbers
    but also acquire numbers.

    Huh?! Nope.

    No.

    Right. :-)

    That however is impossible.

    Indeed!

    It's just your [WM] claim that is wrong: "That is possible only when
    endegments do not only lose numbers but also acquire numbers."

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Thu Jul 25 23:03:51 2024
    Am 25.07.2024 um 22:58 schrieb Moebius:
    Am 25.07.2024 um 19:37 schrieb Jim Burns:
    On 7/25/2024 11:18 AM, WM wrote:

    If infinite endsegments have an empty intersection,
    then no number [is] in all [infinite] endsegments,
    but all [have] infinitely many numbers.

    Right.

    Das sind *ziemlich* triviale Festsellungen, Mückenheim. *lol*

    Ja, unendliche Mengen haben unendlich viele Elemente. WOW!

    Und die Definition der Schnittmenge scheinst Du auch zu kennen! Cool!

    That is possible only
    when endegments do not only lose numbers
    but also acquire numbers.

    Huh?! Nope.

    No.

    Right. :-)

    That however is impossible.

    Indeed!

    It's just your [WM] claim that is wrong: "That is possible only when endegments do not only lose numbers but also acquire numbers."

    Seems that WM never learned that in mathematics claims have to be
    PROVED. <facepalm>

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From joes@21:1/5 to All on Fri Jul 26 08:59:03 2024
    Am Thu, 25 Jul 2024 15:18:29 +0000 schrieb WM:
    Le 25/07/2024 à 03:25, Jim Burns a écrit :
    On 7/24/2024 4:04 PM, WM wrote:

    Name two non-empty endsegments without common numbers.
    There are more than two end.segments.
    In the natural numbers each element is not held in common by all (which
    are more than two) end.segments.
    If infinite endsegments have an empty intersection, then no number must
    be in all endsegments, but all must contain infinitely many numbers.
    Correct.
    That is possible only when endegments do not only lose numbers but alos acquire numbers. That however is impossible.
    That is not the case. You just don't understand that infinities don't
    shrink; they stay infinite when removing an arbitrary finite number.
    Conversely a finite number cannot become infinite by any finite process. Clearly the number 2 also has in infinite number of successors.

    Of two endsegments A and B either A c B or B c A.
    For any two end.segments A and B the elements in A\B aren't in the
    intersection of all end segments.
    As long as numbers remain in endsegments, the intersection is not empty. Inclusion monotony.
    "As long as", but not for the infinite intersection.

    --
    Am Sat, 20 Jul 2024 12:35:31 +0000 schrieb WM in sci.math:
    It is not guaranteed that n+1 exists for every n.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From joes@21:1/5 to All on Fri Jul 26 09:02:56 2024
    Am Thu, 25 Jul 2024 15:08:39 +0000 schrieb WM:
    Le 25/07/2024 à 03:51, Moebius a écrit :
    Am 25.07.2024 um 03:25 schrieb Jim Burns:
    On 7/24/2024 4:04 PM, WM wrote:

    There are only finitely many infinite endsements. [WM]
    No, there are infinitely many infinite endsements.
    Nonsense. The natural numbers cannot be split into two ℵo-sets.
    They aren't. I haven't understood yet why you think that.
    The infinite set of all (infinite) segments of course includes
    all successors.

    Proof: IN is infinite.
    It is an ℵo-set where the first finitely many numbers can be split off
    as indices of endsegments.

    There are infinitely many FISONs (since there is
    a simple bijection from IN onto the set of FISONs: n |-> {1, ..., n}).
    No, all FISONs have ℵo successors. Hence there can be only finittely
    many.
    Do you disagree with the bijection?
    Every successor has a corresponding segment.

    --
    Am Sat, 20 Jul 2024 12:35:31 +0000 schrieb WM in sci.math:
    It is not guaranteed that n+1 exists for every n.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From joes@21:1/5 to All on Fri Jul 26 09:07:24 2024
    Am Thu, 25 Jul 2024 15:01:50 +0000 schrieb WM:
    Le 24/07/2024 à 23:13, joes a écrit :
    Am Wed, 24 Jul 2024 20:04:03 +0000 schrieb WM:

    Name two non-empty endsegments without common numbers.
    "Each"
    Name two.
    No, you name a number that is common to EACH segment.
    Le 23/07/2024 à 20:17, Jim Burns a écrit :
    The intersection over all nonempty terms is the set of elements
    which each nonempty term holds in common.
    In the natural numbers (well.ordered with step.up and
    non.min.step.down) there are no elements which each nonempty term
    holds in common.

    The intersection over all nonempty terms is empty.
    The intersection over finitely many endsgements is infinite. Infinited
    segments have reserved infinitely many numbers for their contents.
    What do you mean by "reserved"?
    Only finitely many are available as indices.
    How so?
    There are only finitely many infinite endsements.
    1 The first segment is infinite.
    Every endsegment E(n) has an index n. As long as infinitely many numbers
    are in all infinite endsegments, only finitely many numbers have been
    used as indices.

    --
    Am Sat, 20 Jul 2024 12:35:31 +0000 schrieb WM in sci.math:
    It is not guaranteed that n+1 exists for every n.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Python@21:1/5 to All on Fri Jul 26 12:45:22 2024
    Le 26/07/2024 à 12:02, FromTheRafters a écrit :
    joes formulated on Friday :
    Am Thu, 25 Jul 2024 15:08:39 +0000 schrieb WM:
    Le 25/07/2024 à 03:51, Moebius a écrit :
    Am 25.07.2024 um 03:25 schrieb Jim Burns:
    On 7/24/2024 4:04 PM, WM wrote:

    There are only finitely many infinite endsements. [WM]
    No, there are infinitely many infinite endsements.
    Nonsense. The natural numbers cannot be split into two ℵo-sets.
    They aren't. I haven't understood yet why you think that.
    The infinite set of all (infinite) segments of course includes
    all successors.

    Proof: IN is infinite.
    It is an ℵo-set where the first finitely many numbers can be split off >>> as indices of endsegments.

    There are infinitely many FISONs (since there is
    a simple bijection from IN onto the set of FISONs: n |-> {1, ..., n}).
    No, all FISONs have ℵo successors. Hence there can be only finittely
    many.
    Do you disagree with the bijection?

    Yes, he does. His idea is that bijection works for non-dark numbers
    only. He thinks it is 'matching' elements from one set to another and
    such 'matching' can't be done with elements which aren't 'distinguished'
    or whatever crazy wishy-washy term he decides to use.

    Wolfgang Mückenheim once used the word "deflorated" for that.

    Remember that Wolfgang Mückenheim is teaching to young students.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Fri Jul 26 17:02:54 2024
    Le 25/07/2024 à 19:37, Jim Burns a écrit :
    On 7/25/2024 11:18 AM, WM wrote:

    If infinite endsegments have an empty intersection,
    then no number must be in all endsegments,
    but all must contain infinitely many numbers.
    That is possible only
    when endegments do not only lose numbers
    but also acquire numbers.

    No.

    You are wrong.

    It is possible for the numbers to be
    well.ordered with step.up and non.min.step.down

    Infinite sets with empty intersection must contain elements which are not identical.

    As long as numbers remain in endsegments,
    the intersection is not empty.

    As long as the intersection holds numbers,
    NOT ALL end.segments are intersected.

    That is very true.

    The intersection of ALL end.segments
    holds no numbers.

    That is very true.

    But all endsegments have lost all numbers. Otherwise they are not all endsegments. And why should they stop to lose numbers?

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Fri Jul 26 17:06:13 2024
    Le 25/07/2024 à 22:58, Moebius a écrit :

    It's just your [WM] claim that is wrong: "That is possible only when endegments do not only lose numbers but also acquire numbers."

    The intersection of infinite endsegments can only be empty when all
    numbers differ. As long as endsegments only lose numbers that is
    impossible.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Fri Jul 26 17:10:06 2024
    Le 26/07/2024 à 10:59, joes a écrit :
    You just don't understand that infinities don't
    shrink; they stay infinite when removing an arbitrary finite number.

    They get empty by infinitely many removings. They happen in the infinite sequence of endsegments.

    As long as numbers remain in endsegments, the intersection is not empty.
    Inclusion monotony.
    "As long as", but not for the infinite intersection.

    Then no numbers remain. If infinitely many endsegments lose infinitely
    many numbers, then none remaons.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From joes@21:1/5 to All on Fri Jul 26 19:39:24 2024
    Am Fri, 26 Jul 2024 17:10:06 +0000 schrieb WM:
    Le 26/07/2024 à 10:59, joes a écrit :
    You just don't understand that infinities don't shrink; they stay
    infinite when removing an arbitrary finite number.
    They get empty by infinitely many removings. They happen in the infinite sequence of endsegments.
    Partly right: there are infinitely many "removals" individually,
    although their combination is not an element of the sequence,
    but a property of its limit.

    As long as numbers remain in endsegments, the intersection is not
    empty.
    Inclusion monotony.
    "As long as", but not for the infinite intersection.
    Then no numbers remain. If infinitely many endsegments lose infinitely
    many numbers, then none remaons.
    Yes, in the sense that every number is eventually "missing".

    --
    Am Sat, 20 Jul 2024 12:35:31 +0000 schrieb WM in sci.math:
    It is not guaranteed that n+1 exists for every n.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From joes@21:1/5 to All on Fri Jul 26 19:40:39 2024
    Am Fri, 26 Jul 2024 17:06:13 +0000 schrieb WM:
    Le 25/07/2024 à 22:58, Moebius a écrit :

    It's just your [WM] claim that is wrong: "That is possible only when
    endegments do not only lose numbers but also acquire numbers."
    The intersection of infinite endsegments can only be empty when all
    numbers differ. As long as endsegments only lose numbers that is
    impossible.
    They are all subsets. Every number is eventually "lost".

    --
    Am Sat, 20 Jul 2024 12:35:31 +0000 schrieb WM in sci.math:
    It is not guaranteed that n+1 exists for every n.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From joes@21:1/5 to All on Fri Jul 26 19:42:29 2024
    Am Fri, 26 Jul 2024 17:02:54 +0000 schrieb WM:
    Le 25/07/2024 à 19:37, Jim Burns a écrit :
    On 7/25/2024 11:18 AM, WM wrote:

    If infinite endsegments have an empty intersection,
    then no number must be in all endsegments,
    but all must contain infinitely many numbers.
    That is possible only when endegments do not only lose numbers but
    also acquire numbers.
    It is possible for the numbers to be well.ordered with step.up and
    non.min.step.down
    Infinite sets with empty intersection must contain elements which are
    not identical.
    ... in all of them, yes. Every number is only in a finite amount of sets.

    As long as numbers remain in endsegments,
    the intersection is not empty.
    As long as the intersection holds numbers,
    NOT ALL end.segments are intersected.
    That is very true.
    The intersection of ALL end.segments holds no numbers.
    That is very true.
    Finally.
    But all endsegments have lost all numbers. Otherwise they are not all endsegments. And why should they stop to lose numbers?
    Because there are infinitely many of them. If you consider them ALL
    at once, every number is included.

    --
    Am Sat, 20 Jul 2024 12:35:31 +0000 schrieb WM in sci.math:
    It is not guaranteed that n+1 exists for every n.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Jim Burns@21:1/5 to All on Fri Jul 26 17:41:56 2024
    On 7/26/2024 1:02 PM, WM wrote:
    Le 25/07/2024 à 19:37, Jim Burns a écrit :
    On 7/25/2024 11:18 AM, WM wrote:

    If infinite endsegments have an empty intersection,
    then no number must be in all endsegments,
    but all must contain infinitely many numbers.
    That is possible only
    when endegments do not only lose numbers
    but also acquire numbers.

    No.

    You are wrong.

    It is possible for the numbers to be
    well.ordered with step.up and non.min.step.down

    Infinite sets with empty intersection
    must contain elements which are not identical.

    For each two end.segments E′ E″
    either there is a number in E′\E″
    or there is a number in E″\E′

    That's always the case for sets which are different.
    That's extensionality.

    For end.segments E′ E″
    either there is NO number in E′\E″
    or there is NO number in E″\E′
    That's inclusion.monotonicity.

    Each number in the difference.set E′\E″
    is not.in the intersection of ALL end.segments.

    Each number is in the difference.set of some two end.segments.
    Each number is not.in the intersection of ALL end.segments.
    The intersection of ALL end.segments is empty.

    As long as numbers remain in endsegments,
    the intersection is not empty.

    As long as the intersection holds numbers,
    NOT ALL end.segments are intersected.

    That is very true.

    The intersection of ALL end.segments
    holds no numbers.

    That is very true.
    But all endsegments have lost all numbers.
    Otherwise they are not all endsegments.

    Each end.segment has lost only finitely.many numbers.
    Each number is not.yet.lost from only finitely.many end.segments.

    ⎛ 'Finitely.many' means that
    ⎜ each non.{}.subset of lost numbers is 2.ended.
    ⎝ Finite doesn't need to be small.

    There are more.than.finitely.many end.segments.
    The end.segments aren't 2.ended.

    Each number is in fewer.than.all end.segments.

    And why should they stop to lose numbers?

    No end.segment is last to lose numbers.
    The end.segments aren't 2.ended.
    The numbers aren't 2.ended.
    Each ordinal j -- followed by j∪{j} -- isn't the second end.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Tom Bola@21:1/5 to All on Sat Jul 27 00:48:42 2024
    Am 26.07.2024 23:41:56 Jim Burns schrieb:

    On 7/26/2024 1:02 PM, WM wrote:
    Le 25/07/2024 à 19:37, Jim Burns a écrit :
    On 7/25/2024 11:18 AM, WM wrote:

    If infinite endsegments have an empty intersection,
    then no number must be in all endsegments,
    but all must contain infinitely many numbers.
    That is possible only
    when endegments do not only lose numbers
    but also acquire numbers.

    No.

    You are wrong.

    It is possible for the numbers to be
    well.ordered with step.up and non.min.step.down

    Infinite sets with empty intersection
    must contain elements which are not identical.

    For each two end.segments E′ E″
    either there is a number in E′\E″
    or there is a number in E″\E′

    That's always the case for sets which are different.
    That's extensionality.

    For end.segments E′ E″
    either there is NO number in E′\E″
    or there is NO number in E″\E′
    That's inclusion.monotonicity.

    Each number in the difference.set E′\E″
    is not.in the intersection of ALL end.segments.

    Each number is in the difference.set of some two end.segments.
    Each number is not.in the intersection of ALL end.segments.
    The intersection of ALL end.segments is empty.

    As long as numbers remain in endsegments,
    the intersection is not empty.

    As long as the intersection holds numbers,
    NOT ALL end.segments are intersected.

    That is very true.

    The intersection of ALL end.segments
    holds no numbers.

    That is very true.
    But all endsegments have lost all numbers.
    Otherwise they are not all endsegments.

    Each end.segment has lost only finitely.many numbers.
    Each number is not.yet.lost from only finitely.many end.segments.

    ⎛ 'Finitely.many' means that
    ⎜ each non.{}.subset of lost numbers is 2.ended.
    ⎝ Finite doesn't need to be small.

    There are more.than.finitely.many end.segments.
    The end.segments aren't 2.ended.

    Each number is in fewer.than.all end.segments.

    And why should they stop to lose numbers?

    No end.segment is last to lose numbers.
    The end.segments aren't 2.ended.
    The numbers aren't 2.ended.
    Each ordinal j -- followed by j∪{j} -- isn't the second end.

    Very, very well put!

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Jim Burns@21:1/5 to Tom Bola on Fri Jul 26 23:34:26 2024
    On 7/26/2024 6:48 PM, Tom Bola wrote:
    Am 26.07.2024 23:41:56 Jim Burns schrieb:
    On 7/26/2024 1:02 PM, WM wrote:
    Le 25/07/2024 à 19:37, Jim Burns a écrit :
    On 7/25/2024 11:18 AM, WM wrote:

    If infinite endsegments have an empty intersection,
    then no number must be in all endsegments,
    but all must contain infinitely many numbers.
    That is possible only
    when endegments do not only lose numbers
    but also acquire numbers.

    No.

    You are wrong.

    It is possible for the numbers to be
    well.ordered with step.up and non.min.step.down

    Infinite sets with empty intersection
    must contain elements which are not identical.

    For each two end.segments E′ E″
    either there is a number in E′\E″
    or there is a number in E″\E′

    That's always the case for sets which are different.
    That's extensionality.

    For end.segments E′ E″
    either there is NO number in E′\E″
    or there is NO number in E″\E′
    That's inclusion.monotonicity.

    Each number in the difference.set E′\E″
    is not.in the intersection of ALL end.segments.

    Each number is in the difference.set of some two end.segments.
    Each number is not.in the intersection of ALL end.segments.
    The intersection of ALL end.segments is empty.

    As long as numbers remain in endsegments,
    the intersection is not empty.

    As long as the intersection holds numbers,
    NOT ALL end.segments are intersected.

    That is very true.

    The intersection of ALL end.segments
    holds no numbers.

    That is very true.
    But all endsegments have lost all numbers.
    Otherwise they are not all endsegments.

    Each end.segment has lost only finitely.many numbers.
    Each number is not.yet.lost from only finitely.many end.segments.

    ⎛ 'Finitely.many' means that
    ⎜ each non.{}.subset of lost numbers is 2.ended.
    ⎝ Finite doesn't need to be small.

    There are more.than.finitely.many end.segments.
    The end.segments aren't 2.ended.

    Each number is in fewer.than.all end.segments.

    And why should they stop to lose numbers?

    No end.segment is last to lose numbers.
    The end.segments aren't 2.ended.
    The numbers aren't 2.ended.
    Each ordinal j -- followed by j∪{j} -- isn't the second end.

    Very, very well put!

    Thank you for saying so.
    From your mouth to WM's ears.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)