• Does the number of nines =?UTF-8?Q?increase=3F?=

    From WM@21:1/5 to All on Tue Jun 25 20:18:23 2024
    Let the infinite sequence 0.999... be multiplied by 10. Does the number of nines grow?
    Corollary-question: Does the number of nines grow when in 0.999 the
    decimal point is shifted by one or more position?

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Jim Burns@21:1/5 to All on Tue Jun 25 18:11:07 2024
    On 6/25/2024 4:18 PM, WM wrote:

    Let the infinite sequence 0.999...
    be multiplied by 10.
    Does the number of nines grow?

    Cardinalities which can grow by 1 are finite.
    The number of nines in 0.999... is
    larger than each finite cardinality.
    It does not equal any finite cardinality.
    It cannot grow by 1

    tl;dr
    No.

    Corollary-question:
    Does the number of nines grow
    when in 0.999 the decimal point is shifted
    by one or more position?

    By only one or any finite number of positions,
    no.

    Nuance:
    There are _only_ positions in 0.999... which
    are separated by some finite number,
    even though there are infinitely.many of them.

    The positions in 0.999... correspond to
    numbers in well.ordered inductive ℕᴬ⤾⁺¹₀ᐣ⤓

    for each j ∈ ℕᴬ⤾⁺¹₀ᐣ⤓
    ⟨0…j⟩ ̊< ⟨0…j⁺¹⟩ ̊≤ ℕ ̊= ℵ₀
    ⟨j……⟩ ̊≤ ⟨j⁺¹……⟩ ̊≤ ⟨j……⟩ ̊= ℕ ̊= ℵ₀

    tl;dr
    No.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Wed Jun 26 07:18:01 2024
    Le 26/06/2024 à 01:17, FromTheRafters a écrit :
    WM used his keyboard to write :
    Let the infinite sequence 0.999... be multiplied by 10. Does the number of >> nines grow?

    No, both sequences are infinite.

    Corollary-question: Does the number of nines grow when in 0.999 the decimal >> point is shifted by one or more position?

    What do you think multiplying by ten does to a continued decimal
    expansion representation?

    You must understand that no natural number can be added to the complete
    set. Therefore no index can be added here. 9.999... has as many nines as 0.999... . After the decimal point, there is a difference. In completed infinity.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Wed Jun 26 07:19:39 2024
    Le 26/06/2024 à 01:38, "Chris M. Thomasson" a écrit :
    On 6/25/2024 1:18 PM, WM wrote:
    Let the infinite sequence 0.999... be multiplied by 10. Does the number
    of nines grow?
    Corollary-question: Does the number of nines grow when in 0.999 the
    decimal point is shifted by one or more position?

    Huh? .999 * 10 = 9.99

    The number of nines is still three.

    Hence after the decimal point it differs.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Wed Jun 26 07:15:49 2024
    Le 26/06/2024 à 00:11, Jim Burns a écrit :
    On 6/25/2024 4:18 PM, WM wrote:

    Let the infinite sequence 0.999...
    be multiplied by 10.
    Does the number of nines grow?

    Cardinalities which can grow by 1 are finite.
    The number of nines in 0.999... is
    larger than each finite cardinality.
    It does not equal any finite cardinality.
    It cannot grow by 1

    tl;dr
    No.

    Is the set of natural indices complete such that no natural number can be added?

    Nuance:
    There are _only_ positions in 0.999... which
    are separated by some finite number,
    even though there are infinitely.many of them.

    The positions in 0.999... correspond to
    numbers in well.ordered inductive ℕᴬ⤾⁺¹₀ᐣ⤓

    And they are fixed. Therefore your answer is correct:No. Therefore
    9.999... has one 9 less after the decimal point than 0.999... .

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Jim Burns@21:1/5 to All on Wed Jun 26 10:20:28 2024
    On 6/26/2024 3:15 AM, WM wrote:
    Le 26/06/2024 à 00:11, Jim Burns a écrit :
    On 6/25/2024 4:18 PM, WM wrote:

    Let the infinite sequence 0.999...
    be multiplied by 10.
    Does the number of nines grow?

    Cardinalities which can grow by 1 are finite.
    The number of nines in 0.999... is
    larger than each finite cardinality.
    It does not equal any finite cardinality.
    It cannot grow by 1

    tl;dr
    No.

    Is the set of natural indices complete
    such that
    no natural number can be added?

    You'd do better at being understood if
    you said what distinguishes 'natural number'
    from 'natural index'
    if you draw a distinction,
    if being understood is something you want.


    The well.ordered inductive natural.number.indices
    are complete
    such that
    no natural.number.index is not
    a natural.number.index.

    The well.ordered inductive natural.number.indices
    are complete
    such that
    no natural.number.index is without
    its natural.number.index.successor
    and
    such that
    no nonempty natural.number.index.set is without
    its natural.number.index.first.member.

    The well.ordered inductive natural.number.indices
    are complete
    such that
    no natural.number.index.pair is without
    its natural.number.index.sum.

    Nuance:
    There are _only_ positions in 0.999... which
    are separated by some finite number,
    even though there are infinitely.many of them.

    The positions in 0.999... correspond to
    numbers in well.ordered inductive ℕᴬ⤾⁺¹₀ᐣ⤓

    And they are fixed.

    They are certainly well.ordered and inductive.

    If, by 'fixed', you mean that
    each is not anything other than itself,
    then yes.
    They are fixedly well.ordered and inductive.

    Therefore your answer is correct:No.

    Therefore
    9.999... has one 9 less [one 9 fewer]
    after the decimal point than 0.999... .

    No.
    "Move" the decimal point.
    0.9⃒9999... and 09.9⃒9999...
    0.99⃒999... and 09.99⃒999...
    0.999⃒99... and 09.999⃒99...
    0.9999⃒9... and 09.9999⃒9...
    0.99999⃒... and 09.99999⃒...
    ...

    Inductive:
    for each 9 there is its successor.9
    There isn't one 9 fewer.

    Therefore,
    once again,
    'humongous' and 'infinite' are different.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Jim Burns@21:1/5 to Chris M. Thomasson on Wed Jun 26 17:55:27 2024
    On 6/26/2024 2:49 PM, Chris M. Thomasson wrote:
    On 6/26/2024 7:20 AM, Jim Burns wrote:

    Inductive:
    for each 9  there is its successor.9
    There isn't one 9 fewer.

    I still wonder why WM thinks
    there is one 9 "fewer"... Strange one!

    My theory is that
    WM thinks an infiniteᵂᴹ number is very.very.very.large.but.finiteⁿᵒᵗᐧᵂᴹ AKA humongous.

    My own experience with physics problems is
    part of what leads me to think he thinks that.
    Many's the time I've scratched out 'negligible' terms.
    Doing that is treating 'teensy' like 'infinitesimal' and
    'humongous' like 'infinite'.

    Sometimes, doing that works well enough.
    Especially in physics, Kingdom of the Well.Behaved Function.

    Sometimes, infiniteⁿᵒᵗᐧᵂᴹ is different.
    Sometimes, Bob disappears.
    Sometimes, a ball is sliced into finitely.many pieces and
    re.assembled as two balls each as large as the one original.
    WM's response (with terminology corrected) is
    "But that's not what humongous is like!"
    To which the answer comes back,
    yes, you're right. It's NOT like humongous.

    Therefore,
    once again,
    'humongous' and 'infinite' are different.

    Indeed! :^)

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Thu Jun 27 10:26:39 2024
    Le 26/06/2024 à 12:36, FromTheRafters a écrit :
    Ross Finlayson has brought this to us :
    On 06/25/2024 04:17 PM, FromTheRafters wrote:
    WM used his keyboard to write :
    Let the infinite sequence 0.999... be multiplied by 10. Does the
    number of nines grow?

    No, both sequences are infinite.

    Corollary-question: Does the number of nines grow when in 0.999 the
    decimal point is shifted by one or more position?

    What do you think multiplying by ten does to a continued decimal
    expansion representation?

    What does Simon Stevin say?

    The number of nines left of the radix grows, ....

    And the number right of the radix point decreases.

    Though, one might aver it's the "count" of nines,
    it's also its number.

    Counting and numbering are two different things,
    though they're often conflated, not to be confused.

    Numbers "have" a number and "make" a count.

    ...000099.999...

    There are countably many nines on either side of the radix point.

    "Countably" is an unsharp notion because there are countably many prime
    numbers and countably many algebraic numbers but obviously there are
    algebraic numbers which are not prime numbers but all prime numbers are algebraic numbers. So this notion too unsharp to measure the fact that {1,
    2, 3, ...} has one number less than {0, 1, 2, 3, ...} although this is an obvious fact.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Thu Jun 27 11:49:00 2024
    Le 26/06/2024 à 12:40, FromTheRafters a écrit :
    WM has brought this to us :

    Corollary-question: Does the number of nines grow when in 0.999 the
    decimal point is shifted by one or more position?

    What do you think multiplying by ten does to a continued decimal expansion >>> representation?

    You must understand that no natural number can be added to the complete set.

    Of course not, a set contains *all* of its elements.

    And all are indices of the nines in 0.999... .

    Therefore no index can be added here. 9.999... has as many nines as 0.999...
    .

    9.999... is not a set.

    But the indices indexing the nines in 0.999... are the set ℕ. After
    shifting the decimal point, there are just these indices at the right of
    the decimal point. But one of them does not index a nine.

    After the decimal point, there is a difference. In completed infinity.

    You are

    using logic. The set of indices remains unchanges, the row of nines do not acquire another one.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Thu Jun 27 12:03:14 2024
    Le 26/06/2024 à 16:20, Jim Burns a écrit :
    On 6/26/2024 3:15 AM, WM wrote:

    Is the set of natural indices complete
    such that
    no natural number can be added?

    You'd do better at being understood if
    you said what distinguishes 'natural number'
    from 'natural index'

    Why? There is nothing different. The set of numbers and of indices is ℕ.

    The well.ordered inductive natural.number.indices
    are complete

    Therefore the indices of the nines of 0.999... are the complete set ℕ.
    When they are shifted to 9.999..., none is added. One is missing at the
    right of the decimal point.

    Nuance:
    There are _only_ positions in 0.999... which
    are separated by some finite number,
    even though there are infinitely.many of them.

    If, by 'fixed', you mean that
    each is not anything other than itself,
    then yes.

    Yes.

    Therefore
    9.999... has one 9 less [one 9 fewer]
    after the decimal point than 0.999... .

    No.

    You believe in the magic of matheology. Try to think. "Countable" is an
    unsharp notion, too unsharp to measure the fact that {1, 2, 3, ...} has
    one number less than {0, 1, 2, 3, ...} although this is obvious: ℕ is a proper subsets of ℕ_0.

    "Move" the decimal point.
    0.9⃒9999... and 09.9⃒9999...
    0.99⃒999... and 09.99⃒999...
    0.999⃒99... and 09.999⃒99...
    0.9999⃒9... and 09.9999⃒9...
    0.99999⃒... and 09.99999⃒...
    ...

    Not readable what you try here.

    There isn't one 9 fewer.

    As long as you are claiming that elements can be lost by exchanging, your arguments are not relevant in any respect.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Thu Jun 27 12:09:17 2024
    Le 26/06/2024 à 20:46, "Chris M. Thomasson" a écrit :
    On 6/26/2024 12:15 AM, WM wrote:

    9.999... has one 9 less after the decimal point than 0.999... .

    NO! Think of: .(9) * 10 = 9.(9) = 10

    Wrong.

    10*0.999...999 = 9.999...990

    10*0.999...999 < 9.999...999

    9*0.999...999 < 9

    0.999... < 1

    There are still infinite nines... :^)

    If the set ℕ is actually complete, then the set ℕ_0 has one element
    more.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Thu Jun 27 12:15:30 2024
    Le 26/06/2024 à 23:55, Jim Burns a écrit :

    WM thinks an infiniteᵂᴹ number is very.very.very.large.but.finiteⁿᵒᵗᐧᵂᴹ

    No, I assume that sets are complete. Therefore ℕ_0 as a proper superset
    of ℕ has one elements more than ℕ. Infinity does not make them equal.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Jim Burns@21:1/5 to All on Thu Jun 27 12:30:29 2024
    On 6/27/2024 8:03 AM, WM wrote:
    Le 26/06/2024 à 16:20, Jim Burns a écrit :
    On 6/26/2024 3:15 AM, WM wrote:
    Le 26/06/2024 à 00:11, Jim Burns a écrit :
    On 6/25/2024 4:18 PM, WM wrote:

    Let the infinite sequence 0.999...
    be multiplied by 10.
    Does the number of nines grow?

    Cardinalities which can grow by 1 are finite.
    The number of nines in 0.999... is
    larger than each finite cardinality.
    It does not equal any finite cardinality.
    It cannot grow by 1

    tl;dr
    No.

    The well.ordered inductive natural.number.indices
    are complete

    Therefore the indices of the nines of 0.999...
    are the complete set ℕ.

    Each subset of ℕ holds a first, excepting {}, completely.
    Each number in ℕ has a successor and a predecessor,
    excepting 0, which has only a successor, completely.

    For each number in ℕ
    there is a decimal place in 0.999... and a 9 is in it,
    completely.

    When they are shifted to 9.999..., none is added.
    One is missing at the right of the decimal point.

    0 is in {0,1,2,...} and not.in {1,2,3,...}

    Let the infinite sequence 0.999...
    be multiplied by 10.
    Does the number of nines grow?

    No.

    ⎛ for each j in {0,1,2,...}: j⁺¹ is in {1,2,3,...}
    ⎜ j ↦ j⁺¹ is 1.to.1
    ⎜ {0,1,2,...} ̊≤ {1,2,3,...}

    ⎜ {0,1,2,...} ⊇ {1,2,3,...}
    ⎜ {0,1,2,...} ̊≥ {1,2,3,...}

    ⎝ {0,1,2,...} ̊= {1,2,3,...}

    Cardinalities which can grow by 1 are finite.
    Cardinalities which cannot grow by 1 are infinite.

    Therefore
    9.999... has one 9 less [one 9 fewer]
    after the decimal point than 0.999... .

    No.

    You believe in the magic of matheology.

    I believe j ↦ j⁺¹ is 1.to.1

    Try to think.
    "Countable" is an unsharp notion,

    Consider instead the notion '1.to.1 function'

    "Countable" is an unsharp notion,
    too unsharp to measure the fact that
    {1, 2, 3, ...} has one number less than
    {0, 1, 2, 3, ...}
    although this is obvious:
    ℕ is a proper subsets of ℕ_0.

    Consider the set ℕ of
    all cardinalities which can grow by 1

    One more than a cardinality which can grow by 1
    is also a cardinality which can grow by 1
    and is also in ℕ

    If ℕ has a cardinality which can grow by 1
    then there are more than ℕ.many cardinalities in ℕ
    and ℕ is larger than ℕ

    Because ℕ is not larger than ℕ
    the cardinality of ℕ cannot grow by 1
    but
    there are sets which are
    ℕ with 1 element inserted or deleted.
    Those sets have the same cardinality as ℕ
    The cardinality didn't grow by 1

    Is the set of natural indices complete
    such that
    no natural number can be added?

    You'd do better at being understood if
    you said what distinguishes 'natural number'
    from 'natural index'
    if you draw a distinction,
    if being understood is something you want.

    Why? There is nothing different.
    The set of numbers and of indices is ℕ.

    https://en.wiktionary.org/wiki/if

    You're welcome.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to As I on Thu Jun 27 18:37:33 2024
    Le 27/06/2024 à 18:30, Jim Burns a écrit :
    On 6/27/2024 8:03 AM, WM wrote:

    Cardinalities which can grow by 1 are finite.
    Cardinalities which cannot grow by 1 are infinite.

    Cardinalities are useless.
    Sets can grow by 1 element.
    The set ℕ of indices of the nines in 0.999... cannot grow by a natural number.

    Try to think.
    "Countable" is an unsharp notion,

    Consider instead the notion '1.to.1 function'

    That is as unsharp. It shows equinumerosity of primes and rationals.

    Because ℕ is not larger than ℕ
    the cardinality of ℕ cannot grow by 1

    but
    there are sets which are
    ℕ with 1 element inserted or deleted.
    Those sets have the same cardinality as ℕ
    The cardinality didn't grow by 1

    As I said cardinality is useless to check equinumerosity.

    The set of numbers and of indices is ℕ.

    Therefore in 0,999... there are precisely as many nines as in 9.999.... Therefore behind the decimal point there are less after shifting it.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Thu Jun 27 19:52:54 2024
    Le 27/06/2024 à 14:38, FromTheRafters a écrit :
    WM explained :

    If the set ℕ is actually complete, then the set ℕ_0 has one element more.

    If by 'complete' you mean something entirely different from what it
    means to most of the rest of the posters here.

    No, it is a fact that can be proved by 0 and cannot be disproved.

    The set of naturals is
    'complete' in your sense because it is defined such that it contains
    *all* of its elements. All sets are 'complete' in that sense.

    But you believe that the set of indices in 0.999... is not complete?

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Thu Jun 27 19:47:58 2024
    Le 27/06/2024 à 14:33, FromTheRafters a écrit :
    WM submitted this idea :
    Therefore ℕ_0 as a proper superset of ℕ
    has one elements more than ℕ. Infinity does not make them equal.

    Yes it does, cardinal arithmetic works differently in the two realms of finite and infinite.

    Cardinality is nonsense. Set differences are established by their
    elements. ℕ_0 differs from ℕ by one element. Do you want to
    contradict? Don't make a fool of yourself!

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Thu Jun 27 19:55:41 2024
    Le 27/06/2024 à 14:41, FromTheRafters a écrit :
    on 6/27/2024, WM supposed :

    The number of nines left of the radix grows, ....

    And the number right of the radix point decreases.

    No, it does not!

    The complete set of indices, when attached to the nines, can grow when
    only a point of fly droppings is moved?

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Thu Jun 27 20:06:47 2024
    Le 27/06/2024 à 21:56, "Chris M. Thomasson" a écrit :
    On 6/27/2024 5:09 AM, WM wrote:
    Le 26/06/2024 à 20:46, "Chris M. Thomasson" a écrit :
    On 6/26/2024 12:15 AM, WM wrote:

    9.999... has one 9 less after the decimal point than 0.999... .

    NO! Think of: .(9) * 10 = 9.(9) = 10

    Wrong.

    10*0.999...999 = 9.999...990

    Where is that last zero coming from?

    In 0.999... there is a constant set of indices indexing all nines. If a
    point of fly droppings becomes visible at another place this does not
    change the set of indices of nines. Hence also an arbitrary shift of the decimal point by multiplication does not change the number of nines.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Richard Damon@21:1/5 to All on Thu Jun 27 20:03:22 2024
    On 6/27/24 3:47 PM, WM wrote:
    Le 27/06/2024 à 14:33, FromTheRafters a écrit :
    WM submitted this idea :
    Therefore ℕ_0 as a proper superset of ℕ has one elements more than ℕ. >>> Infinity does not make them equal.

    Yes it does, cardinal arithmetic works differently in the two realms
    of finite and infinite.

    Cardinality is nonsense. Set differences are established by their
    elements. ℕ_0 differs from ℕ by one element. Do you want to contradict? Don't make a fool of yourself!

    Regards, WM

    As was saidd, Cardinatality of infinte sets work differently than that
    of finite sets.

    If you can't handle that difference, you can't deal with the truly
    infinite sets, only your sort-of looks a little bit like infinite sets
    of your FISONs, which are just arbitrarily large, not infinite.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Jim Burns@21:1/5 to All on Fri Jun 28 00:31:42 2024
    On 6/27/2024 2:37 PM, WM wrote:
    Le 27/06/2024 à 18:30, Jim Burns a écrit :

    Cardinalities which can grow by 1 are finite.
    Cardinalities which cannot grow by 1 are infinite.

    Cardinalities are useless.
    Sets can grow by 1 element.

    Sets can have elements inserted,
    which makes them different sets.
    The effect on size of inserting 1
    is not the same for all sets.

    Larger than all the
    finiteⁿᵒᵗᐧᵂᴹ.sizes.which.can.grow.by.1
    are the
    infiniteⁿᵒᵗᐧᵂᴹ.sizes.which.cannot.grow.by.1

    For each
    finiteⁿᵒᵗᐧᵂᴹ.size.which.can.grow.by.1
    in the set ℕ of all
    finiteⁿᵒᵗᐧᵂᴹ.sizes.which.can.grow.by.1
    there is a larger
    finiteⁿᵒᵗᐧᵂᴹ.size.which.can.grow.by.1

    It would lead to contradictions for
    for the size of the set ℕ of all finiteⁿᵒᵗᐧᵂᴹ.sizes.which.can.grow.by.1
    to be smaller than one of the finiteⁿᵒᵗᐧᵂᴹ.sizes.which.can.grow.by.1
    _in itself_

    So,
    the size of the set ℕ of all finiteⁿᵒᵗᐧᵂᴹ.sizes.which.can.grow.by.1
    isn't any of the
    finiteⁿᵒᵗᐧᵂᴹ.sizes.which.can.grow.by.1

    Only
    finiteⁿᵒᵗᐧᵂᴹ.sizes.which.can.grow.by.1
    can grow by 1, which
    the size of the set ℕ of all finiteⁿᵒᵗᐧᵂᴹ.sizes.which.can.grow.by.1
    isn't any of.

    The size of the set ℕ of all finiteⁿᵒᵗᐧᵂᴹ.sizes.which.can.grow.by.1
    cannot grow by 1
    It is an
    infiniteⁿᵒᵗᐧᵂᴹ.size.which.cannot.grow.by.1

    The effect on size of inserting 1
    is not the same for all sets.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From joes@21:1/5 to All on Fri Jun 28 08:38:14 2024
    Am Thu, 27 Jun 2024 12:15:30 +0000 schrieb WM:
    Le 26/06/2024 à 23:55, Jim Burns a écrit :

    WM thinks an infiniteᵂᴹ number is very.very.very.large.but.finiteⁿᵒᵗᐧᵂᴹ
    No, I assume that sets are complete. Therefore ℕ_0 as a proper superset
    of ℕ has one elements more than ℕ. Infinity does not make them equal.
    What does „complete” mean?
    With which numbers do you describe the sizes of N and N_0?

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From joes@21:1/5 to All on Fri Jun 28 08:35:38 2024
    Am Thu, 27 Jun 2024 19:55:41 +0000 schrieb WM:
    Le 27/06/2024 à 14:41, FromTheRafters a écrit :
    on 6/27/2024, WM supposed :

    The number of nines left of the radix grows, ....
    And the number right of the radix point decreases.
    No, it does not!
    The complete set of indices, when attached to the nines, can grow when
    only a point of fly droppings is moved?

    It does not grow. It stays the same. You can subtract an arbitrary finite number and it doesn’t change.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Fri Jun 28 13:41:57 2024
    Le 28/06/2024 à 02:03, Richard Damon a écrit :

    As was saidd, Cardinatality of infinte sets work differently than that
    of finite sets.

    Here is no cardinality asked for.

    A non-terminating digit sequence does not determine a real number.

    The limit of a strictly monotonic sequence is not among its terms.

    The same distinction has to be observed with series. There must not be a difference in the mathematical contents whether the partial sums are
    written separately like

    3, 3.1, 3.14, 3.141, 3.1415, ... (11.1)

    or are written in one line with interruptions

    (((((3.)1)4)1)5)... (11.2)

    or without interruptions

    3.1415... . (11.3)

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Fri Jun 28 13:50:06 2024
    Le 28/06/2024 à 06:31, Jim Burns a écrit :
    On 6/27/2024 2:37 PM, WM wrote:
    Le 27/06/2024 à 18:30, Jim Burns a écrit :

    Cardinalities which can grow by 1 are finite.
    Cardinalities which cannot grow by 1 are infinite.

    Cardinalities are useless.
    Sets can grow by 1 element.

    Sets can have elements inserted,
    which makes them different sets.
    The effect on size of inserting 1
    is not the same for all sets.

    It is changing the infinite set but not its cardinality. Therefore
    cardinality is useless for my proof.

    The size of the set ℕ of all finiteⁿᵒᵗᐧᵂᴹ.sizes.which.can.grow.by.1
    cannot grow by 1
    It is an
    infiniteⁿᵒᵗᐧᵂᴹ.size.which.cannot.grow.by.1

    Your discussion is off topic.

    The effect on size of inserting 1
    is not the same for all sets.

    The effect of removing a nine from 0.999... is changing its value.
    When in 0.999... the decimal point is shifted, the number of nines remains constant. That has nothing to do with cardinalities.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Fri Jun 28 13:55:34 2024
    Le 28/06/2024 à 10:38, joes a écrit :
    Am Thu, 27 Jun 2024 12:15:30 +0000 schrieb WM:
    Le 26/06/2024 à 23:55, Jim Burns a écrit :

    WM thinks an infiniteᵂᴹ number is
    very.very.very.large.but.finiteⁿᵒᵗᐧᵂᴹ
    No, I assume that sets are complete. Therefore ℕ_0 as a proper superset
    of ℕ has one elements more than ℕ. Infinity does not make them equal.
    What does „complete” mean?

    It means that no natural number can be added to
    {0, 1, 2, 3, ..., ω}
    It means that the subtraction of the complete set leaves
    {0, 1, 2, 3, ..., ω} \ ℕ = {0, ω}.
    It means that in {0, 1, 2, 3, ..., ω} before ω there is a natural
    number.

    With which numbers do you describe the sizes of N and N_0?

    Most of them are dark and cannot be used as individuals.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Fri Jun 28 13:51:48 2024
    Le 28/06/2024 à 10:35, joes a écrit :
    Am Thu, 27 Jun 2024 19:55:41 +0000 schrieb WM:
    Le 27/06/2024 à 14:41, FromTheRafters a écrit :
    on 6/27/2024, WM supposed :

    The number of nines left of the radix grows, ....
    And the number right of the radix point decreases.
    No, it does not!
    The complete set of indices, when attached to the nines, can grow when
    only a point of fly droppings is moved?

    It does not grow. It stays the same.

    Therefore 10*0.999...999 = 9.999...990.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Fri Jun 28 13:59:02 2024
    Le 27/06/2024 à 22:20, "Chris M. Thomasson" a écrit :

    There is always an infinite number of nines in Say:

    9.(9) = 10

    Is in 9.999... one 9 more than in 0.999... when 9.999... has been produced
    by multiplying 0.999... by 10?
    Is in 9.999... one 9 more than in 0.999... when 9.999... has been produced
    by adding 9 to 0.999...?

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From joes@21:1/5 to All on Fri Jun 28 17:19:26 2024
    Am Fri, 28 Jun 2024 13:59:02 +0000 schrieb WM:
    Le 27/06/2024 à 22:20, "Chris M. Thomasson" a écrit :

    There is always an infinite number of nines in Say:
    9.(9) = 10

    Is in 9.999... one 9 more than in 0.999... when 9.999... has been
    produced by multiplying 0.999... by 10?
    Is in 9.999... one 9 more than in 0.999... when 9.999... has been
    produced by adding 9 to 0.999...?
    No, they both have infinitely many 9s. It does not matter how they
    were „produced”. They are the same number 10.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From joes@21:1/5 to All on Fri Jun 28 17:27:40 2024
    Am Fri, 28 Jun 2024 13:51:48 +0000 schrieb WM:
    Le 28/06/2024 à 10:35, joes a écrit :
    Am Thu, 27 Jun 2024 19:55:41 +0000 schrieb WM:

    The complete set of indices, when attached to the nines, can grow when
    only a point of fly droppings is moved?
    It does not grow. It stays the same.
    Therefore 10*0.999...999 = 9.999...990.
    It stays infinite. What does your notation mean? You cannot add digits „after” infinitely many; there is no after. You cannot count to or past infinity with naturals, as ω is not itself in N.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From joes@21:1/5 to All on Fri Jun 28 17:23:43 2024
    Am Fri, 28 Jun 2024 13:55:34 +0000 schrieb WM:
    Le 28/06/2024 à 10:38, joes a écrit :
    Am Thu, 27 Jun 2024 12:15:30 +0000 schrieb WM:
    Le 26/06/2024 à 23:55, Jim Burns a écrit :

    WM thinks an infinite number is
    very.large.but.finite
    No, I assume that sets are complete. Therefore ℕ_0 as a proper
    superset of ℕ has one elements more than ℕ. Infinity does not make
    them equal.
    Infinity does not have a predecessor like finite numbers.

    What does „complete” mean?
    It means that no natural number can be added to {0, 1, 2, 3, ..., ω}
    Duh, the set of all natural numbers N contains all of them.

    It means that the subtraction of the complete set leaves {0, 1, 2, 3,
    ..., ω} \ ℕ = {0, ω}.
    It means that in {0, 1, 2, 3, ..., ω} before ω there is a natural
    number.
    There is not, since there are infinitely many of them.

    With which numbers do you describe the sizes of N and N_0?
    Most of them are dark and cannot be used as individuals.
    Not their elements. I was asking for their number, how many
    of them there are.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From joes@21:1/5 to All on Fri Jun 28 17:16:56 2024
    Am Fri, 28 Jun 2024 13:50:06 +0000 schrieb WM:
    Le 28/06/2024 à 06:31, Jim Burns a écrit :
    On 6/27/2024 2:37 PM, WM wrote:
    Le 27/06/2024 à 18:30, Jim Burns a écrit :

    Cardinalities which can grow by 1 are finite. Cardinalities which
    cannot grow by 1 are infinite.
    Cardinalities are useless. Sets can grow by 1 element.
    So what is the size of N\{2}?
    Sets can have elements inserted, which makes them different sets.
    The effect on size of inserting 1 is not the same for all sets.
    It is changing the infinite set but not its cardinality. Therefore cardinality is useless for my proof.
    What are you replacing it with?

    The size of the set ℕ of all finite.sizes.which.can.grow.by.1
    cannot grow by 1 It is an infinite.size.which.cannot.grow.by.1
    Your discussion is off topic.
    The size of N, containing all finite numbers, is itself infinite.

    The effect on size of inserting 1 is not the same for all sets.
    The effect of removing a nine from 0.999... is changing its value.
    When in 0.999... the decimal point is shifted, the number of nines
    remains constant. That has nothing to do with cardinalities.
    You can’t remove from the right, since there is no end. You can only
    remove from the left (dividing by 10), or cut it off, replacing all
    following places with zeroes. If you removed one from the middle (i.e.
    not the first one), there are still infinitely many.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Fri Jun 28 18:25:57 2024
    Le 28/06/2024 à 19:23, joes a écrit :
    Am Fri, 28 Jun 2024 13:55:34 +0000 schrieb WM:
    Le 28/06/2024 à 10:38, joes a écrit :
    Am Thu, 27 Jun 2024 12:15:30 +0000 schrieb WM:
    Le 26/06/2024 à 23:55, Jim Burns a écrit :

    WM thinks an infinite number is
    very.large.but.finite
    No, I assume that sets are complete. Therefore ℕ_0 as a proper
    superset of ℕ has one elements more than ℕ. Infinity does not make >>>> them equal.
    Infinity does not have a predecessor like finite numbers.

    What is immediately before ω?

    What does „complete” mean?
    It means that no natural number can be added to {0, 1, 2, 3, ..., ω}
    Duh, the set of all natural numbers N contains all of them.

    What is immediately before ω?

    It means that the subtraction of the complete set leaves {0, 1, 2, 3,
    ..., ω} \ ℕ = {0, ω}.
    It means that in {0, 1, 2, 3, ..., ω} before ω there is a natural
    number.
    There is not, since there are infinitely many of them.

    Linearity excludes more than one at a position. Immediately before ω
    there is at most one natural number.

    With which numbers do you describe the sizes of N and N_0?
    Most of them are dark and cannot be used as individuals.
    Not their elements. I was asking for their number, how many
    of them there are.

    |N| + 1 = |N_0|

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Fri Jun 28 18:21:45 2024
    Le 28/06/2024 à 19:19, joes a écrit :
    Am Fri, 28 Jun 2024 13:59:02 +0000 schrieb WM:
    Le 27/06/2024 à 22:20, "Chris M. Thomasson" a écrit :

    There is always an infinite number of nines in Say:
    9.(9) = 10

    Is in 9.999... one 9 more than in 0.999... when 9.999... has been
    produced by multiplying 0.999... by 10?
    Is in 9.999... one 9 more than in 0.999... when 9.999... has been
    produced by adding 9 to 0.999...?
    No, they both have infinitely many 9s. It does not matter how they
    were „produced”.

    Then the set of indices is not constant. Try again.

    They are the same number 10.

    Wrong. Try again.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Fri Jun 28 18:28:54 2024
    Le 28/06/2024 à 19:27, joes a écrit :
    Am Fri, 28 Jun 2024 13:51:48 +0000 schrieb WM:
    Le 28/06/2024 à 10:35, joes a écrit :
    Am Thu, 27 Jun 2024 19:55:41 +0000 schrieb WM:

    The complete set of indices, when attached to the nines, can grow when >>>> only a point of fly droppings is moved?
    It does not grow. It stays the same.
    Therefore 10*0.999...999 = 9.999...990.
    It stays infinite. What does your notation mean?

    The set of indices is constant. It cannot grow. Shifting to the left
    happens for all of them.

    You cannot add digits
    „after” infinitely many; there is no after.

    You don't know it. That does not make it vanish.

    You cannot count to or past
    infinity with naturals,

    because they are dark.

    as ω is not itself in N.

    But it is the first transfinite number.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Fri Jun 28 18:19:11 2024
    Le 28/06/2024 à 19:16, joes a écrit :
    Am Fri, 28 Jun 2024 13:50:06 +0000 schrieb WM:
    Le 28/06/2024 à 06:31, Jim Burns a écrit :
    On 6/27/2024 2:37 PM, WM wrote:
    Le 27/06/2024 à 18:30, Jim Burns a écrit :

    Cardinalities which can grow by 1 are finite. Cardinalities which
    cannot grow by 1 are infinite.
    Cardinalities are useless. Sets can grow by 1 element.
    So what is the size of N\{2}?

    It is |ℕ| - 1. That was easy.

    Sets can have elements inserted, which makes them different sets.
    The effect on size of inserting 1 is not the same for all sets.
    It is changing the infinite set but not its cardinality. Therefore
    cardinality is useless for my proof.
    What are you replacing it with?

    Number of elements.

    The size of the set ℕ of all finite.sizes.which.can.grow.by.1
    cannot grow by 1 It is an infinite.size.which.cannot.grow.by.1
    Your discussion is off topic.
    The size of N, containing all finite numbers, is itself infinite.

    Yes, it is |ℕ|.

    The effect on size of inserting 1 is not the same for all sets.
    The effect of removing a nine from 0.999... is changing its value.
    When in 0.999... the decimal point is shifted, the number of nines
    remains constant. That has nothing to do with cardinalities.

    You can’t remove from the right, since there is no end.

    If all are a complete set, then we can shift all by one position to the
    left.

    You can only
    remove from the left (dividing by 10)

    Removing from the right is done by multiplying by 10.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Fri Jun 28 19:58:17 2024
    Le 28/06/2024 à 19:46, FromTheRafters a écrit :
    joes was thinking very hard :
    Am Fri, 28 Jun 2024 13:55:34 +0000 schrieb WM:

    What does „complete” mean?
    It means that no natural number can be added to {0, 1, 2, 3, ..., ω}
    Duh, the set of all natural numbers N contains all of them.

    With which numbers do you describe the sizes of N and N_0?
    Most of them are dark and cannot be used as individuals.
    Not their elements. I was asking for their number, how many
    of them there are.

    There's a number of them, however, how many there are is not a number.

    Either there is a complete and fixed set ℕ with a fixed number |ℕ| of elements.
    If so, then 0.999...*10 = 9,999... where the number of nines has not
    changed by more than 0.
    Or this is not the case.
    But assuming completeness and simultaneously claiming different numbers of nines is stupid.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Jim Burns@21:1/5 to All on Sat Jun 29 09:24:24 2024
    On 6/28/2024 9:50 AM, WM wrote:
    Le 28/06/2024 à 06:31, Jim Burns a écrit :
    On 6/27/2024 2:37 PM, WM wrote:
    Le 27/06/2024 à 18:30, Jim Burns a écrit :

    Cardinalities which can grow by 1 are finite.
    Cardinalities which cannot grow by 1 are infinite.

    Cardinalities are useless.
    Sets can grow by 1 element.

    Sets can have elements inserted,
    which makes them different sets.
    The effect on size of inserting 1
    is not the same for all sets.

    It is changing the infinite set
    but not its cardinality.

    A set with a cardinal.growable.by.1 (finiteⁿᵒᵗᐧᵂᴹ)
    cannot change without its cardinality changing.

    Not all cardinals are growable.by.1 (finiteⁿᵒᵗᐧᵂᴹ)
    A set with a cardinal.not.growable.by.1 (infiniteⁿᵒᵗᐧᵂᴹ)
    can change without its cardinality changing.

    ⎛ ...not that setsⁿᵒᵗᐧᵂᴹ changeⁿᵒᵗᐧᵂᴹ
    ⎜ Adjunct X∪{Y} isn't X
    ⎜( Sets can grow by 1 element.
    ⎜ means
    ⎝( For each X,Y X∪{Y} exists

    The cardinal ℵ₀ for
    all cardinals.growable.by.1 (finiteⁿᵒᵗᐧᵂᴹ)
    is a cardinal.not.growable.by.1 (infiniteⁿᵒᵗᐧᵂᴹ)

    | Assume otherwise.
    | Assume ℵ₀ is growable.by.1
    |
    | If
    | the cardinal ℵ₀ of
    | all cardinals.growable.by.1
    | is growable.by.1
    | then
    | the cardinal ℵ₀ᐡᴮᵒᵇ for
    | all cardinals.growable.by.1
    | and Bob too
    | is growable.by.1 too
    | and
    | there are more.than.ℵ₀.many
    | cardinals.growable.by.1
    |
    | However,
    | there are ℵ₀.many
    | cardinalities growable.by.1
    | Contradiction.

    Therefore,
    the cardinal ℵ₀ for
    all cardinals.growable.by.1 (finiteⁿᵒᵗᐧᵂᴹ)
    is a cardinal.not.growable.by.1 (infiniteⁿᵒᵗᐧᵂᴹ)

    Not all cardinals are growable.by.1 (finiteⁿᵒᵗᐧᵂᴹ)
    A set with a cardinal.not.growable.by.1 (infiniteⁿᵒᵗᐧᵂᴹ)
    can change without its cardinality changing.

    Therefore
    cardinality is useless for my proof.

    if we stop _saying_
    ( cardinal of {k……} ̊≤ cardinal of {k⁺¹……}
    k ↦ k⁺¹ doesn't stop _being_
    1.to.1 from {k……} to {k⁺¹……}

    For any difficulty which cardinality presents,
    not.saying 'cardinal' not.resolves the difficulty.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Sat Jun 29 16:58:36 2024
    Le 28/06/2024 à 23:01, FromTheRafters a écrit :
    WM pretended :

    Either there is a complete and fixed set ℕ with a fixed number |ℕ| of
    elements.
    If so, then 0.999...*10 = 9,999... where the number of nines has not changed >> by more than 0.
    Or this is not the case.
    But assuming completeness and simultaneously claiming different numbers of >> nines is stupid.

    The number of nines is not a number.

    The set of natural indices is a set.
    Shifting it to the left shifts every index and every indexed nine to the
    left.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Sat Jun 29 17:01:10 2024
    Le 29/06/2024 à 00:23, "Chris M. Thomasson" a écrit :
    On 6/28/2024 6:41 AM, WM wrote:
    Le 28/06/2024 à 02:03, Richard Damon a écrit :

    As was saidd, Cardinatality of infinte sets work differently than that
    of finite sets.

    Here is no cardinality asked for.

    A non-terminating digit sequence does not determine a real number.

    Huh? Sure it can. What is:

    .(428571)

    That is a formula determining an infinite digit sequence

    ? It is a non-terminating digit sequence in base ten.

    No. Like "0.111..." it is a formula.

    Formulas determine sequences. The other way round is not possible.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Sat Jun 29 17:08:02 2024
    Le 29/06/2024 à 03:05, Ross Finlayson a écrit :


    I thought .999... = 1, ....

    That is wrong. All nines are from the sequence 0.9, 0.09, 0.009, ... None
    of the ℵo nines makes its partial sum 0,9, 0.99, 0.999, ... equal to 1.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Sat Jun 29 17:10:52 2024
    Le 29/06/2024 à 11:37, FromTheRafters a écrit :
    Ross Finlayson pretended :

    You know, or it "goes" to.

    Yes, but the number of nines in the sequence after the radix point is countably infinite rather than finite, hence NaN in this context.

    All nines are from the sequence 0.9, 0.09, 0.009, ... None of the ℵo
    nines makes its partial sum 0,9, 0.99, 0.999, ... equal to 1. ℵo nines
    fail.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Sat Jun 29 17:18:26 2024
    Le 29/06/2024 à 15:24, Jim Burns a écrit :
    On 6/28/2024 9:50 AM, WM wrote:

    It is changing the infinite set
    but not its cardinality.

    A set with a cardinal.growable.by.1 (finiteⁿᵒᵗᐧᵂᴹ)
    cannot change without its cardinality changing.

    Cardinality is irrelevant.

    Therefore
    cardinality is useless for my proof.

    For any difficulty which cardinality presents,
    not.saying 'cardinal' not.resolves the difficulty.

    Cardinality does not present a difficulty. It is simply unable to
    distinguish |ℕ| and |ℕ_0|.

    All nines of 0.999... are from the sequence 0.9, 0.09, 0.009, ... None of
    the ℵo nines makes its partial sum 0,9, 0.99, 0.999, ... equal to 1.
    ℵo nines fail to make 0.999... = 1.

    Regards, WM

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Jim Burns@21:1/5 to Ross Finlayson on Sat Jun 29 14:01:12 2024
    On 6/28/2024 9:05 PM, Ross Finlayson wrote:
    On 06/28/2024 02:01 PM, FromTheRafters wrote:

    The number of nines is not a number.

    I thought .999... = 1, ....

    1 is near almost.all (all.but.finitely.many) of
    0.9 0.99 0.999 0.9999 0.99999 ...
    for any sense > 0 of 'near'

    For that reason,
    we assign 1 to 0.999...

    The values of infinite.length decimals
    are assigned by a different method from how
    the values of finite.length decimals are assigned.

    You know, or it "goes" to.



    This recalls the "First of Zen Koans" bit again,

    Two Buddhist priests observe a flag in the wind.

    The first says, "the wind, moves, the flag".
    The second says, "ah, that flag, moves, in the wind."

    A third says "it is your mind that moves".

    </RF>
    Date: Fri, 28 Jun 2024 21:38:40 -0700

    The sequence
    0.9 0.99 0.999 0.9999 0.99999 ...
    does not move.

    It is your mind that moves,
    imagining the next, and the next, and the next.

    Remember that
    0.9 0.99 0.999 0.9999 0.99999 ...
    doesn't "go to" even Avogadroᴬᵛᵒᵍᵃᵈʳᵒ 9s
    not inside our 13.8×10⁹.year.old universe.

    However,
    we can reason about Avogadroᴬᵛᵒᵍᵃᵈʳᵒ 9s
    by finite not.first.false claim.sequence
    without going to them.

    It's the same for infinitely.many 9s in that
    we can't go to them, but
    we can reason about them.
    But
    'infinite' is different from 'humongous' and
    different conclusions get concluded.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Sat Jun 29 18:14:57 2024
    Le 29/06/2024 à 20:01, Jim Burns a écrit :

    However,
    we can reason about Avogadroᴬᵛᵒᵍᵃᵈʳᵒ 9s
    by finite not.first.false claim.sequence
    without going to them.

    We can reason about ℵo nines, all missing the limit.

    It's the same for infinitely.many 9s in that
    we can't go to them, but
    we can reason about them.

    But most matheologians don't understand that the sequence
    0.9, 0.09, 0.009, ... contains ℵo nines without containing the limit 0.

    But
    'infinite' is different from 'humongous' and
    different conclusions get concluded.

    If you think straight, then only one conclusion follows: 0.999... < 1.
    And Bob does not disappear.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From joes@21:1/5 to All on Sat Jun 29 20:29:11 2024
    XPost: de.sci.mathematik

    Am Sat, 29 Jun 2024 16:58:36 +0000 schrieb WM:
    Le 28/06/2024 à 23:01, FromTheRafters a écrit :
    WM pretended :

    Either there is a complete and fixed set ℕ with a fixed number |ℕ| of >>> elements.
    If so, then 0.999...*10 = 9,999... where the number of nines has not
    changed by more than 0.
    Which it hasn’t.
    Or this is not the case.
    But assuming completeness and simultaneously claiming different
    numbers of nines is stupid.
    They are the same.
    The number of nines is not a number.
    The set of natural indices is a set.
    Shifting it to the left shifts every index and every indexed nine to the left.
    So what? Every index is increased by 1, blah blah PA.

    --
    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 Jun 29 20:25:10 2024
    Am Sat, 29 Jun 2024 17:18:26 +0000 schrieb WM:
    Le 29/06/2024 à 15:24, Jim Burns a écrit :
    On 6/28/2024 9:50 AM, WM wrote:

    It is changing the infinite set but not its cardinality.
    A set with a cardinal.growable.by.1 (finite)
    cannot change without its cardinality changing.
    Cardinality is irrelevant.
    Then how do you measure infinite sets?

    Therefore cardinality is useless for my proof.
    For any difficulty which cardinality presents,
    not saying 'cardinal' not.resolves the difficulty.
    Cardinality does not present a difficulty. It is simply unable to
    distinguish |ℕ| and |ℕ_0|.
    Working as designed. How do you distinguish them?

    All nines of 0.999... are from the sequence 0.9, 0.09, 0.009, ... None
    of the ℵo nines makes its partial sum 0,9, 0.99, 0.999, ... equal to 1. ℵo nines fail to make 0.999... = 1.
    That’s one way to construct it. Of course none of the infinite series individually reaches the limit (otherwise the following ones :-P would go
    above it?). Together they do. It is reached after exactly Aleph0 steps.

    --
    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 Jun 29 20:57:34 2024
    Am Fri, 28 Jun 2024 18:19:11 +0000 schrieb WM:
    Le 28/06/2024 à 19:16, joes a écrit :
    Am Fri, 28 Jun 2024 13:50:06 +0000 schrieb WM:
    Le 28/06/2024 à 06:31, Jim Burns a écrit :
    On 6/27/2024 2:37 PM, WM wrote:
    Le 27/06/2024 à 18:30, Jim Burns a écrit :

    Cardinalities which can grow by 1 are finite. Cardinalities which
    cannot grow by 1 are infinite.
    Cardinalities are useless. Sets can grow by 1 element.
    So what is the size of N\{2}?
    It is |ℕ| - 1. That was easy.
    Why is that the same as ℕ\{1}? They are not supersets of each other.

    Sets can have elements inserted, which makes them different sets.
    The effect on size of inserting 1 is not the same for all sets.
    It is changing the infinite set but not its cardinality. Therefore
    cardinality is useless for my proof.
    What are you replacing it with?
    Number of elements.
    Which you define how? Starting maybe with |ℕ|. What numbers do you use?

    The size of the set ℕ of all finite sizes which can grow by 1 cannot >>>> grow by 1. It is an infinite size which cannot grow by 1.
    The size of N, containing all finite numbers, is itself infinite.
    Yes, it is |ℕ|.
    Which is as a concrete number…? [not OT?]

    The effect of removing a nine from 0.999... is changing its value.
    Only when replacing with another digit.
    When in 0.999... the decimal point is shifted, the number of nines
    remains constant. That has nothing to do with cardinalities.
    Yes it does; that is how WE define the number of nines.
    You can’t remove from the right, since there is no end.
    If all are a complete set, then we can shift all by one position to the
    left.
    Or equivalently, add 9.
    It is as a rope coming from the machine: there’s always more.

    You can only remove from the left (dividing by 10)
    Removing from the right is done by multiplying by 10.
    Where do the superfluous digits go: 0.(9)9 ?

    --
    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 Jun 29 20:46:53 2024
    Am Fri, 28 Jun 2024 18:25:57 +0000 schrieb WM:
    Le 28/06/2024 à 19:23, joes a écrit :
    Am Fri, 28 Jun 2024 13:55:34 +0000 schrieb WM:
    Le 28/06/2024 à 10:38, joes a écrit :
    Am Thu, 27 Jun 2024 12:15:30 +0000 schrieb WM:
    Le 26/06/2024 à 23:55, Jim Burns a écrit :

    WM thinks an infinite number is very.large.but.finite
    No, I assume that sets are complete. Therefore ℕ_0 as a proper
    superset of ℕ has one elements more than ℕ. Infinity does not make >>>>> them equal.
    It does.
    What is immediately before ω?
    Infinity does not have a predecessor like finite numbers.

    What does „complete” mean?
    It means that no natural number can be added to {0, 1, 2, 3, ..., ω}
    Duh, the set of all natural numbers N contains all of them.
    This is misleadingly notated, implying a predecessor. You mean ω u ℕ,
    or {ℕ}∪ℕ = {{0, 1, 2, …}, 0, 1, 2, …}. [Neo layout FTW]

    It means that the subtraction of the complete set leaves {0, 1, 2, 3,
    ..., ω} \ ℕ = {0, ω}.
    It means that in {0, 1, 2, 3, ..., ω} before ω there is a natural
    number.
    There is not, since there are infinitely many of them.
    Linearity excludes more than one at a position. Immediately before ω
    there is at most one natural number.
    You are confusing the infinitely long, linearly scaled natural number
    line with the ordinal number line, which can be drawn with 0, ω, ω*2(?), ω^2, …(?) at fixed/constant intervals. They do not live in the same
    world. You want to shoehorn ω and the rest somewhere onto the infinite
    N, continuing in steps of 1. This already fails in finding the non-
    existent far end. ω is not connected, as you say, to 0 by a finite
    number of steps. It is an augmentation to the whole set, giving a new
    anchor. Likewise ω*2 = ω+ω is obviously infinitely far away from ω.


    With which numbers do you describe the sizes of N and N_0?
    Most of them are dark and cannot be used as individuals.
    Not their elements. I was asking for their number, how many of them
    there are.
    |N| + 1 = |N_0|
    And that is…? You gave only a relation.

    --
    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 Jun 29 21:18:32 2024
    XPost: alt.crackpot

    Am Sat, 29 Jun 2024 17:01:10 +0000 schrieb WM:
    Le 29/06/2024 à 00:23, "Chris M. Thomasson" a écrit :
    On 6/28/2024 6:41 AM, WM wrote:
    Le 28/06/2024 à 02:03, Richard Damon a écrit :

    As was saidd, Cardinatality of infinte sets work differently than
    that of finite sets.

    Here is no cardinality asked for.
    A non-terminating digit sequence does not determine a real number.

    Huh? Sure it can. What is: .(428571)?
    That is a formula determining an infinite digit sequence
    Which number does it describe?

    It is a non-terminating digit sequence in base ten.
    No. Like "0.111..." it is a formula.
    Formulas determine sequences. The other way round is not possible.
    Then all real numbers are formulas.

    --
    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 Jim Burns@21:1/5 to All on Sat Jun 29 18:48:23 2024
    On 6/29/2024 1:18 PM, WM wrote:
    Le 29/06/2024 à 15:24, Jim Burns a écrit :
    On 6/28/2024 9:50 AM, WM wrote:

    It is changing the infinite set
    but not its cardinality.

    A set with a cardinal.growable.by.1 (finiteⁿᵒᵗᐧᵂᴹ)
    cannot change without its cardinality changing.

    Cardinality is irrelevant.

    Therefore cardinality is useless for my proof.

    For any difficulty which cardinality presents,
    not.saying 'cardinal' not.resolves the difficulty.

    Cardinality does not present a difficulty.
    It is simply unable to distinguish |ℕ| and |ℕ_0|.

    A not.at.all.drug.impaired use of the word 'irrelevant'
    declaring that cardinality is irrelevantᵂᴹ to
    cardinals |ℕ₁| and |ℕ₀|

    Cardinality does not distinguish cardinals |ℕ₁| and |ℕ₀|
    because
    j ↦ j⁺¹ is 1.to.1 from ℕ₀ to ℕ₁
    and
    k ↤ k is 1.to.1 to ℕ₀ from ℕ₁

    Without 'cardinality'
    you (WM) still have your (WM's) difficulty,
    that
    j ↦ j⁺¹ is 1.to.1 from ℕ₀ to ℕ₁
    and
    k ↤ k is 1.to.1 to ℕ₀ from ℕ₁

    All nines of 0.999... are from
    the sequence 0.9, 0.09, 0.009, ...
    None of the ℵo nines makes
    its partial sum 0,9, 0.99, 0.999, ... equal to 1.

    Each non.empty.set of 9s holds a first.in.set 9
    Each 9 has a first.after 9 and a last.before 9,
    except the first 9, which only has a first.after 9

    None of those is the last 9
    None of those equal 1

    ℵo nines fail to make 0.999... = 1.

    1 is near almost.all (all.but.finitely.many) of
    0.9 0.99 0.999 0.9999 0.99999 ...
    for any sense > 0 of 'near'

    For that reason,
    we assign 1 to 0.999...

    The values of infinite.length decimals
    are assigned by a different method from how
    the values of finite.length decimals are assigned.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Jim Burns@21:1/5 to All on Sun Jun 30 06:28:59 2024
    On 6/29/2024 2:14 PM, WM wrote:
    Le 29/06/2024 à 20:01, Jim Burns a écrit :

    However,
    we can reason about Avogadroᴬᵛᵒᵍᵃᵈʳᵒ 9s
    by finite not.first.false claim.sequence
    without going to them.

    Each non.empty.set of 9s holds a first.in.set 9
    Each 9 has a first.after 9 and a last.before 9,
    except the first 9, which only has a first.after 9

    We can reason about ℵo nines,
    all missing the limit.

    1 is near almost.all (all.but.finitely.many) of
    0.9 0.99 0.999 0.9999 0.99999 ...
    for any sense > 0 of 'near'

    For that reason,
    we assign 1 to 0.999...

    The values of infinite.length decimals
    are assigned by a method different from how
    the values of finite.length decimals are assigned.

    We can reason about ℵo nines,
    all missing the limit.

    None of
    0.9 0.99 0.999 0.9999 0.99999 ...
    is near almost.all of
    0.9 0.99 0.999 0.9999 0.99999 ...
    for any sense > 0 of 'near'
    but
    the values of infinite.length decimals
    are assigned by a different method from how
    the values of finite.length decimals are assigned.
    0.999... = 1
    0.999... ≠ 0.9
    0.999... ≠ 0.99
    0.999... ≠ 0.999
    0.999... ≠ 0.9999
    0.999... ≠ 0.99999
    ...

    It's the same for infinitely.many 9s  in that
    we can't go to them,  but
    we can reason about them.

    But most matheologians don't understand that
    the sequence 0.9, 0.09, 0.009, ... contains
    ℵo nines without containing the limit 0.

    1 is near almost.all (all.but.finitely.many) of
    0.9 0.99 0.999 0.9999 0.99999 ...
    for any sense > 0 of 'near'
    0.999... = 1
    0.999... ≠ 0.9
    0.999... ≠ 0.99
    0.999... ≠ 0.999
    0.999... ≠ 0.9999
    0.999... ≠ 0.99999
    ...

    But
    'infinite' is different from 'humongous' and
    different conclusions get concluded.

    If you think straight,
    then only one conclusion follows:
    0.999... < 1.

    The values of infinite.length decimals
    are assigned by a different method from how
    the values of finite.length decimals are assigned.
    0.999... ≠ 0.9 < 1
    0.999... ≠ 0.99 < 1
    0.999... ≠ 0.999 < 1
    0.999... ≠ 0.9999 < 1
    0.999... ≠ 0.99999 < 1
    ...

    0.999... = 1

    ----
    And Bob does not disappear.

    The cardinal ℵ₀ of the set ℕ of
    all cardinals.growable.by.1 (finiteⁿᵒᵗᐧᵂᴹ)
    is a cardinal.not.growable.by.1 (infiniteⁿᵒᵗᐧᵂᴹ)

    / Assume otherwise
    | Assume ℵ₀⁺¹ > ℵ₀
    | There are at.least.ℵ₀⁺¹ cardinals.growable.by.1
    | However, ℵ₀ is how.many cardinals.growable.by.1
    \ Contradiction.

    ℵ₀ = |ℕ| is not.growable.by.1
    |ℕ| = |ℕ∪{Bob]|
    exists f: ℕ∪{Bob} → ℕ : bijection
    Bob ∉ f(ℕ∪{Bob})
    And Bob disappears.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Sun Jun 30 14:51:42 2024
    Le 30/06/2024 à 12:29, Jim Burns a écrit :
    On 6/29/2024 2:14 PM, WM wrote:

    If you think straight,
    then only one conclusion follows:
    0.999... < 1.

    The values of infinite.length decimals
    are assigned by a different method from how
    the values of finite.length decimals are assigned.
    0.999... ≠ 0.9 < 1
    0.999... ≠ 0.99 < 1
    0.999... ≠ 0.999 < 1
    0.999... ≠ 0.9999 < 1
    0.999... ≠ 0.99999 < 1
    ...

    If you use only definable length, then always ℵo terms are missing.

    All finite indices guarantee finite length.
    0.999... = 0.999... < 1

    0.999... = 1

    That is wrong.
    If you insert parentheses, nothing changes

    ..((((0,9)9)9)9)... = 0,999...

    0.9 + 0.09 + 0.009 + ... contains ℵo terms with ℵo nines, all together smaller than 1.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Sun Jun 30 14:38:48 2024
    Le 29/06/2024 à 21:11, "Chris M. Thomasson" a écrit :
    On 6/29/2024 10:01 AM, WM wrote:
    Le 29/06/2024 à 00:23, "Chris M. Thomasson" a écrit :
    On 6/28/2024 6:41 AM, WM wrote:
    Le 28/06/2024 à 02:03, Richard Damon a écrit :

    As was saidd, Cardinatality of infinte sets work differently than
    that of finite sets.

    Here is no cardinality asked for.

    A non-terminating digit sequence does not determine a real number.

    Huh? Sure it can. What is:

    .(428571) >
    That is a formula determining an infinite digit sequence

    Try 3/7 represented in base 10 decimal notation ;^)

    That is a formula too.


    ? It is a non-terminating digit sequence in base ten.

    No. Like "0.111..." it is a formula.

    Formulas determine sequences. The other way round is not possible.

    Here is a simple recursive formula that creates infinite 9's during iteration:

    Formulas determine sequences.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Sun Jun 30 14:56:17 2024
    Le 30/06/2024 à 12:29, Jim Burns a écrit :

    |ℕ| = |ℕ∪{Bob]|

    That proves cardinality being useless to describe what we are discussing.

    exists f: ℕ∪{Bob} → ℕ : bijection
    Bob ∉ f(ℕ∪{Bob})
    And Bob disappears.

    Bob is only exchanged with other terms. Therefore he cannot disappear.

    Regardes, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Sun Jun 30 15:05:43 2024
    Le 30/06/2024 à 11:55, FromTheRafters a écrit :

    Yes it does, the sequence of partial sums approaches/converges to one.
    This *complete* ordered field of reals guarantees cauchy sequence convergence.

    The limit is not one of the ℵo terms.

    See how real numbers are defined.

    I have taught it for 30 years.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Sun Jun 30 15:03:10 2024
    Le 30/06/2024 à 12:02, FromTheRafters a écrit :
    WM pretended :


    The set of natural indices is a set.
    Shifting it to the left shifts every index and every indexed nine to the
    left.

    That still doesn't affect the fact that aleph_null is not a real
    number.

    But the set of indices is invariable. It cannot even expand by one index.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Sun Jun 30 15:07:41 2024
    Le 30/06/2024 à 00:48, Jim Burns a écrit :

    The values of infinite.length decimals
    are assigned by a different method from how
    the values of finite.length decimals are assigned.

    Are there ℵo partial sums 0.9, 0.99, 0.999, ... ?
    It the limit one of them?

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Sun Jun 30 15:18:31 2024
    Le 29/06/2024 à 22:25, joes a écrit :
    Am Sat, 29 Jun 2024 17:18:26 +0000 schrieb WM:

    All nines of 0.999... are from the sequence 0.9, 0.09, 0.009, ... None
    of the ℵo nines makes its partial sum 0,9, 0.99, 0.999, ... equal to 1.
    ℵo nines fail to make 0.999... = 1.
    That’s one way to construct it. Of course none of the infinite series individually reaches the limit (otherwise the following ones :-P would go above it?). Together they do. It is reached after exactly Aleph0 steps.

    Are there ℵo partial sums 0.9, 0.99, 0.999, ... ?
    If yes they can be combined to 0.999... .
    Is the limit one of them?

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Sun Jun 30 15:15:37 2024
    Le 29/06/2024 à 23:18, joes a écrit :
    Am Sat, 29 Jun 2024 17:01:10 +0000 schrieb WM:

    Like "0.111..." it is a formula.
    Formulas determine sequences. The other way round is not possible.

    Then all real numbers are formulas.

    Yes, you got it!

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Sun Jun 30 15:21:53 2024
    Le 29/06/2024 à 22:46, joes a écrit :
    Am Fri, 28 Jun 2024 18:25:57 +0000 schrieb WM:

    ℕ_0 as a proper
    superset of ℕ has one elements more than ℕ. Infinity does not make >>>>>> them equal.
    It does.

    Your world is not mine and is not maths.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Sun Jun 30 15:35:23 2024
    Le 29/06/2024 à 22:25, joes a écrit :
    Of course none of the infinite series
    individually reaches the limit (otherwise the following ones :-P would go above it?). Together they do.

    No. None with a smaller number of nines than another one is useful for any "together". The limit cannot be anyone of the ℵo partial sums.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Jim Burns@21:1/5 to Ross Finlayson on Sun Jun 30 11:44:03 2024
    On 6/30/2024 10:48 AM, Ross Finlayson wrote:
    On 06/30/2024 02:55 AM, FromTheRafters wrote:

    This *complete* ordered field of reals guarantees
    cauchy sequence convergence.
    See how real numbers are defined.

    It's axiomatic,
    and about the usual open topology.

    There are others, ....

    ...but not in that discussion.

    Yes,
    we CAN discuss things other than the real numbers.

    However,
    if we ARE discussing the real numbers,
    then we AREN'T doing that.

    Define the Dedekind.complete real numbers.
    Prove the Intermediate Value Theorem.

    Counter.propose(?) the rational numbers,
    for which the Intermediate Value Theorem is false.

    So what?
    The rational numbers aren't the real numbers.
    We can still apply the Intermediate Value Theorem
    to the real numbers,
    which is all anyone has claimed.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From joes@21:1/5 to All on Sun Jun 30 17:47:30 2024
    Am Sun, 30 Jun 2024 15:21:53 +0000 schrieb WM:
    Le 29/06/2024 à 22:46, joes a écrit :
    Am Fri, 28 Jun 2024 18:25:57 +0000 schrieb WM:

    ℕ_0 as a proper superset of ℕ has one elements more than ℕ. >>>>>>> Infinity does not make them equal.
    It does.
    Their cardinality, of course.
    Your world is not mine and is not maths.

    --
    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 Sun Jun 30 17:49:10 2024
    Am Sun, 30 Jun 2024 15:18:31 +0000 schrieb WM:
    Le 29/06/2024 à 22:25, joes a écrit :
    Am Sat, 29 Jun 2024 17:18:26 +0000 schrieb WM:

    All nines of 0.999... are from the sequence 0.9, 0.09, 0.009, ... None
    of the ℵo nines makes its partial sum 0,9, 0.99, 0.999, ... equal to
    1. ℵo nines fail to make 0.999... = 1.
    That’s one way to construct it. Of course none of the infinite series
    individually reaches the limit (otherwise the following ones :-P would
    go above it?). Together they do. It is reached after exactly Aleph0
    steps.
    Which is to say, after all of the steps.

    Are there ℵo partial sums 0.9, 0.99, 0.999, ... ?
    If yes they can be combined to 0.999... .
    That is the limit, yes.
    Is the limit one of them?

    --
    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 Sun Jun 30 17:51:30 2024
    Am Sun, 30 Jun 2024 15:07:41 +0000 schrieb WM:
    Le 30/06/2024 à 00:48, Jim Burns a écrit :

    The values of infinite.length decimals are assigned by a different
    method from how the values of finite.length decimals are assigned.

    Are there ℵo partial sums 0.9, 0.99, 0.999, ... ?
    It the limit one of them?
    The limit is the Aleph-zeroth, if you will.

    --
    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 Jim Burns@21:1/5 to All on Sun Jun 30 13:29:41 2024
    On 6/30/2024 10:51 AM, WM wrote:
    Le 30/06/2024 à 12:29, Jim Burns a écrit :
    On 6/29/2024 2:14 PM, WM wrote:

    If you think straight,
    then only one conclusion follows:
    0.999... < 1.

    The values of infinite.length decimals
    are assigned by a different method from how
    the values of finite.length decimals are assigned.
    0.999...  ≠  0.9  <  1
    0.999...  ≠  0.99  <  1
    0.999...  ≠  0.999  <  1
    0.999...  ≠  0.9999  <  1
    0.999...  ≠  0.99999  <  1
    ...

    If you use only definable length,
    then always ℵo terms are missing.

    Each nonempty set of terms holds a least member.
    Each term t has
    a last.before term 10⋅t-9 and
    a first.after term (9+t)/10
    except the first term 0 which has only a first.after.

    No terms are incorrectly described by that.
    It is complete.

    All finite indices guarantee finite length.
    0.999...  =  0.999...  <  1

    No.

    1 is near almost.all (all.but.finitely.many) of
    0.9 0.99 0.999 0.9999 0.99999 ...
    for any sense > 0 of 'near'

    For that reason,
    we assign 1 to 0.999...

    The values of infinite.length decimals
    are assigned by a method different from how
    the values of finite.length decimals are assigned.

    0.999... = 1

    0.999...  =  1

    That is wrong.
    If you insert parentheses, nothing changes

    ..((((0,9)9)9)9)... = 0,999...
    0.9 + 0.09 + 0.009 + ...
    contains ℵo terms with ℵo nines,
    all together smaller than 1.

    β is the least.upper.bound of the terms
    0.9 0.99 0.999 0.9999 0.99999 ...

    least.upper.bound β is not less than 1

    | Assume otherwise.
    | Assume least.upper.bound β < 1
    |
    | 10⋅β-9 < β < (9+β)/10
    |
    | (9+β)/10 is an upper.bound of terms
    |
    | 10⋅β-9 isn't an upper.bound of terms
    | term tₓ exists:
    | tₓ > 10⋅β-9
    | (99+tₓ)/100 > (99+(10⋅β-9))/100
    | tₓ₊₂ > (9+β)/10
    | (9+β)/10 isn't an upper.bound of terms
    |
    | However,
    | (9+β)/10 is an upper.bound of terms
    | Contradiction.

    Therefore,
    least.upper.bound β is not less than 1

    Also.
    least.upper.bound β not greater than 1

    least.upper.bound β = 1

    And
    1 is near almost.all (all.but.finitely.many) of
    0.9 0.99 0.999 0.9999 0.99999 ...
    for any sense > 0 of 'near'

    Consider sense of 'near' ε > 0

    1-ε is not an upper.bound of terms
    term tₑ exists: 1-ε < tₑ < 1
    finitely.many terms < tₑ

    | Assume otherwise.
    | Assume infinitely.many terms < tₑ
    |
    | 0.9 0.99 0.999 0.9999 0.99999 ...
    | is well.ordered.
    |
    | A FIRST infinitely.preceded term tₓ exists
    | with last.before.tₓ tₓ₋₁ finitely.preceded.
    |
    | However,
    | if tₓ₋₁ is finitely.preceded
    | then first.after.tₓ₋₁ tₓ is finitely.preceded
    | Contradiction.

    Therefore,
    finitely.many terms < tₑ

    And
    finitely.many terms < ε

    And
    we assign 1 to 0.999...

    The values of infinite.length decimals
    are assigned by a method different from how
    the values of finite.length decimals are assigned.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From joes@21:1/5 to All on Sun Jun 30 18:04:58 2024
    Am Sun, 30 Jun 2024 15:03:10 +0000 schrieb WM:
    Le 30/06/2024 à 12:02, FromTheRafters a écrit :
    WM pretended :

    The set of natural indices is a set.
    Shifting it to the left shifts every index and every indexed nine to
    the left.
    That still doesn't affect the fact that aleph_null is not a real
    number.
    But the set of indices is invariable. It cannot even expand by one
    index.
    Which it doesn’t. There is no end to 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 joes@21:1/5 to All on Sun Jun 30 17:56:18 2024
    Am Sun, 30 Jun 2024 14:51:42 +0000 schrieb WM:
    Le 30/06/2024 à 12:29, Jim Burns a écrit :

    The values of infinite length decimals are assigned by a different
    method from how the values of finite length decimals are assigned.
    0.999... ≠ 0.99999 < 1 ...

    If you use only definable length, then always ℵo terms are missing.
    Did you mean: /finite/ length ?
    All finite indices guarantee finite length.

    0.(9) is not finitely long though, so there are no „missing” terms

    0.9 + 0.09 + 0.009 + ... contains ℵo terms with ℵo nines, all together smaller than 1.
    We are not talking about the terms, but their limit, which is all of them /taken together/.

    --
    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 Jim Burns@21:1/5 to All on Sun Jun 30 14:10:13 2024
    On 6/30/2024 11:15 AM, WM wrote:
    Le 29/06/2024 à 23:18, joes a écrit :
    Am Sat, 29 Jun 2024 17:01:10 +0000 schrieb WM:

    Like "0.111..." it is a formula.
    Formulas determine sequences.
    The other way round is not possible.

    Then all real numbers are formulas.

    Yes, you got it!

    Then there are more formulas than there are formulas.

    Formulas which are
    finite strings from a finite alphabet
    can be assigned finite indices.

    Each nonempty set of formulas holds
    a first.indexed member.
    For each formula,
    there is a last.before indexed.formula and
    a first.after indexed.formula,
    except the very.first, which has only a first.after.

    There is a sequence of nested intervals of
    the real number line
    such that
    each interval contains later intervals, and
    its end.points are indexed.formulas, and
    any interior indexed formulas are
    later than its end.points.

    Any formula interior to all the intervals
    is later than infinitely.many endpoints.
    But there are no indexed.formulas
    later than infinitely.many end.points

    There is no formula interior to all the intervals.

    However,
    there is a point interior to all the intervals,
    or else
    the Intermediate Value Theorem fails, and
    there exist functions 'continuous' at all points
    which nevertheless jump.

    So, there is a point there.
    So, there is a formula there.
    But there isn't an indexed.formula there.
    So, all the indexed.formulas
    (finite strings, finite alphabet)
    aren't all the formulas.
    Somehow.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Sun Jun 30 20:45:46 2024
    Am 25.06.2024 um 22:18 schrieb WM:

    Let the infinite sequence 0.999...

    0.999... ist keine "infinite sequence", sondern eine Zahl, nämlich die
    Zah 1, Du Trottel.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Jim Burns@21:1/5 to All on Sun Jun 30 16:59:39 2024
    On 6/27/2024 8:15 AM, WM wrote:
    Le 26/06/2024 à 23:55, Jim Burns a écrit :

    WM thinks an infiniteᵂᴹ number is
    very.very.very.large.but.finiteⁿᵒᵗᐧᵂᴹ

    No,
    I assume that sets are complete.

    I (JB) think that what you (WM) call 'logic' is that
    each nonempty set has a trichotomous order such that
    each nonempty subset holds a first and a last,
    whether its first or last is visibleᵂᴹ or darkᵂᴹ

    Is that what you're saying?

    Therefore ℕ_0 as a proper superset of ℕ has
    one elements more than ℕ.
    Infinity does not make them equal.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Jim Burns@21:1/5 to Ross Finlayson on Sun Jun 30 21:38:56 2024
    On 6/30/2024 5:05 PM, Ross Finlayson wrote:
    On 06/30/2024 08:44 AM, Jim Burns wrote:
    On 6/30/2024 10:48 AM, Ross Finlayson wrote:
    On 06/30/2024 02:55 AM, FromTheRafters wrote:

    This *complete* ordered field of reals guarantees
    cauchy sequence convergence.
    See how real numbers are defined.

    It's axiomatic,
    and about the usual open topology.

    There are others, ....

    ...but not in that discussion.

    Yes,
    we CAN discuss things other than the real numbers.

    However,
    if we ARE discussing the real numbers,
    then we AREN'T doing that.

    Define the Dedekind.complete real numbers.
    Prove the Intermediate Value Theorem.

    Counter.propose(?) the rational numbers,
    for which the Intermediate Value Theorem is false.

    So what?
    The rational numbers aren't the real numbers.
    We can still apply the Intermediate Value Theorem
    to the real numbers,
    which is all anyone has claimed.

    Well, iota-values are defined and
    satisfy making for the IVT
    which results the FTC's,
    Fundamental Theorems of Calculus.

    If I use the usual definitions for
    the limit of a sequence of sets
    for your iota.values,
    they do not satisfy the Intermediate Value Theorem.

    I understand your iota.values to be the limit
    n/d: 0≤n≤d: d → ∞

    For n/d: 0≤n≤d I read {0/d,1/d,...,d/d}

    For lim[d → ∞] I read ⋂[0<dᵢ<∞] ⋃[dᵢ<d<∞]

    Is that what you mean? You (RF) don't say.

    ⋂[0<dᵢ<∞] ⋃[dᵢ<d<∞] {0/d,1/d,...,d/d}
    does not satisfy the Intermediate Value Theorem.

    For the past several years
    a Mikhail Katz has been working on
    rehabilitating infinitesimals,

    I wish Mikhail Katz all the best in his endeavors.
    I don't know what those endeavors are, but
    I expect Mikhail Katz to know that,
    from the Intermediate Value Theorem, one can prove that
    the real numbers don't have infinitesimals.

    My _guess_ is that Mikhail Katz is
    _talking about something else_

    and it reminds
    me of a story where an educator surveyed an introductory
    class whether .999... was the same, or different, than 1.0,
    and at least according to their thought processes,
    it was about 50/50.

    They're the same, whatever the thought processes of
    introductory students or Field medalists are,
    _unless we're talking about something else_

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Jim Burns@21:1/5 to Ross Finlayson on Mon Jul 1 00:22:22 2024
    On 6/30/2024 11:32 PM, Ross Finlayson wrote:
    On 06/30/2024 06:38 PM, Jim Burns wrote:
    On 6/30/2024 5:05 PM, Ross Finlayson wrote:

    Well, iota-values are defined and
    satisfy making for the IVT
    which results the FTC's,
    Fundamental Theorems of Calculus.

    If I use the usual definitions for
    the limit of a sequence of sets
    for your iota.values,
    they do not satisfy the Intermediate Value Theorem.

    I understand your iota.values to be the limit
    n/d: 0≤n≤d: d → ∞

    For n/d: 0≤n≤d  I read {0/d,1/d,...,d/d}

    For lim[d → ∞] I read ⋂[0<dᵢ<∞] ⋃[dᵢ<d<∞]

    Is that what you mean? You (RF) don't say.

    ⋂[0<dᵢ<∞] ⋃[dᵢ<d<∞] {0/d,1/d,...,d/d}
    does not satisfy the Intermediate Value Theorem.

    Yes it does, the iota-values result that they do
    make for the IVT,

    Tell me what you are talking about.

    I understand your iota.values to be the limit
    n/d: 0≤n≤d: d → ∞

    For n/d: 0≤n≤d I read {0/d,1/d,...,d/d}

    For lim[d → ∞] I read ⋂[0<dᵢ<∞] ⋃[dᵢ<d<∞]

    Is that what you mean? You (RF) don't say.

    ⋂[0<dᵢ<∞] ⋃[dᵢ<d<∞] {0/d,1/d,...,d/d}
    does not satisfy the Intermediate Value Theorem.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Mon Jul 1 16:03:42 2024
    Le 30/06/2024 à 19:51, joes a écrit :
    Am Sun, 30 Jun 2024 15:07:41 +0000 schrieb WM:
    Le 30/06/2024 à 00:48, Jim Burns a écrit :

    The values of infinite.length decimals are assigned by a different
    method from how the values of finite.length decimals are assigned.

    Are there ℵo partial sums 0.9, 0.99, 0.999, ... ?
    It the limit one of them?
    The limit is the Aleph-zeroth, if you will.

    The limit of the infinitely many terms is the ωth.
    All |ℕ| terms differ from 1.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Mon Jul 1 15:59:48 2024
    Le 30/06/2024 à 19:29, Jim Burns a écrit :

    1 is near almost.all (all.but.finitely.many) of
    0.9 0.99 0.999 0.9999 0.99999 ...
    for any sense > 0 of 'near'

    But it is none of the terms.

    For that reason,
    we assign 1 to 0.999...

    That is wrong.
    The sequence 0.9, 0.09, 0.009, ... contains ℵo terms with ℵo nines but
    not its limit 0.
    The sequence 0.9, 0.99, 0.999, ... contains ℵo terms with ℵo nines appearing for the first time but not its limit 1.
    The compact description is ...((((0.9)9)9)... = 0.999....

    The values of infinite.length decimals
    are assigned by a method different from how
    the values of finite.length decimals are assigned.

    There are infinitely many terms near 1 but different from 1.

    ..((((0,9)9)9)9)... = 0,999...
    0.9 + 0.09 + 0.009 + ...
    contains ℵo terms with ℵo nines,
    all together smaller than 1.

    β is the least.upper.bound of the terms
    0.9 0.99 0.999 0.9999 0.99999 ...

    least.upper.bound β is not less than 1

    Of course. Who claimed otherwise?

    | Assume otherwise.

    No. Your strawman is not asked for.

    Fact is that 0.999... contains ℵo nines of ℵo terms < 1.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Mon Jul 1 16:07:22 2024
    Le 30/06/2024 à 19:56, joes a écrit :
    Am Sun, 30 Jun 2024 14:51:42 +0000 schrieb WM:
    Le 30/06/2024 à 12:29, Jim Burns a écrit :

    The values of infinite length decimals are assigned by a different
    method from how the values of finite length decimals are assigned.
    0.999... ≠ 0.99999 < 1 ...

    If you use only definable length, then always ℵo terms are missing.
    Did you mean: /finite/ length ?

    Only finite length is definable.

    All finite indices guarantee finite length.

    0.(9) is not finitely long though, so there are no „missing” terms

    0.9 + 0.09 + 0.009 + ... contains ℵo terms with ℵo nines, all together >> smaller than 1.

    We are not talking about the terms, but their limit,

    which is not reached by any of the ℵo partial sum.

    which is all of them
    /taken together/.

    Nonsense. Show any terms which taken together are larger than all singles.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Mon Jul 1 16:10:58 2024
    Le 30/06/2024 à 20:10, Jim Burns a écrit :
    On 6/30/2024 11:15 AM, WM wrote:
    Le 29/06/2024 à 23:18, joes a écrit :
    Am Sat, 29 Jun 2024 17:01:10 +0000 schrieb WM:

    Like "0.111..." it is a formula.
    Formulas determine sequences.
    The other way round is not possible.

    Then all real numbers are formulas.

    Yes, you got it!

    Then there are more formulas than there are formulas.

    Of course. All constructed finite formulas belong to a potentially
    infinite collection.

    So, there is a point there.
    So, there is a formula there.
    But there isn't an indexed.formula there.
    So, all the indexed.formulas
    (finite strings, finite alphabet)
    aren't all the formulas.
    Somehow.

    Yes. There is no absolute "all" in potential infinity.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Mon Jul 1 16:13:35 2024
    Le 30/06/2024 à 22:59, Jim Burns a écrit :
    On 6/27/2024 8:15 AM, WM wrote:

    I assume that sets are complete.

    I (JB) think that what you (WM) call 'logic' is that
    each nonempty set has a trichotomous order such that
    each nonempty subset holds a first and a last,
    whether its first or last is visibleᵂᴹ or darkᵂᴹ

    Is that what you're saying?

    Yes, but only under the pr4condition of completed infinity.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Mon Jul 1 16:15:47 2024
    Le 30/06/2024 à 20:45, Moebius a écrit :
    Am 25.06.2024 um 22:18 schrieb WM:

    Let the infinite sequence 0.999...

    0.999... ist keine "infinite sequence", sondern eine Zahl,

    Wrong. 0.999... is an abbreviation of ...(((0.9)9)9)... = 0.9, 0.99,
    0.999, ... converging to but never reaching 1.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Mon Jul 1 18:55:56 2024
    Am 01.07.2024 um 18:15 schrieb WM:
    Le 30/06/2024 à 20:45, Moebius a écrit :
    Am 25.06.2024 um 22:18 schrieb WM:

    Let the infinite sequence 0.999...

    0.999... ist keine "infinite sequence", sondern eine Zahl,

    Wrong.

    Nein, nicht wrong, Du hirnloser Depp.

    0.999... e IR, daher ist 0,999... eine reelle Zahl. Es gilt sogar
    0,999... = 1 (siehe https://simple.wikipedia.org/wiki/0.999...),
    0.999... ist also identisch mit der reellen Zahl 1.

    0.999... is <dumschwatz>

    Geh scheißen, Mückenheim!

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Mon Jul 1 19:24:52 2024
    Am 01.07.2024 um 18:37 schrieb Chris M. Thomasson:
    On 7/1/2024 9:15 AM, WM wrote:
    Le 30/06/2024 à 20:45, Moebius a écrit :
    Am 25.06.2024 um 22:18 schrieb WM:

    Let the infinite sequence 0.999...

    0.999... ist keine "infinite sequence", sondern eine Zahl,

    Wrong. 0.999... is an abbreviation of ...(((0.9)9)9)... = 0.9, 0.99,
    0.999, ... converging to but never reaching 1.

    .(9) is just <etc.>

    Please don't make the same mistakes as Mückenheim.

    I'm talking about the number 0.999... (i.e. 1) here. Not about the
    string "0.999..." (consisting of 8 characters) or a "representation"
    (say the decimal representation) of the number which may be denoted by
    the string "0.999...", or ".(9)", etc.

    This means especially that 0.999... (i.e. the number 1) is not an
    "infinite sequence".

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Jim Burns@21:1/5 to All on Mon Jul 1 14:32:45 2024
    On 7/1/2024 12:13 PM, WM wrote:
    Le 30/06/2024 à 22:59, Jim Burns a écrit :
    On 6/27/2024 8:15 AM, WM wrote:

    I assume that sets are complete.

    I (JB) think that what you (WM) call 'logic' is that
    each nonempty set has a trichotomous order such that
    each nonempty subset holds a first and a last,
    whether its first or last is visibleᵂᴹ or darkᵂᴹ

    Is that what you're saying?

    Yes, but
    only under the pr4condition of completed infinity.

    Completed.infinityᵂᴹ is finiteⁿᵒᵗᐧᵂᴹ.

    https://en.wikipedia.org/wiki/Finite_set
    | Necessary and sufficient conditions for finiteness

    | (Paul Stäckel)
    | S can be given a total ordering which is
    | well-ordered both forwards and backwards.
    | That is, every non-empty subset of S has
    | both a least and a greatest element in the subset.

    The set ℕ of all finiteⁿᵒᵗᐧᵂᴹ cardinals
    cannot be given
    a total ordering which is
    well-ordered both forwards and backwards.
    ℕ isn't a finiteⁿᵒᵗᐧᵂᴹ set.

    For each finiteⁿᵒᵗᐧᵂᴹ cardinal j ∈ ℕ
    j ends an initial segment {0,1,2,...,j} of ℕ
    which can be given a total ordering which is
    well-ordered both forwards and backwards.
    {0,1,2,...,j} is a finiteⁿᵒᵗᐧᵂᴹ set.

    For each finiteⁿᵒᵗᐧᵂᴹ cardinal j ∈ ℕ
    j begins an end segment {j,j+1,...} of ℕ
    which cannot be given a total ordering which is
    well-ordered both forwards and backwards.
    {j,j+1,...} isn't a finiteⁿᵒᵗᐧᵂᴹ set.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Mon Jul 1 21:38:43 2024
    Am 01.07.2024 um 20:32 schrieb Jim Burns:

    https://en.wikipedia.org/wiki/Finite_set
    | Necessary and sufficient conditions for finiteness

    | (Paul Stäckel)
    | S can be given a total ordering which is
    | well-ordered both forwards and backwards.
    | That is, every non-empty subset of S has
    | both a least and a greatest element in the subset.

    Makes much sense. Thank you for bringing this to our attention (again).

    https://en.wikipedia.org/wiki/Paul_St%C3%A4ckel https://de.wikipedia.org/wiki/Paul_St%C3%A4ckel

    "In the area of prime number theory, he used the term /twin prime/ (in
    its German form, "Primzahlzwilling") for the first time." :-)

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Mon Jul 1 21:52:08 2024
    Am 28.06.2024 um 20:25 schrieb WM:

    What [ordinal number] is immediately before ω?

    Keine, Mückenheim.

    WIE OFT SOLL MAN DIR DAS NOCH SAGEN? Du scheinst geistig-mental sogar
    noch schlechter aufgestellt zu sein, als Biden.

    What [ordinal number] is immediately before ω?

    Siehe oben.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Mon Jul 1 21:56:48 2024
    Am 01.07.2024 um 21:52 schrieb Moebius:
    Am 28.06.2024 um 20:25 schrieb WM:

    What [ordinal number] is immediately before ω?

    Keine, Mückenheim.

    WIE OFT SOLL MAN DIR DAS NOCH SAGEN? Du scheinst geistig-mental sogar
    noch schlechter aufgestellt zu sein, als Biden.

    What [ordinal number] is immediately before ω?

    Siehe oben.

    Zum 1000-mal:

    Wenn n eine Ordinalzahl < als ω ist, dann ist n eine natürliche Zahl.
    Dann ist n+1 eine natürliche Zahl, die größer als n ist. Da n+1 aber
    eine natürliche Zahl ist, ist auch n+1 eine Ordinalzahl kleiner als ω.
    Also: n < n+1 < ω. Damit ist n kein unmittelbarer Vorgänger von ω.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Mon Jul 1 21:47:29 2024
    Am 27.06.2024 um 12:26 schrieb WM:

    {1, 2, 3, ...} has one number less than {0, 1, 2, 3, ...} although this <bla>

    Ja, Mückenheim, diesem Umstand wird durch den Hinweis auf

    card(IN_0 \ IN) = 1

    Rechnung getragen. Für transfinite Kardinalzahlen bist Du aber zu blöde.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Mon Jul 1 22:40:55 2024
    Am 29.06.2024 um 19:08 schrieb WM:
    Le 29/06/2024 à 03:05, Ross Finlayson a écrit :

    I thought .999... = 1, ....

    That is wrong.

    Nein, Du psychotischer Spinner: 0.999... = 1 ist (im Kontext der reellen Zahlen) völlig korrekt.

    See: https://de.wikipedia.org/wiki/0,999%E2%80%A6

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Tue Jul 2 01:42:15 2024
    Am 01.07.2024 um 18:55 schrieb Moebius:
    Am 01.07.2024 um 18:15 schrieb WM:
    Le 30/06/2024 à 20:45, Moebius a écrit :
    Am 25.06.2024 um 22:18 schrieb WM:

    Let the infinite sequence 0.999...

    0.999... ist keine "infinite sequence", sondern eine Zahl,

    Wrong.

    Nein, nicht wrong, Du hirnloser Depp.

    0.999... e IR, daher ist 0,999... eine reelle Zahl. Es gilt sogar
    0,999... = 1 (siehe https://simple.wikipedia.org/wiki/0.999...),
    0.999... ist also identisch mit der reellen Zahl 1.

    0.999... is <dumschwatz>

    Du bis einfach zu blöde, um den Unterschied zwischen einem Term, der ein mathematisches Objekt bezeichnet und dem mathematischen Objekt, das von
    dem Term bezeichnet wird, zu verstehen.

    Kurz: Du bist zu blöde, den Unterschied zwischen dem Symbol "2" und der
    Zahl 2 zu verstehen.

    Vieles von deinem hirntoten Gequatsche lässt sich auf dieses Unvermögen zurückführen.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Tue Jul 2 01:53:55 2024
    Am 27.06.2024 um 21:47 schrieb WM:

    Cardinality is nonsense.

    Klar, Mückenheim. Because you said so?

    Du dummes Ar*loch bist selbst zum Scheißen zu blöde.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Tue Jul 2 01:57:32 2024
    Am 30.06.2024 um 17:05 schrieb WM:
    Le 30/06/2024 à 11:55, FromTheRafters a écrit :

    See how real numbers are defined.

    I have taught it for 30 years.

    Dann hast Du entweder 30 Jahre lang Unsinn erzählt, oder bist vor
    einiger Zeit an Demenz erkrankt. Ich würde auf Letzteres tippen.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Tue Jul 2 02:01:15 2024
    Am 29.06.2024 um 18:58 schrieb WM:

    The set of natural indices is a set.

    Das sind wirklich faszinierende Erkenntnisse.

    Demnächst begreifst Du vielleicht sogar, dass jede natürliche Zahl eine natürliche Zahl ist?!

    Oder auch, dass eine Menge eine Menge ist. (After all, you just realized
    that a set of <bla> is a set! Incredible!)

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Jim Burns@21:1/5 to Ross Finlayson on Mon Jul 1 21:10:01 2024
    On 7/1/2024 7:42 PM, Ross Finlayson wrote:
    On 06/30/2024 09:22 PM, Jim Burns wrote:
    On 6/30/2024 11:32 PM, Ross Finlayson wrote:
    On 06/30/2024 06:38 PM, Jim Burns wrote:
    On 6/30/2024 5:05 PM, Ross Finlayson wrote:

    Well, iota-values are defined and
    satisfy making for the IVT
    which results the FTC's,
    Fundamental Theorems of Calculus.

    If I use the usual definitions for
    the limit of a sequence of sets
    for your iota.values,
    they do not satisfy the Intermediate Value Theorem.

    I understand your iota.values to be the limit
    n/d: 0≤n≤d: d → ∞

    For n/d: 0≤n≤d  I read {0/d,1/d,...,d/d}

    For lim[d → ∞] I read ⋂[0<dᵢ<∞] ⋃[dᵢ<d<∞]

    Is that what you mean? You (RF) don't say.

    ⋂[0<dᵢ<∞] ⋃[dᵢ<d<∞] {0/d,1/d,...,d/d}
    does not satisfy the Intermediate Value Theorem.

    Yes it does, the iota-values result that they do
    make for the IVT,

    Tell me what you are talking about.

    I understand your iota.values to be the limit
    n/d: 0≤n≤d: d → ∞

    For n/d: 0≤n≤d  I read {0/d,1/d,...,d/d}

    For lim[d → ∞] I read ⋂[0<dᵢ<∞] ⋃[dᵢ<d<∞]

    Is that what you mean? You (RF) don't say.

    ⋂[0<dᵢ<∞] ⋃[dᵢ<d<∞] {0/d,1/d,...,d/d}
    does not satisfy the Intermediate Value Theorem.

    There must be satisfied "extent density completeness
    measure" to satisfy the IVT, though one may aver that
    "extent density completeness" would suffice.

    The intermediate value theorem
    is equivalent to
    the least upper bound property.
    Either one implies the other.

    So, iota-values or
    ran(EF) of the natural/unit equivalency function,
    or sweep, has "extent density completeness measure",
    thus the IVT follows.

    I understand your iota.values to be the limit
    n/d: 0≤n≤d: d → ∞

    For n/d: 0≤n≤d I read {0/d,1/d,...,d/d}

    For lim[d → ∞] I read ⋂[0<dᵢ<∞] ⋃[dᵢ<d<∞]

    Is that what you mean? You (RF) don't say.

    It's sort of irrelevant what I intend

    I disagree about the irrelevance of
    what you (RF) mean by
    your (RF's) notation.

    However,
    let's assume for argument's sake
    that what you mean is irrelevant.
    What does it cost you to tell me?

    as I don't see value in nominalist fictionalism,
    what it is is what it is, what it is.

    In some possible worlds,
    what n/d: 0≤n≤d is is what {0/d,1/d,...,d/d} is
    In other possible worlds, it isn't.

    In some possible worlds,
    what lim[d → ∞] is is what ⋂[0<dᵢ<∞] ⋃[dᵢ<d<∞] is
    In other possible worlds, it isn't.

    Knowing which possible world the actual world is
    is relevant to discussing n/d: 0≤n≤d: d → ∞

    It's not really any of the initial approximations,
    this limit, this infinite limit, this continuum limit.

    It's an _infinite_ limit.

    Is it
    ⋂[0<dᵢ<∞] ⋃[dᵢ<d<∞] {0/d,1/d,...,d/d} ?

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Tue Jul 2 03:41:41 2024
    Am 02.07.2024 um 03:22 schrieb Jim Burns:
    On 7/1/2024 3:38 PM, Moebius wrote:
    Am 01.07.2024 um 20:32 schrieb Jim Burns:

    https://en.wikipedia.org/wiki/Finite_set
    | Necessary and sufficient conditions for finiteness

    | (Paul Stäckel)
    | S can be given a total ordering which is
    | well-ordered both forwards and backwards.
    | That is, every non-empty subset of S has
    | both a least and a greatest element in the subset.

    Makes much sense.
    Thank you for bringing this to our attention (again).

    https://en.wikipedia.org/wiki/Paul_St%C3%A4ckel
    https://de.wikipedia.org/wiki/Paul_St%C3%A4ckel

    "In the area of prime number theory, he used
    the term /twin prime/
    (in its German form, "Primzahlzwilling")
    for the first time." :-)

    "Paul Gustav Samuel Stäckel
    (20 August 1862, Berlin – 12 December 1919, Heidelberg)"

    Perhaps WM has not yet caught up
    to this late.breaking development.
    Give him another century.

    Remember that WM is a physicist. His knowledge of math is rather
    superficial.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Jim Burns@21:1/5 to Moebius on Mon Jul 1 21:22:00 2024
    On 7/1/2024 3:38 PM, Moebius wrote:
    Am 01.07.2024 um 20:32 schrieb Jim Burns:

    https://en.wikipedia.org/wiki/Finite_set
    | Necessary and sufficient conditions for finiteness

    | (Paul Stäckel)
    | S can be given a total ordering which is
    | well-ordered both forwards and backwards.
    | That is, every non-empty subset of S has
    | both a least and a greatest element in the subset.

    Makes much sense.
    Thank you for bringing this to our attention (again).

    https://en.wikipedia.org/wiki/Paul_St%C3%A4ckel https://de.wikipedia.org/wiki/Paul_St%C3%A4ckel

    "In the area of prime number theory, he used
    the term /twin prime/
    (in its German form, "Primzahlzwilling")
    for the first time." :-)

    "Paul Gustav Samuel Stäckel
    (20 August 1862, Berlin – 12 December 1919, Heidelberg)"

    Perhaps WM has not yet caught up
    to this late.breaking development.
    Give him another century.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Jim Burns@21:1/5 to Moebius on Tue Jul 2 00:57:24 2024
    On 7/1/2024 9:41 PM, Moebius wrote:
    Am 02.07.2024 um 03:22 schrieb Jim Burns:
    On 7/1/2024 3:38 PM, Moebius wrote:
    Am 01.07.2024 um 20:32 schrieb Jim Burns:

    https://en.wikipedia.org/wiki/Finite_set
    | Necessary and sufficient conditions for finiteness

    | (Paul Stäckel)
    | S can be given a total ordering which is
    | well-ordered both forwards and backwards.
    | That is, every non-empty subset of S has
    | both a least and a greatest element in the subset.

    Makes much sense.
    Thank you for bringing this to our attention (again).

    https://en.wikipedia.org/wiki/Paul_St%C3%A4ckel
    https://de.wikipedia.org/wiki/Paul_St%C3%A4ckel

    "In the area of prime number theory, he used
    the term /twin prime/
    (in its German form, "Primzahlzwilling")
    for the first time." :-)

    "Paul Gustav Samuel Stäckel
    (20 August 1862, Berlin – 12 December 1919, Heidelberg)"

    Perhaps WM has not yet caught up
    to this late.breaking development.
    Give him another century.

    Remember that WM is a physicist.
    His knowledge of math is rather superficial.

    I don't see how Physics can be blamed for
    Wolfgang Mückenheim's delusion of
    never being wrong.

    In Physics,
    being wrong is nearly a sacrament.

    Theories are stretched by experiments until they SNAP,
    and then the good news is rapidly shared with colleagues:
    New physics!
    We know more today about how the universe works
    than we knew yesterday, when we only had
    the not.yet.broken theory.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Jim Burns@21:1/5 to Ross Finlayson on Tue Jul 2 08:07:11 2024
    On 7/1/2024 11:19 PM, Ross Finlayson wrote:
    On 07/01/2024 06:10 PM, Jim Burns wrote:

    What that means is that
    I think
    theory is a strong mathematical platonism,
    it matters what is _attained_ to,
    or that to which we _attain_,
    the "true" objects of
    a universe of mathematical objects,
    "a" universe, then with regards to descriptions

    "descriptions"

    there's that
    the "extent density completeness measure" provide
    "extent density completeness"
    which you would agree that
    "extent density completeness" makes for
    satisfying the IVT.

    Then, as I mentioned,
    there's a theory,
    in all the universe of theories,
    all the abstract and contingent and fanciful and
    practical and otherwise,
    one of which is "the true theory",
    that among those,
    there's one where it appears that
    "it is so" is an axiom.

    So, given that
    you won't accept that via inspection,

    "inspection"

    that a least-upper-bound is given and
    also a sigma algebra is given,
    given that extent and density are givens,
    then,
    given that it's axiomatic,

    "axiomatic"

    and, doesn't contradict the ordinary
    because
    it just makes for the "only-diagonal" contra
    the "anti-diagonal",
    then, how's that.

    Good sir, ....

    Do I understand you correctly?
    You have declined my invitation to say
    what your symbol.string n/d: 0≤n≤d: d → ∞ means
    because
    you consider what you've told me to have answered me:
    n/d: 0≤n≤d: d → ∞ satisfies IVT
    n/d: 0≤n≤d: d → ∞ is countable
    etc.

    You have defined it so.
    Do you realize that?

    Definitions are two.edged swords.
    They grant you unrestricted power,
    but only inside the area of what.you.mean
    and outside of that, no power.

    If what.you.mean by n/d: 0≤n≤d: d → ∞ is that
    n/d: 0≤n≤d: d → ∞ satisfies IVT
    n/d: 0≤n≤d: d → ∞ is countable
    etc.
    then, okay, you can define it so, but
    defining it so doesn't mean it exists.

    Those proofs which
    you think n/d: 0≤n≤d: d → ∞ disproves
    prove that n/d: 0≤n≤d: d → ∞ doesn't exist.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Jim Burns@21:1/5 to Ross Finlayson on Tue Jul 2 14:40:33 2024
    On 7/1/2024 7:42 PM, Ross Finlayson wrote:
    On 06/30/2024 09:22 PM, Jim Burns wrote:

    [...]

    It's not really any of the initial approximations,
    this limit, this infinite limit, this continuum limit.

    It's an _infinite_ limit.

    Again, despite the name,
    the continuum limit and the continuum are different.

    In the continuum limit,
    the least.upper.bound of neighbor.distances is 0

    In the continuum,
    in each nonempty split F ᴬ<ᴬ H
    foresplit F holds a last or hindsplit H holds a first.

    The rationals are an example of
    the continuum limit which isn't the continuum.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Jim Burns@21:1/5 to Jim Burns on Tue Jul 2 14:43:10 2024
    On 7/2/2024 2:40 PM, Jim Burns wrote:
    On 7/1/2024 7:42 PM, Ross Finlayson wrote:
    On 06/30/2024 09:22 PM, Jim Burns wrote:

    [...]

    It's not really any of the initial approximations,
    this limit, this infinite limit, this continuum limit.

    It's an _infinite_ limit.

    Again, despite the name,
    the continuum limit and the continuum are different.

    In the continuum limit,
    the least.upper.bound of neighbor.distances is 0

    Gack!
    In the continuum limit,
    the greatest.lower.bound of neighbor.distances is 0

    In the continuum,
    in each nonempty split F ᴬ<ᴬ H
    foresplit F holds a last or hindsplit H holds a first.

    The rationals are an example of
    the continuum limit which isn't the continuum.



    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Wed Jul 3 19:00:16 2024
    Am 28.06.2024 um 15:41 schrieb WM:

    A non-terminating digit sequence does not determine a real number.

    Natürlich tut sie das, Du Trottel.

    Die Folge (d_1, d_2, d_3, ...) mit d_i e {0, 1, 2, 3, 4, 4, 5, 6, 7, 8,
    9} für alle i e IN "determiniert" die reelle Zahl SUM_(n=1..oo) d_n/10^n.

    Wie dumm kann/darf ein Professor an der technischen Hochschule Augsburg eigentlich sein?

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Wed Jul 3 19:01:25 2024
    Am 28.06.2024 um 15:41 schrieb WM:

    A non-terminating digit sequence does not determine a real number.

    Natürlich tut sie das, Du Trottel.

    Die Folge (d_1, d_2, d_3, ...) mit d_i e {0, 1, 2, 3, 4, 5, 6, 7, 8, 9}
    für alle i e IN "determiniert" die reelle Zahl SUM_(n=1..oo) d_n/10^n.

    Wie dumm kann/darf ein Professor an der technischen Hochschule Augsburg eigentlich sein?

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Wed Jul 3 19:09:33 2024
    Am 28.06.2024 um 15:55 schrieb WM:


    in {0, 1, 2, 3, ..., ω} before ω there is a natural number.

    Ja, "before ω" (im Sinne von kleiner) sind unendlich viele natural
    numbers, nämlich die natürlichen Zahlen 0, 1, 2, 3, ... usw.

    Es gibt aber keine natürliche Zahl die "unmittelbar vor" ω steht. Mit
    anderen Worten: Es gibt keine natürliche Zahl n, so dass es keine
    natürliche Zahl m gibt mit n < m < ω.

    Wieder anders, so dass es viell. sogar Du verstehen kannst: Zu jeder natürlichen Zahl n gibt es eine natürliche Zahl m (beispielsweise n+1),
    so dass n < m < ω gilt.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Jim Burns@21:1/5 to All on Wed Jul 3 14:24:37 2024
    On 6/28/2024 9:41 AM, WM wrote:
    Le 28/06/2024 à 02:03, Richard Damon a écrit :

    [...]

    A non-terminating digit sequence
    does not determine a real number.

    A non.terminating decimal determines
    no less than one real number (line.point) and
    no more than one real number (line.point).

    ⎛ For each split of the line,
    ⎜ the split is _situated_ ==
    ⎜ there is a point _at_ the split,
    ⎝ last in the fore.split or first in the hind.split.


    A non.terminating decimal determines
    no less than one real number (line.point).

    A non.terminating decimal determines
    a split of _terminating_ decimals
    into _fore.decimals_ and _hind.decimals_
    (finite.length and too.low or too.high)

    There is a line.point at the split.
    The non.terminating decimal determines it.


    A non.terminating decimal determines
    no more than one real number (line.point).

    ⎛ For each fore.decimal,hind.decimal pair which
    ⎜ is a distance d apart,
    ⎜ there is a fore.decimal,hind.decimal pair which
    ⎝ is a distance ⅒⋅d apart.

    | Assume there are two line.points between
    | all fore.decimal,hind.decimal pairs
    | (points determined by the non.terminating decimal).
    | The two points are a distance > 0 apart.
    |
    | The greatest.lower.bound β of
    | fore.decimal,hind.decimal distances is > 0
    | 10⋅β > β > ⅒⋅β > 0
    |
    | ⅒⋅β is a lower.bound
    |
    | 10⋅β isn't a lower.bound
    | There is a pair closer than 10⋅β
    | There is a pair closer than ⅒⋅10⋅β
    | There is a pair closer than ⅒⋅⅒⋅10⋅β
    | ⅒⋅β isn't a lower.bound.
    | Contradiction.

    Therefore,
    A non.terminating decimal determines
    no more than one real number (line.point).


    Therefore,
    A non.terminating decimal determines
    exactly one real number (line.point).

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Wed Jul 3 21:31:13 2024
    Am 03.07.2024 um 20:24 schrieb Jim Burns:

    Therefore,
    A non.terminating decimal determines
    exactly one real number (line.point).

    See: https://www.dpmms.cam.ac.uk/~wtg10/decimals.html

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Wed Jul 3 22:02:00 2024
    Am 03.07.2024 um 22:00 schrieb WM:

    But it is impossible to <bla bla bla>

    Geh scheißen, Mückenheim!

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Wed Jul 3 20:00:28 2024
    Le 03/07/2024 à 20:24, Jim Burns a écrit :
    On 6/28/2024 9:41 AM, WM wrote:
    Le 28/06/2024 à 02:03, Richard Damon a écrit :

    [...]

    A non-terminating digit sequence
    does not determine a real number.

    A non.terminating decimal determines
    no less than one real number (line.point) and
    no more than one real number (line.point).

    But it is impossible to construct or define or find or recognize or
    communicate a non-terminating decimal without using a finite formula, and
    be it as simple as "0.111...". Therefore my above statement is true.
    A formula can define a non-terminating decimal and its limit, a real
    number. A non-terminating digit sequence without defining formula cannot
    define anything because it cannot be handled with eniugh precision. Always almost all digits are dark.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Wed Jul 3 20:05:48 2024
    Le 03/07/2024 à 19:09, Moebius a écrit :
    Am 28.06.2024 um 15:55 schrieb WM:


    in {0, 1, 2, 3, ..., ω} before ω there is a natural number.

    Ja, "before ω" (im Sinne von kleiner) sind unendlich viele natural
    numbers, nämlich die natürlichen Zahlen 0, 1, 2, 3, ... usw.

    Es gibt aber keine natürliche Zahl die "unmittelbar vor" ω steht.

    You cannot recognize it. It is existing but dark.

    Zu jeder
    natürlichen Zahl n gibt es eine natürliche Zahl m (beispielsweise n+1),
    so dass n < m < ω gilt.

    For every visible natural number this is true.

    Like ∀x > 0: NUF(x) = ℵo is true. But this truth proves the existence
    of dark numbers, because between every such x and 0 there must lie ℵo
    unit fractions and ℵo finite distances between them.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Wed Jul 3 20:07:29 2024
    Le 03/07/2024 à 19:01, Moebius a écrit :
    Am 28.06.2024 um 15:41 schrieb WM:

    A non-terminating digit sequence does not determine a real number.

    Natürlich tut sie das

    Die Folge (d_1, d_2, d_3, ...) mit d_i e {0, 1, 2, 3, 4, 5, 6, 7, 8, 9}
    für alle i e IN "determiniert" die reelle Zahl SUM_(n=1..oo) d_n/10^n.

    Gib mal eine konkret an.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Wed Jul 3 22:49:36 2024
    Am 03.07.2024 um 22:05 schrieb WM:
    Le 03/07/2024 à 19:09, Moebius a écrit :
    Am 28.06.2024 um 15:55 schrieb WM:


    in {0, 1, 2, 3, ..., ω} before ω there is a natural number.

    Ja, "before ω" (im Sinne von kleiner) sind unendlich viele natural
    numbers, nämlich die natürlichen Zahlen 0, 1, 2, 3, ... usw.

    Es gibt aber keine natürliche Zahl die "unmittelbar vor" ω steht.

    You <bla>

    Mückenheim, halt endlich mal die Fresse und geh scheißen.

    Deinen saudummen Scheißdreck kann man sich wirklich nicht länger
    anhören. (Beim Psychiater warst Du offensichtlich auch nicht.)

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Wed Jul 3 21:10:12 2024
    Le 03/07/2024 à 22:46, Moebius a écrit :
    Am 03.07.2024 um 22:07 schrieb WM:
    Le 03/07/2024 à 19:01, Moebius a écrit :
    Am 28.06.2024 um 15:41 schrieb WM:

    A non-terminating digit sequence does not determine a real number.

    Natürlich tut sie das

    Die Folge (d_1, d_2, d_3, ...) mit d_i e {0, 1, 2, 3, 4, 5, 6, 7, 8,
    9} für alle i e IN "determiniert" die reelle Zahl SUM_(n=1..oo) d_n/10^n. >>>
    Gib mal eine konkret an.

    Da wäre z. B. die Folge (d_n)_(n e IN), die durch d_i = 3 für alle i e
    IN definiert ist.

    That is a formula.

    Diese Folge "determiniert" die reelle Zahl
    SUM_(n=1..oo) d_n/10^n = 1/3.

    This formula defines the infinite sequence of partial sums and its limit
    1/3.

    The paper of the whole universe would not be enough to write only the
    first 10^10^100 digits of the sequence.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Wed Jul 3 22:46:59 2024
    Am 03.07.2024 um 22:07 schrieb WM:
    Le 03/07/2024 à 19:01, Moebius a écrit :
    Am 28.06.2024 um 15:41 schrieb WM:

    A non-terminating digit sequence does not determine a real number.

    Natürlich tut sie das

    Die Folge (d_1, d_2, d_3, ...) mit d_i e {0, 1, 2, 3, 4, 5, 6, 7, 8,
    9} für alle i e IN "determiniert" die reelle Zahl SUM_(n=1..oo) d_n/10^n. >>
    Gib mal eine konkret an.

    Da wäre z. B. die Folge (d_n)_(n e IN), die durch d_i = 3 für alle i e
    IN definiert ist. Diese Folge "determiniert" die reelle Zahl
    SUM_(n=1..oo) d_n/10^n = 1/3.

    Mückenheim, Du bist für jede Art von Mathematik zu doof und zu blöde.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Wed Jul 3 23:18:31 2024
    Am 03.07.2024 um 23:10 schrieb WM:
    Le 03/07/2024 à 22:46, Moebius a écrit :
    Am 03.07.2024 um 22:07 schrieb WM:
    Le 03/07/2024 à 19:01, Moebius a écrit :
    Am 28.06.2024 um 15:41 schrieb WM:

    A non-terminating digit sequence does not determine a real number. >>>>
    Natürlich tut sie das

    Die Folge (d_1, d_2, d_3, ...) mit d_i e {0, 1, 2, 3, 4, 5, 6, 7, 8,
    9} für alle i e IN "determiniert" die reelle Zahl SUM_(n=1..oo)
    d_n/10^n.

    Gib mal eine konkret an.

    Da wäre z. B. die Folge (d_n)_(n e IN), die durch d_i = 3 für alle i e
    IN definiert ist.

    That is

    Mückenheim, Du bist für jede Art von Mathematik zu dumm und zu blöde.
    Deine Psychose und (neuerdings) Demenz machen es praktisch UNMÖGLICH,
    mit Dir über irgend ein mathematisches Thema zu sprechen.

    Und tschüss.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Wed Jul 3 23:30:32 2024
    Am 03.07.2024 um 23:18 schrieb Moebius:
    Am 03.07.2024 um 23:10 schrieb WM:
    Le 03/07/2024 à 22:46, Moebius a écrit :
    Am 03.07.2024 um 22:07 schrieb WM:
    Le 03/07/2024 à 19:01, Moebius a écrit :
    Am 28.06.2024 um 15:41 schrieb WM:

    A non-terminating digit sequence does not determine a real number. >>>>>
    Natürlich tut sie das

    Die Folge (d_1, d_2, d_3, ...) mit d_i e {0, 1, 2, 3, 4, 5, 6, 7,
    8, 9} für alle i e IN "determiniert" die reelle Zahl SUM_(n=1..oo)
    d_n/10^n.

    Gib mal eine konkret an.

    Da wäre z. B. die Folge (d_n)_(n e IN), die durch d_i = 3 für alle i
    e IN definiert ist.

    That is

    Mückenheim, Du bist für jede Art von Mathematik zu dumm und zu blöde. Deine Psychose und (neuerdings) Demenz machen es praktisch UNMÖGLICH,
    mit Dir über irgend ein mathematisches Thema zu sprechen.

    Und tschüss.

    Nur um Dich nicht dumm sterben lassen:

    Wir definieren eine "non-terminating digit sequence" the following way:

    Wir betrachten die Folge (d_n)_(n e IN), die durch d_i = 3 für alle i e
    IN definiert ist.

    Diese Folge "determiniert" die reelle Zahl SUM_(n=1..oo) d_n/10^n = 1/3.

    Damit ist Deine hirnrissige Behauptung "A non-terminating digit sequence
    does not determine a real number." falsifiziert.

    EOD.

    Hint: Man kann mit Dir nicht "mehr" vernünftig diskutieren, Mückenheim.
    Du hast einen schweren Dachschaden.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Wed Jul 3 23:58:03 2024
    Am 03.07.2024 um 22:05 schrieb WM:

    ∀x > 0: NUF(x) = ℵo is true.

    Right, if our domain of discourse is IR (i.e. if x ranges over the
    elements in IR).

    This means:

    between every x [in IR] and 0 there [...] lie ℵo unit
    fractions and ℵo finite distances between them.

    Exactly!

    Das hast Du gut beobachtet, Mückenheim!

    Was genau verstehst Du jetzt daran nicht?

    Hinweis: Für jedes x e IR mit x > 0 gibt es (abzählbar) unendlich viele Stammbrüche s, so dass s < x ist.

    Wie schwer kann es sein das zu verstehen?

    Bis Du wirklich selbst zum Scheißen zu blöde, Mückenheim?

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Jim Burns@21:1/5 to All on Wed Jul 3 23:20:30 2024
    On 7/3/2024 4:00 PM, WM wrote:
    Le 03/07/2024 à 20:24, Jim Burns a écrit :
    On 6/28/2024 9:41 AM, WM wrote:

    A non-terminating digit sequence
    does not determine a real number.

    A non.terminating decimal determines
    no less than one real number (line.point) and
    no more than one real number (line.point).

    But it is impossible to
    construct or define or find or recognize or communicate
    a non-terminating decimal without using a finite formula,
    and be it as simple as "0.111...".

    Answer the questions
    "What is a non.terminating.decimalⁿᵒᵗᐧᵂᴹ?" and
    "What is a line.pointⁿᵒᵗᐧᵂᴹ?"
    and one can prove from very reasonable assumptions
    that non.terminating.decimalsⁿᵒᵗᐧᵂᴹ _exist_
    and line.pointsⁿᵒᵗᐧᵂᴹ _exist_
    and
    a non.terminating.decimalⁿᵒᵗᐧᵂᴹ determines
    no less than one real number (line.pointⁿᵒᵗᐧᵂᴹ) and
    no more than one real number (line.pointⁿᵒᵗᐧᵂᴹ).

    If it is impossible to constructᵂᴹ or defineᵂᴹ or findᵂᴹ or
    recognizeᵂᴹ or communicateᵂᴹ a non.terminating.decimalⁿᵒᵗᐧᵂᴹ
    then that proves that it is unnecessary to
    constructᵂᴹ or defineᵂᴹ or findᵂᴹ or recognizeᵂᴹ or
    communicateᵂᴹ a non.terminating.decimalⁿᵒᵗᐧᵂᴹ

    because it cannot be handled with eniugh precision.

    Then it _exists_ and is unable to be
    handled.with.enough.precisionᵂᴹ.

    Always almost all digits are dark.

    All.nonempty.digit.setsⁿᵒᵗᐧᵂᴹ hold a first member. All.digitsⁿᵒᵗᐧᵂᴹ have a first.after.digit and a last.before.digit, except the first.digit, which has only a first.after.digit.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Thu Jul 4 06:45:09 2024
    Am 04.07.2024 um 05:20 schrieb Jim Burns:

    Always almost all digits are dark.

    I guess it's dark in his asshole too.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From joes@21:1/5 to All on Thu Jul 4 11:00:09 2024
    Am Wed, 03 Jul 2024 20:05:48 +0000 schrieb WM:
    Le 03/07/2024 à 19:09, Moebius a écrit :
    Am 28.06.2024 um 15:55 schrieb WM:

    in {0, 1, 2, 3, ..., ω} before ω there is a natural number.

    Ja, "before ω" (im Sinne von kleiner) sind unendlich viele natural
    numbers, nämlich die natürlichen Zahlen 0, 1, 2, 3, ... usw.
    Es gibt aber keine natürliche Zahl die "unmittelbar vor" ω steht.

    You cannot recognize it. It is existing but dark.

    Zu jeder natürlichen Zahl n gibt es eine natürliche Zahl m
    (beispielsweise n+1),
    so dass n < m < ω gilt.
    For every visible natural number this is true.
    There is no such thing as „visibility”.

    Like ∀x > 0: NUF(x) = ℵo is true. But this truth proves the existence of dark numbers, because between every such x and 0 there must lie ℵo unit fractions and ℵo finite distances between them.
    Why? That distance can be divided infinitely.

    --
    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 Thu Jul 4 13:12:07 2024
    Le 03/07/2024 à 23:30, Moebius a écrit :

    Wir definieren eine "non-terminating digit sequence" the following way:

    Defining and writing are different.

    Wir betrachten die Folge (d_n)_(n e IN), die durch d_i = 3 für alle i e
    IN definiert ist.

    That is a formula. The formula defines every digit of the infinite
    sequence and its limit.
    It is impossible to define the formula or the limit by an infinite
    sequence.

    Diese Folge "determiniert" die reelle Zahl SUM_(n=1..oo) d_n/10^n = 1/3.

    No. The formula defines the sequence. An infinite sequence has infinitely
    many digits which are given, not only abbreviated by a formula. This is a formula: "0.333...". Like any other infinite sequence this infinite
    sequence cannot be given.

    Regards, WMK

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Thu Jul 4 15:49:09 2024
    Am 04.07.2024 um 15:19 schrieb WM:
    Le 03/07/2024 à 23:58, Moebius a écrit :
    Am 03.07.2024 um 22:05 schrieb WM:

    ∀x > 0: NUF(x) = ℵo is true.

    Right, if our domain of discourse is IR (i.e. if x ranges over the
    elements in IR).

    This means:

    between every x [in IR] and 0 there [...] lie ℵo unit fractions and
    ℵo finite distances between them.

    Exactly!

    Why do you adhere to the [...] idea that every x > 0 is larger than [the sum of] ℵo finite distances?


    Because it is true?

    Hinweis: Für jedes x e IR mit x > 0 gibt es (abzählbar) unendlich
    viele Stammbrüche s, so dass s < x ist.

    <bla>

    Mückenheim, Du bist für jede Art von Mathematik zu doof. Daher auch hier
    EOD.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Thu Jul 4 13:19:35 2024
    Le 03/07/2024 à 23:58, Moebius a écrit :
    Am 03.07.2024 um 22:05 schrieb WM:

    ∀x > 0: NUF(x) = ℵo is true.

    Right, if our domain of discourse is IR (i.e. if x ranges over the
    elements in IR).

    This means:

    between every x [in IR] and 0 there [...] lie ℵo unit
    fractions and ℵo finite distances between them.

    Exactly!

    Why do you adhere to the silly idea that every x > 0 is larger than ℵo
    finite distances?
    Note that you are wrong. Not every x > 0 is larger than ℵo finite
    distances.

    Hinweis: Für jedes x e IR mit x > 0 gibt es (abzählbar) unendlich viele Stammbrüche s, so dass s < x ist.

    Only for x larger than ℵo finite distances.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Thu Jul 4 13:49:47 2024
    Le 04/07/2024 à 05:20, Jim Burns a écrit :
    On 7/3/2024 4:00 PM, WM wrote:

    But it is impossible to
    construct or define or find or recognize or communicate
    a non-terminating decimal without using a finite formula,
    and be it as simple as "0.111...".

    Answer the questions
    "What is a non.terminating.decimalⁿᵒᵗᐧᵂᴹ?" and
    "What is a line.pointⁿᵒᵗᐧᵂᴹ?"
    and one can prove from very reasonable assumptions
    that non.terminating.decimalsⁿᵒᵗᐧᵂᴹ _exist_
    and line.pointsⁿᵒᵗᐧᵂᴹ _exist_
    and
    a non.terminating.decimalⁿᵒᵗᐧᵂᴹ determines
    no less than one real number (line.pointⁿᵒᵗᐧᵂᴹ) and
    no more than one real number (line.pointⁿᵒᵗᐧᵂᴹ).

    Yes, the line point is the limit of an infinite sequence.
    Example: 0.999... --> 1.
    But the sequence cannot be given other than by its defining formula like "0.999...".

    If it is impossible to constructᵂᴹ or defineᵂᴹ or findᵂᴹ or
    recognizeᵂᴹ or communicateᵂᴹ a non.terminating.decimalⁿᵒᵗᐧᵂᴹ

    It is not impossible to construct every desired digit of the sequence. But
    it is impossible to do so without a finite formula. And it is impossible
    to desire all digits. ℵo are always missing.

    because it cannot be handled with enough precision.

    Then it _exists_ and is unable to be
    handled.with.enough.precisionᵂᴹ.

    It is handled by a formula, sometimes even with absolute precision like 0.999... --> 1.

    Always almost all digits are dark.

    All.nonempty.digit.setsⁿᵒᵗᐧᵂᴹ hold a first member. All.digitsⁿᵒᵗᐧᵂᴹ have a first.after.digit

    Most are unknown.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Thu Jul 4 13:59:49 2024
    Le 04/07/2024 à 15:49, Moebius a écrit :
    Am 04.07.2024 um 15:19 schrieb WM:
    Le 03/07/2024 à 23:58, Moebius a écrit :

    Why do you adhere to the [...] idea that every x > 0 is larger than [the sum of]
    ℵo finite distances?

    Because it is true?

    No, it shows a deficit of logical thinking capability. The finite
    distances consist also of x > 0. Useless to discuss with you further.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Thu Jul 4 14:07:13 2024
    Le 04/07/2024 à 13:00, joes a écrit :
    Am Wed, 03 Jul 2024 20:05:48 +0000 schrieb WM:

    so dass n < m < ω gilt.
    For every visible natural number this is true.
    There is no such thing as „visibility”.

    There is invisibility: For all visible/choosable n: |ℕ \ {1, 2, 3, ...,
    n}| = ℵo.

    Like ∀x > 0: NUF(x) = ℵo is true. But this truth proves the existence of >> dark numbers, because between every such x and 0 there must lie ℵo unit
    fractions and ℵo finite distances between them.
    Why? That distance can be divided infinitely.

    But the first unit fraction already is an x > 0.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Thu Jul 4 16:07:37 2024
    Am 04.07.2024 um 13:00 schrieb joes:
    Am Wed, 03 Jul 2024 20:05:48 +0000 schrieb WM:
    Le 03/07/2024 à 19:09, Moebius a écrit :
    Am 28.06.2024 um 15:55 schrieb WM:

    in {0, 1, 2, 3, ..., ω} before ω there is a natural number.

    Ja, "before ω" (im Sinne von kleiner) sind unendlich viele natural
    numbers, nämlich die natürlichen Zahlen 0, 1, 2, 3, ... usw.
    Es gibt aber keine natürliche Zahl die "unmittelbar vor" ω [ist].

    It is existing but <bla>

    No, it is NOT existing, you psychotic asshole.

    Proof:

    Zu jeder natürlichen Zahl n gibt es eine natürliche Zahl m
    (beispielsweise n+1), so dass n < m < ω gilt.

    For every <bla bla bla>

    Lies, was ich geschrieben habe, Mückenhirn. Eines der Peano-Axiome
    lautet An e IN: n+1 e IN. Mithilfe der üblichen Definition von < kann
    man dann leicht zeigen, dass für alle n e IN: n < n+1 gilt. Also gilt
    mit An e IN: n < ω: An e IN: n < n+1 < ω. bzw. An e IN: Em e IN: n < m <
    ω. qed

    There is no such thing as „visibility”.

    und dergleichen. Jedenfalls nicht im aktuellen mathematischen Kontext
    (in der Darstellenden Geometrie gibt's das schon, SCNR).

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Thu Jul 4 14:10:29 2024
    Le 04/07/2024 à 16:01, Peter Fairbrother a écrit :
    On 25/06/2024 21:18, WM wrote:

    A more interesting question; suppose a set containing an infinite number
    of 9's.

    If the nines are not different by some indices, then the set has only one element.

    Now copy that set and add a 2.

    Is the second set bigger than the first set?

    Of course, since it contains every element of the first set and one more element.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Thu Jul 4 15:45:15 2024
    Am 04.07.2024 um 15:12 schrieb WM:

    saudummen Scheißdreck.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Peter Fairbrother@21:1/5 to All on Thu Jul 4 15:01:29 2024
    On 25/06/2024 21:18, WM wrote:
    Let the infinite sequence 0.999... be multiplied by 10. Does the number
    of nines grow?
    Corollary-question: Does the number of nines grow when in 0.999 the
    decimal point is shifted by one or more position?

    Regards, WM

    A more interesting question; suppose a set containing an infinite number
    of 9's. Now copy that set and add a 2.

    Is the second set bigger than the first set?

    Peter Fairbrother

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Thu Jul 4 16:45:59 2024
    Am 04.07.2024 um 16:07 schrieb WM:
    Le 04/07/2024 à 13:00, joes a écrit :

    There is no such thing as „visibility”.

    There is invisibility

    Ja, z. B. Dein Matheverständnis.

    For all visible/choosable n: |ℕ \ {1, 2, 3, ..., n}| = ℵo.

    Mal davon abgesehen, dass niemand weiß, was Deine "visible/choosable n"
    sein sollen (im Gegensatz zu den anderen natürlichen Zahlen), gilt:

    For all natural numbers n: |ℕ \ {1, 2, 3, ..., n}| = ℵo ,

    bzw. in Zeichen:

    An e ℕ: |ℕ \ {1, 2, 3, ..., n}| = ℵo .

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Thu Jul 4 16:30:17 2024
    Am 04.07.2024 um 15:59 schrieb WM:
    Le 04/07/2024 à 15:49, Moebius a écrit :
    Am 04.07.2024 um 15:19 schrieb WM:
    Le 03/07/2024 à 23:58, Moebius a écrit :

    Why do you adhere to the [...] idea that every x > 0 is larger than
    [the sum of] ℵo finite distances?

    Because it is true?

    <bla bla bla> Useless to discuss with you further.

    Da gibt's auch nicht zu "diskutieren", Mückenheim.

    Hinweis: Für jedes x e IR mit x > 0 gibt es (abzählbar) unendlich viele Stammbrüche s, so dass s < x ist. Die Summe der (abzählbar) unendlich
    vielen Abstände zwischen diesen Stammbrüchen ist dann natürlich < x.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Thu Jul 4 17:08:24 2024
    Am 04.07.2024 um 16:30 schrieb Moebius:
    Am 04.07.2024 um 15:59 schrieb WM:
    Le 04/07/2024 à 15:49, Moebius a écrit :
    Am 04.07.2024 um 15:19 schrieb WM:
    Le 03/07/2024 à 23:58, Moebius a écrit :

    Why do you adhere to the [...] idea that every x > 0 is larger than
    [the sum of] ℵo finite distances?

    Because it is true?

    <bla bla bla> Useless to discuss with you further.

    Da gibt's auch nicht zu "diskutieren", Mückenheim.

    Hinweis: Für jedes x e IR mit x > 0 gibt es (abzählbar) unendlich viele Stammbrüche s, so dass s < x ist. Die Summe der (abzählbar) unendlich vielen Abstände zwischen diesen Stammbrüchen ist dann natürlich < x.

    Andere Möglichkeit: Man betrachtet einfach die (abzählbar) unendlich
    vielen Intervalle [x/4, x/2], [x/8, x/4], [x/16, x/8], ... Die
    (abzählbar) unendlich vielen "finite distances" d_1 = x/2 - x/4, d_2 =
    x/4 - x/8, usw. summieren sich dann genau zu x/2 auf: SUM_(n=1..oo) d_n
    = x/2. Und x/2 ist bekanntlich kleiner als x (für x e IR, x > 0).

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Thu Jul 4 15:09:31 2024
    Le 04/07/2024 à 16:45, Moebius a écrit :
    Am 04.07.2024 um 16:07 schrieb WM:

    For all visible/choosable n: |ℕ \ {1, 2, 3, ..., n}| = ℵo.

    Mal davon abgesehen, dass niemand weiß, was Deine "visible/choosable n"
    sein sollen (im Gegensatz zu den anderen natürlichen Zahlen), gilt:

    Es bedeutet, dass man alle Zahlen von 1 bis n angeben kann.
    Auf diese endlich vielen folgen noch unendlich viele, von denen man
    unendlich viele nicht angeben kann.

    Gruß, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Thu Jul 4 15:16:23 2024
    Le 04/07/2024 à 17:08, Moebius a écrit :
    Am 04.07.2024 um 16:30 schrieb Moebius:

    Da gibt's auch nicht zu "diskutieren",

    Doch, die Frage, wie Du Dir die Verteilung der ersten Stammbrüche, also derjenigen, die kleiner als jeder, den Du angeben kannst, sind,
    vorstellst, bleibt. (Off limits for native English speakers.)

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Thu Jul 4 17:20:43 2024
    Am 04.07.2024 um 17:09 schrieb WM:
    Le 04/07/2024 à 16:45, Moebius a écrit :
    Am 04.07.2024 um 16:07 schrieb WM:

    For all visible/choosable n: |ℕ \ {1, 2, 3, ..., n}| = ℵo.

    Mal davon abgesehen, dass niemand weiß, was Deine "visible/choosable
    n" sein sollen (im Gegensatz zu den anderen natürlichen Zahlen), gilt:

    Es bedeutet, dass man alle Zahlen von 1 bis n angeben kann.
    Auf diese endlich vielen folgen noch unendlich viele, von denen man
    unendlich viele nicht angeben kann.

    Aus dem nämlichen Grund hat man sog. Variablen eingeführt Mückenheim.
    Diese erlauben uns auch Aussage über alle Element einer sehr großen
    endlichen oder unendlichen Menge zu tätigen.

    So gilt z. B. für all x in {n e IN : n < 10^10^10^10^100}: x+x = 2*x

    Oder auch für alle x in {n e IN}: x+x = 2*x.

    Niemand muss dazu die entsprechenden Zahlen "angeben" ("explizit hinschreiben"), Du Depp.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Thu Jul 4 17:22:26 2024
    Am 04.07.2024 um 17:09 schrieb WM:
    Le 04/07/2024 à 16:45, Moebius a écrit :
    Am 04.07.2024 um 16:07 schrieb WM:

    For all visible/choosable n: |ℕ \ {1, 2, 3, ..., n}| = ℵo.

    Mal davon abgesehen, dass niemand weiß, was Deine "visible/choosable
    n" sein sollen (im Gegensatz zu den anderen natürlichen Zahlen), gilt:

    Es bedeutet, dass man alle Zahlen von 1 bis n angeben kann.
    Auf diese endlich vielen folgen noch unendlich viele, von denen man
    unendlich viele nicht angeben kann.

    Aus dem nämlichen Grund hat man sog. Variablen eingeführt Mückenheim.
    Diese erlauben uns auch Aussage über alle Element einer sehr großen
    endlichen oder unendlichen Menge zu tätigen.

    So gilt z. B. für all x in {n e IN : n < 10^100}: x+x = 2*x

    Oder auch für alle x in IN: x+x = 2*x.

    Niemand muss dazu die entsprechenden Zahlen "angeben" ("explizit hinschreiben"), Du Depp.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Thu Jul 4 17:25:05 2024
    Am 04.07.2024 um 17:16 schrieb WM:

    die Verteilung der ersten Stammbrüche

    Mückenheim, es gibt keine "ersten Stammbrüche". Zu _jedem_ Stammbruch
    gibt es (abzählbar) unendlich viele kleinere Stammbrüche.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Thu Jul 4 15:27:12 2024
    Le 04/07/2024 à 17:22, Moebius a écrit :
    Am 04.07.2024 um 17:09 schrieb WM:
    Le 04/07/2024 à 16:45, Moebius a écrit :
    Am 04.07.2024 um 16:07 schrieb WM:

    For all visible/choosable n: |ℕ \ {1, 2, 3, ..., n}| = ℵo.

    Mal davon abgesehen, dass niemand weiß, was Deine "visible/choosable
    n" sein sollen (im Gegensatz zu den anderen natürlichen Zahlen), gilt:

    Es bedeutet, dass man alle Zahlen von 1 bis n angeben kann.
    Auf diese endlich vielen folgen noch unendlich viele, von denen man
    unendlich viele nicht angeben kann.

    Aus dem nämlichen Grund hat man sog. Variablen eingeführt

    Ja, natürlich. n ist gerade so eine. Damit kann man beweisen, dass fast
    alle natürlichen Zahlen nicht visible sind. Nur endlich viele sind
    visible, unendlich viele sind es nicht.

    Diese erlauben uns auch Aussage über alle Element einer sehr großen endlichen oder unendlichen Menge zu tätigen.

    Auf diese Weise beweist man: Fast alle natürlichen Zahlen sind dunkel.

    Gruß, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Thu Jul 4 17:41:13 2024
    Am 04.07.2024 um 17:27 schrieb WM:
    Le 04/07/2024 à 17:22, Moebius a écrit :
    Am 04.07.2024 um 17:09 schrieb WM:
    Le 04/07/2024 à 16:45, Moebius a écrit :
    Am 04.07.2024 um 16:07 schrieb WM:
    ;
    For all visible/choosable n: |ℕ \ {1, 2, 3, ..., n}| = ℵo.
    ;
    Mal davon abgesehen, dass niemand weiß, was Deine
    "visible/choosable n" sein sollen (im Gegensatz zu den anderen
    natürlichen Zahlen), gilt:
    ;
    Es bedeutet, dass man alle Zahlen von 1 bis n angeben kann.
    Auf diese endlich vielen folgen noch unendlich viele, von denen man
    unendlich viele nicht angeben kann.

    Aus dem nämlichen Grund hat man sog. Variablen eingeführt

    Ja, natürlich. n ist gerade so eine. Damit kann man beweisen, dass fast
    alle natürlichen Zahlen nicht visible sind. Nur endlich viele sind
    visible, unendlich viele sind es nicht.

    Diese erlauben uns auch Aussage über alle Element einer sehr großen
    endlichen oder unendlichen Menge zu tätigen.

    Auf diese Weise beweist man: Fast alle natürlichen Zahlen sind dunkel.

    Na, dann Beweis mal schön (!) und sage uns dann, welche Sätze der Zahlentheorie oder Analysis jetzt Aufgrund dieser Einsichten nun
    umgeschrieben werden müss(t)en.

    Also BISLANG ist die Mathematik offenbar ganz gut ohne Deine visible, nicht-visible/dunklen Zahlen ausgekommen, scheint mir zumindest. Kenne
    kein Mathematik-Lehrbuch (textbook) in dem dieser Unsinn thematisiert
    würde. Also so, dass sie Teil einer MATHEMATISCHEN THEORIE sind.

    Es wird Zeit, dass Du endlich ein "Einführung in die dunklen Zahlen" schreibst, Mückenheim!

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From joes@21:1/5 to All on Thu Jul 4 16:39:15 2024
    Am Thu, 04 Jul 2024 13:19:35 +0000 schrieb WM:
    Le 03/07/2024 à 23:58, Moebius a écrit :
    Am 03.07.2024 um 22:05 schrieb WM:

    ∀x > 0: NUF(x) = ℵo is true.
    Right, if our domain of discourse is IR (i.e. if x ranges over the
    elements in IR). This means:

    between every x [in IR] and 0 there [...] lie ℵo unit fractions and ℵo >>> finite distances between them.
    Exactly!
    Why do you adhere to the silly idea that every x > 0 is larger than ℵo finite distances?
    Note that you are wrong. Not every x > 0 is larger than ℵo finite distances.
    That depends on the size of those distances.

    Hinweis: Für jedes x e IR mit x > 0 gibt es (abzählbar) unendlich viele
    Stammbrüche s, so dass s < x ist.
    Only for x larger than ℵo finite distances.
    Which ones aren’t?

    --
    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 Jim Burns@21:1/5 to All on Thu Jul 4 14:52:21 2024
    On 7/4/2024 9:49 AM, WM wrote:
    Le 04/07/2024 à 05:20, Jim Burns a écrit :
    On 7/3/2024 4:00 PM, WM wrote:

    Always almost all digits are dark.

    All.nonempty.digit.setsⁿᵒᵗᐧᵂᴹ hold a first member.
    All.digitsⁿᵒᵗᐧᵂᴹ have a first.after.digit

    Most are unknown.

    Stop misquoting.

    All.nonempty.digit.setsⁿᵒᵗᐧᵂᴹ hold a first member.
    All.digitsⁿᵒᵗᐧᵂᴹ have a first.after.digit and a last.before.digit,
    except the first.digit, which has only a first.after.digit.

    Most are unknown.

    Any unknownᵂᴹ digits have nonempty.digit.sets with first members
    and first.after.digits and last.before.digits.

    But it is impossible to
    construct or define or find or recognize or communicate
    a non-terminating decimal without using a finite formula,
    and be it as simple as "0.111...".

    Answer the questions
    "What is a non.terminating.decimalⁿᵒᵗᐧᵂᴹ?"  and
    "What is a line.pointⁿᵒᵗᐧᵂᴹ?"
    and one can prove from very reasonable assumptions
    that non.terminating.decimalsⁿᵒᵗᐧᵂᴹ _exist_
    and line.pointsⁿᵒᵗᐧᵂᴹ _exist_
    and
    a non.terminating.decimalⁿᵒᵗᐧᵂᴹ determines
    no less than one real number (line.pointⁿᵒᵗᐧᵂᴹ) and
    no more than one real number (line.pointⁿᵒᵗᐧᵂᴹ).

    Yes, the line point is the limit of an infinite sequence.
    Example: 0.999... --> 1.
    But the sequence cannot be given other than
    by its defining formula like "0.999...".

    Givingᵂᴹ the sequence isn't needed in order for us
    to know there is only one line.point.

    10 = {0,1,2,3,4,5,6,7,8,9}

    Each nonempty.subset of ℕ₁ holds a first.in.subset
    For each in ℕ₁, first.after and last.before are in ℕ₁
    except 1 first.in.ℕ₁ with only first.after in ℕ₁

    N₁×10 is the set of all pairs ⟨n,d⟩: n ∈ ℕ₁, d ∈ 10

    𝒫(N₁×10) is the set of all subsets of N₁×10
    All the non.terminating.decimalsⁿᵒᵗᐧᵂᴹ exist in 𝒫(N₁×10)
    But not only they are in 𝒫(N₁×10)

    We describe what we mean by 'non.terminating.decimal'
    and that determines the set of
    all and only non.terminating.decimals.

    Define
    y:N₁→10 "y is a non.terminating.decimal" ⇔
    y ∈ 𝒫(N₁×10) ∧
    ∀n ∈ ℕ₁:
    ∃d ∈ 10: ⟨n,d⟩ ∈ y ∧ ¬∃d₂≠d: ⟨n,d₂⟩ ∈ y

    For simplicity,
    I exclude trailing 0s

    y ∃0… "non.terminating decimal y has trailing 0s" ⇔
    y:N₁→10 ∧
    ∃j∈ℕ₁: ∀k>j: y(k)=0

    {y: N₁→10: ¬∃0…} is the set of
    all and only non.terminating.decimals not.trailing.0s

    For each line.point in (0,1] there is
    exactly one non.terminating.decimal in {y:N₁→10:¬∃0…}

    For each non.terminating.decimal in {y:N₁→10:¬∃0…}
    there is exactly one line.point in (0,1]

    The proof of those claims follows from
    the description of {y:N₁→10:¬∃0…} as the set of
    all and only non.terminating.decimals not.trailing.0s

    The proof does not apply _and isn't intended to apply_
    to things which aren't
    non.terminating.decimals not.trailing.0s
    but, where it applies,
    it is complete, no exception exists.

    because it cannot be handled with enough precision.

    Then it _exists_ and is unable to be
      handled.with.enough.precisionᵂᴹ.

    It is handled by a formula,
    sometimes even with absolute precision like
    0.999... --> 1.

    Consider the _terminating_ decimals {q: N₁→10: ∃0…}
    (terminate == ignore trailing 0s)

    for each _non.terminating_ decimal x ∈ {y:N₁→10:¬∃0…}
    there is a split Fₓ Hₓ of
    the _terminating_ decimals {q:N₁→10:∃0…}

    for each pair ⟨x₋,x₊⟩ ∈ Fₓ×Hₓ of
    terminating fore.decimals and hind.decimals
    there is a pair ⟨x′₋,x′₊⟩ ∈ Fₓ×Hₓ of
    terminating fore.decimals and hind.decimals which
    is apart ⅒ the distance ⟨x₋,x₊⟩ is apart.
    x′₊-x₋, = ⅒⋅(x₊-x₋)

    The greatest.lower.bound βₓ of
    terminating.pair.distances is not positive.

    | Assume βₓ > 0
    | 10⋅βₓ > βₓ > ⅒⋅βₓ > 0
    |
    | ⅒⋅βₓ is a lower.bound
    |
    | 10⋅βₓ isn't a lower.bound
    | There is a terminating.pair closer than 10⋅βₓ
    | There is a terminating.pair closer than ⅒⋅10⋅βₓ
    | There is a terminating.pair closer than ⅒⋅⅒⋅10⋅βₓ
    | ⅒⋅βₓ isn't a lower.bound
    | Contradiction.

    Therefore,
    the greatest.lower.bound βₓ of
    terminating.pair.distances is not positive.


    For each non.terminating x ∈ {y:N₁→10:¬∃0…}
    there aren't two or more line.points between
    the terminating.split Fₓ Hₓ determined by x
    Otherwise,
    the greatest lower.bound βₓ of x₊-x₋ would be positive,
    which is contradictory.

    It is handled by a formula,
    sometimes even with absolute precision like
    0.999... --> 1.

    For each non.terminating.decimal in {y:N₁→10:¬∃0…}
    there is no more than one line.point in (0,1]

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Peter Fairbrother@21:1/5 to FromTheRafters on Thu Jul 4 19:15:54 2024
    On 04/07/2024 17:58, FromTheRafters wrote:
    Peter Fairbrother formulated on Thursday :
    On 25/06/2024 21:18, WM wrote:
    Let the infinite sequence 0.999... be multiplied by 10. Does the
    number of nines grow?
    Corollary-question: Does the number of nines grow when in 0.999 the
    decimal point is shifted by one or more position?

    Regards, WM

    A more interesting question; suppose a set containing an infinite
    number of 9's. Now copy that set and add a 2.

    Is the second set bigger than the first set?

    Peter Fairbrother

    Lrf, pneqvanyvgl bar naq pneqvanyvgl gjb.

    But if the 9's are distinguishable (and why not) the cardinality (note, cardinality does not equal bigness) of both sets is infinite.

    Peter Fairbrother

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Thu Jul 4 22:30:57 2024
    Am 04.07.2024 um 22:23 schrieb Chris M. Thomasson:

    I was just thinking that infinite is infinite,

    No, it isn't.

    there is an infinite number of natural numbers,

    Right, _countably_ infinitely many.

    there are an infinite amount of [real] numbers between say, .0000001 and .00000001

    _Uncountably_ infinitely many.

    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 Jim Burns@21:1/5 to Chris M. Thomasson on Fri Jul 5 00:35:03 2024
    On 7/4/2024 4:23 PM, Chris M. Thomasson wrote:
    On 7/4/2024 1:01 PM, FromTheRafters wrote:

    Providing one infinite set and the other
    are both countable or both uncountable.
    If one set is size Aleph_zero
    and the other is 2^Aleph_zero
    then they are not the same size.

    I was just thinking that infinite is infinite,

    Finite is finite, but
    infinite is merely not.that.other.thing,
    in whatever way it happens to be not.that.

    | Happy families are all alike;
    | each unhappy family is unhappy in its own way.
    |
    -- Leo Tolstoy, _Anna Karenina_

    Being a thing and not.being that thing
    are not symmetric, generally speaking.

    More formally,
    each set is smaller than its powerset.
    Finite or infinite, it's smaller.

    ℕ is a smaller infinite than 𝒫(ℕ)
    𝒫(ℕ) is a smaller infinite than 𝒫(𝒫(ℕ))

    Proof:
    There is no way to match
    the elements of S to all the subsets of S

    Suppose F: S → 𝒫(S) matches
    elements of S to subsets of S
    Not all the subsets are matched with an element.
    In particular, it's a contradiction to claim that
    {y ∈ S: y ∉ F(y)} ⊆ S is matched to any element.

    There is no way to match
    the elements of S to all the subset of S
    S is smaller than 𝒫(S)
    If S is infinite,
    then S is a smaller infinite than 𝒫(S)

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Fri Jul 5 07:44:40 2024
    Le 04/07/2024 à 18:39, joes a écrit :
    Am Thu, 04 Jul 2024 13:19:35 +0000 schrieb WM:
    Not every x > 0 is larger than ℵo finite
    distances.
    That depends on the size of those distances.

    Wrong, and easily proved wrong: NUF(x), the number of unit fractions
    between 0 and x increases from 0 to more. It cannot grow by more than 1 at
    any real point x because at any x only one unit fraction can exist.

    Hinweis: Für jedes x e IR mit x > 0 gibt es (abzählbar) unendlich viele >>> Stammbrüche s, so dass s < x ist.
    Only for x larger than ℵo finite distances.
    Which ones aren’t?

    Any x within the first distance. Note that without a first distance ℵo distances cannot exist.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Fri Jul 5 07:39:53 2024
    Le 04/07/2024 à 17:25, Moebius a écrit :
    Am 04.07.2024 um 17:16 schrieb WM:

    die Verteilung der ersten Stammbrüche

    es gibt keine "ersten Stammbrüche". Zu _jedem_ Stammbruch
    gibt es (abzählbar) unendlich viele kleinere Stammbrüche.

    Wrong, and easily proved wrong: NUF(x), the number of unit fractions
    between 0 and x increases from 0 to more. It cannot grow by more than 1 at
    any real point x because at any x only one unit fraction can exist.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Fri Jul 5 07:59:59 2024
    Le 04/07/2024 à 22:30, Moebius a écrit :
    Am 04.07.2024 um 22:23 schrieb Chris M. Thomasson:

    there are an infinite amount of [real] numbers between say, .0000001 and
    .00000001

    _Uncountably_ infinitely many.

    Wrong. That would require complete infinite sequences which cannot be
    given because the not given part is always larger, namely infinite. And
    only finite formulas defining real numbers are not enough to establish an uncountable set.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Fri Jul 5 07:53:55 2024
    Le 04/07/2024 à 20:52, Jim Burns a écrit :
    On 7/4/2024 9:49 AM, WM wrote:

    Yes, the line point is the limit of an infinite sequence.
    Example: 0.999... --> 1.
    But the sequence cannot be given other than
    by its defining formula like "0.999...".

    Givingᵂᴹ the sequence isn't needed in order for us
    to know there is only one line.point.

    Who doubted that? But uncountability could only be established by
    completed infinite sequences, not by finite formulas.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Peter Fairbrother@21:1/5 to FromTheRafters on Fri Jul 5 09:07:32 2024
    On 04/07/2024 21:01, FromTheRafters wrote:
    Chris M. Thomasson laid this down on his screen :
    On 7/4/2024 9:58 AM, FromTheRafters wrote:
    Peter Fairbrother formulated on Thursday :
    On 25/06/2024 21:18, WM wrote:
    Let the infinite sequence 0.999... be multiplied by 10. Does the
    number of nines grow?
    Corollary-question: Does the number of nines grow when in 0.999 the
    decimal point is shifted by one or more position?

    Regards, WM

    A more interesting question; suppose a set containing an infinite
    number of 9's. Now copy that set and add a 2.

    Is the second set bigger than the first set?

    Peter Fairbrother

    Lrf, pneqvanyvgl bar naq pneqvanyvgl gjb.

    Different set with an infinite number of elements. Their sizes are the
    same for infinity = infinity... :^)

    Providing one infinite set and the other are both countable or both uncountable. If one set is size Aleph_zero and the other is 2^Aleph_zero
    then they are not the same size.

    I imagined the 9's as being the last digits of 0.99... so
    distinguishable and countably infinite.

    But the second set is also countable.


    So the sets have the same cardinality, (?and the same size?), but the
    element 2 is in one set but not in the other, and no other element is in
    one set but not the other.

    Peter Fairbrother

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From joes@21:1/5 to All on Fri Jul 5 09:47:34 2024
    Am Fri, 05 Jul 2024 07:44:40 +0000 schrieb WM:
    Le 04/07/2024 à 18:39, joes a écrit :
    Am Thu, 04 Jul 2024 13:19:35 +0000 schrieb WM:
    Not every x > 0 is larger than ℵo finite distances.
    That depends on the size of those distances.
    Wrong, and easily proved wrong: NUF(x), the number of unit fractions
    between 0 and x increases from 0 to more. It cannot grow by more than 1
    at any real point x because at any x only one unit fraction can exist.
    It is infinite for every x>0 and zero at 0. There is no first point.
    Same as the sign function. Where does that one jump?

    Hinweis: Für jedes x e IR mit x > 0 gibt es (abzählbar) unendlich
    viele Stammbrüche s, so dass s < x ist.
    Only for x larger than ℵo finite distances.
    Which ones aren’t?
    Any x within the first distance.
    Which is?

    Note that without a first distance ℵo distances cannot exist.
    Why not? You’re counting from the wrong end.

    --
    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 Peter Fairbrother@21:1/5 to FromTheRafters on Fri Jul 5 11:42:33 2024
    On 05/07/2024 10:59, FromTheRafters wrote:
    After serious thinking Peter Fairbrother wrote :
    On 04/07/2024 21:01, FromTheRafters wrote:
    Chris M. Thomasson laid this down on his screen :
    [..]
    Providing one infinite set and the other are both countable or both
    uncountable. If one set is size Aleph_zero and the other is
    2^Aleph_zero then they are not the same size.

    I imagined the 9's as being the digits of 0.99... so
    distinguishable and countably infinite.

    There is nothing wrong with a sequence having duplicate members. Sets
    (ZFC) don't have duplicates though.

    Oh dear. Let's forget about the nines (which are not duplicates, the nth
    9 is different from the (n+1)th 9).

    One set is all the natural numbers, the second is that plus an orange.
    OK? Both countable infinities, no duplicates.

    [...]

    A difference between the idea of 'same' and 'equal size'. 'Same' if each
    can be a subset/superset of the other (matching elements) and 'equal
    size' in terms of cardinality (pairing elements).

    Maybe. but I'm not concerned about "same" here. only size. And the
    elements are pairable (if an orange can be paired to a number), but one
    set has an orange in it and the other doesn't.


    So, pairing (and cardinality) don't really work for sizing these sets;
    in everyday terms, the second is bigger.

    Certainly heavier.:)

    Peter Fairbrother

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Fri Jul 5 15:34:19 2024
    Am 05.07.2024 um 06:44 schrieb Chris M. Thomasson:

    Does saying that the reals are infinitely denser than the naturals make
    any sense?

    Hmmm... Not sure about that, would't say it that way.

    After all, aren't the rational numbers (in their usual order)
    "infinitely denser than the naturals" too? I'd say, yes!

    But the rational numbers are countable, just like the natural numbers,
    while the real numbers are not.

    As in there are more reals than naturals even if they both
    are infinite.

    Yeah, here are (in a certain sense) "more reals than naturals", but not
    "more rationals than naturals". :-P

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Fri Jul 5 15:26:08 2024
    Am 05.07.2024 um 06:40 schrieb Chris M. Thomasson:
    On 7/4/2024 1:30 PM, Moebius wrote:
    Am 04.07.2024 um 22:23 schrieb Chris M. Thomasson:

    I was just thinking that infinite is infinite,

    No, it isn't.

    For some reason I like to think of the density of infinity. The Natural numbers are not dense at all when compared to the reals...

    Yeah, but this idea might be rather missleading!

    Hint: The natural numbers are not dense at all when compared to the
    rational numbers either, no?


    But both sets, the set of natural numbers and the set of rational
    numbers are _countably infinite_, while the set of real numbers is
    _uncountably infinite_

    there is an infinite number of natural numbers,

    Right, _countably_ infinitely many.

    there are an infinite amount of [real] numbers between say, .0000001
    and .00000001

    _Uncountably_ infinitely many.

    Okay. I get a little confused by that sometimes. Trying to count the
    reals is not possible because of all those infinite infinities that are embedded in them...

    Yeah, a very good metaphor!

    However The naturals have no infinities between say,
    1 and 2. Make any sense to you?

    Yeah, somehow.

    Still, the rational numbers are countable! (Not enough "infinite
    infinities embedded in them"!)

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Fri Jul 5 15:54:19 2024
    Am 05.07.2024 um 09:39 schrieb WM:
    Le 04/07/2024 à 17:25, Moebius a écrit :
    Am 04.07.2024 um 17:16 schrieb WM:

    die Verteilung der ersten Stammbrüche

    es gibt keine "ersten Stammbrüche". Zu _jedem_ Stammbruch gibt es
    (abzählbar) unendlich viele kleinere Stammbrüche.

    Wrong,

    Nope. Und jetzt halt die Fresse, Du Depp!

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Fri Jul 5 15:52:50 2024
    Am 05.07.2024 um 06:44 schrieb Chris M. Thomasson:

    Does saying that the reals are infinitely denser than the naturals
    make any sense?

    Hmmm... Not sure about that, wouldn't say it that way.

    After all, aren't the rational numbers (in their usual order)
    "infinitely denser than the naturals" too? I'd say, yes!

    But the rational numbers are countable, just like the natural numbers,
    while the real numbers are not.

    As in there are more reals than naturals even if they both are infinite.

    Yeah, there are (in a certain sense) "more reals than naturals", but not
    "more rationals than naturals". 😛

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Fri Jul 5 15:56:44 2024
    Am 05.07.2024 um 09:59 schrieb WM:
    Le 04/07/2024 à 22:30, Moebius a écrit :
    Am 04.07.2024 um 22:23 schrieb Chris M. Thomasson:

    there are an infinite amount of real numbers between say, .0000001
    and .00000001

    _Uncountably_ infinitely many.

    Wrong
    Nope. Und jetzt halt endlich mal die Fresse, Du Depp!

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Peter Fairbrother@21:1/5 to FromTheRafters on Fri Jul 5 15:59:32 2024
    On 05/07/2024 15:33, FromTheRafters wrote:
    Peter Fairbrother was thinking very hard :
    On 05/07/2024 10:59, FromTheRafters wrote:
    After serious thinking Peter Fairbrother wrote :
    On 04/07/2024 21:01, FromTheRafters wrote:
    Chris M. Thomasson laid this down on his screen :
    [..]
    Providing one infinite set and the other are both countable or both
    uncountable. If one set is size Aleph_zero and the other is
    2^Aleph_zero then they are not the same size.

    I imagined the 9's as being the digits of 0.99... so distinguishable
    and countably infinite.

    There is nothing wrong with a sequence having duplicate members. Sets
    (ZFC) don't have duplicates though.

    Oh dear. Let's forget about the nines (which are not duplicates, the
    nth 9 is different from the (n+1)th 9).

    One set is all the natural numbers, the second is that plus an orange.
    OK? Both countable infinities, no duplicates.

    Yes, this is exactly the infinite cardinal arithmetic WM doesn't grasp.
    Or rather, say, he objects to its validity.

    [...]

    A difference between the idea of 'same' and 'equal size'. 'Same' if
    each can be a subset/superset of the other (matching elements) and
    'equal size' in terms of cardinality (pairing elements).

    Maybe. but I'm not concerned about "same" here. only size.

    In that case you need not have any concern about what the elements are,
    only cardinality.

    And the elements are pairable (if an orange can be paired to a
    number), but one set has an orange in it and the other doesn't.

    That doesn't matter, it's another element even if it's a fish.

    So, pairing (and cardinality) don't really work for sizing these sets;
    in everyday terms, the second is bigger.

    Pairing does work,

    Eh? I don't follow that. AFAICT every element in one set can be paired
    with an element of the other, so if that is a definition of being the
    same size, they are the same size.

    But one set contains an orange more than the other one does, so afaict
    pairing doesn't work here.


    Peter Fairbrother

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Fri Jul 5 18:03:00 2024
    Am 05.07.2024 um 16:59 schrieb Peter Fairbrother:
    On 05/07/2024 15:33, FromTheRafters wrote:
    Peter Fairbrother was thinking very hard :

    One set is all the natural numbers, the second is that plus an
    orange. OK? Both countable infinities, no duplicates.

    Yes, this is exactly the infinite cardinal arithmetic WM doesn't
    grasp. Or rather, say, he objects to its validity.

    So, pairing (and cardinality) don't really work for sizing these
    sets;

    Sure it does.

    in everyday terms, the second is bigger.

    If you say so. But we are dealing with math terms here (you know).

    Pairing does work,

    Right.

    Eh? I don't follow that. AFAICT every element in one set can be paired
    with an element of the other, so if that is a definition of being the
    same size, they are the same size.

    Right.

    But one set contains an orange more than the other one does,*)

    Right. But how does this orange contribute to the "size" of the (whole)
    set in "set theoretic terms" (i.e. power/cardinality).

    It does not "count" (sic!). (lol)

    The set {orange, 0, 1, 2, 3, ...} is /countably infinite/, just like {0,
    1 2, 3, ...}.

    Proof: There's a bijektion between {orange, 0, 1, 2, 3, ...} and {0, 1
    2, 3, ...}, say, 0|-> orange, 1 |-> 0, 2 |-> 1, etc.

    This means: |{orange, 0, 1, 2, 3, ...}| = |{0, 1, 2, 3, ...}| or
    card({orange, 0, 1, 2, 3, ...}) = card({0, 1, 2, 3, ...}).

    Sure: {0, 1, 2, 3, ...} c {orange, 0, 1, 2, 3, ...}. But this does not
    imply that {orange, 0, 1, 2, 3, ...} is "larger" from a set-theoretic
    point of view.

    Maybe helpful:

    You might think that {orange, 1, 2, 3, ...} is "larger" than, say, {1,
    2, 3, ...}, right?

    On the other hand, you might agree that {orange, 1, 2, 3, ...} has "the
    same size" as, say, {{orange}, {1}, {2}, {3}, ...}, right?

    But what if I tell you (now) that in our special context we had defined
    1 = {orange}, 2 = {1}, 3 = {2}, etc.

    Then actually, {{orange}, {1}, {2}, {3}, ...} = {1, 2, 3, 4, ...}.

    So {orange, 1, 2, 3, ...} would have the same size as {{orange}, {1},
    {2}, {3}, ...}, but on the other hand it would be larger... :-P

    _________________________________

    *) "But one set contains an orange more than the other one does." Right, {orange, 0, 1, 2, 3, ...} contains 1 orange, and {0, 1, 2, 3, ...}
    contains 0 oranges. Hence {orange, 0, 1, 2, 3, ...} contains exactly 1
    orange more than {0, 1, 2, 3, ...}. (Note that we are talking about
    finitely many oranges here.)

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Jim Burns@21:1/5 to All on Fri Jul 5 13:09:09 2024
    On 7/5/2024 3:53 AM, WM wrote:
    Le 04/07/2024 à 20:52, Jim Burns a écrit :
    On 7/4/2024 9:49 AM, WM wrote:

    Yes, the line point is the limit of an infinite sequence.
    Example: 0.999... --> 1.
    But the sequence cannot be given other than
    by its defining formula like  "0.999...".

    Givingᵂᴹ the sequence isn't needed in order for us
    to know there is only one line.point.

    Who doubted that?

    But it is impossible to
    construct or define or find or recognize or communicate
    a non-terminating decimal without using a finite formula,
    and be it as simple as "0.111...".

    Yes, the line point is the limit of an infinite sequence.
    Example: 0.999... --> 1.
    But the sequence cannot be given
    other than by its defining formula like "0.999...".

    It is not impossible to construct every desired digit
    of the sequence.
    But it is impossible to do so without a finite formula.
    And it is impossible to desire all digits.
    ℵo are always missing.

    But uncountability could only be established by
    completed infinite sequences, not by finite formulas.

    The provably.uncountable set of all and only
    non.terminating decimals is a subset of 𝒫(N₁×10)

    10 = {0,1,2,3,4,5,6,7,8,9}
    ℕ₁ = {1,2,3,...}
    ℕ₂ = {2,3,4,...} = ℕ₁\{1}
    ℕ₁ is well.ordered
    Each in ℕ₁ has its first.after in ℕ₂ and
    each in ℕ₂ has its last.before in ℕ₁
    ⎛ ∀S ⊆ ℕ₁: S={} ∨ ∃j ∈ S: j ≤ᴬ S
    ⎝ ∀j ∈ ℕ₁: j⁺¹ ∈ ℕ₂ ∧ ∀k ∈ ℕ₂: k⁻¹ ∈ ℕ₁

    𝒫(N₁×10) is the set of all sets of
    ⟨decimal.place,decimal⟩ pairs

    A non.terminating.decimal is a set of
    ⟨decimal.place,decimal⟩ pairs
    {⟨1,9⟩} is a set of
    ⟨decimal.place,decimal⟩ pairs, too,
    but it isn't a non.terminating.decimal.

    y is a non.terminating.decimal iff
    if, for each decimal.place,
    y holds one and only one <decimal.place,decimal>

    y:N₁→10 "y is a non.terminating.decimal"

    y ∈ 𝒫(N₁×10) ∧
    ∀n ∈ ℕ₁:
    ∃d ∈ 10: ⟨n,d⟩ ∈ y ∧ ¬∃d₂≠d: ⟨n,d₂⟩ ∈ y

    All and only the non.terminating.decimals are in
    {y:N₁→10}

    {⟨1,9⟩} isn't a non.terminating.decimal and
    it isn't in {y:N₁→10}

    ⎛ But trailing.0s are often assumed, which makes
    ⎜ {⟨1,9⟩} = 0.9 = 0.9000... = '0.9':N₁→10
    ⎜ where
    ⎜ '0.9'{1) = 9
    ⎜ '0.9'(n) = 0 otherwise
    ⎜ and '0.9' ∈ {y:N₁→10}

    ⎜ In this discussion,
    ⎜ trailing.0s bring further complication
    ⎜ without compensating clarity or expressiveness.
    ⎜ For example, also '0.8999...' ∈ {y:N₁→10}

    ⎝ So, here, I'm excluding all trailing.0s decimals.

    y:N₁→10:¬∃0… "y is a non.terminating.decimal not.trailing.0s"

    y:N₁→10 ∧
    ¬∃j ∈ N₁: ∀k>j: y(k)=0

    {y:N₁→10:¬∃0…} ⊆ 𝒫(N₁×10) is the set of
    all and only non.terminating.decimals not.trailing.0s

    But uncountability could only be established by
    completed infinite sequences, not by finite formulas.

    Uncountability has been established for {y:N₁→10:¬∃0…}
    It has been, historically.
    It has been, here, for you (WM).
    It could be established again, for you,
    if you had the slightest interest in being correct,
    as distinct from being uncorrected.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Jim Burns@21:1/5 to Peter Fairbrother on Fri Jul 5 14:08:34 2024
    On 7/5/2024 6:42 AM, Peter Fairbrother wrote:
    On 05/07/2024 10:59, FromTheRafters wrote:

    A difference between the idea of 'same' and 'equal size'.
    'Same' if each can be a subset/superset of the other (matching elements)
    and 'equal size' in terms of cardinality (pairing elements).

    Maybe. but I'm not concerned about "same" here. only size.
    And the elements are pairable (if an orange can be paired to a number),
    but one set has an orange in it and the other doesn't.

    So, pairing (and cardinality) don't really work for sizing these sets;
    in everyday terms, the second is bigger.

    The other way around.
    It's set.inclusion which stops working as a guide to size.

    Some sets (the everyday sets) with an orange inserted
    cannot fit in that set un.oranged.
    These sets have finite cardinals.

    Consider the set ℕ of all and only finite cardinals.
    There is no cardinal ℵ₀ in ℕ which is the cardinal |ℕ|

    ⎛ Assume otherwise.
    ⎜ Assume |ℕ| = ℵ₀ is in ℕ
    ⎜ ℵ₀ is finite.
    ⎜ ℕ⁺ᵒʳᵃⁿᵍᵉ doesn't fit in ℕ
    ⎜ |ℕ⁺ᵒʳᵃⁿᵍᵉ| = |{|α|<ℵ₀⁺¹}|
    ⎜ {|α|<ℵ₀⁺¹} doesn't fit in ℕ

    ⎜ However,
    ⎜ {|α|<ℵ₀⁺¹} ⊆ ℕ the finite cardinals
    ⎜ {|α|<ℵ₀⁺¹} fits in ℕ
    ⎝ Contradiction.

    Therefore,
    there is no cardinal ℵ₀ in ℕ which is the cardinal |ℕ|
    and
    ℕ⁺ᵒʳᵃⁿᵍᵉ is not bigger than its proper subset ℕ

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Fri Jul 5 19:44:16 2024
    Am 05.07.2024 um 09:59 schrieb WM:


    That would require complete infinite sequences which cannot be given because the not given part is always larger, namely infinite.

    Hast Du nur noch Matsch im Kopf, Mückenheim, oder was?

    Die durch d_n = n für alle n e IN definierte Folge (d_n)_(n e IN) ist
    also in der Irrenanstalt in Mückenhauesen keine "vollständige unendliche Folge"? Was genau fehlt ihr denn zur Mückenheim-Vollständigkeit?

    Geh scheißen, Mückenheim!

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Sat Jul 6 03:58:49 2024
    Am 05.07.2024 um 20:08 schrieb Jim Burns:

    The other way around.
    It's set.inclusion which stops working as a guide to size.

    Right. How would we be able to compare, say, the sets {1, 2, 3, ...} and
    {-1, -2, -3, ...} concerning "size" by relying on "set inclusion"? Or,
    say, {1, 2, 3, ...} and {1.5, 2.5, 3.5, ...} etc.

    Or even {1, 2, orange} and {1, 2, 3}.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Sat Jul 6 04:12:22 2024
    Am 06.07.2024 um 03:58 schrieb Moebius:
    Am 05.07.2024 um 20:08 schrieb Jim Burns:

    The other way around.
    It's set.inclusion which stops working as a guide to size.

    Right. How would we be able to compare, say, the sets {1, 2, 3, ...} and
    {-1, -2, -3, ...} concerning "size" by relying on "set inclusion"? Or,
    say, {1, 2, 3, ...} and {1.5, 2.5, 3.5, ...} etc.

    Or even {1, 2, orange} and {1, 2, 3}.

    Or let's compare the size of, say,

    {0, 1, 2, 3, ...} with the size of {(0, x_0), (1, x_1), (2, x_2), (3,
    x_3), ...} (for some x_0, x_1, x_2, x_3...).

    It seems that in this case the size of these two sets should be the
    same, I'd say.

    Now let's compare the size of, say, {1, 2, 3, ...} with the size of
    {(y_1, 1), (y_2, 2), (y_3, 3), ...} (for some y_1, y_2, y_3, ...).

    Again, it seems that in this case the size of these two sets should be
    the same, I'd say.

    So what's the size of the set {(0, 1), (1, 2), (2, 3), (3, 4), ...}?

    The same as the size of {0, 1, 2, 3, ...} and/or the same as the size of
    {1, 2, 3, ...}?

    The "conclusion" seems to be that {0, 1, 2, 3, ...} and {1, 2, 3, ...}
    have the same size, even though {1, 2, 3, ...} c {0, 1, 2, 3, ...}.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Sat Jul 6 04:27:12 2024
    Am 05.07.2024 um 20:08 schrieb Jim Burns:

    The other way around.
    It's set.inclusion which stops working as a guide to size.

    Indeed! Shouldn't have, say, {-1, 1, 2, 3, ...} and {-2, 1, 2, 3, ...}
    the s a m e size?

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Jim Burns@21:1/5 to Ross Finlayson on Sat Jul 6 12:04:31 2024
    On 7/6/2024 1:25 AM, Ross Finlayson wrote:
    On 07/05/2024 07:12 PM, Moebius wrote:

    [...]

    I'm reminded many years ago,
    when studying size relations in sets,
    that one rule that arrived was that
    a proper subset, had a size relation,
    ? smaller than the superset,
    and was told that
    it was not so,
    while, still it was written how
    it was so.

    Then, Fred Katz pointed me to
    his Ph.D. from M.I.T. and OUTPACING,
    showing that it was a formal result that
    it was so.

    So,
    the "conclusion", seems to be, "not a conclusion",
    for all the "considerations",
    their conclusions, together.

    No.
    Each of the conclusions (no scare quotes)
    is a conclusion
    in a different discussion.

    A human body has height, weight, age,
    body.fat.index, and on, and on.
    It is not an error
    that there are these different numbers,
    and that they are different.

    The various human sizes are
    somewhat.predictive of each other, but
    where they aren't predictive, they aren't,
    and I don't know of anyone who thinks
    human sizes being not.always.predictive
    is a mistake of some kind.

    When we discuss the various set sizes,
    a mistake is seen by some people,
    because the set sizes are _too good_
    ⎛ This is my personal theory of
    ⎝ the psychological reasons for these objections.

    For _all these sets_ (the everyday sets)
    inclusion.size predicts matching.size.
    But, look! Over there are sets for which
    inclusion.size doesn't predict matching.size.
    The sets are wrong!
    Inclusion.size is wrong!
    Matching.size is wrong!
    Something must be wrong!

    For some people,
    being predictive for _all these sets_
    but NOT for _these other sets_ (the infinites)
    is just a bridge too far.

    Situations in which,
    for Albert and Betty or for Cathy and Daniel,
    one is taller and the other is heavier
    are not encountered rarely enough
    to be seen as an error of some kind.

    Then another one was asymptotic density and
    the size relation of sets not just being ordered
    but also having a rational value,
    this was the "half of the integers are even".

    It involves a bit of book-keeping, yet,
    it is possible to keep these various notions,
    while still there's cardinality sort of in the middle,
    where of course on the other side of
    these refinements of the notion of
    the relation of size in infinite sets of
    numbers their spaces their elements then
    there's an entire absolute of "ubiquitous ordinals",
    that have the infinite sets as of a "size".

    So, when you mean cardinal, say cardinal.

    A better rule is:
    When you mean "cardinal", be sure
    "cardinal" is understood.
    Which is what we have been doing.

    How is "ubiquitous ordinal" to be understood?

    There are other notions of
    "size", and "measure", and, "number".

    The advantage the word "size" has over
    the word "cardinal" is that
    "size" is an everyday.word, and,
    as such, "size" travels with a cloud of
    intuitions buzzing around it.

    That advantage is a disadvantage
    if our intuitions lead us astray.
    If they do, "cardinal" might serve better.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From joes@21:1/5 to All on Sun Jul 7 10:24:09 2024
    XPost: de.sci.mathematik

    Am Thu, 04 Jul 2024 15:16:23 +0000 schrieb WM:
    Le 04/07/2024 à 17:08, Moebius a écrit :
    Am 04.07.2024 um 16:30 schrieb Moebius:

    Da gibt's auch nicht zu "diskutieren",
    Doch, die Frage, wie Du Dir die Verteilung der ersten Stammbrüche, also derjenigen, die kleiner als jeder, den Du angeben kannst, sind,
    vorstellst, bleibt.
    Du zählst vom falschen Ende. Es gibt keine Stammbrüche, die kleiner als
    alle anderen sind; es gibt aber immer einen kleineren Stammbruch als
    einen vermeintlich kleinsten.

    --
    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 Jim Burns@21:1/5 to All on Sun Jul 7 13:39:01 2024
    On 7/4/2024 11:16 AM, WM wrote:
    Le 04/07/2024 à 17:08, Moebius a écrit :
    Am 04.07.2024 um 16:30 schrieb Moebius:

    Da gibt's auch nicht zu "diskutieren",

    Doch, die Frage, wie Du Dir
    die Verteilung der ersten Stammbrüche,
    also derjenigen, die kleiner als jeder,
    den Du angeben kannst, sind, vorstellst, bleibt.
    (Off limits for native English speakers.)

    ⎛ ∀j ∈ ℕ₁:
    ⎜ ∃u ∈ ⅟ℕ: u = ⅟j ∧
    ⎜ ¬∃v ∈ ⅟ℕ: ⅟j = v ≠ u

    ⎜ ∀u ∈ ⅟ℕ:
    ⎜ ∃j ∈ ℕ₁: j = ⅟u ∧
    ⎜ ¬∃k ∈ ℕ₁: ⅟u = k ≠ j

    ⎜ ∀j,k ∈ ℕ₁:
    ⎜ ∀u,v ∈ ⅟ℕ: u = ⅟j ∧ v = ⅟k ⟹
    ⎝ j < k ⇔ u > v

    ⎛ ∀A ⊆ ℕ₁: A ≠ {} ⟹
    ⎜ ∃j ∈ A: ∀k ∈ A: j ≤ k

    ⎜ ∀B ⊆ ⅟ℕ: B ≠ {} ⟹
    ⎝ ∃v ∈ B ∀u ∈ B: v ≥ u

    ⎛ ∀j ∈ ℕ₁: ℕ₁\{1} ∋ j⁺¹ > j

    ⎝ ∀u ∈ ⅟ℕ: ⅟ℕ\{1} ∋ ⅟(⅟u)⁺¹ < u

    ⎛ ∀k ∈ ℕ₁\{1}: ℕ₁ ∋ k⁻¹ < k

    ⎝ ∀v ∈ ⅟ℕ\{1}: ⅟ℕ ∋ ⅟(⅟v)⁻¹ > v

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Sun Jul 7 20:01:29 2024
    Le 07/07/2024 à 19:39, Jim Burns a écrit :
    On 7/4/2024 11:16 AM, WM wrote:
    Le 04/07/2024 à 17:08, Moebius a écrit :
    Am 04.07.2024 um 16:30 schrieb Moebius:

    Da gibt's auch nicht zu "diskutieren",

    Doch, die Frage, wie Du Dir
    die Verteilung der ersten Stammbrüche,
    also derjenigen, die kleiner als jeder,
    den Du angeben kannst, sind, vorstellst, bleibt.
    (Off limits for native English speakers.)

    ⎛ ∀j ∈ ℕ₁:
    ⎜ ∃u ∈ ⅟ℕ: u = ⅟j ∧
    ⎜ ¬∃v ∈ ⅟ℕ: ⅟j = v ≠ u

    ⎜ ∀u ∈ ⅟ℕ:
    ⎜ ∃j ∈ ℕ₁: j = ⅟u ∧
    ⎜ ¬∃k ∈ ℕ₁: ⅟u = k ≠ j

    ⎜ ∀j,k ∈ ℕ₁:
    ⎜ ∀u,v ∈ ⅟ℕ: u = ⅟j ∧ v = ⅟k ⟹
    ⎝ j < k ⇔ u > v

    ⎛ ∀A ⊆ ℕ₁: A ≠ {} ⟹
    ⎜ ∃j ∈ A: ∀k ∈ A: j ≤ k

    ⎜ ∀B ⊆ ⅟ℕ: B ≠ {} ⟹
    ⎝ ∃v ∈ B ∀u ∈ B: v ≥ u

    ⎛ ∀j ∈ ℕ₁: ℕ₁\{1} ∋ j⁺¹ > j

    ⎝ ∀u ∈ ⅟ℕ: ⅟ℕ\{1} ∋ ⅟(⅟u)⁺¹ < u

    ⎛ ∀k ∈ ℕ₁\{1}: ℕ₁ ∋ k⁻¹ < k

    ⎝ ∀v ∈ ⅟ℕ\{1}: ⅟ℕ ∋ ⅟(⅟v)⁻¹ > v

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Sun Jul 7 20:04:14 2024
    Le 07/07/2024 à 19:39, Jim Burns a écrit :
    On 7/4/2024 11:16 AM, WM wrote:
    Le 04/07/2024 à 17:08, Moebius a écrit :
    Am 04.07.2024 um 16:30 schrieb Moebius:

    Da gibt's auch nicht zu "diskutieren",

    Doch, die Frage, wie Du Dir
    die Verteilung der ersten Stammbrüche,
    also derjenigen, die kleiner als jeder,
    den Du angeben kannst, sind, vorstellst, bleibt.
    (Off limits for native English speakers.)

    ⎛ ∀j ∈ ℕ₁:
    ⎜ ∃u ∈ ⅟ℕ: u = ⅟j ∧
    ⎜ ¬∃v ∈ ⅟ℕ: ⅟j = v ≠ u

    The question is only this: Are there more than one unit fractions in the
    point where NUF(x) changes from 0 to more, or is there only one unit
    fraction?

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Sun Jul 7 20:06:23 2024
    Le 07/07/2024 à 12:24, joes a écrit :
    Am Thu, 04 Jul 2024 15:16:23 +0000 schrieb WM:
    Le 04/07/2024 à 17:08, Moebius a écrit :
    Am 04.07.2024 um 16:30 schrieb Moebius:

    Da gibt's auch nicht zu "diskutieren",
    Doch, die Frage, wie Du Dir die Verteilung der ersten Stammbrüche, also
    derjenigen, die kleiner als jeder, den Du angeben kannst, sind,
    vorstellst, bleibt.
    Du zählst vom falschen Ende.

    Wer will es verbieten?

    Es gibt keine Stammbrüche, die kleiner als
    alle anderen sind;

    Behauptung ohne Beweis.

    The question is only this: Are there more than one unit fractions in the
    point where NUF(x) changes from 0 to more, or is there only one unit
    fraction?

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Sun Jul 7 20:19:37 2024
    Le 05/07/2024 à 19:09, Jim Burns a écrit :
    On 7/5/2024 3:53 AM, WM wrote:

    But uncountability could only be established by
    completed infinite sequences, not by finite formulas.

    Uncountability has been established for {y:N₁→10:¬∃0…}
    It has been, historically.
    It has been, here, for you (WM).
    It could be established again, for you,

    It is impossible to completely write an infinite digit sequence.
    An infinite digit sequence cannot be determined by writing all its terms.
    An infinite digit sequence can only be determined by a finite expression.
    There are only countably many finite expression.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Sun Jul 7 20:24:46 2024
    Le 05/07/2024 à 15:54, Moebius a écrit :
    Am 05.07.2024 um 09:39 schrieb WM:
    Le 04/07/2024 à 17:25, Moebius a écrit :
    Am 04.07.2024 um 17:16 schrieb WM:

    die Verteilung der ersten Stammbrüche

    es gibt keine "ersten Stammbrüche". Zu _jedem_ Stammbruch gibt es
    (abzählbar) unendlich viele kleinere Stammbrüche.

    Wrong,

    Nope.

    In sufficient argument.
    There are only two alternatives: NUF changes from 0 to more in steps of 1
    at every step, or in larger steps. Claiming the latter shows insufficient mathematical knowledge.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Sun Jul 7 20:27:14 2024
    Le 07/07/2024 à 22:25, "Chris M. Thomasson" a écrit :
    On 7/7/2024 1:19 PM, WM wrote:
    Le 05/07/2024 à 19:09, Jim Burns a écrit :
    On 7/5/2024 3:53 AM, WM wrote:

    But uncountability could only be established by completed infinite
    sequences, not by finite formulas.

    Uncountability has been established for {y:N₁→10:¬∃0…}
    It has been, historically.
    It has been, here, for you (WM).
    It could be established again, for you,

    It is impossible to completely write an infinite digit sequence.
    An infinite digit sequence cannot be determined by writing all its terms.
    An infinite digit sequence can only be determined by a finite expression.
    There are only countably many finite expression.

    What generated this?

    .(121232)

    ?

    The finite formula ".(121232)" generated this.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Mon Jul 8 01:28:10 2024
    Am 07.07.2024 um 22:19 schrieb Chris M. Thomasson:
    On 7/5/2024 6:26 AM, Moebius wrote:

    Still, the rational numbers are countable! (Not enough "infinite
    infinities embedded in them"!)

    [...] How many embedded infinite infinities are
    "needed" _before_ it can be deemed uncountable?

    As much as are needed?

    Say between 0 and 1.

    Well, the rationals won't do the job, but the reals can.

    There seems to be an infinite number of rationals that can fill in the
    "gap", so to speak.

    Sure, but not enough, though.

    0 + (1/8 + 1/8 + 1/4 + 1/2) = 1
    0 + (1/16 + 1/16 + 1/8 + 1/4 + 1/2) = 1
    0 + (1/16 + 1/16 + 1/8 + 2/3 + 1/3 - 1/4) = 1

    These are all rational, right?

    Sure.

    One of my professors once tried to express this state of affairs the
    following way: "There are (in a certain sense) much more real numbers
    than rational numbers."

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Mon Jul 8 01:22:10 2024
    Am 07.07.2024 um 22:01 schrieb Chris M. Thomasson:

    :^) Are the complex numbers more "dense" than the reals?

    Well, define /dense/ in this context. Then we'll see.

    Actually, I'd say no (without definition).

    They are just more "complexe". (ha ha)

    For every real we can use it wrt a non-zero y-axis, or imaginary axis if
    you will. Fair enough?

    Sure.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Jim Burns@21:1/5 to All on Sun Jul 7 19:57:45 2024
    On 7/7/2024 4:04 PM, WM wrote:
    Le 07/07/2024 à 19:39, Jim Burns a écrit :
    On 7/4/2024 11:16 AM, WM wrote:
    Le 04/07/2024 à 17:08, Moebius a écrit :
    Am 04.07.2024 um 16:30 schrieb Moebius:

    Da gibt's auch nicht zu "diskutieren",

    Doch, die Frage, wie Du Dir
    die Verteilung der ersten Stammbrüche,
    also derjenigen, die kleiner als jeder,
    den Du angeben kannst, sind, vorstellst, bleibt.
    (Off limits for native English speakers.)

    ⎛ ∀j ∈ ℕ₁:
    ⎜ ∃u ∈ ⅟ℕ: u = ⅟j ∧
    ⎜ ¬∃v ∈ ⅟ℕ: ⅟j = v ≠ u


    The question is only this:
    Are there more than one unit fractions in
    the point where NUF(x) changes from 0 to more,
    or is there only one unit fraction?

    The complete distribution of unit fractions,
    both darkᵂᴹ and visibleᵂᴹ
    is
    ⎛ ∀B ⊆ ⅟ℕ: B ≠ {} ⟹
    ⎜ ∃v ∈ B ∀u ∈ B: v ≥ u

    ⎜ ∀u ∈ ⅟ℕ: ⅟ℕ\{1} ∋ ⅟(⅟u)⁺¹ < u

    ⎝ ∀v ∈ ⅟ℕ\{1}: ⅟ℕ ∋ ⅟(⅟v)⁻¹ > v

    The greatest lower bound β of
    {x ∈ ℝ: NUF(x) = ℵ₀}
    isn't positive.
    ⎛ Otherwise,
    ⎜ if β > 0
    ⎜ there is a unit fraction u₂ᵦ < 2⋅β such that
    ⎜ ¼⋅u₂ᵦ < ½⋅β isn't a unit fraction.
    ⎝ And there isn't such a unit fraction u₂ᵦ

    NUF(0) = 0
    NUF(x) changes at 0
    There is no unit fraction at 0

    The question is only this:
    Are there more than one unit fractions in
    the point where NUF(x) changes from 0 to more,
    or is there only one unit fraction?

    The third choice: none.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Mon Jul 8 04:52:17 2024
    Am 08.07.2024 um 04:35 schrieb Moebius:
    Am 07.07.2024 um 22:04 schrieb WM:

    Are there more than one unit fractions in the point where NUF(x)
    changes from 0 to more, or

    Mückenheim, Ihr dummes Gerede tut allein schon beim Lesen weh.

    Grundsätzlich kann sich eine Funktion in einem Punkt nicht ändern, Depp.

    f(x_0) hat (falls x_0 im Definitionsbereich der Funktion f liegt) einen bestimmten Wert und damit hat es sich. Da ändert sich nichts.

    In Bezug auf NUF ist es so, dass NUF(0) = 0 ist und NUF(x) = aleph_0 für alle x e IR, x > 0.

    Es gibt also keinen spezifische Punkt wo NUF "sich von 0 auf aleph_0 ändert", weil es solche Punkte gar nicht gibt.

    Du bist einfach für jede Art von Mathematik zu doof und zu blöde.

    Um Dich nicht dumm sterben zu lassen, hier ein paar Hinweise:

    (1) In der MENGENLEHRE gilt, dass die Menge aller natürlicher Zahlen,
    IN, (abzählbar) unendlich ist und damit auch die Menge aller Kehrwerte natürlicher Zahlen {1/n : n e IN}, also der Ganzzahlbrüche.

    Beweis: Die Funktion f: IN --> {1/n : n e IN}, die durch f(n) = 1/n für
    alle n e IN definiert ist, ist eine Bijektion von IN auf {1/n : n e IN}.

    Es gilt also insbesondere |{1/n : n e IN}| = |IN| = aleph_0.

    (2) Wie man leicht zeigen kann, gilt für jedes x e IR, 0 < x: es gibt
    (nur) endliche viele Stammbrüche, die größer-gleich x sind.

    (3) Daraus folgt trivialerweise für jedes x e IR, 0 < x: es gibt
    (abzählbar) unendlich viele Stammbrüche, die kleiner-gleich x sind.

    (4) Es gilt also IN DER MENGENLEHRE für alle x e IR, x > 0: |{m e {1/n :
    n e IN} : m <= x}| = aleph_0.

    (5) Mit der Definition NUF(x) := |{m e {1/n : n e IN} : m <= x}| folgt
    also für alle x e IR, x > 0: NUF(x) = aleph_0.

    WIE SCHWER KANN ES SEIN, DIESE EINFACHEN ZUSAMMENHÄNGE ZU VERSTEHEN, MÜCKENHEIM?

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Mon Jul 8 04:35:29 2024
    Am 07.07.2024 um 22:04 schrieb WM:

    Are there more than one unit fractions in the
    point where NUF(x) changes from 0 to more, or

    Mückenheim, Ihr dummes Gerede tut allein schon beim Lesen weh.

    Grundsätzlich kann sich eine Funktion in einem Punkt nicht ändern, Depp.

    f(x_0) hat (falls x_0 im Definitionsbereich der Funktion f liegt) einen bestimmten Wert und damit hat es sich. Da ändert sich nichts.

    In Bezug auf NUF ist es so, dass NUF(0) = 0 ist und NUF(x) = aleph_0 für
    alle x e IR, x > 0.

    Es gibt also keinen spezifische Punkt wo NUF "sich von 0 auf aleph_0
    ändert", weil es solche Punkte gar nicht gibt.

    Du bist einfach für jede Art von Mathematik zu doof und zu blöde.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Mon Jul 8 13:49:43 2024
    Le 08/07/2024 à 01:57, Jim Burns a écrit :
    On 7/7/2024 4:04 PM, WM wrote:

    The question is only this:
    Are there more than one unit fractions in
    the point where NUF(x) changes from 0 to more,
    or is there only one unit fraction?

    The complete distribution of unit fractions,

    does not answer this question.

    NUF(0) = 0
    NUF(x) changes at 0
    There is no unit fraction at 0

    Therefore it does not change at 0.

    The question is only this:
    Are there more than one unit fractions in
    the point where NUF(x) changes from 0 to more,
    or is there only one unit fraction?

    The third choice: none.

    Wrong. NUF(x) changes only in points occupied by unit fractions.
    (That is so by definition, like Bob cannot disappear by exchanging X and
    O. You see that your insistence on set theory requires violating
    mathematics and logic.)

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Mon Jul 8 13:39:30 2024
    Le 07/07/2024 à 22:28, "Chris M. Thomasson" a écrit :
    On 7/7/2024 1:27 PM, WM wrote:

    There are only countably many finite expression.

    What generated this?

    .(121232)

    ?

    The finite formula ".(121232)" generated this.

    Did you know that a rational generated it?

    Every periodic decimal number has a rational limit.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Mon Jul 8 14:12:37 2024
    Le 08/07/2024 à 04:52, Moebius a écrit :

    (4) Es gilt also IN DER MENGENLEHRE für alle x e IR, x > 0: |{m e {1/n :
    n e IN} : m <= x}| = aleph_0.

    (5) Mit der Definition NUF(x) := |{m e {1/n : n e IN} : m <= x}| folgt
    also für alle x e IR, x > 0: NUF(x) = aleph_0.

    ℵo unit fractions occupy at least ℵo different points on the positive
    real axis.
    Hence NUF(x) = ℵo cannot be true for x less than ℵo points, that is
    for a set of ℵo positive x.

    Only persons unable to comprehend this can carry on set theory. The
    results will be as stupid as these persons.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Mon Jul 8 13:58:06 2024
    Le 08/07/2024 à 04:35, Moebius a écrit :
    Am 07.07.2024 um 22:04 schrieb WM:

    Grundsätzlich kann sich eine Funktion in einem Punkt nicht ändern

    A function changes from the old value to a new one in the point where the
    new value applies.
    Example: The function f(x) = [x] changes in x = 1 from its former value 0
    to its new value 1.

    In Bezug auf NUF ist es so, dass NUF(0) = 0 ist und NUF(x) = aleph_0 für alle x e IR, x > 0.

    That is nonsense. NUF(x) cannot be ℵo unless x consists of ℵo points. Unfortunately we don't know how great x must be, but we know that it
    cannot be zero.

    Es gibt also keinen spezifische Punkt wo NUF "sich von 0 auf aleph_0 ändert", weil es solche Punkte gar nicht gibt.

    Nice try. But insufficient. See above.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Mon Jul 8 16:35:40 2024
    Am 08.07.2024 um 16:12 schrieb WM:
    Le 08/07/2024 à 04:52, Moebius a écrit :

    (4) Es gilt also IN DER MENGENLEHRE für alle x e IR, x > 0: |{m e {1/n
    : n e IN} : m <= x}| = aleph_0.

    (5) Mit der Definition NUF(x) := |{m e {1/n : n e IN} : m <= x}| folgt
    also für alle x e IR, x > 0: NUF(x) = aleph_0.

    ℵo unit fractions occupy at least ℵo different points on the positive real axis.

    Nicht nur "at least", sondern "genau", Mückenheim.

    Hence NUF(x) = ℵo cannot be true for x less than ℵo points, that is for
    a set of ℵo positive x.

    Huh?! Du redest wirres Zeug, Mann. :-)

    NUF(x) = ℵo ist für alle x e IR, x > 0 wahr. Also für überabzählbar
    viele Punkte.

    Wir brauchen NUF aber gar nicht auf der Definitionsmenge IR zu
    definieren; auch Q ginge als Definitionsmenge:

    NUF(x) := |{m e {1/n : n e IN} : m <= x}| (x e Q).

    Auch in diesem Fall gilt: NUF(0) = 0 und für alle x e IR, x > 0: NUF(x)
    = aleph_0.

    Das ist alles ziemlich trivial.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Mon Jul 8 16:22:17 2024
    Am 08.07.2024 um 15:58 schrieb WM:
    Le 08/07/2024 à 04:35, Moebius a écrit :
    In Bezug auf NUF ist es so, dass NUF(0) = 0 ist und NUF(x) = aleph_0
    für alle x e IR, x > 0.

    That is

    korrekt.

    Nochmal:

    Es gibt also keinen spezifische Punkt, wo NUF "sich von 0 auf aleph_0
    ändert", weil es solche Punkte gar nicht gibt.

    Allerdings gilt NUF(0) = 0 ist und NUF(x) = aleph_0 für alle x e IR, x > 0.

    Hier ein paar Hinweise dazu:

    (1) In der MENGENLEHRE gilt, dass die Menge aller natürlichen Zahlen,
    IN, (abzählbar) unendlich ist und damit auch die Menge aller Kehrwerte
    dieser Zahlen {1/n : n e IN}, also der Ganzzahlbrüche.

    Beweis: Die Funktion f: IN --> {1/n : n e IN}, die durch f(n) = 1/n für
    alle n e IN definiert ist, ist eine Bijektion von IN auf {1/n : n e IN}.

    Es gilt also insbesondere |{1/n : n e IN}| = |IN| = aleph_0.

    (2) Wie man leicht zeigen kann, gilt für jedes x e IR, x > 0: es gibt
    (nur) endliche viele Stammbrüche, die größer-gleich x sind.

    (3) Daraus folgt trivialerweise für jedes x e IR, x > 0: es gibt
    (abzählbar) unendlich viele Stammbrüche, die kleiner-gleich x sind.

    (4) Es gilt also IN DER MENGENLEHRE für alle x e IR, x > 0: |{m e {1/n :
    n e IN} : m <= x}| = aleph_0.

    (5) Mit der Definition NUF(x) := |{m e {1/n : n e IN} : m <= x}| folgt
    also für alle x e IR, x > 0: NUF(x) = aleph_0.

    WIE SCHWER KANN ES SEIN, DIESE EINFACHEN ZUSAMMENHÄNGE ZU VERSTEHEN, MÜCKENHEIM?

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From joes@21:1/5 to All on Mon Jul 8 14:49:23 2024
    XPost: de.sci.mathematik

    Am Mon, 08 Jul 2024 13:58:06 +0000 schrieb WM:
    Le 08/07/2024 à 04:35, Moebius a écrit :
    Am 07.07.2024 um 22:04 schrieb WM:

    In Bezug auf NUF ist es so, dass NUF(0) = 0 ist und NUF(x) = aleph_0
    für alle x e IR, x > 0.
    That is nonsense. NUF(x) cannot be ℵo unless x consists of ℵo points.
    WTF does that even mean. Since when is this a question about measure?

    --
    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 Mon Jul 8 17:32:38 2024
    Am 08.07.2024 um 16:35 schrieb Moebius:
    Am 08.07.2024 um 16:12 schrieb WM:
    Le 08/07/2024 à 04:52, Moebius a écrit :

    (4) Es gilt also IN DER MENGENLEHRE für alle x e IR, x > 0: |{m e
    {1/n : n e IN} : m <= x}| = aleph_0.

    (5) Mit der Definition NUF(x) := |{m e {1/n : n e IN} : m <= x}|
    folgt also für alle x e IR, x > 0: NUF(x) = aleph_0.

    ℵo unit fractions occupy at least ℵo different points on the positive
    real axis.

    Nicht nur "at least", sondern "genau", Mückenheim.

    Hence NUF(x) = ℵo cannot be true for x less than ℵo points, that is
    for a set of ℵo positive x.

    Huh?! Du redest wirres Zeug, Mann. :-)

    NUF(x) = ℵo ist für alle x e IR, x > 0 wahr. Also für überabzählbar viele Punkte.

    Wir brauchen NUF aber gar nicht auf der Definitionsmenge IR zu
    definieren; auch Q ginge als Definitionsmenge:

    NUF(x) := |{m e {1/n : n e IN} : m <= x}| (x e Q).

    Auch in diesem Fall gilt: NUF(0) = 0 und für alle x e IR, x > 0: NUF(x)
    = aleph_0.

    Typo. Sollte heißen: Auch in diesem Fall gilt: NUF(0) = 0 und für alle
    x e Q, x > 0: NUF(x) = aleph_0.

    Das ist alles ziemlich trivial.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Mon Jul 8 18:34:30 2024
    XPost: de.sci.mathematik

    Am 08.07.2024 um 16:49 schrieb joes:
    Am Mon, 08 Jul 2024 13:58:06 +0000 schrieb WM:
    Le 08/07/2024 à 04:35, Moebius a écrit :
    Am 07.07.2024 um 22:04 schrieb WM:

    In Bezug auf NUF ist es so, dass NUF(0) = 0 ist und NUF(x) = aleph_0
    für alle x e IR, x > 0.

    That is nonsense. NUF(x) cannot be ℵo unless x consists of ℵo points.

    WTF does that even mean. Since when is this a question about measure?

    Ah, I guess, this idiot meant:

    | NUF(x) cannot be ℵo unless (0, x] consists of ℵo points.

    lol. I guess his "idea" is: For an x e IR, x > 0 such that (0, x]
    contains less than ℵo points, NUF(x) cannot be ℵo.

    Right. On the other hand, there is no such x > 0 in IR.

    @Mückenheim: Ax e IR, x > 0: card((0, x]) > ℵo.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Mon Jul 8 18:18:11 2024
    Am 08.07.2024 um 15:58 schrieb WM:
    Le 08/07/2024 à 04:35, Moebius a écrit :

    In Bezug auf NUF ist es so, dass NUF(0) = 0 ist und NUF(x) = aleph_0
    für alle x e IR, x > 0.

    That is

    korrekt.

    Nochmal:

    Es gibt also keinen spezifische Punkt, wo NUF "sich von 0 auf
    aleph_0 ändert", weil es solche Punkte gar nicht gibt.

    Allerdings gilt: NUF(0) = 0 und NUF(x) = aleph_0 für alle x e IR, x > 0.

    Hier ein paar Hinweise dazu:

    (1) In der MENGENLEHRE gilt, dass die Menge aller natürlichen Zahlen,
    IN, (abzählbar) unendlich ist und damit auch die Menge aller Kehrwerte
    dieser Zahlen {1/n : n e IN}, also der Stammbrüche.

    Beweis: Die Funktion f: IN --> {1/n : n e IN}, die durch f(n) = 1/n für
    alle n e IN definiert ist, ist eine Bijektion von IN auf {1/n : n e IN}.

    Es gilt also insbesondere |{1/n : n e IN}| = |IN| = aleph_0.

    (2) Wie man leicht zeigen kann, gilt für jedes x e IR, x > 0: es gibt
    (nur) endliche viele Stammbrüche, die größer-gleich x sind.

    (3) Daraus folgt trivialerweise für jedes x e IR, x > 0: es gibt
    (abzählbar) unendlich viele Stammbrüche, die kleiner-gleich x sind.

    (4) Es gilt also IN DER MENGENLEHRE für alle x e IR, x > 0: |{m e {1/n :
    n e IN} : m <= x}| = aleph_0.

    (5) Mit der Definition NUF(x) := |{m e {1/n : n e IN} : m <= x}| folgt
    also für alle x e IR, x > 0: NUF(x) = aleph_0.

    WIE SCHWER KANN ES SEIN, DIESE EINFACHEN ZUSAMMENHÄNGE ZU VERSTEHEN, MÜCKENHEIM?

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Jim Burns@21:1/5 to All on Mon Jul 8 13:33:04 2024
    On 7/8/2024 9:49 AM, WM wrote:
    Le 08/07/2024 à 01:57, Jim Burns a écrit :
    On 7/7/2024 4:04 PM, WM wrote:

    The question is only this:
    Are there more than one unit fractions in
    the point where NUF(x) changes from 0 to more,
    or is there only one unit fraction?

    The complete distribution of unit fractions,

    does not answer this question.

    ...determines which things you are asking about.

    Are you asking about things for which
    each nonempty set holds a rightmost element (nearest 1)?

    Are you asking about things for which
    each u (including 1) has ⅟(1+⅟u) next.thing.to.the.left?

    Are you asking about things for which
    each v (excluding 1) has ⅟(-1+⅟v) next.thing.to.the.right?

    If your answers are yes, yes, and yes,
    then, whatever the things are called,
    the answer to your question is the third option: none.

    / If there is a point x > 0: NUF(x) < ℵ₀
    | then there is a leftmost unit.fraction β in (0,x]
    | and unit fraction u₂ᵦ < 2⋅β not.leftmost
    | and unit.fraction ¼⋅u₂ᵦ < ½⋅β < β
    | to the left of leftmost unit.fraction β
    \ Contradiction.

    There is no point x > 0: NUF(x) < ℵ₀
    There is no point x < 0: NUF(x) > 0
    NUF(x) changes "at" 0.

    And,
    if any of the three answers is no,
    then you're asking about something else.
    Maybe some day you'll say what you're asking about.

    NUF(0) = 0
    NUF(x) changes at 0
    There is no unit fraction at 0

    Therefore it does not change at 0.

    Functions do not change at single points.
    A change needs be _with respect to_ something, and
    the value at a point with respect to itself
    is unchanging.

    Consider the function
    NP(x) = |{.01,.02,.03,…,1.00}∩(0,x]|

    NP(.005) = 0
    NP(.015) = 1
    NP(x) changes between .005 and .015

    for 0<β<.01
    NP(.01-β) = 0
    NP(.01+β) = 1
    NP(x) changes between .01-β and .01+β

    NP(.01) = NP(.01) is unchanging.

    Consider once more the function
    NUF(x) = |⅟ℕ∩(0,x]|

    for each x
    NUF(x) = NUF(x) is unchanging.

    for 0<β
    NUF(0-β) = 0
    NUF(0+β) = ℵ₀
    NUF(x) changes between 0-β and 0+β


    for 0<β
    NUF(0+β) = ℵ₀
    because, otherwise,
    a unit fraction u₂ᵦ exists such that
    ¼⋅u₂ᵦ is NOT a unit fraction.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Mon Jul 8 20:05:35 2024
    Le 08/07/2024 à 16:49, joes a écrit :
    Am Mon, 08 Jul 2024 13:58:06 +0000 schrieb WM:
    Le 08/07/2024 à 04:35, Moebius a écrit :
    Am 07.07.2024 um 22:04 schrieb WM:

    In Bezug auf NUF ist es so, dass NUF(0) = 0 ist und NUF(x) = aleph_0
    für alle x e IR, x > 0.
    That is nonsense. NUF(x) cannot be ℵo unless x consists of ℵo points.
    WTF does that even mean. Since when is this a question about measure?

    It has been so from the beginning.
    10 unit fractions and their mutual distances occupy a part of the positive
    real axis.
    For any x from that part NUF(x) < 11 and therefore NUF(x) < ℵo.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Mon Jul 8 19:57:33 2024
    Le 08/07/2024 à 19:33, Jim Burns a écrit :
    On 7/8/2024 9:49 AM, WM wrote:

    the answer to your question is the third option: none.

    That is ridiculous.

    There is no point x > 0: NUF(x) < ℵ₀

    That is wrong because 10 unit fractions and their finite distances occupy
    a part of the positive axis which has a finite positive measure. Therefore there exist x > 0: NUF(x) < 11. in order to accumulate ℵ₀ unit
    fractions, at least 10 must exist at the beginning. Are you unable to understand that?

    There is no point x < 0: NUF(x) > 0
    NUF(x) changes "at" 0.

    The function f(x) = [x] changes at 1 from 0 to 1, at 2 from 1 to 2, and so
    on.
    The function NUF(x) changes at unit fractions by 1, but not before, not at
    0.


    Therefore it does not change at 0.

    Functions do not change at single points.

    You are wrong. The function f(x) = [x] changes at the points 1, 2, 3, ...

    A change needs be _with respect to_ something,

    yes, to the value befor that point.

    Consider

    No. A person who believes in loss by exchange and NUF changing at 0 is not
    of interest to me.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Mon Jul 8 20:11:45 2024
    Le 08/07/2024 à 16:35, Moebius a écrit :
    Am 08.07.2024 um 16:12 schrieb WM:
    Le 08/07/2024 à 04:52, Moebius a écrit :

    (4) Es gilt also IN DER MENGENLEHRE für alle x e IR, x > 0: |{m e {1/n
    : n e IN} : m <= x}| = aleph_0.

    (5) Mit der Definition NUF(x) := |{m e {1/n : n e IN} : m <= x}| folgt
    also für alle x e IR, x > 0: NUF(x) = aleph_0.

    ℵo unit fractions occupy at least ℵo different points on the positive
    real axis.

    Nicht nur "at least", sondern "genau"

    There is no precision, no "genau" with ℵo.

    Hence NUF(x) = ℵo cannot be true for x less than ℵo points, that is for >> a set of ℵo positive x.

    Huh?!

    You cannot think so far? What a pity.

    NUF(x) = ℵo ist für alle x e IR, x > 0 wahr.

    Not for the first ℵo points and their intervals required that the number
    of unit fractions can grow to ℵo.

    Auch in diesem Fall gilt: NUF(0) = 0 und für alle x e IR, x > 0: NUF(x)
    = aleph_0.

    Das ist alles ziemlich trivial.

    You cannot draw the conclusion: If X unit fractions occupy X points, then
    there cannot exist more than X unit fractions at the first X points.

    Ob alle Mathematiker zu blöde sind, um das zu verstehen?

    Gruß, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From joes@21:1/5 to All on Mon Jul 8 20:44:11 2024
    Am Mon, 08 Jul 2024 19:57:33 +0000 schrieb WM:
    Le 08/07/2024 à 19:33, Jim Burns a écrit :
    On 7/8/2024 9:49 AM, WM wrote:

    There is no point x > 0: NUF(x) < ℵ₀
    That is wrong because 10 unit fractions and their finite distances
    occupy a part of the positive axis which has a finite positive measure. Therefore there exist x > 0: NUF(x) < 11. in order to accumulate ℵ₀ unit fractions, at least 10 must exist at the beginning. Are you unable to understand that?
    Which ten.

    There is no point x < 0: NUF(x) > 0 NUF(x) changes "at" 0.
    The function f(x) = [x] changes at 1 from 0 to 1, at 2 from 1 to 2, and
    so on.
    The function NUF(x) changes at unit fractions by 1, but not before, not
    at 0.
    NUF changes at 0 from 0 to omega.

    Therefore it does not change at 0.
    Functions do not change at single points.
    You are wrong. The function f(x) = [x] changes at the points 1, 2, 3,
    ...
    And NUF changes like the sign function.

    --
    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 Mon Jul 8 21:08:51 2024
    XPost: de.sci.mathematik, alt.crackpot

    Am Mon, 08 Jul 2024 20:11:45 +0000 schrieb WM:
    Le 08/07/2024 à 16:35, Moebius a écrit :
    Am 08.07.2024 um 16:12 schrieb WM:
    Le 08/07/2024 à 04:52, Moebius a écrit :

    ℵo unit fractions occupy at least ℵo different points on the positive >>> real axis.
    Nicht nur "at least", sondern "genau"
    There is no precision, no "genau" with ℵo.
    That is as precise as it gets.

    Hence NUF(x) = ℵo cannot be true for x less than ℵo points, that is
    for a set of ℵo positive x.
    NUF(x) = ℵo ist für alle x e IR, x > 0 wahr.
    Not for the first ℵo points and their intervals required that the number
    of unit fractions can grow to ℵo.
    Grammar?

    Auch in diesem Fall gilt: NUF(0) = 0 und für alle x e IR, x > 0: NUF(x)
    = aleph_0. Das ist alles ziemlich trivial.
    You cannot draw the conclusion: If X unit fractions occupy X points,
    then there cannot exist more than X unit fractions at the first X
    points.
    There are no "first points"!

    --
    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 8 20:47:23 2024
    Le 08/07/2024 à 22:44, joes a écrit :
    Am Mon, 08 Jul 2024 19:57:33 +0000 schrieb WM:
    Le 08/07/2024 à 19:33, Jim Burns a écrit :
    On 7/8/2024 9:49 AM, WM wrote:

    There is no point x > 0: NUF(x) < ℵ₀
    That is wrong because 10 unit fractions and their finite distances
    occupy a part of the positive axis which has a finite positive measure.
    Therefore there exist x > 0: NUF(x) < 11. in order to accumulate ℵ₀ unit >> fractions, at least 10 must exist at the beginning. Are you unable to
    understand that?
    Which ten.

    There cannot be ℵ₀ without first 10.

    There is no point x < 0: NUF(x) > 0 NUF(x) changes "at" 0.
    The function f(x) = [x] changes at 1 from 0 to 1, at 2 from 1 to 2, and
    so on.
    The function NUF(x) changes at unit fractions by 1, but not before, not
    at 0.
    NUF changes at 0 from 0 to omega.

    Are all mathematicians so stupid?

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Mon Jul 8 23:12:14 2024
    Am 08.07.2024 um 22:47 schrieb WM:

    Are all mathematicians [...] stupid?

    Certainly not, but you are, for certain.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Mon Jul 8 23:13:39 2024
    Am 08.07.2024 um 22:11 schrieb WM:

    Ob alle Mathematiker zu blöde sind, um das zu verstehen?

    Vermutlich nicht; aber Sie sind es mit Sicherheit.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Mon Jul 8 23:16:18 2024
    Am 08.07.2024 um 21:57 schrieb WM:

    A person who believes in loss by exchange and NUF changing at 0 is
    not of interest to me.

    Geh sterben, Mückenheim!

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Tue Jul 9 03:04:17 2024
    Am 07.07.2024 um 22:24 schrieb WM:
    Le 05/07/2024 à 15:54, Moebius a écrit :
    Am 05.07.2024 um 09:39 schrieb WM:
    Le 04/07/2024 à 17:25, Moebius a écrit :
    Am 04.07.2024 um 17:16 schrieb WM:
    ;
    die Verteilung der ersten Stammbrüche
    ;
    es gibt keine "ersten Stammbrüche". Zu _jedem_ Stammbruch gibt es
    (abzählbar) unendlich viele kleinere Stammbrüche.
    ;
    Wrong,

    Nope.

    In sufficient argument.

    Natürlich ist das "sufficient", du dummes Arschloch.

    Hinweis: Wenn s ein Stammbruch ist, dann ist 1/(1/s + 1) ein Stammbruch,
    der kleiner ist als s.

    Und jetzt geh scheißen, Mückenheim!

    __________________________________________

    Du warst offensichtlich immer noch nicht beim Psychiater, um Dich
    behandeln zu lassen. Sehr betrüblich.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Jim Burns@21:1/5 to All on Mon Jul 8 20:15:48 2024
    On 7/8/2024 3:57 PM, WM wrote:
    Le 08/07/2024 à 19:33, Jim Burns a écrit :

    A change needs be _with respect to_ something,

    yes, to the value befor that point.

    Yes,
    for example, floor(0) with respect to floor(0-ε)

    Or,
    yes, to the value after that point

    for example, ceiling(0) with respect to ceiling(0+ε)

    Functions do not change at a point.
    Functions change _near_ a point.

    Consider

    No.
    A person who believes in
    loss by exchange and
    NUF changing at 0

    _near_ 0

    is not of interest to me.

    Does each nonempty set S of unit.fractionsᵂᴹ
    hold a largest S.element?

    Does each unit.fractionᵂᴹ u (including 1)
    have a next.smaller unit.fractionᵂᴹ ⅟(1+⅟u) ?

    Does each unit.fractionᵂᴹ v (excluding 1)
    have a next.larger unit.fractionᵂᴹ ⅟(-1+⅟v) ?

    Or is what you're talking about irrelevant to
    what you're saying?

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Tue Jul 9 11:49:21 2024
    Le 08/07/2024 à 23:12, Moebius a écrit :
    Am 08.07.2024 um 22:47 schrieb WM:

    Are all mathematicians [...] stupid?

    Certainly not, but

    many don't understand that ℵo unit fractions cannot occupy a distance
    smaller than all positive distances. Can you?

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Tue Jul 9 12:08:46 2024
    Le 09/07/2024 à 02:15, Jim Burns a écrit :
    On 7/8/2024 3:57 PM, WM wrote:
    Le 08/07/2024 à 19:33, Jim Burns a écrit :

    A change needs be _with respect to_ something,

    yes, to the value befor that point.

    Yes,
    for example, floor(0) with respect to floor(0-ε)

    Or,
    yes, to the value after that point

    No, my definition _for this concrete case_ is this: A change of NUF(x)
    happens at point x if for all y < x NUF(x) > NUF(y).

    A person who believes in
    loss by exchange and
    NUF changing at 0

    _near_ 0

    So the change does not happen at zero. Thank you for correcting your
    NUF(x) changes "at" 0. Otherwise you would really have been of no interest
    to me.

    Does each nonempty set S of unit.fractionsᵂᴹ
    hold a largest S.element?

    A largest and a smallest. Alas the smallest can only be found if it is not dark.

    Does each unit.fractionᵂᴹ u (including 1)
    have a next.smaller unit.fractionᵂᴹ ⅟(1+⅟u) ?

    Obviously not, as I have demonstrated irrefutably (refuted only by people
    who cannot think clear enough. But every unit fraction that can be named
    has a next smaller unit fraction.

    Does each unit.fractionᵂᴹ v (excluding 1)
    have a next.larger unit.fractionᵂᴹ ⅟(-1+⅟v) ?

    Yes, but for all dark unit fractions this cannot be found. Every unit
    fraction excluding 1/1 that can be named has a next larger unit fraction.

    Or is what you're talking about irrelevant to
    what you're saying?

    Relevant is this and only this: NUF(0) = 0, and the first step happens at
    x > 0. Like every step it is a step by 1.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Tue Jul 9 12:11:24 2024
    Le 09/07/2024 à 03:04, Moebius a écrit :
    Am 07.07.2024 um 22:24 schrieb WM:
    Le 05/07/2024 à 15:54, Moebius a écrit :
    Am 05.07.2024 um 09:39 schrieb WM:
    Le 04/07/2024 à 17:25, Moebius a écrit :
    Am 04.07.2024 um 17:16 schrieb WM:
    ;
    die Verteilung der ersten Stammbrüche
    ;
    es gibt keine "ersten Stammbrüche". Zu _jedem_ Stammbruch gibt es
    (abzählbar) unendlich viele kleinere Stammbrüche.
    ;
    Wrong,

    Nope.

    Insufficient argument.

    Hinweis: Wenn s ein Stammbruch ist, dann ist 1/(1/s + 1) ein Stammbruch,
    der kleiner ist als s.

    Not true for the smallest unit fraction.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From joes@21:1/5 to All on Tue Jul 9 13:23:10 2024
    Am Tue, 09 Jul 2024 11:49:21 +0000 schrieb WM:
    Le 08/07/2024 à 23:12, Moebius a écrit :
    Am 08.07.2024 um 22:47 schrieb WM:

    Are all mathematicians [...] stupid?
    Certainly not, but

    many don't understand that ℵo unit fractions cannot occupy a distance smaller than all positive distances. Can you?
    What does this mean? It should read "smaller than ANY".


    --
    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 Tue Jul 9 13:21:12 2024
    XPost: alt.crackpot

    Am Tue, 09 Jul 2024 12:08:46 +0000 schrieb WM:
    Le 09/07/2024 à 02:15, Jim Burns a écrit :
    On 7/8/2024 3:57 PM, WM wrote:
    Le 08/07/2024 à 19:33, Jim Burns a écrit :

    A change needs be _with respect to_ something,
    yes, to the value befor that point.
    Yes, for example, floor(0) with respect to floor(0-ε)
    Or, yes, to the value after that point
    No, my definition _for this concrete case_ is this: A change of NUF(x) happens at point x if for all y < x NUF(x) > NUF(y).
    Why this direction of less/greater than?

    Does each nonempty set S of unit.fractionsᵂᴹ hold a largest element?
    A largest and a smallest. Alas the smallest can only be found if it is
    not dark.
    Why should there be a smallest element?

    Does each unit.fractionᵂᴹ u (including 1)
    have a next.smaller unit.fractionᵂᴹ ⅟(1+⅟u) ?
    Obviously not, as I have demonstrated irrefutably (refuted only by
    people who cannot think clear enough. But every unit fraction that can
    be named has a next smaller unit fraction.
    "Named", which is all of them.

    Does each unit.fractionᵂᴹ v (excluding 1)
    have a next.larger unit.fractionᵂᴹ ⅟(-1+⅟v) ?
    Yes, but for all dark unit fractions this cannot be found. Every unit fraction excluding 1/1 that can be named has a next larger unit
    fraction.

    Or is what you're talking about irrelevant to what you're saying?
    Relevant is this and only this: NUF(0) = 0, and the first step happens
    at x > 0. Like every step it is a step by 1.
    The only step is at 0.

    --
    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 Tue Jul 9 16:13:25 2024
    Am 09.07.2024 um 14:11 schrieb WM:
    Le 09/07/2024 à 03:04, Moebius a écrit :
    Am 07.07.2024 um 22:24 schrieb WM:
    Le 05/07/2024 à 15:54, Moebius a écrit :
    Am 05.07.2024 um 09:39 schrieb WM:
    Le 04/07/2024 à 17:25, Moebius a écrit :
    Am 04.07.2024 um 17:16 schrieb WM:
    ;
    die Verteilung der ersten Stammbrüche
    ;
    es gibt keine "ersten Stammbrüche". Zu _jedem_ Stammbruch gibt es >>>>  >> (abzählbar) unendlich viele kleinere Stammbrüche.
    ;
    Wrong,

    Nope.

    Insufficient argument.

    Hinweis: Wenn s ein Stammbruch ist, dann ist 1/(1/s + 1) ein
    Stammbruch, der kleiner ist als s.

    Not true for the smallest unit fraction.

    There IS NO smallest unit fraction, Du psychotischer Spinner.

    Mit anderen Worten: Für ALLE Stammbrüche s gilt: Wenn s ein Stammbruch
    ist, dann ist 1/(1/s + 1) ein Stammbruch, der kleiner ist als s.

    Kleine Hilfestellung: Für jeden Stammbruch s ist 1/s eine natürliche
    Zahl und damit auch 1/s + 1. Außerdem ist 1/s + 1 > 1/s. Daher ist
    1/(1/s + 1) ein Stammbruch der kleiner als s ist: 1/(1/s + 1) < s.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Tue Jul 9 16:35:05 2024
    Am 09.07.2024 um 15:23 schrieb joes:
    Am Tue, 09 Jul 2024 11:49:21 +0000 schrieb WM:

    many don't understand that ℵo unit fractions cannot occupy a distance
    smaller than all positive distances. Can you?

    What does this mean? It should read "smaller than ANY".

    Es bedeutet, dass Mückenheim (in diesem Kontext) nicht zwischen AxEy und
    EyAx unterscheiden kann.

    Man hat es im schon gefühlte 1000-mal erklärt, dass es zwar zu jedem
    reellen x > 0 einen Bruch q gibt, so dass q < x gilt, dass man daraus
    aber nicht darauf schießen kann/darf, dass es einen Bruch q gibt, so
    dass für alle reellen x > 0 q < x gilt.

    Aus dem Umstand, dass also

    Eq e {1/n e IN}: Ax e IR+: q < x

    NICHT gilt, zieht Mückenheim messerscharf den Schluss, dass auch

    Ax e IR+: Eq e {1/n e IN}: q < x

    NICHT gilt. Man spricht in diesem Zusammenhang auch vom sog. "Mückenschluss".*)

    __________________________________________


    *) Dies ist aber lediglich der Versuch, seine (falschen) Behauptungen
    mithilfe einer "logischen Analyse" zu verstehen.

    Vermutlich ist es aber eher so, dass er schlicht und einfach
    geistig-mental nicht zwischen "Eq e {1/n e IN}: Ax e IR+: q < x" und "Ax
    e IR+: Eq e {1/n e IN}: q < x" unterscheiden kann, da also auch keinen Unterschied "sieht" bzw. "macht".

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Tue Jul 9 16:47:00 2024
    Le 09/07/2024 à 15:23, joes a écrit :
    Am Tue, 09 Jul 2024 11:49:21 +0000 schrieb WM:

    many don't understand that ℵo unit fractions cannot occupy a distance
    smaller than all positive distances. Can you?
    What does this mean? It should read "smaller than ANY".

    No, it has been claimed for all x > 0.
    In fact it is true for any positive x that can be selected.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Tue Jul 9 16:44:55 2024
    Le 09/07/2024 à 15:21, joes a écrit :
    Am Tue, 09 Jul 2024 12:08:46 +0000 schrieb WM:

    Relevant is this and only this: NUF(0) = 0, and the first step happens
    at x > 0. Like every step it is a step by 1.
    The only step is at 0.

    Steps are there where unit fractions lie. At 0 there is none.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Tue Jul 9 16:53:22 2024
    Le 09/07/2024 à 16:35, Moebius a écrit :
    Am 09.07.2024 um 15:23 schrieb joes:
    Am Tue, 09 Jul 2024 11:49:21 +0000 schrieb WM:

    many don't understand that ℵo unit fractions cannot occupy a distance
    smaller than all positive distances. Can you?

    What does this mean? It should read "smaller than ANY".

    Es bedeutet, dass Mückenheim (in diesem Kontext) nicht zwischen AxEy und EyAx unterscheiden kann.

    That is nonsense. Either there is a first unit fraction or this is not the case. If it is not the case, then NUF(x) increases by more than 1, say by
    X, at that x where it is leaving 0. But then there must exist an x
    occupied by more than one, namely by X, unit fractions. Contradiction.

    No quantifier magic.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Tue Jul 9 19:07:56 2024
    Am 09.07.2024 um 18:53 schrieb WM:

    Either there is a first unit fraction or this is not the case.

    It is not the case.

    Hint: If s is a unit fraction, 1/(1/s + 1) is a smaller one.

    If it is not the case, then NUF(x) increases by more than 1,
    say by X, at that x where it is leaving 0.

    1. NUF does not "increase" but "jump".

    2. "That x where it is leaving 0" does not exist. :-)

    Hint: NUF(x) = 0 for all x e IR, x <= 0 and NUF(x) = aleph_0 for all x e
    IR, x > 0.

    But then there must exist an x <bla bla bla>

    Hint: For all x e IR, x > 0 there are infinitely many unit fractions
    which are smaller than x. Namely the unit fractions 1/(ceil(1/x + 1), 1/(ceil(1/x + 2), 1/(ceil(1/x + 3), ...

    Wie dumm kann man eigentlich sein, Mückenheim?

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Jim Burns@21:1/5 to All on Tue Jul 9 14:51:39 2024
    On 7/9/2024 8:08 AM, WM wrote:
    Le 09/07/2024 à 02:15, Jim Burns a écrit :
    On 7/8/2024 3:57 PM, WM wrote:
    Le 08/07/2024 à 19:33, Jim Burns a écrit :

    A change needs be _with respect to_ something,

    yes, to the value befor that point.

    Yes,
    for example, floor(0) with respect to floor(0-ε)

    Or,
    yes, to the value after that point

    for example, ceiling(0) with respect to ceiling(0+ε)

    No, my definition _for this concrete case_ is this:
    A change of NUF(x) happens at point x if
    for all y < x NUF(x) > NUF(y).

    Then ceiling(x) _doesn't_ changeᵂᴹ "at" 0

    This is a handy illustration of how your logicᵂᴹ works:
    1. Decide on the answer.
    2. Abuse the terms until you get that answer.

    A person who believes in
    loss by exchange and
    NUF changing at 0

    _near_ 0

    So the change does not happen at zero.

    In exactly the same way ceiling(x) doesn't changeᵂᴹ "at" 0

    Does each nonempty set S of unit.fractionsᵂᴹ
    hold a largest S.element?

    A largest and a smallest.
    Alas the smallest can only be found if it is not dark.

    Each nonempty set S of unit.fractionsⁿᵒᵗᐧᵂᴹ
    holds a largest S.element.

    Consider the nonempty set S of unit.fractionsⁿᵒᵗᐧᵂᴹ
    and the set ⤓S of unit.fractionⁿᵒᵗᐧᵂᴹ lower.bounds of S
    ⤓S = {u∈⅟ℕ: u≤ᴬS}

    ⤓S is empty or nonempty.

    If ⤓S is empty,
    then S doesn't hold a smallest member, which would be in ⤓S

    If ⤓S is nonempty,
    then unit.fractionⁿᵒᵗᐧᵂᴹ.set ⤓S holds largest member max.⤓S

    If max.⤓S isn't in S
    then (max.⤓S)⁺¹ is also a lower.bound of S
    and in ⤓S
    and larger than max.⤓S
    and a contradiction.

    max.⤓S is in S
    max.⤓S = min.S exists iff
    S is bounded.below in ⅟ℕ

    Also,
    if S is bounded.below
    then each nonempty subset of S is bounded.below
    and holds minimum and maximum.

    Unit.fractionⁿᵒᵗᐧᵂᴹ.set S is a finiteⁿᵒᵗᐧᵂᴹ set iff
    S is bounded.below in ⅟ℕ

    The set ⅟ℕ of all unit.fractionsⁿᵒᵗᐧᵂᴹ
    isn't bounded below in ⅟ℕ
    Each unit.fractionⁿᵒᵗᐧᵂᴹ u isn't below ⅟(1+⅟u) in ⅟ℕ
    and isn't a lower.bound.
    ⅟ℕ is an infiniteⁿᵒᵗᐧᵂᴹ set.

    Does each unit.fractionᵂᴹ u (including 1)
    have a next.smaller unit.fractionᵂᴹ ⅟(1+⅟u) ?

    Obviously not,

    Then unit.fractionsᵂᴹ aren't unit.fractionsⁿᵒᵗᐧᵂᴹ
    Each unit.fractionⁿᵒᵗᐧᵂᴹ (including 1) has
    a next.smaller unit.fractionⁿᵒᵗᐧᵂᴹ ⅟(1+⅟u)

    as I have demonstrated irrefutably

    ...for unit.fractionsᵂᴹ
    but not for unit.fractionsⁿᵒᵗᐧᵂᴹ

    This is a handy illustration of how your logicᵂᴹ works:
    1. Decide on the answer.
    2. Abuse the terms until you get that answer.

    (refuted only by people who cannot think clear enough.
    But every unit fraction that can be named
    has a next smaller unit fraction.

    Does each unit.fractionᵂᴹ v (excluding 1)
    have a next.larger unit.fractionᵂᴹ ⅟(-1+⅟v) ?

    Yes, but
    for all dark unit fractions this cannot be found.
    Every unit fraction excluding 1/1 that can be named
    has a next larger unit fraction.

    Each unit.fractionⁿᵒᵗᐧᵂᴹ (excluding 1) has
    a next.larger unit.fractionⁿᵒᵗᐧᵂᴹ ⅟(-1+⅟u)

    Or is  what you're talking about irrelevant to
    what you're saying?

    Relevant is this and only this:
    NUF(0) = 0,
    and the first step happens at x > 0.
    Like every step it is a step by 1.

    If NUF(x) = 0 at x > 0
    then
    ⅟ℕ.greatest.lower.bound β ≥ x > 0
    ⅟ℕ.lower.bound ½⋅β < β
    ⅟ℕ.not.lower.bound 2⋅β > β
    unit.fractionⁿᵒᵗᐧᵂᴹ u₂ᵦ < 2⋅β unit.fractionⁿᵒᵗᐧᵂᴹ ¼⋅u₂ᵦ < ¼⋅2⋅β = ½⋅β ⅟ℕ.not.lower.bound ½⋅β
    Contradiction.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Tue Jul 9 23:07:59 2024
    Am 09.07.2024 um 22:10 schrieb Chris M. Thomasson:
    On 7/9/2024 3:11 AM, FromTheRafters wrote:

    Does that mean there are as many rationals as there are reals?

    I already told you that: The set of rational numbers is countable
    infinite while the set of real numbers is _uncountable_.

    Again: One of my math professors once tried to express this state of
    affairs the following way: "There are (in a certain sense) much more
    real numbers than rational numbers."

    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 Moebius@21:1/5 to All on Tue Jul 9 23:17:51 2024
    Am 09.07.2024 um 22:42 schrieb Chris M. Thomasson:
    On 7/9/2024 9:53 AM, WM wrote:
    Le 09/07/2024 à 16:35, Moebius a écrit :
    Am 09.07.2024 um 15:23 schrieb joes:
    Am Tue, 09 Jul 2024 11:49:21 +0000 schrieb WM:

    many don't understand that ℵo unit fractions cannot occupy a distance >>>>> smaller than all positive distances. Can you?

    What does this mean? It should read "smaller than ANY".

    Es bedeutet, dass Mückenheim (in diesem Kontext) nicht zwischen AxEy
    und EyAx unterscheiden kann.

    That is nonsense. Either there is a first unit fraction or this is not
    the case.

    There is a first unit fraction at 1/1. However, there is no last unit fraction... :^)

    No, with "first" he means a "smallest" unit fraction. Hence from this
    point of view 1/1 is the "last" (i.e. largest) unit fraction.

    ... < 1/3 < 1/2 < 1/1.

    WM's claim is that there is a unit fraction WM such that

    Au e {1/n : n e IN}: WM <= u

    In other words:

    WM < ... < 1/3 < 1/2 < 1/1 ,

    such that there is no unit fraction u with

    u < WM < ... < 1/3 < 1/2 < 1/1 .

    Of course, this doesn't MAKE any sense (i.e. is bullshit). After all,
    1/(1/WM + 1) would be a unit fraction with

    1/(1/WM + 1) < WM < ... < 1/3 < 1/2 < 1/1 .

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Tue Jul 9 23:33:44 2024
    Am 09.07.2024 um 22:07 schrieb Chris M. Thomasson:
    On 7/9/2024 5:11 AM, WM wrote:
    Le 09/07/2024 à 03:04, Moebius a écrit :
    Am 07.07.2024 um 22:24 schrieb WM:
    Le 05/07/2024 à 15:54, Moebius a écrit :
    Am 05.07.2024 um 09:39 schrieb WM:
    Le 04/07/2024 à 17:25, Moebius a écrit :
    Am 04.07.2024 um 17:16 schrieb WM:
    ;
    die Verteilung der ersten Stammbrüche
    ;
    es gibt keine "ersten Stammbrüche". Zu _jedem_ Stammbruch gibt es >>>>>  >> (abzählbar) unendlich viele kleinere Stammbrüche.
    ;
    Wrong,

    Nope.

    Insufficient argument.

    Hinweis: Wenn s ein Stammbruch ist, dann ist 1/(1/s + 1) ein
    Stammbruch, der kleiner ist als s.

    Not true for the smallest unit fraction.

    There is NO smallest unit fraction. Dark or not. :^)

    Indeed!

    Theorem: There is no smallest unit fraction.

    Proof: If s is a unit fraction, then there's (by definition) a natural
    number n such that s = 1/n. Then n + 1 is a natural number to (by one of
    the peano axioms and the definition of +) and n + 1 > n (by the
    definition of >). Hence 1/(n + 1) < 1/n (by the rules of the field Q).
    And hence 1/(1/s + 1) < s (again by the rules of the field Q). Moreover
    1/(1/s + 1) is a unit fraction (again by definition). Hence There is a
    unit fraction, namely 1/(1/s + 1), which is smaller than s.

    If we define:

    s is a smallest unit fraction =df s smaller than all other unit fractions

    Then the theorem we just proved implies that THERE IS NO "smallest unit fraction".

    HENCE in a mathematical context we would not be allowed to talk about
    "the smallest unit fraction" (as Mückenfuck does) simply because there
    IS NO such entity.

    You see:

    The round square is round an square.
    The triange with 4 corners has 4 corners.

    etc.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Tue Jul 9 23:34:26 2024
    Am 09.07.2024 um 22:07 schrieb Chris M. Thomasson:
    On 7/9/2024 5:11 AM, WM wrote:
    Le 09/07/2024 à 03:04, Moebius a écrit :
    Am 07.07.2024 um 22:24 schrieb WM:
    Le 05/07/2024 à 15:54, Moebius a écrit :
    Am 05.07.2024 um 09:39 schrieb WM:
    Le 04/07/2024 à 17:25, Moebius a écrit :
    Am 04.07.2024 um 17:16 schrieb WM:

    die Verteilung der ersten Stammbrüche

    es gibt keine "ersten Stammbrüche". Zu _jedem_ Stammbruch gibt es
    (abzählbar) unendlich viele kleinere Stammbrüche.

    Wrong,

    Nope.

    Insufficient argument.

    Hinweis: Wenn s ein Stammbruch ist, dann ist 1/(1/s + 1) ein
    Stammbruch, der kleiner ist als s.

    Not true for the smallest unit fraction.

    There is NO smallest unit fraction. Dark or not. :^)

    Indeed!

    Theorem: There is no smallest unit fraction.

    Proof: If s is a unit fraction, then there's (by definition) a natural
    number n such that s = 1/n. Then n + 1 is a natural number to (by one of
    the peano axioms and the definition of +) and n + 1 > n (by the
    definition of >). Hence 1/(n + 1) < 1/n (by the rules of the field Q).
    And hence 1/(1/s + 1) < s (again by the rules of the field Q). Moreover
    1/(1/s + 1) is a unit fraction (again by definition). Hence There is a
    unit fraction, namely 1/(1/s + 1), which is smaller than s.

    If we define:

    s is a smallest unit fraction =df s smaller than all other unit fractions

    Then the theorem we just proved implies that THERE IS NO "smallest unit fraction".

    HENCE in a mathematical context we would not be allowed to talk about
    "the smallest unit fraction" (as Mückenfuck does) simply because there
    IS NO such entity.

    You see:

    The round square is round an square.
    The triange with 4 corners has 4 corners.

    etc.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Tue Jul 9 23:49:35 2024
    Am 09.07.2024 um 23:34 schrieb Chris M. Thomasson:
    On 7/9/2024 2:07 PM, Moebius wrote:
    Am 09.07.2024 um 22:10 schrieb Chris M. Thomasson:
    On 7/9/2024 3:11 AM, FromTheRafters wrote:

    Does that mean there are as many rationals as there are reals?

    I already told you that: The set of rational numbers is countable
    infinite while the set of real numbers is _uncountable_.

    Again: One of my math professors once tried to express this state of
    affairs the following way: "There are (in a certain sense) much more
    real numbers than rational numbers."

    Strange that any real can be represented by a rational up to infinite precision...
    What is "up to infinite precision" and "represent"?

    Hint: There is NO rational number such that r = sqrt(2).

    Hence for each and every rational number r there is a "non zero"
    difference between sqrt(2) and r.

    I guess you might have a _sequence_ of rational numbers in mind, say,

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

    So we might say that this SEQUENCE represents the real number sqrt(2) -
    in a certain sense. :-P

    Actually, its limit is sqrt(2).

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Wed Jul 10 00:59:57 2024
    Am 09.07.2024 um 23:34 schrieb Chris M. Thomasson:
    On 7/9/2024 2:07 PM, Moebius wrote:
    Am 09.07.2024 um 22:10 schrieb Chris M. Thomasson:
    On 7/9/2024 3:11 AM, FromTheRafters wrote:

    Does that mean there are as many rationals as there are reals?

    I already told you that: The set of rational numbers is countable
    infinite while the set of real numbers is _uncountable_.

    Again: One of my math professors once tried to express this state of
    affairs the following way: "There are (in a certain sense) much more
    real numbers than rational numbers."

    Strange that any real can be represented by a rational up to infinite precision...

    It's even worse: Between any two (different) real numbers there's a
    rational number and between any two (different) rational numbers there's
    a real number!

    So how can there be "more" real numbers than rational numbers? :-P

    This is one of WM's arguments to show that card(IR) and card(Q) are the
    same (iirc). Needless to say that it is incorrect.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Wed Jul 10 01:23:16 2024
    Am 08.07.2024 um 22:47 schrieb WM:

    There cannot be ℵ₀ without first 10.

    There cannot be ℵ₀ rational numbers > 0 without first 10?

    Which are these numbers? Pleeeze tell us!

    The first 10 Mückenheim-darkies?

    We might call them WM_1, WM_2, .., WM_10.

    But shouldn't there be a rational number WM_0 := WM_1/2 with WM_0 < WM_1
    (since WM_1/2 < WM_1)?

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Wed Jul 10 03:02:09 2024
    Am 10.07.2024 um 01:23 schrieb Moebius:
    Am 08.07.2024 um 22:47 schrieb WM:

    There cannot be ℵ₀ without first 10.

    There cannot be ℵ₀ rational numbers > 0 without first 10?

    Which are these numbers? Pleeeze tell us!

    The first 10 Mückenheim-darkies?

    We might call them WM_1, WM_2, .., WM_10.

    But shouldn't there be a rational number WM_0 := WM_1/2 with WM_0 < WM_1 (since WM_1/2 < WM_1)?

    In Mückenland not each and every rational number can be divided by 2?

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Wed Jul 10 15:44:37 2024
    Le 09/07/2024 à 19:07, Moebius a écrit :
    Am 09.07.2024 um 18:53 schrieb WM:

    Either there is a first unit fraction or this is not the case.

    It is not the case.

    Then there are more first unit fractions.

    Hint: If s is a unit fraction, 1/(1/s + 1) is a smaller one.

    This is in contradiction with mathematics: Only one unit fraction at one
    point.

    If it is not the case, then NUF(x) increases by more than 1,
    say by X, at that x where it is leaving 0.

    1. NUF does not "increase" but "jump".

    But not by more than 1 at any x.

    2. "That x where it is leaving 0" does not exist. :-)

    Wrong worship of matheology.
    In mathematics NUF(x) is leaving x not without a unit fraction.

    Hint: NUF(x) = 0 for all x e IR, x <= 0 and NUF(x) = aleph_0 for all x e
    IR, x > 0.

    Wrong worship of matheology.

    But then there must exist an x <bla bla bla>

    Hint: For all x e IR, x > 0 there are infinitely many unit fractions
    which are smaller than x.

    Not for x between these unit fractions.

    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:02:18 2024
    Le 09/07/2024 à 20:51, Jim Burns a écrit :
    On 7/9/2024 8:08 AM, WM wrote:

    A change of NUF(x) happens at point x if
    for all y < x NUF(x) > NUF(y).

    Then

    Then what ever. It is my definition.

    Relevant is this and only this:
    NUF(0) = 0,
    and the first step happens at x > 0.
    Like every step it is a step by 1.

    If NUF(x) = 0 at x > 0
    then
    Contradiction.

    Not in dark numbers.

    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:23:38 2024
    Le 10/07/2024 à 00:59, Moebius a écrit :

    So how can there be "more" real numbers than rational numbers? :-P

    This is one of WM's arguments to show that card(IR) and card(Q) are the
    same (iirc).

    There are not more visisble rationals than visisble irrationals and vice
    versa.
    But there are more dark irrationals than dark rationals.

    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:18:20 2024
    Le 10/07/2024 à 03:02, Moebius a écrit :
    Am 10.07.2024 um 01:23 schrieb Moebius:
    Am 08.07.2024 um 22:47 schrieb WM:

    There cannot be ℵ₀ without first 10.

    There cannot be ℵ₀ rational numbers > 0 without first 10?

    Which are these numbers? Pleeeze tell us!

    They are dark.

    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:24:50 2024
    Am 10.07.2024 um 18:02 schrieb WM:
    Le 09/07/2024 à 20:51, Jim Burns a écrit :

    Contradiction.

    Not in dark numbers.

    Yeah, in the dark (numbers) every contradiction becomes a non-contradiction!

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Wed Jul 10 18:29:20 2024
    Am 10.07.2024 um 18:18 schrieb WM:
    Le 10/07/2024 à 03:02, Moebius a écrit :
    Am 10.07.2024 um 01:23 schrieb Moebius:
    Am 08.07.2024 um 22:47 schrieb WM:

    There cannot be ℵ₀ without first 10.

    There cannot be ℵ₀ rational numbers > 0 without first 10?

    Which are these numbers? Pleeeze tell us!

    They are dark.

    Mückenheim, geh scheißen!

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Jim Burns@21:1/5 to Jim Burns on Wed Jul 10 14:07:17 2024
    On 7/10/2024 1:58 PM, Jim Burns wrote:
    On 7/10/2024 12:02 PM, WM wrote:
    Le 09/07/2024 à 20:51, Jim Burns a écrit :
    On 7/9/2024 8:08 AM, WM wrote:

    A change of NUF(x) happens at point x if
    for all y < x NUF(x) > NUF(y).

    Then ceiling(x) _doesn't_ changeᵂᴹ "at" 0

    Then what ever. It is my definition.

    Very much like Humpty Dunpty and "glory".
    [1]

    | “I don't know what you mean by 'glory,'"
    | Alice said.
    |
    | Humpty Dumpty smiled contemptuously.
    | "Of course you don't
    | ---till I tell you. I meant
    | 'there's a nice knock-down argument for you!'"
    |
    | "But glory' doesn't mean
    | 'a nice knock-down argument,'"
    | Alice objected.
    |
    | "When I use a word,"
    | Humpty Dumpty said, in rather a scornful tone,
    | "it means just what I choose it to mean
    | ---neither more nor less."
    |
    | "The question is,"
    | said Alice,
    | "whether you can make words mean so many different things."
    |
    | "The question is,"
    | said Humpty Dumpty,
    | "Which is to be master---that's all."
    |
    -- Lewis Carroll

    When you say that
    NUF(x) doesn't changeᵂᴹ at 0
    you mean that
    NUF(x) doesn't changeᵂᴹ like ceiling(x) doesn't.

    However,
    your argument depends upon
    it being unclear what you (WM) mean.
    Not the best argument.

    Relevant is this and only this:
    NUF(0) = 0,
    and the first step happens  at x > 0.
    Like every step it is a step by 1.

    If NUF(x) = 0  at  x > 0
    then
    Contradiction.

    Not in dark numbers.

    For the unit.fractionsⁿᵒᵗᐧᵂᴹ.set ⅟ℕⁿᵒᵗᐧᵂᴹ glb.⅟ℕⁿᵒᵗᐧᵂᴹ > 0 is contradictory.

    Each nonempty ⅟ℕⁿᵒᵗᐧᵂᴹ.subset S
    holds a largest S.element.

    Each ⅟ℕⁿᵒᵗᐧᵂᴹ.element u (including 1) has
    a next.smaller ⅟ℕⁿᵒᵗᐧᵂᴹ.element ⅟(1+⅟u)

    Each ⅟ℕⁿᵒᵗᐧᵂᴹ.element v (excluding 1) has
    a next.larger ⅟ℕⁿᵒᵗᐧᵂᴹ.element ⅟(-1+⅟v)

    However,
    your argument depends upon
    it being unclear what you (WM) mean.
    Not the best argument.



    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Jim Burns@21:1/5 to All on Wed Jul 10 13:58:28 2024
    On 7/10/2024 12:02 PM, WM wrote:
    Le 09/07/2024 à 20:51, Jim Burns a écrit :
    On 7/9/2024 8:08 AM, WM wrote:

    A change of NUF(x) happens at point x if
    for all y < x NUF(x) > NUF(y).

    Then ceiling(x) _doesn't_ changeᵂᴹ "at" 0

    Then what ever. It is my definition.

    Very much like Humpty Dunpty and "glory".
    [1]

    When you say that
    NUF(x) doesn't changeᵂᴹ at 0
    you mean that
    NUF(x) doesn't changeᵂᴹ like ceiling(x) doesn't.

    However,
    your argument depends upon
    it being unclear what you (WM) mean.
    Not the best argument.

    Relevant is this and only this:
    NUF(0) = 0,
    and the first step happens  at x > 0.
    Like every step it is a step by 1.

    If NUF(x) = 0  at  x > 0
    then
    Contradiction.

    Not in dark numbers.

    For the unit.fractionsⁿᵒᵗᐧᵂᴹ.set ⅟ℕⁿᵒᵗᐧᵂᴹ glb.⅟ℕⁿᵒᵗᐧᵂᴹ > 0 is contradictory.

    Each nonempty ⅟ℕⁿᵒᵗᐧᵂᴹ.subset S
    holds a largest S.element.

    Each ⅟ℕⁿᵒᵗᐧᵂᴹ.element u (including 1) has
    a next.smaller ⅟ℕⁿᵒᵗᐧᵂᴹ.element ⅟(1+⅟u)

    Each ⅟ℕⁿᵒᵗᐧᵂᴹ.element v (excluding 1) has
    a next.larger ⅟ℕⁿᵒᵗᐧᵂᴹ.element ⅟(-1+⅟v)

    However,
    your argument depends upon
    it being unclear what you (WM) mean.
    Not the best argument.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Wed Jul 10 20:44:48 2024
    Am 10.07.2024 um 20:36 schrieb Moebius:
    Am 10.07.2024 um 19:58 schrieb Jim Burns:
    On 7/10/2024 12:02 PM, WM wrote:

    your argument depends upon
    it being unclear what you (WM) mean.
    Not the best argument.

    I beg to differ. It's the best (type of) argument WM will ever have.

    So _at least for him_ it's "the best" (type of) argument. :-P

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

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Wed Jul 10 20:36:53 2024
    Am 10.07.2024 um 19:58 schrieb Jim Burns:
    On 7/10/2024 12:02 PM, WM wrote:

    your argument depends upon
    it being unclear what you (WM) mean.
    Not the best argument.

    I beg to differ. It's the best (type of) argument WM will ever have.

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

    I guess you might have a _sequence_ of rational numbers in mind, say,

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

    So we might say that this SEQUENCE represents the real number sqrt(2)
    - in a certain sense. :-P

    Actually, its limit is sqrt(2).

    Well, basically, I was thinking that for any element of:

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

    there is a rational that can represent it.

    lol. (Sorry!)

    Which one, if I may ask? :-P

    So, it kind of makes my brain want to bleed from time to time, shit happens! Uggg.

    lol. (Sorry again!)

    Imho you are "on a good way"!

    Just take your time, and don't do the Mückenheim! :-)

    Taken to infinity, there are rationals that can represent [...] sqrt 2:

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

    Yeah, but when speaking of a mathematical objekts (in this connection)
    we (usually) refer to the SEQUENCE (1, 1.4, 1.41, 1.414, ...)

    Set theory allows to refer to such objekts (sets).

    However, there is no single rational that equals sqrt 2.

    Exactly! :-)

    A thing even the ancient greeks new! :-P

    Humm... Fair enough?

    Absolutely!

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

    Think of the whole as simply, sqrt(2)

    It's possible to "construct" the real numbers that way.

    The finite parts are the step wise construction of the whole, can be something akin to:

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

    Is this a decent line of thought?

    Yes.

    Cantor "constructed" (defined) the real numbers "that way" (or in a
    "similar" way).

    Hint: There are quite different "constructions" of the real numbers
    (Dedekind, Contor, ...) but all these "constructions" lead to "the same"
    (up to isomorphism) "field" called "the real numbers".

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

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

    For each element there is a rational that can represent it.

    Well, A = A? Agree!

    No single rational can represent the whole...

    Right!

    Otherwise the question would be; Which one? :-)

    However, a real can represent [...] the whole...

    Exactly! (!!!)

    Fair enough?

    Sure!

    Or am I drifting off deeper into WM land?

    Not at all! I'm quite sure that you are NOT a crank. :-)

    Just take your time!

    Math SHOULD BE fun! (imho)

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

    Math SHOULD BE fun! (imho)

    Hmmm... It's quite clear that WM doesnt' have ANY fun with math, I'd say.

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

    Math SHOULD BE fun! (imho)

    Hmmm... It's quite clear that WM doesn't have ANY fun with math, I'd say.

    Actually, he doesn't DO any math.

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

    Math SHOULD BE fun! (imho)

    Hmmm... It's quite clear that WM doesn't have ANY fun with math, I'd say.

    Actually, he doesn't DO any math.

    Most cranks don't to any (real) math, they just "criticizes" (sort of)
    things they don't really understand.

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

    Math SHOULD BE fun! (imho)

    Hmmm... It's quite clear that WM doesn't have ANY fun with math, I'd
    say.

    Actually, he doesn't DO any math.

    Most cranks don't do any (real) math, they just "criticize" (sort of)
    things they don't really understand.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Thu Jul 11 02:03:45 2024
    Am 11.07.2024 um 01:37 schrieb Chris M. Thomasson:
    On 7/10/2024 3:55 PM, Moebius wrote:
    Am 11.07.2024 um 00:26 schrieb Chris M. Thomasson:

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

    For each element [term] [in (1, 1.4, 1.41, 1.414, ...)] there is a rational that can represent it.

    Well, A = A? Agree!

    Hint: All elements/terms in (1, 1.4, 1.41, 1.414, ...) are rational
    numbers. :-)

    Should I add in the word finite here:

    For each _finite_ element there is a rational that can represent it.

    Nope. After all, each and every element (term) in (1, 1.4, 1.41, 1.414,
    ...) is "finite" (sort of).*)

    So you wont't get anything (meaningful) by adding "finite" in this context.

    Any clearer, or does it add mud to the clear waters?

    It's just "superfluous" (imho). :-P

    No single rational can represent the whole...

    Right!

    Otherwise the question would be: Which one? :-)

    However, a real can represent [...] the whole...

    Exactly! (!!!)

    Fair enough?

    Sure!

    See?!

    __________________________________

    *) i.e. is equal to to some n/m where n,m e IN.

    --- 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:32:57 2024
    "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> writes:

    On 7/10/2024 4:29 PM, Moebius wrote:
    Am 11.07.2024 um 01:02 schrieb Moebius:
    Am 11.07.2024 um 01:00 schrieb Moebius:
    Am 11.07.2024 um 00:55 schrieb Moebius:

    Math SHOULD BE fun! (imho)

    Hmmm... It's quite clear that WM doesn't have ANY fun with math, I'd
    say.

    Actually, he doesn't DO any math.
    Most cranks don't to any (real) math, they just "criticizes" (sort of)
    things they don't really understand.

    If I am having a hard time understanding something, I ask/read around until
    I can finally grasp the underlying meaning of the problem to a point where
    I can code up a working solution. It has certainly tended worked for me in the past.

    Here's and interesting problem to code up. The input is a finite array
    of n pairs of strings, so there are 2n strings in all. They are often
    thought of as strings on the top and bottom of a collection of tiles or dominos, but that just help visualise the problem. An example with n=3
    might be

    aa bb abb
    aab ba b

    The pairs (or tiles) are numbered from 1 to n. The problem is to
    determine, for any finite set of tiles, if there is a finite sequence of numbers such that when those numbered tiles are laid out (we can use any
    tile as often as we like) the concatenation of the top stings is the
    same as the concatenation of the bottom strings.

    For example, with these tiles, the sequence 1, 2, 1, 3 produces

    aa bb aa abb
    aab ba aab b

    with top string aabbaaabb = bottom string aabbaaabb. So for this input,
    the program should print "yes". You don't need to give the sequence
    that gives the matching top and bottom strings (though that would be a
    neat extra), you just have print yes or no depending on whether such a
    sequence of tiles exists or not.

    --
    Ben.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Thu Jul 11 02:55:12 2024
    Am 11.07.2024 um 02:52 schrieb Jim Burns:
    On 7/10/2024 6:55 PM, Moebius wrote:
    Am 11.07.2024 um 00:26 schrieb Chris M. Thomasson:

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

    For each element there is a rational that can represent it.

    Well, A = A? Agree!

    Just to keep things from becoming too clear...

    WM has disputed A = A for darkᵂᴹ numbers A
    To be precise,
    he has disputed _saying_ 'A = A'

    ...which I guess indicates that he _agrees_ with it
    and dislikes how it messes up his "proofs".

    WMmath is "strange", I'd say. (lol)

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Jim Burns@21:1/5 to Moebius on Wed Jul 10 20:52:39 2024
    On 7/10/2024 6:55 PM, Moebius wrote:
    Am 11.07.2024 um 00:26 schrieb Chris M. Thomasson:

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

    For each element there is a rational that can represent it.

    Well, A = A? Agree!

    Just to keep things from becoming too clear...

    WM has disputed A = A for darkᵂᴹ numbers A
    To be precise,
    he has disputed _saying_ 'A = A'

    ...which I guess indicates that he _agrees_ with it
    and dislikes how it messes up his "proofs".

    --- 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:11:05 2024
    "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> writes:

    On 7/10/2024 5:32 PM, Ben Bacarisse wrote:
    "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> writes:
    [...]
    For example, with these tiles, the sequence 1, 2, 1, 3 produces


    aa bb aa abb
    aab ba aab b

    r[0] = aa
    r[1] = bb
    r[3] = abb
    r[4] = aab
    r[5] = ba
    r[6] = b

    Where:

    r[0] r[1] r[0] r[3]
    r[4] r[5] r[4] r[6]


    Is a legit mapping?

    I have no idea why you numbered the strings like that. In C I might
    represent this example as:

    struct {
    char *top, *bottom;
    } tiles[3] = {
    { "", "" }, // dummy entry so we can use numbers 1 to 3
    { "aa", "aab" },
    { "bb", "ba" },
    { "abb", "b" }
    };

    and there is a solution because the concatenation of

    tile[1].top, tile[2].top, tile[1].top, tile[3].top

    and

    tile[1].bottom, tile[2].bottom, tile[1].bottom, tile[3].bottom

    are the same string. The solution being the sequence of indexes 1, 2,
    1, 3.

    Is that any help?

    --
    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 02:46:32 2024
    "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> writes:

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

    On 7/10/2024 4:29 PM, Moebius wrote:
    Am 11.07.2024 um 01:02 schrieb Moebius:
    Am 11.07.2024 um 01:00 schrieb Moebius:
    Am 11.07.2024 um 00:55 schrieb Moebius:

    Math SHOULD BE fun! (imho)

    Hmmm... It's quite clear that WM doesn't have ANY fun with math, I'd >>>>>> say.

    Actually, he doesn't DO any math.
    Most cranks don't to any (real) math, they just "criticizes" (sort of) >>>> things they don't really understand.

    If I am having a hard time understanding something, I ask/read around until >>> I can finally grasp the underlying meaning of the problem to a point where >>> I can code up a working solution. It has certainly tended worked for me in >>> the past.
    Here's and interesting problem to code up. The input is a finite array
    of n pairs of strings, so there are 2n strings in all. They are often
    thought of as strings on the top and bottom of a collection of tiles or
    dominos, but that just help visualise the problem. An example with n=3
    might be
    aa bb abb
    aab ba b

    Just making up an example:

    ab ab ab = ababab
    aba ba b = ababab

    Would that work?

    If I understand you, yes. It's a simple case where the tiles, used once
    in some order make a solution. In most cases is will be much harder to determine if there is a solution.

    Does each string need to be unique?

    No.

    --
    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 10:31:14 2024
    "Chris M. Thomasson" <chris.m.thomasson.1@gmail.com> writes:

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

    Just making up a quick example, I need to work on something else right
    now... Sorry Ben.

    No worries. I posted the problem because you said you like to "code
    things up" as a way of understanding and I thought you might find it interesting. But it's only interesting if you spend some time one it,
    so without time, there is no point.

    --
    Ben.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Fri Jul 12 17:04:50 2024
    Le 11/07/2024 à 02:52, Jim Burns a écrit :
    On 7/10/2024 6:55 PM, Moebius wrote:
    Am 11.07.2024 um 00:26 schrieb Chris M. Thomasson:

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

    For each element there is a rational that can represent it.

    Well, A = A? Agree!

    Just to keep things from becoming too clear...

    WM has disputed A = A for darkᵂᴹ numbers A
    To be precise,
    he has disputed _saying_ 'A = A'

    Dark numbers are equal to themselves. We cannot prove it, because we
    cannot know them. But it has to be assumed in any meaningful theory.
    Further it happens to be true for every dark number that becomes visible..


    ...which I guess indicates that he _agrees_ with it
    and dislikes how it messes up his "proofs".

    says a person who believes that by exchanging two elements one of them can
    be lost.

    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:29:53 2024
    Le 10/07/2024 à 19:58, Jim Burns a écrit :
    On 7/10/2024 12:02 PM, WM wrote:
    When you say that
    NUF(x) doesn't changeᵂᴹ at 0
    you mean that

    it does not change its value from x < 0, namely NUF(0) = 0.

    your argument depends upon
    it being unclear what you (WM) mean.

    That applies only for stupid readers. They will also not understand the results.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Jim Burns@21:1/5 to All on Fri Jul 12 16:23:41 2024
    On 7/12/2024 1:04 PM, WM wrote:
    Le 11/07/2024 à 02:52, Jim Burns a écrit :
    On 7/10/2024 6:55 PM, Moebius wrote:
    Am 11.07.2024 um 00:26 schrieb Chris M. Thomasson:

    (1, 1.4, 1.41, 1.414, ...)
    For each element
    there is a rational that can represent it.

    Well, A = A? Agree!

    Just to keep things from becoming too clear...
    WM has disputed A = A for darkᵂᴹ numbers A
    To be precise,
    he has disputed _saying_ 'A = A'

    Dark numbers are equal to themselves.

    There are no actuallyᵂᴹ.infinite sets
    (different from actuallyⁿᵒᵗᐧᵂᴹ.infinite sets).

    Actuallyᵂᴹ.infinite set A
    has no proper subset B into which A fits
    ⎛ no B ≠⊂ A and f: A→B: 1.to.1
    ⎝ A is finiteⁿᵒᵗᐧᵂᴹ
    but
    actuallyᵂᴹ.infinite set A
    has potentiallyᵂᴹ.infinite subset C which
    has proper subset D into which C fits
    ⎛ yes D ≠⊂ C ⊂ A and g: C→D: 1.to.1
    ⎝ C is infiniteⁿᵒᵗᐧᵂcᴹ

    An actuallyᵂᴹ.infinite set is
    a finiteⁿᵒᵗᐧᵂᴹ set with an infiniteⁿᵒᵗᐧᵂᴹ subset.

    No actuallyᵂᴹ.infinite set exists.
    because
    A\C∪D is a proper subset of A and
    f: A→A\C∪D: 1.to.1
    f(x) = g(x) for x ∈ C
    f(x) = x for x ∈ A\C

    No finiteⁿᵒᵗᐧᵂᴹ set with an infiniteⁿᵒᵗᐧᵂᴹ subset exists.

    We cannot prove it,
    because we cannot know them.
    But it has to be assumed in any meaningful theory.
    Further
    it happens to be true for
    every dark number that becomes visible.

    Which apparently agreesᵂᴹ with
    Dark numbers are equal to themselves.

    ...which I guess indicates that he _agrees_ with it
    and dislikes how it messes up his "proofs".

    says a person who believes that
    by exchanging two elements
    one of them can be lost.

    You (WM) are confused.
    I have never claimed ℵ₀ = 2

    ℵ₀ is the cardinality of
    cardinals which, when augmented, are bigger.

    If ℵ₀ is
    a cardinal which, when augmented, is bigger
    then
    there are at least ℵ₀+1 (by assumption, more.than.ℵ₀)
    cardinals which, when augmented, are bigger

    ...which there aren't.
    ℵ₀ -- not more.than.ℵ₀ -- is the cardinality of
    cardinals which, when augmented, are bigger.

    Therefore,
    the cardinality ℵ₀ of
    cardinals which, when augmented, are bigger,
    when augmented, is NOT bigger.

    The set ℕ⁺ᴮᵒᵇ of
    cardinals which, when augmented, are bigger plus Bob
    has the same cardinality ℵ₀ as
    the set ℕ of
    cardinals which, when augmented, are bigger.

    Bobbed ℕ⁺ᴮᵒᵇ fits in de.Bobbed ℕ
    Exists f: ℕ⁺ᴮᵒᵇ→ℕ: 1.to.1
    Bob ∉ f(ℕ⁺ᴮᵒᵇ)
    f disappears Bob.
    https://www.youtube.com/watch?v=TjAg-8qqR3g

    ℵ₀ ≠ 2

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Sat Jul 13 04:38:16 2024
    Am 12.07.2024 um 19:29 schrieb WM:
    Le 10/07/2024 à 19:58, Jim Burns a écrit :
    On 7/10/2024 12:02 PM, WM wrote:

    When you say that
    NUF(x) doesn't changeᵂᴹ at 0
    you mean that

    it does not change its value from x < 0, namely NUF(0) = 0.

    But it changes its value from aleph_0 for each and every x > 0 to 0 at x
    = 0, Du dummer Depp!

    your argument depends upon it being unclear what you (WM) mean.

    In der Tat, Du hirnloser Affe.

    That <bla bla bla>

    Geh scheißen, Mückenheim!

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Sat Jul 13 04:43:47 2024
    Am 12.07.2024 um 22:23 schrieb Jim Burns:

    You (WM) are confused.
    You think?

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Sat Jul 13 04:36:55 2024
    Am 12.07.2024 um 19:29 schrieb WM:
    Le 10/07/2024 à 19:58, Jim Burns a écrit :
    On 7/10/2024 12:02 PM, WM wrote:

    When you say that
    NUF(x) doesn't changeᵂᴹ at 0
    you mean that

    it does not change its value from x < 0, namely NUF(0) = 0.

    But it changes it's value from aleph_0 for each and every x > 0 to 0 at
    x = 0, Du dummer Depp!

    your argument depends upon
    it being unclear what you (WM) mean.

    In der Tat, Du hirnloser Affe.

    That <bla bla bla>

    Geh scheißen, Mückenheim!

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Sat Jul 13 15:43:08 2024
    Le 12/07/2024 à 22:23, Jim Burns a écrit :
    On 7/12/2024 1:04 PM, WM wrote:

    says a person who believes that
    by exchanging two elements
    one of them can be lost.

    I have never claimed ℵ₀ = 2

    You have claimed that by exchanging X and O an O can disappear, in fact infinitely many can disappear by pure exchange.

    The set ℕ⁺ᴮᵒᵇ of
    cardinals which, when augmented, are bigger plus Bob
    has the same cardinality ℵ₀ as

    Cardinality is nonsense as my proof shows. There is no counting but only exchanging. You cannot consistently argue with rules which are disproved.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Sat Jul 13 15:56:07 2024
    Le 13/07/2024 à 04:38, Moebius a écrit :
    Am 12.07.2024 um 19:29 schrieb WM:
    Le 10/07/2024 à 19:58, Jim Burns a écrit :

    When you say that
    NUF(x) doesn't changeᵂᴹ at 0
    you mean that

    it does not change its value from x < 0, namely NUF(0) = 0.

    But it changes its value from aleph_0 for each and every x > 0 to 0 at x
    = 0,

    That claim is wrong, easily disproved by the fact, that ℵo unit
    fractions cannot be compressed between [0, oo) and (0, oo).

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Sat Jul 13 21:37:08 2024
    Am 13.07.2024 um 17:56 schrieb WM:
    Le 13/07/2024 à 04:38, Moebius a écrit :
    Am 12.07.2024 um 19:29 schrieb WM:
    Le 10/07/2024 à 19:58, Jim Burns a écrit :

    When you say that
    NUF(x) doesn't changeᵂᴹ at 0
    you mean that
    ;
    it does not change its value from x < 0, namely NUF(0) = 0.

    But it changes its value from aleph_0 for each and every x > 0 to 0 at
    x = 0,

    That claim is wrong,

    Nope. Aber Du bist zu dumm für jede Art von Mathematik, Mückenheim.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Jim Burns@21:1/5 to All on Sat Jul 13 17:55:26 2024
    On 7/13/2024 11:43 AM, WM wrote:
    Le 12/07/2024 à 22:23, Jim Burns a écrit :
    On 7/12/2024 1:04 PM, WM wrote:

    says a person who believes that
    by exchanging two elements
    one of them can be lost.

    I have never claimed ℵ₀ = 2

    You have claimed that
    by exchanging X and O an O can disappear,

    Yes.
    f(j) := (j=Bob ? 1 : j⁺¹)
    (Perl ternary conditional operator)
    f: ℕ₁⁺ᴮᵒᵇ → ℕ₁: 1.to.1
    Bob ∉ f(ℕ₁⁺ᴮᵒᵇ)

    in fact
    infinitely many can disappear by pure exchange.

    Yes.
    g⟨j,k⟩ := ⟨ (j+k-1)(j+k-2)/2+j, 1 ⟩
    g: ℕ₁×ℕ₁ → ℕ₁×{1}: 1.to.1
    ∀⟨j,k⟩ ∈ ℕ₁×(ℕ₁\{1}): ⟨j,k⟩ ∉ g(ℕ₁×ℕ₁)

    The set ℕ⁺ᴮᵒᵇ of
    cardinals which, when augmented, are bigger plus Bob
    has the same cardinality ℵ₀ as

    Cardinality is nonsense as my proof shows.
    There is no counting but only exchanging.

    There are
    f(j) := (j=Bob ? 1 : j⁺¹)
    and
    g⟨j,k⟩ := ⟨ (j+k-1)(j+k-2)/2+j, 1 ⟩

    You cannot consistently argue with
    rules which are disproved.

    The Disappearing.Bob Proposal:
    ⎛ Equi.membered sets are the same set.
    ⎜ Empty set ∅ exists.
    ⎝ Adjunct X∪{Y} exists for existing sets X and Y

    From the Disappearing Bob Proposal,
    it follows not.first.false.ly
    that familiar natural.number arithmetic
    is consistent
    that functions f(j) and g⟨j,k⟩ which, respectively,
    disappear Bob and ℕ₁×(ℕ₁\{1})
    exist.


    You have the definitions of f and g in front of you.
    Your argument against believing your lying eyes is that
    ℕ₁⁺ᴮᵒᵇ and ℕ₁×ℕ₁ don't act like finiteⁿᵒᵗᐧᵂᴹ sets.

    You crow that I and others don't understand
    your argument that
    ℕ₁⁺ᴮᵒᵇ and ℕ₁×ℕ₁ don't act like finiteⁿᵒᵗᐧᵂᴹ sets.

    I and others understand your argument that
    ℕ₁⁺ᴮᵒᵇ and ℕ₁×ℕ₁ don't act like finiteⁿᵒᵗᐧᵂᴹ sets.

    What we also which understand and you (WM) don't is that
    ℕ₁⁺ᴮᵒᵇ and ℕ₁×ℕ₁ aren't finiteⁿᵒᵗᐧᵂᴹ sets, and
    not.acting like they are is appropriate to their nature.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Sun Jul 14 02:15:01 2024
    Am 13.07.2024 um 17:43 schrieb WM:

    Cardinality is

    a very useful notion, Mückenheim.

    Du bist halt zu blöde für JEDE Art von Mathematik, da kann man nichts
    machen.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Sun Jul 14 12:58:53 2024
    Le 13/07/2024 à 21:37, Moebius a écrit :
    Am 13.07.2024 um 17:56 schrieb WM:
    Le 13/07/2024 à 04:38, Moebius a écrit :
    Am 12.07.2024 um 19:29 schrieb WM:
    Le 10/07/2024 à 19:58, Jim Burns a écrit :

    When you say that
    NUF(x) doesn't changeᵂᴹ at 0
    you mean that
    ;
    it does not change its value from x < 0, namely NUF(0) = 0.

    But it changes its value from aleph_0 for each and every x > 0 to 0 at
    x = 0,

    That claim is wrong,

    Nope.

    That claim is wrong, easily disproved by the fact, that ℵo unit
    fractions cannot be compressed between [0, oo) and (0, oo).

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Sun Jul 14 13:16:05 2024
    Le 13/07/2024 à 23:55, Jim Burns a écrit :
    On 7/13/2024 11:43 AM, WM wrote:
    Le 12/07/2024 à 22:23, Jim Burns a écrit :
    On 7/12/2024 1:04 PM, WM wrote:

    says a person who believes that
    by exchanging two elements
    one of them can be lost.

    I have never claimed ℵ₀ = 2

    You have claimed that
    by exchanging X and O an O can disappear,

    Yes.

    That disqualifies you from any serious discussion.

    in fact
    infinitely many can disappear by pure exchange.

    Yes.

    Laughable. Are you aware that nobody followed you?

    What we also which understand and you (WM) don't is that
    ℕ₁⁺ᴮᵒᵇ and ℕ₁×ℕ₁ aren't finiteⁿᵒᵗᐧᵂᴹ sets,

    Logic remains valid for all correct mathematics, finite and infinite.

    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:04:03 2024
    Am 14.07.2024 um 14:58 schrieb WM:
    Le 13/07/2024 à 21:37, Moebius a écrit :
    Am 13.07.2024 um 17:56 schrieb WM:
    Le 13/07/2024 à 04:38, Moebius a écrit :
    Am 12.07.2024 um 19:29 schrieb WM:
    Le 10/07/2024 à 19:58, Jim Burns a écrit :

    When you say that
    NUF(x) doesn't changeᵂᴹ at 0
    you mean that
    ;
    it does not change its value from x < 0, namely NUF(0) = 0.

    But it changes its value from aleph_0 for each and every x > 0 to 0
    at x = 0,

    That claim is wrong,

    Nope.

    That claim is wrong,

    Nope.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Sun Jul 14 17:27:55 2024
    Am 14.07.2024 um 17:04 schrieb Moebius:
    Am 14.07.2024 um 14:58 schrieb WM:
    Le 13/07/2024 à 21:37, Moebius a écrit :
    Am 13.07.2024 um 17:56 schrieb WM:
    Le 13/07/2024 à 04:38, Moebius a écrit :
    Am 12.07.2024 um 19:29 schrieb WM:
    Le 10/07/2024 à 19:58, Jim Burns a écrit :

    When you say that
    NUF(x) doesn't changeᵂᴹ at 0
    you mean that
    ;
    it does not change its value from x < 0, namely NUF(0) = 0.

    But it changes its value from aleph_0 for each and every x > 0 to 0
    at x = 0,

    That claim is wrong,

    Nope.

    That claim is wrong,

    Nope.

    Hinweis:

    For each and every x e IR, x > 0: NUF(x) = aleph_0
    and for each and every x e IR, x <= 0: NUF(x) = 0.

    That's a change, isn't it?

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Jim Burns@21:1/5 to All on Sun Jul 14 16:37:40 2024
    On 7/14/2024 9:16 AM, WM wrote:
    Le 13/07/2024 à 23:55, Jim Burns a écrit :
    On 7/13/2024 11:43 AM, WM wrote:
    Le 12/07/2024 à 22:23, Jim Burns a écrit :
    On 7/12/2024 1:04 PM, WM wrote:

    says a person who believes that
    by exchanging two elements
    one of them can be lost.

    I have never claimed ℵ₀ = 2

    You have claimed that
    by exchanging X and O an O can disappear,

    Yes.

    That disqualifies you from any serious discussion.

    E pur si muove.

    f(j) := (j=Bob ? 1 : j⁺¹)
    (Perl ternary conditional operator)
    f: ℕ₁⁺ᴮᵒᵇ → ℕ₁: 1.to.1
    Bob ∉ f(ℕ₁⁺ᴮᵒᵇ)

    in fact infinitely many can disappear
    by pure exchange.

    Yes.

    Laughable.
    Are you aware that nobody followed you?

    E pur si muove.

    g⟨j,k⟩ := ⟨ (j+k-1)(j+k-2)/2+j, 1 ⟩
    g: ℕ₁×ℕ₁ → ℕ₁×{1}: 1.to.1
    ∀⟨j,k⟩ ∈ ℕ₁×(ℕ₁\{1}): ⟨j,k⟩ ∉ g(ℕ₁×ℕ₁)

    What we also [understand which] you (WM) don't is that
    ℕ₁⁺ᴮᵒᵇ and ℕ₁×ℕ₁ aren't finiteⁿᵒᵗᐧᵂᴹ sets,

    Logic remains valid for all correct mathematics,
    finite and infinite.

    Finiteⁿᵒᵗᐧᵂᴹ.set A
    can be finitelyᴶᴮ.ordered.

    A finiteᴶᴮ.order '<' of set A
    is trichotomous, and
    each nonempty.subset B of A
    holds a firstᑉ B.element and a lastᑉ B.element.

    An infiniteᴶᴮ.order '<₂'of set C
    is trichotomous and not finiteᴶᴮ --
    one or more nonempty.subset D of C
    _lacks_ a firstᑉ² D.element or a lastᑉ² D.element.

    No set has
    both a finiteᴶᴮ.order and an infiniteᴶᴮ.order.


    The familiar order '<' of familiar ℕ
    is an infiniteᴶᴮ.order.

    Familiar ℕ is an infiniteⁿᵒᵗᐧᵂᴹ set.

    Each nonempty subset B of ℕ
    in the familiar order '<'
    holds a firstᑉ B.element.

    For each j in ℕ
    there is nextᑉ j⁺¹ > j in ℕ\{0}

    For each k in ℕ\{0}
    there is nextᑉ k⁻¹ < k in ℕ

    E pur si muove.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Mon Jul 15 03:09:47 2024
    Am 14.07.2024 um 15:16 schrieb WM:

    Are you aware that nobody followed you?

    Are YOU aware that nobody follows YOU, Mückenheim?

    Actually, Jim "approach" is indeed "questionable" (imho), but there is a
    way to formulate it in a sensible way. And the result is: Bye Bob!

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Mon Jul 15 12:41:03 2024
    Le 14/07/2024 à 17:27, Moebius a écrit :

    For each and every x e IR, x > 0: NUF(x) = aleph_0

    Wrong. All unit fractions are separated. Therefore there is a first one at
    y. NUF(y) = 1.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Mon Jul 15 12:21:52 2024
    Le 14/07/2024 à 17:04, Moebius a écrit :
    Am 14.07.2024 um 14:58 schrieb WM:
    Le 13/07/2024 à 21:37, Moebius a écrit :
    Am 13.07.2024 um 17:56 schrieb WM:
    Le 13/07/2024 à 04:38, Moebius a écrit :
    Am 12.07.2024 um 19:29 schrieb WM:
    Le 10/07/2024 à 19:58, Jim Burns a écrit :

    When you say that
    NUF(x) doesn't changeᵂᴹ at 0
    you mean that
    ;
    it does not change its value from x < 0, namely NUF(0) = 0.

    But it changes its value from aleph_0 for each and every x > 0 to 0
    at x = 0,

    That claim is wrong,

    Nope.

    That claim is wrong,

    Nope.

    That claim has been disproved. Something that is before each and every x >
    0 sits at zero or at the negative real line.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From joes@21:1/5 to All on Mon Jul 15 13:33:08 2024
    Am Mon, 15 Jul 2024 12:21:52 +0000 schrieb WM:
    Le 14/07/2024 à 17:04, Moebius a écrit :
    Am 14.07.2024 um 14:58 schrieb WM:
    Le 13/07/2024 à 21:37, Moebius a écrit :
    Am 13.07.2024 um 17:56 schrieb WM:
    Le 13/07/2024 à 04:38, Moebius a écrit :
    Am 12.07.2024 um 19:29 schrieb WM:
    Le 10/07/2024 à 19:58, Jim Burns a écrit :

    When you say that NUF(x) doesn't changeᵂᴹ at 0 you mean that >>>>>>  > it does not change its value from x < 0, namely NUF(0) = 0.

    But it changes its value from aleph_0 for each and every x > 0 to 0 >>>>>> at x = 0,

    That claim has been disproved. Something that is before each and every x
    0 sits at zero or at the negative real line.
    As has been repeated, there is no single fixed number less than all/every
    other number. However, every number has a smaller one. Do you understand
    the difference?

    --
    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 13:59:51 2024
    Le 15/07/2024 à 03:09, Moebius a écrit :
    Am 14.07.2024 um 15:16 schrieb WM:

    Are you aware that nobody followed you?

    Are YOU aware that nobody follows YOU, Mückenheim?

    You are in error. There is a group of mathematicians discussion dark
    numbers.

    Actually, Jim "approach" is indeed "questionable" (imho), but there is a
    way to formulate it in a sensible way. And the result is: Bye Bob!

    Nonsense remains nonsense in every formulation. Loss by exchange is purest nonsense.

    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:19:36 2024
    Le 15/07/2024 à 15:33, joes a écrit :
    Am Mon, 15 Jul 2024 12:21:52 +0000 schrieb WM:
    Le 14/07/2024 à 17:04, Moebius a écrit :
    Am 14.07.2024 um 14:58 schrieb WM:
    Le 13/07/2024 à 21:37, Moebius a écrit :
    Am 13.07.2024 um 17:56 schrieb WM:
    Le 13/07/2024 à 04:38, Moebius a écrit :
    Am 12.07.2024 um 19:29 schrieb WM:
    Le 10/07/2024 à 19:58, Jim Burns a écrit :

    When you say that NUF(x) doesn't changeᵂᴹ at 0 you mean that >>>>>>>  > it does not change its value from x < 0, namely NUF(0) = 0.

    But it changes its value from aleph_0 for each and every x > 0 to 0 >>>>>>> at x = 0,

    That claim has been disproved. Something that is before each and every x
    0 sits at zero or at the negative real line.
    As has been repeated, there is no single fixed number less than all/every other number.

    Hence your claim that for every x > 0: NUF(x) = ℵo, is blatantly wrong.

    However, every number has a smaller one. Do you understand
    the difference?

    The function NUF(x) counts only real points. They are separated. Therefore there is a first unit fraction. It is an x, a single number which
    contradicts your claim.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Jim Burns@21:1/5 to All on Mon Jul 15 15:37:00 2024
    On 7/15/2024 8:21 AM, WM wrote:
    Le 14/07/2024 à 17:04, Moebius a écrit :
    Am 14.07.2024 um 14:58 schrieb WM:
    Le 13/07/2024 à 21:37, Moebius a écrit :
    Am 13.07.2024 um 17:56 schrieb WM:
    Le 13/07/2024 à 04:38, Moebius a écrit :
    Am 12.07.2024 um 19:29 schrieb WM:
    Le 10/07/2024 à 19:58, Jim Burns a écrit :

    When you say that
    NUF(x) doesn't changeᵂᴹ at 0
    you mean that

    it does not change its value from x < 0,
    namely NUF(0) = 0.

    But it changes its value from aleph_0
    for each and every x > 0
    to 0 at x = 0,

    That claim is wrong,

    Nope.

    That claim is wrong,

    Nope.

    That claim has been disproved.

    You (WM) are confused about what that claim is.

    Something that is before each and every x > 0
    sits at zero or at the negative real line.

    ⎛ That claim is not that
    ⎜ one unit fraction or ℵ₀.many unit.fractions
    ⎝ sit at zero or at the negative real line.

    Each ℵ₀.sequenceᴶᴮ matches each ℵ₀.sequenceᴶᴮ element.to.element.
    Each ℵ₀.sequenceᴶᴮ holds ℵ₀.many.

    For ℵ₀.sequenceᴶᴮ A ordered by '<'
    ⎛ for each nonempty B ⊆ A: firstᑉ.B ∈ B
    ⎜ for each j ∈ A: first.afterᑉ.j ∈ A\{firstᑉ.A}
    ⎝ for each k ∈ A\{firstᑉ.A}: last.beforeᑉ.k ∈ A


    For each real x > 0
    the unit fractions ⅟ℕ∩(0,x] ordered by '>'
    is an ℵ₀.sequenceᴶᴮ and holds ℵ₀.many

    ...because...

    For each nonempty B ⊆ ⅟ℕ∩(0,x]
    ⅟B = {⅟u: u ∈ B} is a nonempty subset of ℕ
    exists min.⅟B ∈ ⅟B ⊆ ℕ
    ⅟(min.⅟B) = max.B ∈ B

    max.(⅟ℕ∩(0,x]) = ⅟⌈⅟x⌉

    For each u ∈ ⅟ℕ∩(0,x]: ⅟(1+⅟u) ∈ ⅟ℕ∩(0,x]\{⅟⌈⅟x⌉}

    For each v ∈ ⅟ℕ∩(0,x]\{⅟⌈⅟x⌉}: ⅟(-1+⅟v) ∈ ⅟ℕ∩(0,x]

    Therefore,
    for each real x > 0
    the unit fractions ⅟ℕ∩(0,x] ordered by '>'
    is an ℵ₀.sequenceᴶᴮ and holds ℵ₀.many
    and NUF(x) = |⅟ℕ∩(0,x]| = ℵ₀

    ∀ᴿx>0: NUF(x) = ℵ₀

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From joes@21:1/5 to All on Mon Jul 15 21:08:58 2024
    Am Mon, 15 Jul 2024 14:19:36 +0000 schrieb WM:
    Le 15/07/2024 à 15:33, joes a écrit :
    Am Mon, 15 Jul 2024 12:21:52 +0000 schrieb WM:
    Le 14/07/2024 à 17:04, Moebius a écrit :
    Am 14.07.2024 um 14:58 schrieb WM:
    Le 13/07/2024 à 21:37, Moebius a écrit :
    Am 13.07.2024 um 17:56 schrieb WM:
    Le 13/07/2024 à 04:38, Moebius a écrit :
    Am 12.07.2024 um 19:29 schrieb WM:
    Le 10/07/2024 à 19:58, Jim Burns a écrit :

    When you say that NUF(x) doesn't changeᵂᴹ at 0 you mean that >>>>>>>>  > it does not change its value from x < 0, namely NUF(0) = 0. >>>>>>>> But it changes its value from aleph_0 for each and every x > 0 to >>>>>>>> 0 at x = 0,
    That claim has been disproved. Something that is before each and every
    x 0 sits at zero or at the negative real line.
    As has been repeated, there is no single fixed number less than
    all/every other number.
    Hence your claim that for every x > 0: NUF(x) = ℵo, is blatantly wrong.
    I don't see how that follows.

    However, every number has a smaller one. Do you understand the
    difference?
    The function NUF(x) counts only real points. They are separated.
    Real as in elements of R?

    Therefore there is a first unit fraction. It is an x, a single number
    which contradicts your claim.
    Non sequitur. Like Moebius said, 1/(1+1/x) is smaller.

    --
    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 Tom Bola@21:1/5 to All on Tue Jul 16 00:07:23 2024
    Am 15.07.2024 21:08:58 joes schrieb:
    Am Mon, 15 Jul 2024 14:19:36 +0000 schrieb WM:
    Le 15/07/2024 à 15:33, joes a écrit :
    Am Mon, 15 Jul 2024 12:21:52 +0000 schrieb WM:
    Le 14/07/2024 à 17:04, Moebius a écrit :
    Am 14.07.2024 um 14:58 schrieb WM:
    Le 13/07/2024 à 21:37, Moebius a écrit :
    Am 13.07.2024 um 17:56 schrieb WM:
    Le 13/07/2024 à 04:38, Moebius a écrit :
    Am 12.07.2024 um 19:29 schrieb WM:
    Le 10/07/2024 à 19:58, Jim Burns a écrit :

    When you say that NUF(x) doesn't changeᵂᴹ at 0 you mean that >>>>>>>>>  > it does not change its value from x < 0, namely NUF(0) = 0. >>>>>>>>> But it changes its value from aleph_0 for each and every x > 0 to >>>>>>>>> 0 at x = 0,
    That claim has been disproved. Something that is before each and every >>>> x 0 sits at zero or at the negative real line.
    As has been repeated, there is no single fixed number less than
    all/every other number.
    Hence your claim that for every x > 0: NUF(x) = ℵo, is blatantly wrong.
    I don't see how that follows.

    However, every number has a smaller one. Do you understand the
    difference?
    The function NUF(x) counts only real points. They are separated.
    Real as in elements of R?

    WM states (always) there what he feels inside his brain. Magnificat!

    Therefore there is a first unit fraction. It is an x, a single number
    which contradicts your claim.
    Non sequitur. Like Moebius said, 1/(1+1/x) is smaller.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Tom Bola@21:1/5 to All on Tue Jul 16 00:11:30 2024
    Am 15.07.2024 23:57:09 Moebius schrieb:

    Am 15.07.2024 um 15:33 schrieb joes:
    Am Mon, 15 Jul 2024 12:21:52 +0000 schrieb WM:
    Le 14/07/2024 à 17:04, Moebius a écrit :
    Am 14.07.2024 um 14:58 schrieb WM:
    Le 13/07/2024 à 21:37, Moebius a écrit :
    Am 13.07.2024 um 17:56 schrieb WM:
    Le 13/07/2024 à 04:38, Moebius a écrit :
    Am 12.07.2024 um 19:29 schrieb WM:
    ; Le 10/07/2024 à 19:58, Jim Burns a écrit :

    ; When you say that NUF(x) doesn't changeᵂᴹ at 0 you mean that >>>>>>>>  > it does not change its value from x < 0, namely NUF(0) = 0. >>>>>>>>
    But it changes its value from aleph_0 for each and every x > 0 to 0 >>>>>>>> at x = 0,

    That claim has been disproved. Something that is before each and every x > 0
    sits at zero or at the negative real line.

    As has been repeated, there is no single fixed number less than all/every
    other number. However, every number has a smaller one. Do you understand
    the difference?

    Wie schon ein paar Mal (also ein paar 100-mal) erwähnt, scheint
    Mückenheim nicht fähig (oder gewillt) zu sein, zwischen

    Ax Ey (y < x)
    und
    Ex Ay (y < x)

    zu unterscheiden. Der Mann hat einen schweren Dachschaden, das steht fest.

    Und das bedeutet, dass du das noch einige Tausende Male wiederkäuen wirst
    oder der Herr im Himmel dir zeige, dass du etwas anderes erzählen musst,
    wenn du m i t WM nicht immer weiter erfolglos herumlabern willst.

    Der Rest, also deine (sich wiederholenden) Selbstgespräche, sind langweilig.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Mon Jul 15 23:57:09 2024
    Am 15.07.2024 um 15:33 schrieb joes:
    Am Mon, 15 Jul 2024 12:21:52 +0000 schrieb WM:
    Le 14/07/2024 à 17:04, Moebius a écrit :
    Am 14.07.2024 um 14:58 schrieb WM:
    Le 13/07/2024 à 21:37, Moebius a écrit :
    Am 13.07.2024 um 17:56 schrieb WM:
    Le 13/07/2024 à 04:38, Moebius a écrit :
    Am 12.07.2024 um 19:29 schrieb WM:
    ; Le 10/07/2024 à 19:58, Jim Burns a écrit :

    ; When you say that NUF(x) doesn't changeᵂᴹ at 0 you mean that >>>>>>>  > it does not change its value from x < 0, namely NUF(0) = 0. >>>>>>>
    But it changes its value from aleph_0 for each and every x > 0 to 0 >>>>>>> at x = 0,

    That claim has been disproved. Something that is before each and every x > 0 >> sits at zero or at the negative real line.

    As has been repeated, there is no single fixed number less than all/every other number. However, every number has a smaller one. Do you understand
    the difference?

    Wie schon ein paar Mal (also ein paar 100-mal) erwähnt, scheint
    Mückenheim nicht fähig (oder gewillt) zu sein, zwischen

    Ax Ey (y < x)
    und
    Ex Ay (y < x)

    zu unterscheiden. Der Mann hat einen schweren Dachschaden, das steht fest.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Tue Jul 16 01:57:19 2024
    Am 16.07.2024 um 00:11 schrieb Tom Bola:
    Am 15.07.2024 23:57:09 Moebius schrieb:

    Wie schon ein paar Mal (also ein paar 100-mal) erwähnt, scheint
    Mückenheim nicht fähig (oder gewillt) zu sein, zwischen

    Ax Ey (y < x)
    und
    Ex Ay (y < x)

    zu unterscheiden. [...]

    Mal etwas für Kenner: Diese Unterscheidung muss man nicht nur bei einer aktualen Auffassung der Unendlichkeit (wie in der _Mengenlehre_),
    sondern auch bei einer "potentialistischen" Auffassung des Unendlichen
    machen.

    Zweifellos gibt es bei letzterer zu jedem Stammbruch, den man
    konstruieren kann, einen kleineren Stammbruch, den man konstruieren kann
    (vgl. Streckenteilung in der Geometrie). Es gibt aber auch hier keinen Stammbruch, den man konstruieren kann, der kleiner ist als alle
    Stammbrüche, die man konstruieren kann.

    Schon merkwürdig, dass ein Mann, der "Geschichte des Unendlichen" an der Technischen Hochschule Augsburg lehrt, das nicht begreift/versteht.

    -------------------------------------------------------------------------

    Schlimmer noch, in einem universe of discourse mit mehr als einem
    Element (einer Entität), also in so ziemlich jedem nichttrivialen
    universe of discourse, gilt natürlich

    Ax Ey (x =/= y) ,
    NICHT ABER
    Ey Ax (x =/= y) .

    Es empfiehlt sich also, Ax Ey ...x...y... nicht für gleichbedeutend zu
    halten mit Ey Ax ...x...y..., wie Herr Mückenheim das tut.

    Siehe auch: https://en.wikipedia.org/wiki/Quantifier_shift

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Tue Jul 16 01:20:08 2024
    Am 16.07.2024 um 00:11 schrieb Tom Bola:

    wenn du m i t WM nicht immer weiter erfolglos herumlabern willst.

    Wer will denn das?

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Tue Jul 16 02:09:07 2024
    Am 16.07.2024 um 01:57 schrieb Moebius:

    Siehe auch: https://en.wikipedia.org/wiki/Quantifier_shift

    Hier wird als ein Beispiel für diesen Fehlschluss angeführt:

    3. Every natural number 𝑛 has a successor 𝑚 = 𝑛 + 1, the smallest of all natural numbers that are greater than 𝑛. Therefore, there is a
    natural number 𝑚 that is a successor to all natural numbers.

    ∀𝑛 ∃𝑚 𝑆𝑛𝑚 ⊢ ∃𝑚 ∀𝑛 𝑆𝑛𝑚.

    It is fallacious to conclude that there is a single natural number that
    is the successor of every natural number.

    Für Mückenheim ist es nun aber so, dass wegen seiner "Gleichsetzung" von ∀𝑛 ∃𝑚 𝑆𝑛𝑚 mit ∃𝑚 ∀𝑛 𝑆𝑛𝑚 eben ∀𝑛 ∃𝑚 𝑆𝑛𝑚 ∃𝑚 ∀𝑛 𝑆𝑛𝑚
    "impliziert" (besser gleichbedeutend ist mit ∃𝑚 ∀𝑛 𝑆𝑛𝑚).

    Im Mückenland gibt es daher eine natürliche Zahl, die "Successor" jeder natürlichen Zahl ist (also auch von sich selbst); d a s ist die größte natürliche Zahl!

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

    There are infinite successors to any finite number?

    Depends on the definition of /successor/, usually the "immediate"
    successor is meant.

    In this case each and every natural number has exactly one successor.

    Say, 5:

    5 + 1

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Tue Jul 16 03:27:12 2024
    Am 16.07.2024 um 00:32 schrieb Chris M. Thomasson:
    On 7/15/2024 5:41 AM, WM wrote:
    Le 14/07/2024 à 17:27, Moebius a écrit :

    For each and every x e IR, x > 0: NUF(x) = aleph_0

    Wrong. All unit fractions are separated. Therefore there is a first
    one at y. NUF(y) = 1.

    There is a first unit fraction at 1/1. There is no last unit fraction.
    Get over it man!

    Note that in the usual order < (defined on the rationals) 1/1 ist the last/largest unit fraction, while there IS NO first/smallest unit fraction:

    ... < 1/3 < 1/2 < 1/1.

    Mückenheim ist just talking nonsense.

    "All unit fractions are separated. Therefore Therefore there is a first
    one at y" is just an instance of a NON SEQUITUR.

    This man is dumb like shit.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Tue Jul 16 03:39:26 2024
    Am 16.07.2024 um 03:27 schrieb Chris M. Thomasson:

    Naturals:

    a = any natural number
    b = a + 1 is the /successor/ of a?

    ;^)

    Hell, man, you are asking questions... :-)

    Ok, starting with the Peano-axioms there is a functions called /the
    successor function/ s. Then THE successor of, say, n is s(n). :-)

    Based on the Peano-axioms we usually define "addition" + ("recursively")
    the following way:

    n + 0 = n
    n + s(m) = s(n + m).

    Moreover we (usually) have the definition:

    1 := s(0).
    "1 is the successor of 0".

    Hence

    n + 1 = n + s(0) = s(n + 0) = s(n).

    So, yes, a + 1 is indeed the successor of a (for any a e IN).

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Tue Jul 16 03:47:13 2024
    Am 16.07.2024 um 03:32 schrieb Chris M. Thomasson:

    going left to right, so to speak, [...]

    1/1, 1/2, 1/3, 1/4, ...

    Nope, here you are going "from right to left" (on the real line).

    You see, 1/1 is larger than, say, 1/2, hence on "the real line" 1/1 is
    RIGHT from 1/2. No?

    Hint:

    ... | ... | ... | ... (real line)

    0 1/2 1/1 (=1)

    Huh? WM is backwards?

    Actually, not. :-)

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Tue Jul 16 03:59:32 2024
    Am 16.07.2024 um 03:53 schrieb Chris M. Thomasson:

    0 is origin!

    Agree! :-)

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Tue Jul 16 03:57:42 2024
    Am 16.07.2024 um 03:49 schrieb Chris M. Thomasson:
    On 7/15/2024 6:47 PM, Moebius wrote:
    Am 16.07.2024 um 03:32 schrieb Chris M. Thomasson:

    going left to right, so to speak, [...]

    1/1, 1/2, 1/3, 1/4, ...

    Nope, here you are going "from right to left" (on the real line).

    You see, 1/1 is larger than, say, 1/2, hence on "the real line" 1/1 is
    RIGHT from 1/2. No?

    Hint:

    ... | ... | ... | ... (real line)

         0    1/2   1/1 (=1)

    Huh? WM is backwards?

    Actually, not. :-)

    Actually, my real line is, say

    ...-1...0...+1...


    Seems poor. :-P

    Let's fill in some unit fractions (at least 1/2). :-)

    ...| ... | ... | ... | ... (real line)
    -1 0 1/2 1/1 (=1)

    So, left to right with origin at zero [...] the natural numbers, starting at zero the
    origin of the real line:

    0, 1, 2, 3, 4, ...

    Right. But ALL unit fractions are between 0 and 1 (incl.). :-)

    0 is at origin point on my real line, the x axis so to speak. It has an origin at 0. Fair enough?

    Sure. Why do you ask? :-P

    Left of zero, or origin if you will, is negative, right of zero is positive...

    Yeah.

    And between 0 and 1 (=1/1) there are the unit fractions 1/2, 1/3, ...:

    0 < ... < 1/3 < 1/2 < 1/1 .

    See? :-P

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Tue Jul 16 04:04:51 2024
    Am 16.07.2024 um 03:59 schrieb Chris M. Thomasson:

    all of the signed imaginary parts go off axis. [...]

    No Power to Drugs! :-)

    Hint: We were speaking about the "real line" (or the real numbers) and
    "unit fractions" (as a part of this line), you know.

    lol

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Tue Jul 16 04:16:16 2024
    Am 16.07.2024 um 04:02 schrieb Chris M. Thomasson:
    On 7/15/2024 6:57 PM, Moebius wrote:

    See? :-P

    I see that you increased the granularity from natural numbers into the unit fractions...

    Yeah, the real numbers comprise the naturals, the integers, the unit
    fractons, the rational numbers, ..., you know. :-)

    Wrt enumeration unit fractions I like to go from 1/1, to 1/2, to 1/3,
    ect...

    You may like to do that, still:

    ... < 1/3 < 1/2 < 1/1.

    Meaning: Concening the < relation as _defined on the reals_ (as well on
    the rationals) 1/3 is SMALLER than 1/2 and 1/2 is smaller than 1/1. In
    general: 1/(n+1) is smaller than 1/n.

    Is that wrong?

    Nope. You may define a SEQUENCE (of unit fractions):

    (1/1, 1/2, 1/3, ...)

    Here (referring to these sequence) 1/1 is "before", say, 1/2. :-)

    we have to think of a a smallest unit fraction, WM world, right?

    Right. There simply is no such unit fraction because for each and every
    unit fraction u: 1/(1/u + 1) is a unit fraction that is smaller than u.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Tue Jul 16 04:55:06 2024
    Repost:

    Am 16.07.2024 um 04:02 schrieb Chris M. Thomasson:
    On 7/15/2024 6:57 PM, Moebius wrote:

    See? 😛

    I see that you increased the granularity from natural numbers into
    the unit fractions...

    Yeah, the real numbers comprise the naturals, the integers, the unit
    fractons, the rational numbers, ..., you know. 🙂

    Wrt enumeration unit fractions I like to go from 1/1, to 1/2, to 1/3,
    ect...

    You may like to do that, still:

    0 < ... < 1/3 < 1/2 < 1/1.

    Meaning: Concening the < relation as _defined on the reals_ (as well on
    the rationals) 1/3 is SMALLER than 1/2 and 1/2 is smaller than 1/1. In
    general: 1/(n+1) is smaller than 1/n.

    Is that wrong?

    Nope. You may define a SEQUENCE (of unit fractions):

    (1/1, 1/2, 1/3, ...)

    Here (referring to these sequence) 1/1 is "before", say, 1/2. 🙂

    we have to think of a a smallest unit fraction, WM world, right?

    Right. There simply is no such unit fraction because for each and every
    unit fraction u: 1/(1/u + 1) is a unit fraction that is smaller than u.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Tue Jul 16 05:08:33 2024
    Am 16.07.2024 um 04:55 schrieb Moebius:
    Repost:

    Am 16.07.2024 um 04:02 schrieb Chris M. Thomasson:
    On 7/15/2024 6:57 PM, Moebius wrote:

    See? 😛

    I see that you increased the granularity from natural numbers into the unit fractions...

    Yeah, the real numbers comprise the naturals, the integers, the unit fractons, the rational numbers, ..., you know. 🙂

    Wrt enumeration unit fractions I like to go from 1/1, to 1/2, to 1/3, ect...


    You may like to do that, still:

    0 < ... < 1/3 < 1/2 < 1/1.

    Meaning: Concening the < relation as _defined on the reals_ (as well on
    the rationals) 1/3 is SMALLER than 1/2 and 1/2 is smaller than 1/1. In general: 1/(n+1) is smaller than 1/n.

    Is that wrong?

    Nope. You may define a SEQUENCE (of unit fractions):

    (1/1, 1/2, 1/3, ...)

    Here (referring to these sequence) 1/1 is "before", say, 1/2. 🙂

    we have to think of a a smallest unit fraction, WM world, right?

    Right. There simply is no such unit fraction because for each and every
    unit fraction u: 1/(1/u + 1) is a unit fraction that is smaller than u.

    Of course, we may consider the set {1/1, 1/2, 1/3, ...} of all unit
    fractions and define a certain order << on it, such that

    1/1 << 1/2 << 1/3 << ... .

    But this is NOT the order WM is referring to. WM is referring to the
    usual order < as defined on the reals (or rationals). There

    0 < ... < 1/3 < 1/2 < 1/1.

    Nuff said. (Ufff...)

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Tue Jul 16 13:12:25 2024
    Le 15/07/2024 à 21:37, Jim Burns a écrit :

    ∀ᴿx>0: NUF(x) = ℵ₀

    Not for the first few x > 0. ℵ₀ unit fractions occupy ℵ₀ finite intervals. The points of the first one already disprove your nonsense.

    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:16:19 2024
    Le 15/07/2024 à 23:08, joes a écrit :
    Am Mon, 15 Jul 2024 14:19:36 +0000 schrieb WM:

    Hence your claim that for every x > 0: NUF(x) = ℵo, is blatantly wrong.
    I don't see how that follows.

    Do you believe in the reality of finite real intervals?
    ℵ₀ unit fractions occupy ℵ₀ finite intervals. The points of the
    first one already disprove the claim.

    Therefore there is a first unit fraction. It is an x, a single number
    which contradicts your claim.
    Non sequitur. Like Moebius said, 1/(1+1/x) is smaller.

    Only for x which can be named.

    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:21:57 2024
    Le 15/07/2024 à 23:57, Moebius a écrit :
    Am 15.07.2024 um 15:33 schrieb joes:

    As has been repeated, there is no single fixed number less than all/every
    other number. However, every number has a smaller one.

    That is potential infinity.

    Wie schon ein paar Mal (also ein paar 100-mal) erwähnt, scheint
    Mückenheim nicht fähig (oder gewillt) zu sein, zwischen

    Ax Ey (y < x)

    That is potential infinity. There is no smallest y.
    In actual infinity there are all points including the smallest unit
    fraction. It is not necessary to construct them by naming some larger x.

    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:27:41 2024
    Le 16/07/2024 à 01:57, Moebius a écrit :
    Am 16.07.2024 um 00:11 schrieb Tom Bola:
    Am 15.07.2024 23:57:09 Moebius schrieb:

    Wie schon ein paar Mal (also ein paar 100-mal) erwähnt, scheint
    Mückenheim nicht fähig (oder gewillt) zu sein, zwischen

    Ax Ey (y < x)
    und
    Ex Ay (y < x)

    Fehler! x und y vertauscht!

    zu unterscheiden. [...]

    Mal etwas für Kenner: Diese Unterscheidung muss man nicht nur bei einer aktualen Auffassung der Unendlichkeit (wie in der _Mengenlehre_),
    sondern auch bei einer "potentialistischen" Auffassung des Unendlichen machen.

    _Nur_ dort gilt die erste Form.

    Zweifellos gibt es bei letzterer zu jedem Stammbruch, den man
    konstruieren kann, einen kleineren Stammbruch, den man konstruieren kann (vgl. Streckenteilung in der Geometrie). Es gibt aber auch hier keinen Stammbruch, den man konstruieren kann, der kleiner ist als alle
    Stammbrüche, die man konstruieren kann.

    So ist es. Weil es nämlich in potentielle Unendlichkeit nicht alle gibt.

    Gruß, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Tue Jul 16 16:04:38 2024
    Am 16.07.2024 um 15:27 schrieb WM:
    Le 16/07/2024 à 01:57, Moebius a écrit :
    Am 16.07.2024 um 00:11 schrieb Tom Bola:
    Am 15.07.2024 23:57:09 Moebius schrieb:

    Wie schon ein paar Mal (also ein paar 100-mal) erwähnt, scheint
    Mückenheim nicht fähig (oder gewillt) zu sein, zwischen

            Ax Ey (y < x)
    und
            Ex Ay (y < x)

    Fehler! x und y vertauscht!

    Richtig. Es sollte heißen:

    | Wie schon ein paar Mal (also ein paar 100-mal) erwähnt, scheint
    | Mückenheim nicht fähig (oder gewillt) zu sein, zwischen
    |
    | Ax Ey (y < x)
    | und
    | Ey Ax (y < x)
    |
    | zu unterscheiden.

    Mal etwas für Kenner: Diese Unterscheidung muss man nicht nur bei einer aktualen Auffassung der Unendlichkeit (wie in der _Mengenlehre_),
    sondern auch bei einer "potentialistischen" Auffassung des Unendlichen
    machen.

    Zweifellos gibt es bei letzterer zu jedem Stammbruch, den man
    konstruieren kann, einen kleineren Stammbruch, den man konstruieren kann
    (vgl. Streckenteilung in der Geometrie). Es gibt aber auch hier keinen Stammbruch, den man konstruieren kann, der kleiner ist als alle
    Stammbrüche, die man konstruieren kann.

    Schon merkwürdig, dass ein Mann, der "Geschichte des Unendlichen" an der Technischen Hochschule Augsburg lehrt, das nicht begreift/versteht.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Tue Jul 16 16:18:14 2024
    Am 16.07.2024 um 15:21 schrieb WM:
    Le 15/07/2024 à 23:57, Moebius a écrit :
    Am 15.07.2024 um 15:33 schrieb joes:

    As has been repeated, there is no single fixed number less than all/
    every other number. However, every number has a smaller one.

    That is

    something which is true in classical mathematics (i.e. set theory).

    Wie schon ein paar Mal (also ein paar 100-mal) erwähnt, scheint
    Mückenheim nicht fähig (oder gewillt) zu sein, zwischen

           Ax Ey (y < x)

    That is potential infinity.

    Nonsense. DAS habe ich doch gerade eben erklärt, Du Spinner: In der
    heutigen Mathematik, die auf der Mengenlehre basiert ("classical
    mathematics"), gilt selbstverständlich ebenfalls

    Ax Ey (y < x) ,

    wenn das "Universum", das wir der Aussage zugrunde legen (bzw. die Menge
    über die die Variablen laufen) z. B. IR oder Q oder Z ist.

    Da ist so, weil es in der klassischen Mathematik weder eine kleinste
    reelle, noch rationale, noch ganze Zahl gibt, Du Spinner.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Tue Jul 16 14:23:12 2024
    Le 16/07/2024 à 16:18, Moebius a écrit :
    In der
    heutigen Mathematik, die auf der Mengenlehre basiert ("classical mathematics"), gilt selbstverständlich ebenfalls

    Ax Ey (y < x) ,

    Die ist ja auch auf potentieller Unendlichkeit aufgebaut. Hätte Cantor
    recht "wobei keine einzige aus dem Inbegriffe (ω) vergessen ist", dann
    wäre auch die letzte dabei. Zumindest die endlichen Intervalle zwischen
    den Stammbrüchen oder auch den natürlichen Zahlen sollten doch alle da
    sein

    Gruß, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Tue Jul 16 16:34:43 2024
    Am 16.07.2024 um 16:23 schrieb WM:
    Le 16/07/2024 à 16:18, Moebius a écrit:

    In der heutigen Mathematik, die auf der Mengenlehre basiert
    ("classical mathematics"), gilt selbstverständlich ebenfalls

          Ax Ey (y < x) ,

    Die ist ja auch <bla>

    Gut, dass wir darüber geredet haben, Mückenheim.

    Du hast jetzt also verstanden, dass man zwischen

    | Ax Ey (y < x)
    | und
    | Ey Ax (y < x)

    unterscheiden muss? Insbesondere wenn der Kontext z. B. die reellen oder rationalen oder ganzen Zahlen sind?

    Dann hast Du ja jetzt endlich auch joes Aussage verstanden:

    "As has been repeated, there is no single fixed number less than all
    numbers. However, every number has a smaller one." (joe)

    In Zeichen: Ey Ax (y < x) ist falsch, aber Ax Ey (y < x) ist wahr.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Tue Jul 16 16:45:49 2024
    Am 16.07.2024 um 16:34 schrieb Moebius:
    Am 16.07.2024 um 16:23 schrieb WM:
    Le 16/07/2024 à 16:18, Moebius a écrit:

    In der heutigen Mathematik, die auf der Mengenlehre basiert
    ("classical mathematics"), gilt selbstverständlich ebenfalls

          Ax Ey (y < x) ,

    Die ist ja auch <bla>

    Gut, dass wir darüber geredet haben, Mückenheim.

    Du hast jetzt also verstanden, dass man zwischen

    |         Ax Ey (y < x)
    | und
    |         Ey Ax (y < x)

    unterscheiden muss? Insbesondere wenn der Kontext z. B. die reellen oder rationalen oder ganzen Zahlen sind?

    Dann hast Du ja jetzt endlich auch joes Aussage verstanden:

    "As has been repeated, there is no single fixed number less than all
    numbers. However, every number has a smaller one." (joe)

    In Zeichen: Ey Ax (y < x) ist falsch, aber Ax Ey (y < x) ist wahr.

    Man kann das leicht verschärfen, es gilt nämlich

    Ax (1/(1/x + 1) < x) ,

    wenn der Kontext "die Stammbrücke" sind. Man kann es auch etwas
    ausführlicher hinschreiben, um das explizit zu machen:

    Ax e {1/n : n e IN}: 1/(1/x + 1) < x ,
    "Für jeden Stammbruch x, ist 1/(1/x + 1) kleiner als x."

    Und ja, Mückenheim, außerhalb der Irrenanstalt in Mückenhausen gilt:

    Ax e {1/n : n e IN}: (1/(1/x + 1) e {1/n : n e IN} .
    "Für jeden Stammbruch x, ist 1/(1/x + 1) ein Stammbruch."

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Tue Jul 16 16:53:17 2024
    Am 16.07.2024 um 15:16 schrieb WM:
    Le 15/07/2024 à 23:08, joes a écrit :

    Like Moebius said, 1/(1+1/x) is smaller

    than x for each and every x in {1/n : n e IN}.

    Only for x which can be named.

    Red' nicht solchen Stuss, Mückenheim. Diese "Bedingung" gibt es
    allenfalls in der Irrenanstalt in Mückenhausen, in der Mathematik gibt
    es sie nicht, Du Spinner!

    In der Mathematik kann man

    Ax e {1/n : n e IN}: 1/(1/x + 1) < x ,
    "Für jeden Stammbruch x, ist 1/(1/x + 1) kleiner als x."
    und
    Ax e {1/n : n e IN}: (1/(1/x + 1) e {1/n : n e IN} .
    "Für jeden Stammbruch x, ist 1/(1/x + 1) ein Stammbruch."

    BEWEISEN. (Entsprechende Beweise wurden schon zig-mal gepostet.)

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

    There is no smallest unit fraction! Damn it!!! :^)

    In Mückenmath there is, it seems. :-P

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Richard Damon@21:1/5 to All on Tue Jul 16 23:03:08 2024
    On 7/15/24 8:41 AM, WM wrote:
    Le 14/07/2024 à 17:27, Moebius a écrit :

    For each and every x e IR, x > 0: NUF(x) = aleph_0

    Wrong. All unit fractions are separated. Therefore there is a first one
    at y. NUF(y) = 1.

    Regards, WM



    Nope. That means there is a highest natural number n = 1/y

    but m = n+1 is also a natural number, so z = 1/m is a unit fraction
    smaller than y.

    Your problem is you logic can't handle unbounded numbers.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Wed Jul 17 07:53:30 2024
    Am 15.07.2024 um 14:41 schrieb WM:

    All unit fractions are separated. Therefore there is a first one

    Na klar, Mückenheim: All integers are separated. Therefore there is a
    first one (jedenfalls in der Irrenanstalt in Mückenhausen).

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Wed Jul 17 10:26:30 2024
    Le 17/07/2024 à 05:03, Richard Damon a écrit :
    On 7/15/24 8:41 AM, WM wrote:
    Le 14/07/2024 à 17:27, Moebius a écrit :

    For each and every x e IR, x > 0: NUF(x) = aleph_0

    Wrong. All unit fractions are separated. Therefore there is a first one
    at y. NUF(y) = 1.

    Nope.

    Not all unit fractions are separated?

    That means there is a highest natural number n = 1/y.

    Yes.

    but m = n+1 is also a natural number,

    True for definable numbers, not true for all of the ℵo dark successors
    ∀n ∈ ℕ_def: |ℕ \ {1, 2, 3, ..., n}| = ℵo.

    Your problem is you logic can't handle unbounded numbers.

    Forget that magic. Explain how NUF(x) can increase from 0 to more when all
    unit fractions are separated. That is the crucial argument!

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Wed Jul 17 10:20:58 2024
    Le 17/07/2024 à 07:53, Moebius a écrit :
    Am 15.07.2024 um 14:41 schrieb WM:

    All unit fractions are separated. Therefore there is a first one

    All integers are separated. Therefore there is a
    first one

    This is true but difficult to understand. The facts with the unit
    fractions however are so clear that nobody can deny them other than by
    citing unrelated nonsense.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Wed Jul 17 10:31:37 2024
    Le 16/07/2024 à 23:51, "Chris M. Thomasson" a écrit :
    On 7/16/2024 6:21 AM, WM wrote:

           Ax Ey (y < x)

    That is potential infinity. There is no smallest y.
    In actual infinity there are all points including the smallest unit
    fraction.

    There is no smallest unit fraction!

    Don't claim. Explain how NUF(x) can increase from 0 to more when all unit fractions are separated. That is the crucial argument! The result is that mathematics has been erroneous for millenia. No dark numbers have been recognized. But they are existing, if actual infinity is existing.

    Regards, WM

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

    Huh? Take any unit fraction you can think of. Now, does it perfectly
    equal zero? No matter how small it is! NEVER! There is no smallest unit fraction... And for any unit fraction there is one smaller than it that
    does not equal zero. Period.

    Well put!

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Wed Jul 17 20:58:37 2024
    Le 17/07/2024 à 21:42, "Chris M. Thomasson" a écrit :
    On 7/17/2024 3:31 AM, WM wrote:
    Le 16/07/2024 à 23:51, "Chris M. Thomasson" a écrit :
    On 7/16/2024 6:21 AM, WM wrote:

           Ax Ey (y < x)

    That is potential infinity. There is no smallest y.
    In actual infinity there are all points including the smallest unit
    fraction.

    There is no smallest unit fraction!

    Don't claim. Explain how NUF(x) can increase from 0 to more when all
    unit fractions are separated. That is the crucial argument! The result
    is that mathematics has been erroneous for millenia. No dark numbers
    have been recognized. But they are existing, if actual infinity is
    existing.

    Huh? Take any unit fraction you can think of. Now, does it perfectly
    equal zero? No matter how small it is! NEVER! There is no smallest unit fraction... And for any unit fraction there is one smaller than it that
    does not equal zero. Period.

    Don't claim. Explain how NUF(x) can increase from 0 to more when all
    unit fractions are separated.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)