• Re: Replacement of Cardinality

    From Jim Burns@21:1/5 to All on Sat Jul 27 13:34:48 2024
    XPost: sci.logic

    sci.logic and sci.math

    On 7/26/2024 12:31 PM, WM wrote:

    _The rule of subset_ proves that
    every proper subset has
    less elements than its superset.

    ⎛ Each non.{}.set A of ordinals holds min.A

    ⎜ Ordinal j = {i:i<j} set of ordinals before j

    ⎜ Finite ordinal j has fewer elements than j∪{j}

    ⎝ ℕⁿᵒᵗᐧᵂᴹ is the set of ALL finite ordinals.

    ℕⁿᵒᵗᐧᵂᴹ breaks the rule of subset.

    If ℕ has fewer elements than ℕ∪{ℕ}
    then
    |ℕ| ∈ ℕ
    |ℕ∪{ℕ}| ∈ ℕ
    ℕ ≠⊂ {i:i<ℕ∪{ℕ}} ⊂ ℕ
    ℕ ≠⊂ ℕ
    and
    ℕ has fewer elements than ℕ

    Because ℕ does not have fewer elements than ℕ
    ℕ does not have fewer elements than ℕ∪{ℕ}
    and the rule of subsets is broken.

    _The rule of subset_ proves that

    To make a claim
    is not sufficient
    to make a proof.

    To make a finite sequence of claims
    such that no claim is first.false
    is sufficient
    to make a proof.

    The most that is true here is that
    the rule of subset _claims_ without proof that

    every proper subset has
    less elements than its superset.

    ⎛ In English, grammatically speaking,
    ⎜ it is never correct to say "less <plural.noun>"

    ⎜ English has mass nouns (Stoffnamen)
    ⎜ "less rock" ...
    ⎜ and count nouns (zählbare Substantive)
    ⎜ "one rock", "fewer rocks" ...
    ⎜ Only count nouns have a plural.
    ⎜ Only mass nouns are modified by "less".
    ⎝ "Less rocks" and "lescs elements" are never correct.

    ⎛ ...as you (WM) know, since you've been told.
    ⎜ Why you say what you say is often more mysterious
    ⎜ than what you say.

    ⎜ Perhaps you see a mass noun as more appropriate
    ⎜ to your darkᵂᴹ numbers -- to number purée?
    ⎜ That's not the way it would be said.

    ⎜⎛ The smaller bucket holds fewer rocks and less rock.
    ⎜⎝ Every proper subset has less element than its superset.

    ⎜ Perhaps you intentionally insert small errors
    ⎜ in order to draw attention away from large errors:
    ⎜ dropping verbal chaff.
    https://en.wikipedia.org/wiki/Chaff_(countermeasure)

    ⎝ Perhaps looking ignorant is your kink.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Mon Jul 29 02:04:26 2024
    XPost: sci.logic

    Am 27.07.2024 um 19:34 schrieb Jim Burns:
    sci.logic and sci.math

    On 7/26/2024 12:31 PM, WM wrote:

    _The rule of subset_ proves that [bla bla bla]

    Where did Mückenheim get this "rule" from? Any source?

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From joes@21:1/5 to All on Thu Aug 1 12:10:19 2024
    Am Thu, 01 Aug 2024 12:02:52 +0000 schrieb WM:
    Le 31/07/2024 à 18:20, joes a écrit :
    Am Wed, 31 Jul 2024 14:27:06 +0000 schrieb WM:
    Le 31/07/2024 à 03:28, Richard Damon a écrit :
    On 7/30/24 1:37 PM, WM wrote:
    Le 30/07/2024 à 03:18, Richard Damon a écrit :
    On 7/29/24 9:11 AM, WM wrote:

    But what number became ω when doubled?
    ω/2
    And where is that in {1, 2, 3, ... w} ?
    In the midst, far beyond all definable numbers, far beyond ω/10^10.
    That is a bit imprecise. Even though you keep on talking about
    consecutive infinities, you can't compare natural and "dark" numbers.
    Dark natnumbers are larger than defined natnumbers. Even dar natnumbers
    can be compared by size. ω/10^10 < ω/10 < ω/2, < ω-1.
    How is this different from two consecutive infinities?

    ω/10^10 and ω/10 are dark natural numbers.

    If all natural numbers exist, then ω-1 exists.
    Why?
    Because otherwise there was a gap below ω.
    But you combined two different sets, so why can't there be a gap?
    I assume completness.
    Completeness of N? No number n reaches omega.
    What is immediately before ω? Is it a blasphemy to ask such questions?
    There is no "before".

    ∀n ∈ ℕ: 1/n - 1/(n+1) > 0. Note the universal quantifier.
    Right, so we can say that ∀n ∈ ℕ: 1/n > 1/(n+1), so that for every >>>> unit fraction 1/n, there exists another unit fraction smaller than
    itself.
    No. My formula says ∀n ∈ ℕ.
    That is not a contradiction.
    ... to infinitely many unit fractions.

    --
    Am Sat, 20 Jul 2024 12:35:31 +0000 schrieb WM in sci.math:
    It is not guaranteed that n+1 exists for every n.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Thu Aug 1 14:24:42 2024
    Am 01.08.2024 um 14:10 schrieb joes:
    Am Thu, 01 Aug 2024 12:02:52 +0000 schrieb WM:

    ω/10^10 < ω/10 < ω/2, < ω-1.

    <facepalm>

    Keiner dieser Ausdrücke ist definiert. Diese "Zahlen" existieren nur in Mückenheims Wahnsystem (->delusion).

    How is this [...]

    It's pure nonsense.

    ω/10^10 and ω/10 are dark [...] numbers.

    Ja, in seinem Wahnsystem wird es wohl so sein.

    Es könnte aber auch brauner Scheißdreck sein.

    If all natural numbers exist, then ω-1 exists.

    Ah? (->Wahnsystem)

    What is immediately before ω? Is it <bla>

    NOTHING is "immediately before ω".

    Genauer: Keine Ordinalzahl.

    In Zeichen: ~Eo e ORD: o + 1 = ω.

    @Mückenheim: Sie faseln nur saudummen Scheißdreck daher.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Thu Aug 1 12:42:44 2024
    Le 01/08/2024 à 14:10, joes a écrit :
    Am Thu, 01 Aug 2024 12:02:52 +0000 schrieb WM:

    Dark natnumbers are larger than defined natnumbers. Even dark natnumbers
    can be compared by size. ω/10^10 < ω/10 < ω/2, < ω-1.
    How is this different from two consecutive infinities?

    All numbers above a finite natural numbers.

    What is immediately before ω? Is it a blasphemy to ask such questions?
    There is no "before".

    There is the sequence 1, 2, 3, ... and ω is its limit. How close to ω do
    the terms reach?

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Thu Aug 1 12:46:19 2024
    Le 01/08/2024 à 14:24, Moebius a écrit :
    Am 01.08.2024 um 14:10 schrieb joes:
    Am Thu, 01 Aug 2024 12:02:52 +0000 schrieb WM:

    ω/10^10 < ω/10 < ω/2, < ω-1.

    Keiner dieser Ausdrücke ist definiert.

    They are not defined by FISONs. Their relative sizes do not need FISONs to
    be comparable.

    What is immediately before ω?

    NOTHING is "immediately before ω".

    Genauer: Keine Ordinalzahl.

    How close do the ordinal numbers 1, 2, 3, ... come to their limit ω?

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From joes@21:1/5 to All on Thu Aug 1 15:54:58 2024
    Am Thu, 01 Aug 2024 12:46:19 +0000 schrieb WM:
    Le 01/08/2024 à 14:24, Moebius a écrit :
    Am 01.08.2024 um 14:10 schrieb joes:
    Am Thu, 01 Aug 2024 12:02:52 +0000 schrieb WM:

    ω/10^10 < ω/10 < ω/2, < ω-1.
    Keiner dieser Ausdrücke ist definiert.
    They are not defined by FISONs. Their relative sizes do not need FISONs
    to be comparable.
    Do you imagine N as symmetrically countable from either end, with
    something in between?

    What is immediately before ω?
    NOTHING is "immediately before ω".
    Genauer: Keine Ordinalzahl.
    How close do the ordinal numbers 1, 2, 3, ... come to their limit ω?
    Not at all. They are all infinitely far away, or rather omega is
    infinitely far away from all of them. The infinity is at infinity.
    Being a limit, this distance does not shrink. In the same sense as
    cardinality, none of them get any closer. The limit is not a part of
    the sequence, i.e. the natural numbers. It lies outside and beyond.
    It is not even a proper value: the sequence diverges, it transcends
    all bounds.

    --
    Am Sat, 20 Jul 2024 12:35:31 +0000 schrieb WM in sci.math:
    It is not guaranteed that n+1 exists for every n.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Fri Aug 2 11:40:18 2024
    XPost: sci.logic

    Le 01/08/2024 à 18:43, Jim Burns a écrit :
    On 8/1/2024 8:02 AM, WM wrote:

    It is not a contradiction to my formula
    if some n has no n+1.

    No, it literally contradicts your formula
    for some n e N to not.have n+1

    My formula is explicitly valid only for natural numbers.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Fri Aug 2 11:38:33 2024
    XPost: sci.logic

    Le 01/08/2024 à 18:04, joes a écrit :
    Am Thu, 01 Aug 2024 12:27:27 +0000 schrieb WM:

    separated from 0 by any eps. Therefore your claim is wrong.
    No. There is ALWAYS an epsilon.

    Failing to separate almost all unit fractions.
    Don't claim the contrary. Define (separate by an eps from 0) all unit fractions. Fail.

    What is the reason for the gap before omega? How large is it? Are these
    questions a blasphemy?
    A "gap" implies some sort of space that is not filled. There is no such
    space (it would be filled with infinitely many natural numbers).

    Hence there is only the sequence of natnumbers.

    We just condense the whole of N into one concept and call that omega,

    That is nonsense. ω is the first number following upon all natural
    numbers.

    or add it on the next level of infinity.

    Yes.

    Your questions are only a display of your unwillingness to understand infinity,

    They prove that I understand the real infinity while are (con)fusing
    potential and actual infinity.

    If k did not have a successor, what would k+1 be?

    ω

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From joes@21:1/5 to All on Fri Aug 2 12:52:13 2024
    Am Fri, 02 Aug 2024 11:38:33 +0000 schrieb WM:
    Le 01/08/2024 à 18:04, joes a écrit :
    Am Thu, 01 Aug 2024 12:27:27 +0000 schrieb WM:

    Every eps interval around 0 contains unit fractions which cannot be
    separated from 0 by any eps. Therefore your claim is wrong.
    No. There is ALWAYS an epsilon.
    Failing to separate almost all unit fractions.
    Don't claim the contrary. Define (separate by an eps from 0) all unit fractions. Fail.
    Well, there's no epsilon that separates all positive numbers from zero.
    But every fraction has an epsilon that is smaller.

    What is the reason for the gap before omega? How large is it? Are
    these questions a blasphemy?
    A "gap" implies some sort of space that is not filled. There is no such
    space (it would be filled with infinitely many natural numbers).
    Hence there is only the sequence of natnumbers.
    And no sequence of omega - k.

    We just condense the whole of N into one concept and call that omega,
    That is nonsense. ω is the first number following upon all natural
    numbers.
    Following the WHOLE of the natural numbers. The successor of a natural
    is also one.

    If k did not have a successor, what would k+1 be?
    ω
    Ah, a natural number.

    --
    Am Sat, 20 Jul 2024 12:35:31 +0000 schrieb WM in sci.math:
    It is not guaranteed that n+1 exists for every n.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Fri Aug 2 15:32:55 2024
    Le 01/08/2024 à 17:54, joes a écrit :
    Am Thu, 01 Aug 2024 12:46:19 +0000 schrieb WM:

    Do you imagine N as symmetrically countable from either end, with
    something in between?

    Yes. An unbridgeable dark space exists between both ends like in the reals between two known real numbers.

    What is immediately before ω?
    NOTHING is "immediately before ω".
    Genauer: Keine Ordinalzahl.
    How close do the ordinal numbers 1, 2, 3, ... come to their limit ω?
    Not at all. They are all infinitely far away, or rather omega is
    infinitely far away from all of them. The infinity is at infinity.
    Being a limit, this distance does not shrink. In the same sense as cardinality, none of them get any closer.

    Cardinality is nonsense. It concerns only definable numbers. 2 is closer
    to ω than 1, but it is not easy to see. We cannot count through the dark numbers. But 1/2 is closerto 0 than 1/1. That is fact.

    The limit is not a part of
    the sequence, i.e. the natural numbers. It lies outside and beyond.

    The limit is the ωth term.

    It is not even a proper value: the sequence diverges, it transcends
    all bounds.

    The reciprocal is easier to understand.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Fri Aug 2 15:39:26 2024
    Le 01/08/2024 à 21:14, FromTheRafters a écrit :
    WM brought next idea :

    How close do the ordinal numbers 1, 2, 3, ... come to their limit ω?

    It is merely the symbol for the countably infinite ordered set of
    naturals. It represents all of the ordinals which came before it, and
    yet it is the first of its kind, the first transfinite ordinal.

    You might as well be asking what natural number comes before the least natural number.

    No. Something comes there on the real line. No gaps larger than 1. If we
    extend the real line to ω, then my question is legitimate.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Fri Aug 2 15:50:43 2024
    Le 02/08/2024 à 14:52, joes a écrit :
    Am Fri, 02 Aug 2024 11:38:33 +0000 schrieb WM:

    Don't claim the contrary. Define (separate by an eps from 0) all unit
    fractions. Fail.
    Well, there's no epsilon that separates all positive numbers from zero.
    But every fraction has an epsilon that is smaller.

    Note that epsilons must be chosen. You cannot choose an eps that separates
    more than few unit fractions.

    If you object, then simply apply all of them. Then every fraction could be separated and none would remain. Then you had contradicted the existence
    of accumulation points.

    Hence there is only the sequence of natnumbers.
    And no sequence of omega - k.

    Those are natnumbers.

    We just condense the whole of N into one concept and call that omega,
    That is nonsense. ω is the first number following upon all natural
    numbers.
    Following the WHOLE of the natural numbers. The successor of a natural
    is also one.

    Not for all.

    If k did not have a successor, what would k+1 be?
    ω
    Ah, a natural number.

    No, ω is the first transfinite number. But we cannot count from 1 to ω.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From joes@21:1/5 to All on Sat Aug 3 17:42:33 2024
    Am Sat, 03 Aug 2024 14:25:03 +0000 schrieb WM:
    Le 02/08/2024 à 19:31, Moebius a écrit :
    For each and every of these points [here referred to with the variable
    "x"]: NUF(x) = ℵ₀ .
    I recognized lately that you use the wrong definition of NUF.
    It is the definition you have previously used.
    Here is the correct definition:
    There exist NUF(x) unit fractions u, such that for all y >= x: u < y.
    Note that the order is ∃ u ∀ y.
    You are specifying an exact number, not only at least one.
    NUF(x) = ℵ₀ for all x > 0 is wrong. NUF(x) = 1 for all x > 0 already is wrong since there is no unit fraction smaller than all unit fractions.
    New sig.

    ℵ₀ unit fractions need ℵ₀*2ℵ₀ points above zero.

    --
    Am Sat, 20 Jul 2024 12:35:31 +0000 schrieb WM in sci.math:
    It is not guaranteed that n+1 exists for every n.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Sun Aug 4 15:44:45 2024
    Le 03/08/2024 à 19:42, joes a écrit :
    Am Sat, 03 Aug 2024 14:25:03 +0000 schrieb WM:

    Here is the correct definition:
    There exist NUF(x) unit fractions u, such that for all y >= x: u < y.
    Note that the order is ∃ u ∀ y.
    You are specifying an exact number, not only at least one.

    Yes.

    NUF(x) = ℵ₀ for all x > 0 is wrong. NUF(x) = 1 for all x > 0 already is >> wrong since there is no unit fraction smaller than all unit fractions.
    New sig.

    Any problems with this definition? The reversed quantification is nonsense because ℵ₀ unit fractions need ℵ₀*2^ℵ₀ points above zero.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Sun Aug 4 20:12:19 2024
    Am 04.08.2024 um 19:59 schrieb Jim Burns:
    On 8/4/2024 11:44 AM, WM wrote:
    Le 03/08/2024 à 19:42, joes a écrit :

    [...]

    The reversed quantification is nonsense

    ...because from ∀x∃u to ∃u∀x is unreliable.

    From ∃u∀x to ∀x∃u  is reliable.
    From ∃u∃x to ∃x∃u  is reliable.
    From ∀u∀x to ∀x∀u  is reliable.
    However,
    from ∀x∃u to ∃u∀x is unreliable.

    In some cases,
    from ∀x∃u to ∃u∀x is not.only.unreliable,
    it is incorrect.

    Example (referring to FOPL= only):

    ∀x∃u x = u (true)

    ∃u∀x x = u (false)

    for any universe of discourse with more than one "entity" (object).

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Jim Burns@21:1/5 to All on Sun Aug 4 13:59:10 2024
    On 8/4/2024 11:44 AM, WM wrote:
    Le 03/08/2024 à 19:42, joes a écrit :

    [...]

    The reversed quantification is nonsense

    ...because from ∀x∃u to ∃u∀x is unreliable.

    From ∃u∀x to ∀x∃u is reliable.
    From ∃u∃x to ∃x∃u is reliable.
    From ∀u∀x to ∀x∀u is reliable.
    However,
    from ∀x∃u to ∃u∀x is unreliable.

    In some cases,
    from ∀x∃u to ∃u∀x is not.only.unreliable,
    it is incorrect.

    '<' is a case in which it is incorrect.
    From ∀x∃u≠x:x<u to ¬∃u∀x≠u:x<u is reliable.

    because
    ℵ₀ unit fractions need ℵ₀*2^ℵ₀ points above zero.

    Sets ordered so that all non.{}.subsets are 2.ended
    are finite sets.

    Sets ordered so that any non.{}.subset is non.2.ended
    are infinite sets.

    For each unit.fraction,
    the set of unit.fractions below it is non.2.ended.
    It is an infinite set.

    For each unit.fraction,
    each non.{}.subset of unit.fractions above it is 2.ended.
    The unit.fractions above it are finitely.many.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From joes@21:1/5 to All on Mon Aug 5 20:28:50 2024
    Am Mon, 05 Aug 2024 18:58:40 +0000 schrieb WM:
    Le 04/08/2024 à 21:18, Richard Damon a écrit :
    On 8/4/24 11:23 AM, WM wrote:
    Le 03/08/2024 à 17:56, Richard Damon a écrit :
    On 8/3/24 10:30 AM, WM wrote:

    But there is not even an eps that separates half of all unit
    fractions.
    Because such a question is meaningles, as there isn't a finite number
    that is half of the count of unit fractions.
    If there are all, then there is half of all.
    Not with infinities.
    Always.
    What is half of an infinity? Still infinite? Can you make that precise?

    --
    Am Sat, 20 Jul 2024 12:35:31 +0000 schrieb WM in sci.math:
    It is not guaranteed that n+1 exists for every n.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From joes@21:1/5 to All on Mon Aug 5 20:33:00 2024
    Am Mon, 05 Aug 2024 19:04:14 +0000 schrieb WM:
    Le 04/08/2024 à 22:16, Jim Burns a écrit :
    On 8/4/2024 2:13 PM, WM wrote:

    More of interest are these two claims which are not both true or both
    false:
    For every x there is u < x.
    There is u < x for every x.
    In natural language those mean the same thing. The reversed quantifier
    order would be: There is a single u<x *such that for all x* ...
    That is different from the first: Every x has a *corresponding* u ...
    The latter is close to my function:
    There are NUF(x) u < x.
    I don't know how to formalise that.
    From ∀x∃U to ∃U∀x is unreliable,
    There is no from to. NUF(x) is so defined.
    You were confusing the quantifiers.
    For every number of unit fractions NUF(x) gives the smallest interval
    (0, x).
    Are you talking about the inverse function?

    --
    Am Sat, 20 Jul 2024 12:35:31 +0000 schrieb WM in sci.math:
    It is not guaranteed that n+1 exists for every n.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Tue Aug 6 08:58:28 2024
    Le 05/08/2024 à 22:28, joes a écrit :
    Am Mon, 05 Aug 2024 18:58:40 +0000 schrieb WM:
    Le 04/08/2024 à 21:18, Richard Damon a écrit :
    On 8/4/24 11:23 AM, WM wrote:
    Le 03/08/2024 à 17:56, Richard Damon a écrit :
    On 8/3/24 10:30 AM, WM wrote:

    But there is not even an eps that separates half of all unit
    fractions.
    Because such a question is meaningles, as there isn't a finite number >>>>> that is half of the count of unit fractions.
    If there are all, then there is half of all.
    Not with infinities.
    Always.
    What is half of an infinity? Still infinite? Can you make that precise?

    What is infinity? We cannot cross the dark numbers. By definition ω is
    the first infinite number. ω/2 therefore is finite. But it is impossible
    to count to ω/2. Therefore it appears like an infinite number.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Tue Aug 6 09:03:33 2024
    Le 05/08/2024 à 22:33, joes a écrit :
    Am Mon, 05 Aug 2024 19:04:14 +0000 schrieb WM:
    Le 04/08/2024 à 22:16, Jim Burns a écrit :
    On 8/4/2024 2:13 PM, WM wrote:

    More of interest are these two claims which are not both true or both
    false:
    For every x there is u < x.
    There is u < x for every x.
    In natural language those mean the same thing. The reversed quantifier
    order would be: There is a single u<x *such that for all x* ...
    That is different from the first: Every x has a *corresponding* u ...
    The latter is close to my function:
    There are NUF(x) u < x.
    I don't know how to formalise that.

    ∃^k u ∈ ⅟ℕ, u < x, ∀y > x = INVNUF(k).

    From ∀x∃U to ∃U∀x is unreliable,
    There is no from to. NUF(x) is so defined.
    You were confusing the quantifiers.
    For every number of unit fractions NUF(x) gives the smallest interval
    (0, x).
    Are you talking about the inverse function?

    Yes.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Jim Burns@21:1/5 to All on Tue Aug 6 06:32:18 2024
    XPost: sci.logic

    On 8/6/2024 4:26 AM, WM wrote:
    Le 06/08/2024 à 00:19, Jim Burns a écrit :

    NUF(1) = ℵ₀
    NUF(x) = ℵ₀

    NUF(x) gives
    the number of unit fractions smaller than x.

    Following unreadable symbols.

    For  each x > 0
    ⅟ℕᵈᵉᶠ∩(0,x) is not finite.

    For NUF(x) = 3
    ⅟ℕᵈᵉᶠ∩(0,x) is finite, namely 3.

    For NUF(x) = 3.5
    ⅟ℕᵈᵉᶠ∩(0,x) is fractional, namely 3.5, however,
    no such x with NUF(x) = 3.5 exists.

    Also,
    no such x with NUF(x) = 3 exists.

    | Assume otherwise.
    | Assume NUF(x₃) = 3
    |
    | u₁ < u₂ < u₃ are all of
    | the finite unit fractions in (0,x₃)
    |
    | However,
    | ⅟(1+⅟u₁) < u₁ is also
    | a finite unit fraction in (0,x₃)
    | 0 < ⅟(1+⅟u₁) < u₁ < u₂ < u₃ < x₃
    |
    | NUF(x₃) > 3
    | Contradiction.

    Therefore,
    no such x with NUF(x) = 3 exists.

    Counter.argument:
    What about x₃′ = (u₂+u₃)/2 ?
    0 < ⅟(1+⅟u₁) < u₁ < u₂ < x₃′

    Counter.counter.argument:
    0 < ⅟(2+⅟u₁) < ⅟(1+⅟u₁) < u₁ < u₂ < x₃′
    NUF(x₃′) > 3

    Which unit.fractions changes.
    How many unit.fractions stays infinite.

    Infinite is not simply big. It's different.

    Finite can be big, too, even reallyreally big,
    but it's a reallyreally big finite which
    shares "common sense" properties with 3 ...

    ... "common sense" properties which,
    upon a more careful look,
    may be held in common with reallyreally big finites
    but are not held in common with, for example,
    how many unit.fractions there are.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Jim Burns@21:1/5 to All on Tue Aug 6 12:33:55 2024
    XPost: sci.logic

    On 8/6/2024 9:55 AM, WM wrote:
    Le 06/08/2024 à 14:38, Jim Burns a écrit :

    NUF(x) ≠ 1
    is true everywhere
    NUF(x) = 1  ⇒  INVNUF(1) = x
    is true everywhere
    However,
    its truth doesn't imply INVNUF(1) exists.

    ∀n ∈ ℕ: 1/n - 1/(n+1) > 0
    implies its existence.

    No.
    ∀n ∈ ℕ: 1/n - 1/(n+1) > 0
    implies its NONexistence.

    | Assume x₁ exists: NUF(x₁) = 1
    | ⅟n is the one unit.fraction in (0,x₁)
    | 0 < ⅟n < x₁
    |
    | However,
    | ∀n ∈ ℕ: ⅟n - ⅟(n+1) > 0
    | 0 < ⅟(n+1) < ⅟n < x₁
    | NUF(x₁) > 1
    | Contradiction.

    Therefore,
    there is no x₁: NUF(x₁) = 1
    ∀ᴿx: NUF(x) ≠ 1

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From joes@21:1/5 to All on Mon Aug 12 13:27:00 2024
    Am Sat, 10 Aug 2024 15:59:05 +0000 schrieb WM:
    Le 09/08/2024 à 05:34, Jim Burns a écrit :

    and he thinks that a set ordered with two ends is more complete than
    the same set with one or zero ends.
    The set of unit fractions has two ends, namely at 1 and before 0.
    "Before" is not a number. There are still infinitely many of them,
    because their distances (differences, rather) decrease. They have
    only one end that you can count from.

    --
    Am Sat, 20 Jul 2024 12:35:31 +0000 schrieb WM in sci.math:
    It is not guaranteed that n+1 exists for every n.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Mon Aug 12 14:07:34 2024
    Le 12/08/2024 à 15:27, joes a écrit :
    Am Sat, 10 Aug 2024 15:59:05 +0000 schrieb WM:

    The set of unit fractions has two ends, namely at 1 and before 0.
    "Before" is not a number. There are still infinitely many of them,
    because their distances (differences, rather) decrease. They have
    only one end that you can count from.

    There is a first one because all have finite gaps.

    A simple picture: Let a cursor run from 1 to 0. Every passed accessible
    unit fraction has infinitely many smaller unit fractions as successors.
    When the cursor passes 0, all unit fractions have been passed. None
    remains, not even the infinitely many successors of every accessible unit fraction. They are not accessible. They are dark. This prevents that the
    last unit fractions passed by the cursor can be determined and put in
    order. The gaps and the linearity of the problem require that the cursor
    never passes two or more unit fractions at one position. Therefore a last
    one must have been passed when arriving at zero. But we don't know about
    the structure of dark points.

    If all unit fractions had ℵo smaller unit fractions as successors the
    cursor could never diminish the number of unit fractions between itself
    and zero to fewer than ℵo and could never reach zero. Even if every unit fraction had only one successor, the physical movement would be hampered
    by this philosophical assumption. That is impossible.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Python@21:1/5 to All on Mon Aug 12 16:20:53 2024
    Le 12/08/2024 à 16:07, WM a écrit :
    Le 12/08/2024 à 15:27, joes a écrit :
    Am Sat, 10 Aug 2024 15:59:05 +0000 schrieb WM:

    The set of unit fractions has two ends, namely at 1 and before 0.
    "Before" is not a number. There are still infinitely many of them,
    because their distances (differences, rather) decrease. They have
    only one end that you can count from.

    There is a first one because all have finite gaps.

    A simple picture: Let a cursor run from 1 to 0. Every passed accessible
    unit fraction has infinitely many smaller unit fractions as successors.
    When the cursor passes 0, all unit fractions have been passed. None
    remains, not even the infinitely many successors of every accessible
    unit fraction. They are not accessible. They are dark. This prevents
    that the last unit fractions passed by the cursor can be determined and
    put in order. The gaps and the linearity of the problem require that the cursor never passes two or more unit fractions at one position.
    Therefore a last one must have been passed when arriving at zero. But we don't know about the structure of dark points.
    If all unit fractions had ℵo smaller unit fractions as successors the cursor could never diminish the number of unit fractions between itself
    and zero to fewer than ℵo and could never reach zero. Even if every unit fraction had only one successor, the physical movement would be hampered
    by this philosophical assumption. That is impossible.

    When Zeno proposed his well known paradox, he didn't attempt to prove
    that motion was impossible, he want to point out that some apparent
    rational reasoning are invalid.

    Wolfgang Mückenheim, form Hochschule Augsburg (shame! shame! shame!)
    is, on the other hand, drowning himself in sophistries.

    How come such a crook is TEACHING?!!!

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Tue Aug 13 00:39:31 2024
    Am 13.08.2024 um 00:34 schrieb joes:
    Am Mon, 12 Aug 2024 14:07:34 +0000 schrieb WM:

    [...] a last one must have been passed when arriving at zero.

    Nope.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From joes@21:1/5 to All on Mon Aug 12 22:34:56 2024
    Am Mon, 12 Aug 2024 14:07:34 +0000 schrieb WM:
    Le 12/08/2024 à 15:27, joes a écrit :
    Am Sat, 10 Aug 2024 15:59:05 +0000 schrieb WM:

    The set of unit fractions has two ends, namely at 1 and before 0.
    "Before" is not a number. There are still infinitely many of them,
    because their distances (differences, rather) decrease. They have only
    one end that you can count from.

    A simple picture: Let a cursor run from 1 to 0. Every passed accessible
    unit fraction has infinitely many smaller unit fractions as successors.
    When the cursor passes 0, all unit fractions have been passed. None
    remains, not even the infinitely many successors of every accessible
    unit fraction. They are not accessible. They are dark. This prevents
    that the last unit fractions passed by the cursor can be determined and
    put in order. The gaps and the linearity of the problem require that the cursor never passes two or more unit fractions at one position.
    Then it can never reach 0.

    Therefore a last one must have been passed when arriving at zero. But we don't know about the structure of dark points.
    If all unit fractions had ℵo smaller unit fractions as successors the cursor could never diminish the number of unit fractions between itself
    and zero to fewer than ℵo and could never reach zero.
    This is the case.

    Even if every unit
    fraction had only one successor, the physical movement would be hampered
    by this philosophical assumption. That is impossible.
    They do have exactly one successor. Anyway this is not physical.

    --
    Am Sat, 20 Jul 2024 12:35:31 +0000 schrieb WM in sci.math:
    It is not guaranteed that n+1 exists for every n.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Tue Aug 13 14:15:37 2024
    Le 12/08/2024 à 16:20, Python a écrit :
    Le 12/08/2024 à 16:07, WM a écrit :
    Le 12/08/2024 à 15:27, joes a écrit :
    Am Sat, 10 Aug 2024 15:59:05 +0000 schrieb WM:

    The set of unit fractions has two ends, namely at 1 and before 0.
    "Before" is not a number. There are still infinitely many of them,
    because their distances (differences, rather) decrease. They have
    only one end that you can count from.

    There is a first one because all have finite gaps.

    A simple picture: Let a cursor run from 1 to 0. Every passed accessible
    unit fraction has infinitely many smaller unit fractions as successors.
    When the cursor passes 0, all unit fractions have been passed. None
    remains, not even the infinitely many successors of every accessible
    unit fraction. They are not accessible. They are dark. This prevents
    that the last unit fractions passed by the cursor can be determined and
    put in order. The gaps and the linearity of the problem require that the
    cursor never passes two or more unit fractions at one position.
    Therefore a last one must have been passed when arriving at zero. But we
    don't know about the structure of dark points.
    If all unit fractions had ℵo smaller unit fractions as successors the
    cursor could never diminish the number of unit fractions between itself
    and zero to fewer than ℵo and could never reach zero. Even if every unit >> fraction had only one successor, the physical movement would be hampered
    by this philosophical assumption. That is impossible.

    When Zeno proposed his well known paradox, he didn't attempt to prove
    that motion was impossible,

    He did. Learn about his flying arrow.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Tue Aug 13 19:47:35 2024
    XPost: sci.logic

    Am 13.08.2024 um 19:02 schrieb Jim Burns:
    On 8/13/2024 10:21 AM, WM wrote:

    either in a step of size 1
    or in a step of size more than 1.

    Let's "assume" that this is true (sort of) for the sake of the argument.

    But increase by more than 1 is excluded by
    the gaps between unit fractions.

    I can't see any argument for this claim.

    Actually, for each and every real number x > 0 there are infinitely many
    unit fractions smaller than x: 1/cail(1/x + 1)), 1/cail(1/x + 2)),
    1/cail(1/x + 3)), ...

    Hence the difference between NUF(0) (i.e. 0) and NUF(x) is "infinite"
    for each and every x e IR, x > 0.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From joes@21:1/5 to All on Wed Aug 14 13:43:17 2024
    Am Wed, 14 Aug 2024 12:26:27 +0000 schrieb WM:
    Le 13/08/2024 à 19:32, Moebius a écrit :
    Am 13.08.2024 um 19:02 schrieb Jim Burns:
    On 8/13/2024 10:21 AM, WM wrote:
    Le 12/08/2024 à 19:44, Jim Burns a écrit :

    There is no ⅟nₓ before the end of the positive axis without ⅟(nₓ+1)
    before the end of the positive axis.
    You cannot see it. It is dark.
    No number can be seen, dark or not.
    Numbers can be seen.
    What is "seeing"?

    resulting in a real coordinate x with NUF(x) = 1.
    Assume NUF(x0) = 1 with x0 e IR. This means that there is exactly one
    unit fraction u such that u < x0. Let's call this unit fraction u0.
    Then (by definition) there is a (actually exactly one) natural number n
    such that u0 = 1/n. Let n0 e IN such that u0 = 1/n0. But then (again by
    definition) 1/(n0 + 1) is a unit fraction which is smaller than u0 and
    hence smaller than x0. Hence NUF(x0) > 1. Contradiction!
    Therefore 1/(n0 + 1) does not exist.
    That's one way to resolve it. But how do you do mathematics without that
    axiom?

    --
    Am Sat, 20 Jul 2024 12:35:31 +0000 schrieb WM in sci.math:
    It is not guaranteed that n+1 exists for every n.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Wed Aug 14 18:35:24 2024
    Am 14.08.2024 um 15:43 schrieb joes:
    Am Wed, 14 Aug 2024 12:26:27 +0000 schrieb WM:
    Le 13/08/2024 à 19:32, Moebius a écrit :
    Am 13.08.2024 um 19:02 schrieb Jim Burns:
    On 8/13/2024 10:21 AM, WM wrote:
    Le 12/08/2024 à 19:44, Jim Burns a écrit :

    There is no ⅟nₓ before the end of the positive axis without ⅟(nₓ+1)
    before the end of the positive axis.

    You cannot see it. It is dark.

    No number can be seen, dark or not.

    Numbers can be seen.

    What is "seeing"?

    clairvoyance, delusion

    resulting in a real coordinate x with NUF(x) = 1.

    Assume NUF(x0) = 1 with x0 e IR. This means that there is exactly one
    unit fraction u such that u < x0. Let's call this unit fraction u0.
    Then (by definition) there is a (actually exactly one) natural number n
    such that u0 = 1/n. Let n0 e IN such that u0 = 1/n0. But then (again by
    definition) 1/(n0 + 1) is a unit fraction which is smaller than u0 and
    hence smaller than x0. Hence NUF(x0) > 1. Contradiction!

    Therefore 1/(n0 + 1) does not exist.

    That's one way to resolve it.

    No, it isn't. At least not in the context of classical mathematics.

    Actually, it's not even clear how to express: "1/(n0 + 1) does not exist".

    On the other hand, (in the context of classical mathematics, say
    analysis) we have the theorems

    An e IN: n+1 e IN ,

    where + is defined on IN x IN, and

    An e IN: 1/(n0 + 1) e 1/IN ,

    where / is defined on IN x IN (with IN = {1, 2, 3, ...}).

    From these theorems we can prove:

    An e IN: Em e IN: m = n+1

    and

    An e IN: Eu e 1/IN: u = 1/(n+1) .

    Nothing is "resolved" by claiming nonsense.

    _________________________________________________________________


    Moreover, if an assumption A leads to a contradiction, we usually
    conclude ~A. (It's called indirect proof, or proof by contradiction, or reductio ad absurdum.)

    We USUALLY don't conclude ~T, where T is a theorem (somehow) used in the
    proof.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Thu Aug 15 13:49:41 2024
    Le 14/08/2024 à 15:43, joes a écrit :
    Am Wed, 14 Aug 2024 12:26:27 +0000 schrieb WM:

    Numbers can be seen.
    What is "seeing"?

    Recognize the value.

    But then (again by
    definition) 1/(n0 + 1) is a unit fraction which is smaller than u0 and
    hence smaller than x0. Hence NUF(x0) > 1. Contradiction!
    Therefore 1/(n0 + 1) does not exist.
    That's one way to resolve it.

    There is no other way.

    But how do you do mathematics without that
    axiom?

    Mathematics on done in potential infinity. there the axiom is true.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From joes@21:1/5 to All on Thu Aug 15 16:16:35 2024
    Am Sat, 10 Aug 2024 15:26:47 +0000 schrieb WM:
    Le 08/08/2024 à 12:30, FromTheRafters a écrit :
    on 8/8/2024, WM supposed :

    No, that is nonsense. There are not finitely many unit fractions.

    Then stop assuming that there is a first and last element.

    Finitely many means that you can count from first to last. You cannot
    count through the unit fractions.
    They are countably infinite.

    --
    Am Sat, 20 Jul 2024 12:35:31 +0000 schrieb WM in sci.math:
    It is not guaranteed that n+1 exists for every n.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From joes@21:1/5 to All on Thu Aug 15 16:17:58 2024
    Am Sun, 11 Aug 2024 12:24:46 +0000 schrieb WM:
    Le 10/08/2024 à 19:16, FromTheRafters a écrit :
    WM expressed precisely :
    Le 09/08/2024 à 05:34, Jim Burns a écrit :

    and he thinks that a set ordered with two ends is more complete than
    the same set with one or zero ends.

    The set of unit fractions has two ends, namely at 1 and before 0.

    Wrong,

    Name unit fractions larger than 1 or smaller than 0.
    Note: Before domains without unit fractions the set has ended.
    0 is not a unit fraction, so not an end; there is no smallest.

    --
    Am Sat, 20 Jul 2024 12:35:31 +0000 schrieb WM in sci.math:
    It is not guaranteed that n+1 exists for every n.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From joes@21:1/5 to All on Thu Aug 15 16:18:34 2024
    Am Sun, 11 Aug 2024 12:29:13 +0000 schrieb WM:
    Le 10/08/2024 à 19:28, Jim Burns a écrit :
    On 8/10/2024 11:54 AM, WM wrote:
    Le 09/08/2024 à 02:32, Jim Burns a écrit :

    Surely, a lawyer wouldn't think that "Boom! Here's the conclusion"
    is an _argument_ ?
    ∀n ∈ ℕ: 1/n - 1/(n+1) > 0
    If an interval contains unit fractions, then it contains a first one.
    What is the largest real number in (0, 1)?

    Therefore there can only be a single first unit fraction.
    No one has said there are two first unit.fractions.
    What forbids zero first unit.fractions?
    The existence of unit frations enforces one or more first unit
    fractions.
    No.

    What causes an exception: nₓ ∈ ℕ without ⅟(nₓ+1) ?
    The end of the positivee axis.
    What fucking end

    --
    Am Sat, 20 Jul 2024 12:35:31 +0000 schrieb WM in sci.math:
    It is not guaranteed that n+1 exists for every n.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Jim Burns@21:1/5 to Moebius on Fri Aug 16 07:45:34 2024
    XPost: sci.logic

    On 8/16/2024 1:50 AM, Moebius wrote:
    Am 16.08.2024 um 07:05 schrieb Jim Burns:
    On 8/15/2024 7:16 PM, Moebius wrote:
    Am 16.08.2024 um 00:51 schrieb Jim Burns:
    On 8/15/2024 3:37 PM, Moebius wrote:
    Am 15.08.2024 um 21:28 schrieb Jim Burns:

    Defining ⅟𝔊 to be the smallest unit fraction
    isn't a claim that ⅟𝔊 exists.

    You need an existence proof [...]
    BEFORE stating a/the proper definition.

    Half or more of my proofs to WM say
    "Assume otherwise... However... Contradiction."

    Yeah, to be precise a proof by contradiction
    assumes a STATEMENT/CLAIM.

    Many times, a false existence claim.

    Right.

    About things without an existence proof.

    √2 is irrational.

    This statement is just nonsense,
    _if_ "√2" is not already defined.*)

    Delete less.

    ⎛ Assume otherwise.

    Nope. You clearly don't assume

    √2 is rational ,

    but:

    ⎜ Assume p₃,q₃ ∈ ℕ₁:  p₃⋅p₃ = 2⋅q₃⋅q₃
    :
    ⎝ Contradiction.

    I assume a statement equivalent to
    ⎜ Rational √2 exists.

    ________________________________

    *) Of course,
    _if_ we already have introduced the real numbers
    (i.e. IR)
    we may define

    √2 = the real number x such that x*x = 2 ,    (*)

    _after_ we have shown that that
    there is exactly one x e IR such that x*x = 2.

    Upthread is not a proof that real √2 exists.

    Upthread is a proof that rational √2 not.exists,
    which never mentions Dedekind completeness,
    a never.mentioning which shows that,
    whether or not real √2 exists,
    rational √2 not.exists.

    No, I am not proving that, here.
    It makes my proof weaker and less focused, here.

    From (*) we get immediately: √2*√2 = 2.

    You're complaining I didn't show you √2*√2 = 2.

    Consider it left as an exercise for the reader.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Fri Aug 16 16:21:01 2024
    Le 15/08/2024 à 18:17, joes a écrit :

    0 is not a unit fraction, so not an end; there is no smallest.

    We can reduce the interval (0, x) c [0, 1] such that x converges to 0.
    Then the number of unit fractions diminishes. Finally there is none
    remaining. But never, for no interval (0, x), more than one unit fraction
    is lost. Therefore there is only one last unit fraction.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Fri Aug 16 16:22:39 2024
    Le 15/08/2024 à 18:18, joes a écrit :

    The existence of unit frations enforces one or more first unit
    fractions.
    No.

    Cant't you think straight? If NUF grows from 0 to more, then there is a
    first one or more.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From joes@21:1/5 to All on Fri Aug 16 16:49:25 2024
    Am Fri, 16 Aug 2024 16:45:29 +0000 schrieb WM:
    Le 15/08/2024 à 19:01, Moebius a écrit :

    Assume that there is an x e IR such that NUF(x) = 1. Let x0 e IR such
    that NUF(x0) = 1. This means that there is exactly one unit fraction u
    such that u < x0. Let's call this unit fraction u0. Then (by
    definition)
    there is a (actually exactly one) natural number n such that u0 = 1/n.
    Let n0 e IN such that u0 = 1/n0. But then (again by definition) 1/(n0 +
    1) is an unit fraction which is smaller than u0 and hence smaller than
    x0. Hence NUF(x0) > 1. Contradiction!
    We can reduce the interval (0, x) c [0, 1] such that x converges to 0.
    Then the number of unit fractions diminishes. Finally there is none remaining. But never, for no interval (0, x), more than one unit
    fraction is lost. Therefore there is only one last unit fraction.
    It does not diminish, there are always infinitely many.

    --
    Am Sat, 20 Jul 2024 12:35:31 +0000 schrieb WM in sci.math:
    It is not guaranteed that n+1 exists for every n.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Richard Damon@21:1/5 to All on Fri Aug 16 12:48:23 2024
    On 8/16/24 12:21 PM, WM wrote:
    Le 15/08/2024 à 18:17, joes a écrit :

    0 is not a unit fraction, so not an end; there is no smallest.

    We can reduce the interval (0, x) c [0, 1] such that x converges to 0.
    Then the number of unit fractions diminishes. Finally there is none remaining. But never, for no interval (0, x), more than one unit
    fraction is lost. Therefore there is only one last unit fraction.

    Regards, WM

    No, you can't because the count of the unit fractions in (0, x) is
    always aleph_0. When you reduce the size to get the next smaller one,
    the count is still aleph_0, as that is how arithmetic on infinite values
    work.

    The value never converges to 0, as you can never get off aleph_0. To
    converge, you first need to find a value of x where the count of unit
    fractions in (0, x) is a finite number, but no finite number x has that property.

    Your assumptions of non-existant conditions just breaks your logic.

    Just because f(x) == y at x0, does not mean that f(x) converges to y at x0.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From joes@21:1/5 to All on Fri Aug 16 16:50:39 2024
    Am Fri, 16 Aug 2024 16:19:17 +0000 schrieb WM:
    Le 15/08/2024 à 18:16, Jim Burns a écrit :
    On 8/15/2024 9:52 AM, WM wrote:

    ⎜ Assume NUF(x) = 0 and x > 0
    We assume that NUF(0) = 0 and many unit fractions are within (0, 1].
    We can reduce the interval to (0, x) c [0, 1]. Let x converge to 0.
    Then the number of unit fractions diminishes. Finally there is none remaining. But never, for no interval (0, x), more than one unit
    fraction is lost. Therefore there is only one last unit fraction.
    Taking steps only until the next unit fraction, you never reach 0.

    --
    Am Sat, 20 Jul 2024 12:35:31 +0000 schrieb WM in sci.math:
    It is not guaranteed that n+1 exists for every n.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Fri Aug 16 16:57:54 2024
    Le 16/08/2024 à 18:48, Richard Damon a écrit :
    On 8/16/24 12:21 PM, WM wrote:
    Le 15/08/2024 à 18:17, joes a écrit :

    0 is not a unit fraction, so not an end; there is no smallest.

    We can reduce the interval (0, x) c [0, 1] such that x converges to 0.
    Then the number of unit fractions diminishes. Finally there is none
    remaining. But never, for no interval (0, x), more than one unit
    fraction is lost. Therefore there is only one last unit fraction.

    Regards, WM

    No, you can't because the count of the unit fractions in (0, x) is
    always aleph_0. When you reduce the size to get the next smaller one,
    the count is still aleph_0, as that is how arithmetic on infinite values work.

    It works so for cranks.

    The value never converges to 0, as you can never get off aleph_0. To converge, you first need to find a value of x where the count of unit fractions in (0, x) is a finite number, but no finite number x has that property.

    Then more than one diminish simultaneously. Contradiction.
    This proves a first one: ∀n ∈ ℕ: 1/n - 1/(n+1) > 0 .

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Fri Aug 16 17:00:26 2024
    Le 16/08/2024 à 18:50, joes a écrit :
    Am Fri, 16 Aug 2024 16:19:17 +0000 schrieb WM:

    Taking steps only until the next unit fraction, you never reach 0.

    Start from x = 0. The increase cannot be more than 1.
    ∀n ∈ ℕ: 1/n - 1/(n+1) > 0

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Fri Aug 16 16:59:11 2024
    Le 16/08/2024 à 18:49, joes a écrit :
    Am Fri, 16 Aug 2024 16:45:29 +0000 schrieb WM:

    It does not diminish, there are always infinitely many.

    Not according to mathematics: ∀n ∈ ℕ: 1/n - 1/(n+1) > 0 .

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Richard Damon@21:1/5 to All on Fri Aug 16 14:03:27 2024
    On 8/16/24 12:59 PM, WM wrote:
    Le 16/08/2024 à 18:49, joes a écrit :
    Am Fri, 16 Aug 2024 16:45:29 +0000 schrieb WM:

    It does not diminish, there are always infinitely many.

    Not according to mathematics: ∀n ∈ ℕ: 1/n - 1/(n+1) > 0 .

    Regards, WM



    WHich proves that no 1/n can be the smallest, so refutes your claim.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Jim Burns@21:1/5 to All on Fri Aug 16 14:10:56 2024
    On 8/16/2024 12:59 PM, WM wrote:
    Le 16/08/2024 à 18:49, joes a écrit :

    It does not diminish,
    there are always infinitely many.

    Not according to mathematics:
    ∀n ∈ ℕ: 1/n - 1/(n+1) > 0 .

    | In attempts to get cargo to fall by parachute or
    | land in planes or ships again,
    | islanders imitated the same practices
    | they had seen the military personnel use.
    | Cult behaviors usually involved
    | mimicking the day-to-day activities and
    | dress styles of US soldiers, such as
    | performing parade ground drills with
    | wooden or salvaged rifles.
    | The islanders carved headphones from wood and
    | wore them while sitting in fabricated control towers.
    | They waved the landing signals
    | while standing on the runways.
    | They lit signal fires and torches
    | to light up runways and lighthouses.
    |
    https://en.wikipedia.org/wiki/Cargo_cult

    Taking an equation and waving it around,
    apparently just for the hell of it,
    has a lot of parallels to
    carving headphones from wood and
    sitting in a fabricated control tower.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Jim Burns@21:1/5 to All on Fri Aug 16 13:54:07 2024
    On 8/16/2024 1:00 PM, WM wrote:
    Le 16/08/2024 à 18:50, joes a écrit :

    Taking steps only until the next unit fraction,
    you never reach 0.

    Start from x = 0.
    The increase cannot be more than 1.
    ∀n ∈ ℕ: 1/n - 1/(n+1) > 0

    Start from x = 0
    The increase cannot be less than 2
    ∀ᴿx > 0: x > ⅟nₓ > ⅟(nₓ+1)
    nₓ = ⌊1+⅟x⌋

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Richard Damon@21:1/5 to All on Fri Aug 16 14:02:14 2024
    On 8/16/24 12:57 PM, WM wrote:
    Le 16/08/2024 à 18:48, Richard Damon a écrit :
    On 8/16/24 12:21 PM, WM wrote:
    Le 15/08/2024 à 18:17, joes a écrit :

    0 is not a unit fraction, so not an end; there is no smallest.

    We can reduce the interval (0, x) c [0, 1] such that x converges to 0.
    Then the number of unit fractions diminishes. Finally there is none
    remaining. But never, for no interval (0, x), more than one unit
    fraction is lost. Therefore there is only one last unit fraction.

    Regards, WM

    No, you can't because the count of the unit fractions in (0, x) is
    always aleph_0. When you reduce the size to get the next smaller one,
    the count is still aleph_0, as that is how arithmetic on infinite
    values work.

    It works so for cranks.

    So, are you admitting that you are a crank?

    Or just that you just don't believe in how actual Mathematics is defined.


    The value never converges to 0, as you can never get off aleph_0. To
    converge, you first need to find a value of x where the count of unit
    fractions in (0, x) is a finite number, but no finite number x has
    that property.

    Then more than one diminish simultaneously. Contradiction.
    This proves a first one: ∀n ∈ ℕ: 1/n - 1/(n+1) > 0 .

    No, that proves that there is no smallest unit fraction as it shows that 1/(n+1) exists, and is smaller than 1/n for all n that are members of
    the Natural Numbers.

    Sorry, you are just proving how broken your logic is.

    The other way to look at your expression is that is shows that there are
    AT LEAST n more unit fractions below 1/n, so as you get to smaller and
    smaller unit fractions there are more and more to come, becuase that is
    just how infinite sets work, and how badly the actual mathematics of
    unbounded sets break the conventions of finite mathematics.

    Your logic is just all blown up by the unsafe use of explosive
    contradctory logic.


    Regards, WM



    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From joes@21:1/5 to All on Fri Aug 16 18:11:18 2024
    Am Fri, 16 Aug 2024 16:59:11 +0000 schrieb WM:
    Le 16/08/2024 à 18:49, joes a écrit :
    Am Fri, 16 Aug 2024 16:45:29 +0000 schrieb WM:

    It does not diminish, there are always infinitely many.
    Not according to mathematics: ∀n ∈ ℕ: 1/n - 1/(n+1) > 0 .
    I don't see the connection.

    --
    Am Sat, 20 Jul 2024 12:35:31 +0000 schrieb WM in sci.math:
    It is not guaranteed that n+1 exists for every n.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Jim Burns@21:1/5 to Chris M. Thomasson on Fri Aug 16 15:04:49 2024
    On 8/16/2024 2:44 PM, Chris M. Thomasson wrote:
    On 8/16/2024 11:10 AM, Jim Burns wrote:

    Taking an equation and waving it around,
    apparently just for the hell of it,
    has a lot of parallels to
    carving headphones from wood and
    sitting in a fabricated control tower.

    ROFL!!!

    Me too.

    Congratulations on making the cover of
    the AMS calendar.
    https://i.ibb.co/MsWt6Mc/ct-p0.jpg

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Fri Aug 16 22:12:05 2024
    Am 16.08.2024 um 20:11 schrieb joes:
    Am Fri, 16 Aug 2024 16:59:11 +0000 schrieb WM:
    Le 16/08/2024 à 18:49, joes a écrit :

    It does not diminish, there are always infinitely many.

    Not according to mathematics: ∀n ∈ ℕ: 1/n - 1/(n+1) > 0 .

    I don't see the connection.

    Hmmm... Maybe because there *is no* connection?

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Richard Damon@21:1/5 to joes on Fri Aug 16 16:38:36 2024
    On 8/16/24 2:11 PM, joes wrote:
    Am Fri, 16 Aug 2024 16:59:11 +0000 schrieb WM:
    Le 16/08/2024 à 18:49, joes a écrit :
    Am Fri, 16 Aug 2024 16:45:29 +0000 schrieb WM:

    It does not diminish, there are always infinitely many.
    Not according to mathematics: ∀n ∈ ℕ: 1/n - 1/(n+1) > 0 .
    I don't see the connection.


    His thought process seems to be that since there is a finite spacing
    between all the unit fractions, you can not actually have an infinite
    number of them, as the sum of all the spaces would become bigger than one.

    That is just a logical fallacy, a very classical one based on the Zeno
    Paradox that if Achilles gives the turtle a head start, he can never
    pass it and beat it in a race, as every time Achilles runs to the spot
    where the turtle was, it has moved forward some, so we need to do
    another loop.

    Of course, the answer is that the numbers shrink fast enough that even
    though we add an infinite number of them, they only sum to a finite number.

    Each being finite doesn't mean there is a lower bound on their values
    (other than 0), unlike the results you get when you use logic about
    finite sets, where there will be a lowest value in the set.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From joes@21:1/5 to All on Sat Aug 17 11:43:27 2024
    Am Wed, 14 Aug 2024 12:32:41 +0000 schrieb WM:
    Le 13/08/2024 à 19:51, Moebius a écrit :
    Am 13.08.2024 um 19:02 schrieb Jim Burns:
    On 8/13/2024 10:21 AM, WM wrote:

    Actually, for each and every real number x > 0 there are infinitely
    many unit fractions smaller than x:
    That is wrong because ℵo unit fractions occupy a nonvanishig real
    interval, call it y. Then not every point of y has infinitely many unit fractions smaller than it self.

    In fact, Ax > 0: NUF(x) = aleph_0, while NUF(0) = 0.
    A very stupid statement. It claims unit fractions smaller than every
    positive x. "Every positive x" is tantamount to the interval (0, oo).
    Quantifier shift.

    --
    Am Sat, 20 Jul 2024 12:35:31 +0000 schrieb WM in sci.math:
    It is not guaranteed that n+1 exists for every n.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Sat Aug 17 13:33:43 2024
    Le 16/08/2024 à 20:02, Richard Damon a écrit :

    Or just that you just don't believe in how
    This proves a first one: ∀n ∈ ℕ: 1/n - 1/(n+1) > 0 .

    No, that proves that there is no smallest unit fraction as it shows that 1/(n+1) exists,

    No, that does it not show.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Sat Aug 17 13:37:51 2024
    Le 16/08/2024 à 20:11, joes a écrit :
    Am Fri, 16 Aug 2024 16:59:11 +0000 schrieb WM:

    It does not diminish, there are always infinitely many.
    Not according to mathematics: ∀n ∈ ℕ: 1/n - 1/(n+1) > 0 .
    I don't see the connection.

    NUF(x) grows from 0 to more, but at no point it grows by more than 1.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Sat Aug 17 13:36:50 2024
    Le 16/08/2024 à 20:11, Jim Burns a écrit :
    On 8/16/2024 12:59 PM, WM wrote:

    ∀n ∈ ℕ: 1/n - 1/(n+1) > 0 .

    Taking an equation and waving it around,

    It shows that NUF(x) at no point grows by more than 1. But NUF(x) grows.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Sat Aug 17 13:30:05 2024
    Le 16/08/2024 à 19:54, Jim Burns a écrit :
    On 8/16/2024 1:00 PM, WM wrote:

    Start from x = 0.
    The increase cannot be more than 1.
    ∀n ∈ ℕ: 1/n - 1/(n+1) > 0

    Start from x = 0
    The increase cannot be less than 2

    That violates ∀n ∈ ℕ: 1/n - 1/(n+1) > 0 .

    ∀ᴿx > 0: x > ⅟nₓ > ⅟(nₓ+1)
    nₓ = ⌊1+⅟x⌋

    That holds only for definable numbers.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Sat Aug 17 13:39:52 2024
    Le 16/08/2024 à 20:11, joes a écrit :
    Am Fri, 16 Aug 2024 17:00:26 +0000 schrieb WM:
    Le 16/08/2024 à 18:50, joes a écrit :
    Am Fri, 16 Aug 2024 16:19:17 +0000 schrieb WM:

    Taking steps only until the next unit fraction, you never reach 0.
    Start from x = 0. The increase cannot be more than 1.
    No, you were counting down from 1.

    There we see that counting down to 0 requires dark numbers.

    But it is easier counting from NUF(x) = 0 to more. Never by more than 1.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Sat Aug 17 13:42:03 2024
    Le 17/08/2024 à 13:43, joes a écrit :
    Am Wed, 14 Aug 2024 12:14:21 +0000 schrieb WM:

    Every chosen ε > 0 is larger than this interval y.
    Then y must be 0, if epsilon can't be chosen smaller.

    Try to choose an eps smaller infinitely many unit fractions. Fail.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Sat Aug 17 13:46:10 2024
    Le 17/08/2024 à 13:43, joes a écrit :
    Am Wed, 14 Aug 2024 12:32:41 +0000 schrieb WM:
    "Every positive x" is tantamount to the interval (0, oo).
    Quantifier shift.

    The interval that contains every positive x is (0, oo). Find an exception.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Richard Damon@21:1/5 to All on Sat Aug 17 10:15:08 2024
    On 8/17/24 9:42 AM, WM wrote:
    Le 17/08/2024 à 13:43, joes a écrit :
    Am Wed, 14 Aug 2024 12:14:21 +0000 schrieb WM:

    Every chosen ε > 0 is larger than this interval y.
    Then y must be 0, if epsilon can't be chosen smaller.

    Try to choose an eps smaller infinitely many unit fractions. Fail.

    Regards, WM



    You just confuse your qualifiers as you don't seem to understand how
    logic, or mathematics works.

    We can choose an eps smaller than ANY GIVEN value.

    That doesn't mean we can choose an eps smaller than ALL values.

    That you can't tell the difference, just shows you don't understand the properties of unbounded sets, because your logic is too small and blew
    itself up when misapplied, taking your brain out with it.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Richard Damon@21:1/5 to All on Sat Aug 17 10:17:28 2024
    On 8/17/24 9:30 AM, WM wrote:
    Le 16/08/2024 à 19:54, Jim Burns a écrit :
    On 8/16/2024 1:00 PM, WM wrote:

    Start from x = 0.
    The increase cannot be more than 1.
    ∀n ∈ ℕ: 1/n - 1/(n+1) > 0

    Start from x = 0
    The increase cannot be less than 2

    That violates ∀n ∈ ℕ: 1/n - 1/(n+1) > 0 .

    ∀ᴿx > 0:  x  >  ⅟nₓ  >  ⅟(nₓ+1)
    nₓ = ⌊1+⅟x⌋

    That holds only for definable numbers.

    Regards, WM



    Which is all of the Rational Numbers, and thus all of the unit fractions.

    Thats your problem, you don't seem to know how to definie numbers.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Richard Damon@21:1/5 to All on Sat Aug 17 10:22:03 2024
    On 8/17/24 9:37 AM, WM wrote:
    Le 16/08/2024 à 20:11, joes a écrit :
    Am Fri, 16 Aug 2024 16:59:11 +0000 schrieb WM:

    It does not diminish, there are always infinitely many.
    Not according to mathematics: ∀n ∈ ℕ: 1/n - 1/(n+1) > 0 .
    I don't see the connection.

    NUF(x) grows from 0 to more, but at no point it grows by more than 1.

    Regards, WM

    And there is "no point" that is smaller than all unit fractions but
    greater than 0, so at that point NUF(x) jumps from 0 to Aleph_0.

    Your problem is NUF(x) may have a clear verbal description, but not a mathematical one, as it is based on a false assumption that there exists
    a smallest unit fraction. Thus, you argument is you try to "prove" there
    is a smallest unit fraction, using assumng a function that only exists
    if there is a smallest unit fraction.

    Sorry, your logic, and your brain, has exploded based on contradictions.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Richard Damon@21:1/5 to FromTheRafters on Sat Aug 17 12:21:02 2024
    On 8/17/24 11:56 AM, FromTheRafters wrote:
    Richard Damon formulated on Saturday :
    On 8/17/24 9:30 AM, WM wrote:
    Le 16/08/2024 à 19:54, Jim Burns a écrit :
    On 8/16/2024 1:00 PM, WM wrote:

    Start from x = 0.
    The increase cannot be more than 1.
    ∀n ∈ ℕ: 1/n - 1/(n+1) > 0

    Start from x = 0
    The increase cannot be less than 2

    That violates ∀n ∈ ℕ: 1/n - 1/(n+1) > 0 .

    ∀ᴿx > 0:  x  >  ⅟nₓ  >  ⅟(nₓ+1)
    nₓ = ⌊1+⅟x⌋

    That holds only for definable numbers.

    Regards, WM



    Which is all of the Rational Numbers, and thus all of the unit fractions.

    Thats your problem, you don't seem to know how to definie numbers.

    Worse than that, he tries to make a set of undefined/undefinable numbers which he calls dark numbers while sets have well defined elements.

    No, he can have his "dark numbers", but either they are the result of
    his system just not being able to handle unbounded sets, or they are the beyond-finite numbers that exist in the space between the Natural
    Numbers and simple infinities, or between 0 and the positive finite numbers.

    There are number system that define these sorts of numbers, and the
    basic logic that handles the unbounded finites can't deal with them, so
    they could be considered "dark" and undefinable.

    Of course, since his logic can't even handle the unbounded numbers, it
    can't handle them at all.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Jim Burns@21:1/5 to All on Sat Aug 17 17:44:01 2024
    On 8/17/2024 9:36 AM, WM wrote:
    Le 16/08/2024 à 20:11, Jim Burns a écrit :
    On 8/16/2024 12:59 PM, WM wrote:

    ∀n ∈ ℕ: 1/n - 1/(n+1) > 0 .

    Taking an equation and waving it around,

    It shows that
    NUF(x) at no point grows by more than 1.

    At unit.fractions. Not at 0.

    But NUF(x) grows.

    At 0. Not at unit fractions.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Sun Aug 18 04:01:48 2024
    Am 17.08.2024 um 23:44 schrieb Jim Burns:
    On 8/17/2024 9:36 AM, WM wrote:

    NUF(x) at no point grows by more than 1.

    NUF does not "grow" anywhere, Du dummer Spinner.

    It "jumps at 0".

    But NUF(x) grows.

    Nein, it does not grow (in the usual sense of the word).

    At 0.

    Nope. At x = 0 NUF(x) has the value 0. No "growth" at all.

    Though there is a "jump at 0".

    See: https://en.wikipedia.org/wiki/Classification_of_discontinuities#Jump_discontinuity

    and: https://cglab.ca/~discmath/growth-of-functions.html

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From joes@21:1/5 to All on Sun Aug 18 08:16:56 2024
    Am Sat, 17 Aug 2024 13:42:03 +0000 schrieb WM:
    Le 17/08/2024 à 13:43, joes a écrit :
    Am Wed, 14 Aug 2024 12:14:21 +0000 schrieb WM:

    Every chosen ε > 0 is larger than this interval y.
    Then y must be 0, if epsilon can't be chosen smaller.
    Try to choose an eps smaller infinitely many unit fractions. Fail.
    Why should it be possible?

    --
    Am Sat, 20 Jul 2024 12:35:31 +0000 schrieb WM in sci.math:
    It is not guaranteed that n+1 exists for every n.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From joes@21:1/5 to All on Sun Aug 18 09:30:05 2024
    Am Sat, 17 Aug 2024 13:37:51 +0000 schrieb WM:
    Le 16/08/2024 à 20:11, joes a écrit :
    Am Fri, 16 Aug 2024 16:59:11 +0000 schrieb WM:

    It does not diminish, there are always infinitely many.
    Not according to mathematics: ∀n ∈ ℕ: 1/n - 1/(n+1) > 0 .
    I don't see the connection.
    NUF(x) grows from 0 to more, but at no point it grows by more than 1.
    How does it even reach infinity then?

    --
    Am Sat, 20 Jul 2024 12:35:31 +0000 schrieb WM in sci.math:
    It is not guaranteed that n+1 exists for every n.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Mon Aug 19 11:26:02 2024
    Le 17/08/2024 à 16:15, Richard Damon a écrit :
    On 8/17/24 9:42 AM, WM wrote:

    Try to choose an eps smaller infinitely many unit fractions. Fail.

    You just confuse your qualifiers

    No, I use quantifiers.

    We can choose an eps smaller than ANY GIVEN value.

    But you cannot give a value containing only the three smallest unit
    fractions although they exist because all exist and are separated.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Mon Aug 19 11:29:50 2024
    Le 17/08/2024 à 16:22, Richard Damon a écrit :
    On 8/17/24 9:37 AM, WM wrote:

    NUF(x) grows from 0 to more, but at no point it grows by more than 1.

    And there is "no point" that is smaller than all unit fractions but
    greater than 0, so at that point NUF(x) jumps from 0 to Aleph_0.

    That is superstition.

    Your problem is NUF(x) may have a clear verbal description, but not a mathematical one, as it is based on a false assumption that there exists
    a smallest unit fraction.

    That is not an assumption but it is derived from the mathematics:
    ∀n ∈ ℕ: 1/n - 1/(n+1) > 0

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Richard Damon@21:1/5 to All on Mon Aug 19 07:36:27 2024
    On 8/19/24 7:26 AM, WM wrote:
    Le 17/08/2024 à 16:15, Richard Damon a écrit :
    On 8/17/24 9:42 AM, WM wrote:

    Try to choose an eps smaller infinitely many unit fractions. Fail.

    You just confuse your qualifiers

    No, I use quantifiers.

    We can choose an eps smaller than ANY GIVEN value.

    But you cannot give a value containing only the three smallest unit
    fractions although they exist because all exist and are separated.

    Regards, WM



    All the numbers exist. What doesn't exist is the "end" in the system to
    start counting them from that side.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Richard Damon@21:1/5 to All on Mon Aug 19 07:34:54 2024
    On 8/19/24 7:29 AM, WM wrote:
    Le 17/08/2024 à 16:22, Richard Damon a écrit :
    On 8/17/24 9:37 AM, WM wrote:

    NUF(x) grows from 0 to more, but at no point it grows by more than 1.

    And there is "no point" that is smaller than all unit fractions but
    greater than 0, so at that point NUF(x) jumps from 0 to Aleph_0.

    That is superstition.

    Your problem is NUF(x) may have a clear verbal description, but not a
    mathematical one, as it is based on a false assumption that there
    exists a smallest unit fraction.

    That is not an assumption but it is derived from the mathematics:
    ∀n ∈ ℕ: 1/n - 1/(n+1) > 0
    Regards, WM


    But that doesn't say there is a smallest unit fraction, in fact it says
    there isn't as 1/(n+1) will ALWAYS be smaller than 1/n, and by your own definitions, since it was just used individually, is defined. In fact,
    if your system actually has the Natural Numbers, for every n, the number
    n+1 exists and is well defined.

    This means that there is no highest Natural Number, or smallest Unit
    Fraction, and any system that tries to say otherwise doesn't actually
    have the Natural Numbers within it.

    That describes your system which can not actually support the Natural
    numbers, and blows up when you assume they must exist in it.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Mon Aug 19 11:44:34 2024
    Le 17/08/2024 à 23:44, Jim Burns a écrit :
    On 8/17/2024 9:36 AM, WM wrote:
    Le 16/08/2024 à 20:11, Jim Burns a écrit :
    On 8/16/2024 12:59 PM, WM wrote:

    NUF(x) at no point grows by more than 1.

    At unit.fractions. Not at 0.

    But NUF(x) grows.

    At 0. Not at unit fractions.

    You are not entitled to change the definition of NUF(x). NUF(x) grows at
    every unit fractions by 1. At 0 there is no unit fractions, therefore
    NUF(0) = 0 as for all negative arguments. The firstincrease happens at the first unit fraction.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Mon Aug 19 11:46:58 2024
    Le 18/08/2024 à 04:01, Moebius a écrit :
    Am 17.08.2024 um 23:44 schrieb Jim Burns:
    On 8/17/2024 9:36 AM, WM wrote:

    NUF(x) at no point grows by more than 1.

    NUF does not "grow" anywhere,

    It "jumps at 0".

    Why should it? It grows from 0 to 1 at the smallest unit fraction.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Mon Aug 19 11:54:16 2024
    Le 18/08/2024 à 10:16, joes a écrit :
    Am Sat, 17 Aug 2024 13:42:03 +0000 schrieb WM:

    Try to choose an eps smaller infinitely many unit fractions. Fail.
    Why should it be possible?

    Because when infinitely many exist, then also finitely many must exist - according to logic and mathematics: ∀n ∈ ℕ: 1/n - 1/(n+1) > 0 . Everything else is the superstition of matheologians.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Mon Aug 19 11:57:24 2024
    Le 18/08/2024 à 11:30, joes a écrit :
    Am Sat, 17 Aug 2024 13:37:51 +0000 schrieb WM:

    NUF(x) grows from 0 to more, but at no point it grows by more than 1.
    How does it even reach infinity then?

    It passes through darkness. There is no end visible. That means growth
    without end. We call it infinity.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Mon Aug 19 11:59:52 2024
    Le 19/08/2024 à 13:34, Richard Damon a écrit :
    On 8/19/24 7:29 AM, WM wrote:

    That is not an assumption but it is derived from the mathematics:
    ∀n ∈ ℕ: 1/n - 1/(n+1) > 0

    But that doesn't say there is a smallest unit fraction,

    This formula says that never more than one unit fraction appears at a
    point x. Since not many can appear together, there must be a first one.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Mon Aug 19 11:51:23 2024
    Le 18/08/2024 à 10:16, joes a écrit :
    Am Sat, 17 Aug 2024 13:39:52 +0000 schrieb WM:

    There we see that counting down to 0 requires dark numbers.
    Counting down from infinity is not possible.

    Then also counting up from 0 to infinity. But Cantor claims it:

     "If we think the numbers p/q in such an order [...] then every number
    p/q comes at an absolutely fixed position of a simple infinite sequence."
     "The infinite sequence thus defined has the peculiar property to
    contain the positive rational numbers completely, and each of them only
    once at a determined place."
     "[...] so we get the epitome (ω) of all real algebraic numbers [...]
    and with respect to this order we can talk about the th algebraic
    number where not a single one of this epitome () is forgotten."
     "[...] such that every element of the set stands at a definite
    position of this sequence."

    "Werden nun die Zahlen p/q in einer solchen Reihenfolge gedacht, [...]
    so kommt jede der Zahlen p/q an eine ganz bestimmte Stelle einer einfach unendlichen Reihe," [26]
    "Die so definirte unendliche Reihe hat nun das merkwürdige an sich, sämmtliche positiven rationalen Zahlen und jede von ihnen nur einmal an
    einer bestimmten Stelle zu enthalten." [27]
    "[...] so erhält man den Inbegriff (ω) aller reellen algebraischen
    Zahlen [...] und kann mit Rücksicht auf diese Anordnung von der ten algebraischen Zahl reden, wobei keine einzige aus dem Inbegriffe (ω)
    vergessen ist." [28]
    "[...] so daß jedes Element der Menge an einer bestimmten Stelle dieser Reihe steht" [29]

    Your "dark" numbers
    are a nonstandard extension.

    If Cantor is right, then dark numbers are necessary - for counting up and counting down.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Jim Burns@21:1/5 to All on Mon Aug 19 15:06:44 2024
    On 8/19/2024 7:44 AM, WM wrote:
    Le 17/08/2024 à 23:44, Jim Burns a écrit :
    On 8/17/2024 9:36 AM, WM wrote:

    NUF(x) at no point grows by more than 1.

    At unit.fractions. Not at 0.

    But NUF(x) grows.

    At 0. Not at unit fractions.

    You are not entitled to change the definition of NUF(x).

    NUF(x) ≥ NUFᵈᵉᶠ(x) = |⅟ℕᵈᵉᶠ∩(∞,x]|

    NUF(0) = NUFᵈᵉᶠ(0) = 0

    ∀ᴿx > 0: NUF(x) ≥ NUFᵈᵉᶠ(x) > 0
    NUF(x) grows at 0

    β = glb.{ y∈ℝ: ⅟ℕᵈᵉᶠ∩(∞,y]≠{} }

    β = 0

    ⎛ Assume β > 0
    ⎜ not.bound 2⋅β > ⅟k ∈ ⅟ℕᵈᵉᶠ
    ⎜ not.bound ½⋅β > ¼⋅⅟k ∈ ⅟ℕᵈᵉᶠ
    ⎜ bound ½⋅β < β
    ⎝ Contradiction.

    Therefore, β = 0
    ∀ᴿx > 0: NUF(x) ≥ NUFᵈᵉᶠ(x) > 0
    NUF(x) grows at 0

    NUF(x) grows at every unit fractions by 1.

    No. ℵ₀+1 = ℵ₀

    At 0 there is no unit fractions,
    therefore NUF(0) = 0
    as for all negative arguments.
    The firstincrease happens at the first unit fraction.

    No positive lower.bound, darkᵂᴹ or visibleᵂᴹ, exists of
    visibleᵂᴹ unit.fractions.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Jim Burns@21:1/5 to All on Mon Aug 19 15:33:25 2024
    On 8/19/2024 7:57 AM, WM wrote:
    Le 18/08/2024 à 11:30, joes a écrit :
    Am Sat, 17 Aug 2024 13:37:51 +0000 schrieb WM:

    NUF(x) grows from 0 to more,
    but at no point it grows by more than 1.

    How does it even reach infinity then?

    It passes through darkness.
    There is no end visible.
    That means growth without end.
    We call it infinity.

    Definition.
    ⎛ An order ⟨B,<⟩ of B is finiteᵖᵍˢˢ
    ⎜⎛ in the sense proposed by
    ⎜⎝ Paul Gustav Samuel Stäckelᵖᵍˢˢ (1862...1919)
    ⎜ iff
    ⎜ each non.empty subset S ⊆ B holds
    ⎝ both min[<].S and max[<].S

    Lemma 1.
    ⎛ No set B has both
    ⎜ finiteᵖᵍˢˢ order ⟨B,<⟩ and
    ⎝ infiniteᵖᵍˢˢ order ⟨B,◀⟩.

    Lemma 2.
    ⎛ No set B, no element x, no order '◀' exists
    ⎜ such that
    ⎝ ⟨B,◀⟩ is finiteᵖᵍˢˢ and ⟨B∪{x},◀⟩ is infiniteᵖᵍˢˢ.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Richard Damon@21:1/5 to All on Mon Aug 19 21:43:01 2024
    On 8/19/24 7:54 AM, WM wrote:
    Le 18/08/2024 à 10:16, joes a écrit :
    Am Sat, 17 Aug 2024 13:42:03 +0000 schrieb WM:

    Try to choose an eps smaller infinitely many unit fractions. Fail.
    Why should it be possible?

    Because when infinitely many exist, then also finitely many must exist - according to logic and mathematics: ∀n ∈ ℕ: 1/n - 1/(n+1) > 0 . Everything else is the superstition of matheologians.

    Regards, WM

    But why should the finite sub-set need to include the (non-existant)
    first of the infinite set.

    Yes, your finite "natnumbers" which have a highest vaule, will have a
    lowest unit fraction whose 1/n doesn't have a 1/(n+1) with in it,

    But the FULL set of unit fractions based on the INFINITE set of Natural
    Numbers WILL include that n+1, and thus that 1/(n+1) so the 1/n wasn't
    the first unit fraction of the full set, only your finite sub-set that
    no one else cares about.

    When you ADMIT that you are talking about a finite set, and thus
    something that CAN'T be the actual set of Natural Numbers, why do we care.

    And if NUF(x) counts the unit fractions of NatNumbers, then NUF(1) won't
    be aleph_0, but the size of that set of NatNumbers.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Tue Aug 20 13:10:40 2024
    Le 19/08/2024 à 21:06, Jim Burns a écrit :
    On 8/19/2024 7:44 AM, WM wrote:

    NUF(x) grows at every unit fractions by 1.

    No. ℵ₀+1 = ℵ₀

    NUF starts at 0 from 0.

    At 0 there is no unit fractions,
    therefore NUF(0) = 0
    as for all negative arguments.
    The first increase happens at the first unit fraction.

    No positive lower.bound, darkᵂᴹ or visibleᵂᴹ, exists of
    visibleᵂᴹ unit.fractions.

    There is a smallest dark unit fraction. The function NUF(x) grows by 1 at
    every unit fraction. It starts from 0.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Tue Aug 20 13:14:42 2024
    Le 19/08/2024 à 22:10, "Chris M. Thomasson" a écrit :
    The unit fractions get arbitrarily close to zero, but no unit
    fraction ever equals zero...

    And never two equal each other. Hence NUF(x) starts from 0 and grows to 1 before it continues to grow farther.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Wed Aug 21 07:15:11 2024
    Am 20.08.2024 um 21:35 schrieb Chris M. Thomasson:

    Do you even now how to make a Cantor Set Fractal?

    Talking about fractals, there's an extremely simple "fractal".

    Just consider the real line from 0 to 1 and the points 1/2, 1/4, 1/8,
    ... (ad infinitum).

    If you "zoom in" at 0 bei the factors 2, 4, 8, etc. and just "focus" on
    the (new) "0 ... 1 part" of the "magnified" line, you will always "see"
    the same pattern.

    Noes?

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From joes@21:1/5 to All on Wed Aug 21 13:13:45 2024
    Am Wed, 21 Aug 2024 12:24:14 +0000 schrieb WM:
    Le 21/08/2024 à 12:58, FromTheRafters a écrit :
    WM wrote :
    Le 20/08/2024 à 23:25, FromTheRafters a écrit :
    WM explained :
    Le 20/08/2024 à 12:31, FromTheRafters a écrit :
    on 8/19/2024, Richard Damon supposed :

    You can not derive a first number > 0 in any of the Number System >>>>>>> that we have been talking about, Unit Fractions, Rationals or
    Reals, so you can't claim it to exist.

    Not in their natural ordering.

    Dark numbers have no discernible order. It is impossible to find the >>>>> smallest unit fraction or the next one or the next one. It is only
    possible to prove that NUF(x) grows by 1 at every unit fraction. It
    starts from 0.

    Normally, the unit fractions are listed in the sequence one over one,
    one over two, one over three etcetera. There is a first but no last.
    Now you have started from the wrong 'end'

    No, I have started from the other end.
    Correct, that is the wrong end.
    It is an end which proves dark numbers.
    Why should there be an end in the first place? Are there not infinitely
    many unit fractions?

    It exists at x > 0 because NUF(0) = 0.
    Since no unit fraction is below or at zero, the end is before. What
    else?

    --
    Am Sat, 20 Jul 2024 12:35:31 +0000 schrieb WM in sci.math:
    It is not guaranteed that n+1 exists for every n.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Wed Aug 21 15:51:18 2024
    Am 21.08.2024 um 15:13 schrieb joes:
    Am Wed, 21 Aug 2024 12:24:14 +0000 schrieb WM:

    Since no unit fraction is below or at zero, the end is before.

    Since there is no smallest unit fraction, there is no end.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Wed Aug 21 14:53:27 2024
    Le 21/08/2024 à 15:51, Moebius a écrit :
    Am 21.08.2024 um 15:13 schrieb joes:
    Am Wed, 21 Aug 2024 12:24:14 +0000 schrieb WM:

    Since no unit fraction is below or at zero, the end is before.

    Since there is no smallest unit fraction, there is no end.

    The other way round. There is an end, because at and below zero there is
    no unit fraction. Therefore there is an end before. Simple as that.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Wed Aug 21 14:58:50 2024
    Le 21/08/2024 à 15:13, joes a écrit :
    Am Wed, 21 Aug 2024 12:24:14 +0000 schrieb WM:

    It is an end which proves dark numbers.
    Why should there be an end in the first place?

    There is indisputably an interval without unit fractions, namely (-oo, 0].
    That indicates an end before. It proves an end before. Only cranks can
    deny that.

    Are there not infinitely
    many unit fractions?

    Yes, the dark unit fractions cannot be counted through. There are more
    than can be counted.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From joes@21:1/5 to All on Wed Aug 21 18:14:28 2024
    Am Wed, 21 Aug 2024 14:58:50 +0000 schrieb WM:
    Le 21/08/2024 à 15:13, joes a écrit :
    Am Wed, 21 Aug 2024 12:24:14 +0000 schrieb WM:

    It is an end which proves dark numbers.
    Why should there be an end in the first place?

    There is indisputably an interval without unit fractions, namely (-oo,
    0].
    That indicates an end before. It proves an end before. Only cranks can
    deny that.
    The unit fractions get denser toward 0. They are all positive.

    Are there not infinitely many unit fractions?
    Yes, the dark unit fractions cannot be counted through. There are more
    than can be counted.
    I was talking about the regular ones.

    --
    Am Sat, 20 Jul 2024 12:35:31 +0000 schrieb WM in sci.math:
    It is not guaranteed that n+1 exists for every n.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Wed Aug 21 20:34:49 2024
    Am 21.08.2024 um 20:15 schrieb joes:
    Am Wed, 21 Aug 2024 14:53:27 +0000 schrieb WM:
    Le 21/08/2024 à 15:51, Moebius a écrit :
    Am 21.08.2024 um 15:13 schrieb joes:
    Am Wed, 21 Aug 2024 12:24:14 +0000 schrieb WM:

    Since no unit fraction is below or at zero, the end is before.
    Since there is no smallest unit fraction, there is no end.
    The other way round. There is an end, because at and below zero there is
    no unit fraction. Therefore there is an end before. Simple as that.

    Stupid as this: „There is a last negative power of 2.”

    Yeah, it's like claiming: "There is an end (to the natural numbers),
    because at and above omega there is no natural number. Therefor there is
    an end before. Simple as Mückenheim."

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From joes@21:1/5 to All on Wed Aug 21 18:15:44 2024
    Am Wed, 21 Aug 2024 14:53:27 +0000 schrieb WM:
    Le 21/08/2024 à 15:51, Moebius a écrit :
    Am 21.08.2024 um 15:13 schrieb joes:
    Am Wed, 21 Aug 2024 12:24:14 +0000 schrieb WM:

    Since no unit fraction is below or at zero, the end is before.
    Since there is no smallest unit fraction, there is no end.
    The other way round. There is an end, because at and below zero there is
    no unit fraction. Therefore there is an end before. Simple as that.
    Stupid as this: „There is a last negative power of 2.”

    --
    Am Sat, 20 Jul 2024 12:35:31 +0000 schrieb WM in sci.math:
    It is not guaranteed that n+1 exists for every n.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From joes@21:1/5 to All on Thu Aug 22 07:35:26 2024
    Am Mon, 19 Aug 2024 11:32:44 +0000 schrieb WM:
    Le 17/08/2024 à 16:29, Richard Damon a écrit :
    On 8/17/24 9:28 AM, WM wrote:
    Le 16/08/2024 à 19:39, Jim Burns a écrit :

    no element of ℕᵈᵉᶠ is its upper.end, because for each diminishable k
    diminishable k+1 disproves by counter.example that k is the upper.end
    of ℕᵈᵉᶠ
    SBZ(x) starts with 0 at 0 and increases, but at no point x it
    increases by more than 1 because of ∀n ∈ ℕ: 1/n - 1/(n+1) > 0.
    Therefore there is a smallest unit fractions and vice versa a greatest
    natnumber. What can't you understand?
    But there is no point (>0) where it has a finite value,
    You can't see it and you are unable to derive it from mathematics. But blindness is not an argument.
    Neither is darkness.

    --
    Am Sat, 20 Jul 2024 12:35:31 +0000 schrieb WM in sci.math:
    It is not guaranteed that n+1 exists for every n.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Thu Aug 22 10:55:47 2024
    Le 21/08/2024 à 18:21, FromTheRafters a écrit :
    WM used his keyboard to write :

    The other way round. There is an end, because at and below zero there is no >> unit fraction. Therefore there is an end before. Simple as that.

    The "sequence" doesn't end.

    Then it must go on below zero. But it does not.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Thu Aug 22 11:07:42 2024
    Le 21/08/2024 à 20:14, joes a écrit :
    Am Wed, 21 Aug 2024 14:58:50 +0000 schrieb WM:
    Le 21/08/2024 à 15:13, joes a écrit :
    Am Wed, 21 Aug 2024 12:24:14 +0000 schrieb WM:

    It is an end which proves dark numbers.
    Why should there be an end in the first place?

    There is indisputably an interval without unit fractions, namely (-oo,
    0].
    That indicates an end before. It proves an end before. Only cranks can
    deny that.
    The unit fractions get denser toward 0. They are all positive.

    They all have gaps. This implies a last one if all are existing.

    Are there not infinitely many unit fractions?
    Yes, the dark unit fractions cannot be counted through. There are more
    than can be counted.
    I was talking about the regular ones.

    They are potentially infinite: After each one many more appear. They do
    never end. But that's not my topic.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Thu Aug 22 11:09:13 2024
    Le 21/08/2024 à 20:15, joes a écrit :
    Am Wed, 21 Aug 2024 14:53:27 +0000 schrieb WM:
    Le 21/08/2024 à 15:51, Moebius a écrit :
    Am 21.08.2024 um 15:13 schrieb joes:
    Am Wed, 21 Aug 2024 12:24:14 +0000 schrieb WM:

    Since no unit fraction is below or at zero, the end is before.
    Since there is no smallest unit fraction, there is no end.
    The other way round. There is an end, because at and below zero there is
    no unit fraction. Therefore there is an end before. Simple as that.
    Stupid as this: „There is a last negative power of 2.”

    *If there is a complete chain*, then it has a last member.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Thu Aug 22 12:26:08 2024
    Le 22/08/2024 à 09:35, joes a écrit :
    Am Mon, 19 Aug 2024 11:32:44 +0000 schrieb WM:
    But
    blindness is not an argument.
    Neither is darkness.

    No, the argument is this: ∀n ∈ ℕ: 1/n - 1/(n+1) > 0 . No-one every
    has denied it.
    Dark numbers are an explanation.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Thu Aug 22 12:19:58 2024
    XPost: sci.logic

    Le 22/08/2024 à 02:10, Richard Damon a écrit :
    On 8/21/24 8:32 AM, WM wrote:

    No, it is a finite number. ∀n ∈ ℕ: 1/n - 1/(n+1) > 0 holds for all and >> only reciprocals of natural numbers.

    Can't be, because if it WAS 1/n, then 1/(n+1) would be before it,

    That is tadopted from definable numbers. It is not true for all dark
    numbers.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Thu Aug 22 12:16:17 2024
    Le 21/08/2024 à 20:34, Moebius a écrit :

    Yeah, it's like claiming: "There is an end (to the natural numbers),
    because at and above omega there is no natural number.

    Of course, but omega is somewhat ghostly. Do the natnumbers reach till
    omega? Is there a gap? Zero is fixed and firm, existing with certainty.
    The positive reals reach till zero with no doubt. There NUF = 0. And
    because of ∀n ∈ ℕ: 1/n - 1/(n+1) > 0 it cannot increase by more than
    1 per point x.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From joes@21:1/5 to All on Thu Aug 22 13:36:44 2024
    Am Thu, 22 Aug 2024 10:54:46 +0000 schrieb WM:
    Le 21/08/2024 à 18:20, FromTheRafters a écrit :
    WM presented the following explanation :

    Since no unit fraction is below or at zero, the end is before. What
    else?
    No end, Duh!!
    In a linear order of elements which all have distances from each other,
    there is necessarily a last one (if nothing follows) because the only alternative would be more than one. Matheologial conjuring trick is
    outside of mathematics.
    Why is no end impossible?

    --
    Am Sat, 20 Jul 2024 12:35:31 +0000 schrieb WM in sci.math:
    It is not guaranteed that n+1 exists for every n.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From joes@21:1/5 to All on Thu Aug 22 13:37:17 2024
    Am Thu, 22 Aug 2024 10:55:47 +0000 schrieb WM:
    Le 21/08/2024 à 18:21, FromTheRafters a écrit :
    WM used his keyboard to write :

    The other way round. There is an end, because at and below zero there
    is no unit fraction. Therefore there is an end before. Simple as that.
    The "sequence" doesn't end.
    Then it must go on below zero. But it does not.
    It continues in ever smaller steps.

    --
    Am Sat, 20 Jul 2024 12:35:31 +0000 schrieb WM in sci.math:
    It is not guaranteed that n+1 exists for every n.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From joes@21:1/5 to All on Thu Aug 22 13:40:48 2024
    Am Thu, 22 Aug 2024 12:16:17 +0000 schrieb WM:
    Le 21/08/2024 à 20:34, Moebius a écrit :

    Yeah, it's like claiming: "There is an end (to the natural numbers),
    because at and above omega there is no natural number.
    Of course, but omega is somewhat ghostly. Do the natnumbers reach till
    omega? Is there a gap? Zero is fixed and firm, existing with certainty.
    The positive reals reach till zero with no doubt. There NUF = 0. And
    because of ∀n ∈ ℕ: 1/n - 1/(n+1) > 0 it cannot increase by more than 1 per point x.
    The reals do, but not the unit fractions. 1/0 is not a unit fraction.

    --
    Am Sat, 20 Jul 2024 12:35:31 +0000 schrieb WM in sci.math:
    It is not guaranteed that n+1 exists for every n.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From joes@21:1/5 to All on Thu Aug 22 13:39:00 2024
    Am Thu, 22 Aug 2024 11:09:13 +0000 schrieb WM:
    Le 21/08/2024 à 20:15, joes a écrit :
    Am Wed, 21 Aug 2024 14:53:27 +0000 schrieb WM:
    Le 21/08/2024 à 15:51, Moebius a écrit :
    Am 21.08.2024 um 15:13 schrieb joes:
    Am Wed, 21 Aug 2024 12:24:14 +0000 schrieb WM:

    Since no unit fraction is below or at zero, the end is before.
    Since there is no smallest unit fraction, there is no end.
    The other way round. There is an end, because at and below zero there
    is no unit fraction. Therefore there is an end before. Simple as that.
    Stupid as this: „There is a last negative power of 2.”
    *If there is a complete chain*, then it has a last member.
    What do you mean by „complete”?

    --
    Am Sat, 20 Jul 2024 12:35:31 +0000 schrieb WM in sci.math:
    It is not guaranteed that n+1 exists for every n.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Thu Aug 22 17:59:02 2024
    Am 22.08.2024 um 15:39 schrieb joes:
    Am Thu, 22 Aug 2024 11:09:13 +0000 schrieb WM:

    *If there is a complete chain*, then it has a last member.

    What do you mean by „complete”?

    Finite.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Thu Aug 22 17:58:13 2024
    Am 22.08.2024 um 15:36 schrieb joes:
    Am Thu, 22 Aug 2024 10:54:46 +0000 schrieb WM:
    Le 21/08/2024 à 18:20, FromTheRafters a écrit :
    WM presented the following explanation :

    Since no unit fraction is below or at zero, the end is before. What
    else?
    No end, Duh!!

    In a linear order of elements which all have distances from each other,
    there is necessarily a last one

    Yeah, like in the case of the integers. :-)

    Why is no end impossible?

    Because in Mückenhausen there are no infinite sets.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From joes@21:1/5 to All on Thu Aug 22 17:24:20 2024
    Am Thu, 22 Aug 2024 11:07:42 +0000 schrieb WM:
    Le 21/08/2024 à 20:14, joes a écrit :
    Am Wed, 21 Aug 2024 14:58:50 +0000 schrieb WM:
    Le 21/08/2024 à 15:13, joes a écrit :
    Am Wed, 21 Aug 2024 12:24:14 +0000 schrieb WM:

    It is an end which proves dark numbers.
    Why should there be an end in the first place?
    There is indisputably an interval without unit fractions,
    namely (-oo, 0].
    That indicates an end before. It proves an end before. Only cranks can
    deny that.
    The unit fractions get denser toward 0. They are all positive.
    They all have gaps. This implies a last one if all are existing.
    How so?

    Are there not infinitely many unit fractions?
    Yes, the dark unit fractions cannot be counted through. There are more
    than can be counted.
    I was talking about the regular ones.
    They are potentially infinite: After each one many more appear. They do
    never end. But that's not my topic.
    What then?

    --
    Am Sat, 20 Jul 2024 12:35:31 +0000 schrieb WM in sci.math:
    It is not guaranteed that n+1 exists for every n.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Richard Damon@21:1/5 to All on Fri Aug 23 00:14:47 2024
    On 8/22/24 7:07 AM, WM wrote:
    Le 21/08/2024 à 20:14, joes a écrit :
    Am Wed, 21 Aug 2024 14:58:50 +0000 schrieb WM:
    Le 21/08/2024 à 15:13, joes a écrit :
    Am Wed, 21 Aug 2024 12:24:14 +0000 schrieb WM:

    It is an end which proves dark numbers.
    Why should there be an end in the first place?

    There is indisputably an interval without unit fractions, namely (-oo,
    0].
    That indicates an end before. It proves an end before. Only cranks can
    deny that.
    The unit fractions get denser toward 0. They are all positive.

    They all have gaps. This implies a last one if all are existing.

    Are there not infinitely many unit fractions?
    Yes, the dark unit fractions cannot be counted through. There are more
    than can be counted.
    I was talking about the regular ones.

    They are potentially infinite: After each one many more appear. They do
    never end. But that's not my topic.

    Regards, WM



    Excpet that those are the number system you claim to be using.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Fri Aug 23 14:32:34 2024
    Le 22/08/2024 à 19:24, joes a écrit :
    Am Thu, 22 Aug 2024 11:07:42 +0000 schrieb WM:

    The unit fractions get denser toward 0. They are all positive.
    They all have gaps. This implies a last one if all are existing.
    How so?

    Every point is either in the empty domain or in the populated domain. One
    point is the last one in the populated domain.

    Regards WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Fri Aug 23 14:24:39 2024
    Le 22/08/2024 à 15:36, joes a écrit :

    Why is no end impossible?

    In linear order there is an end before the empty domain.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Fri Aug 23 14:27:11 2024
    Le 22/08/2024 à 16:19, FromTheRafters a écrit :
    WM formulated the question :

    *If there is a complete chain*, then it has a last member.

    Just as the last saucer completes the tea set?

    No, just as there is a border between populated and empty domains.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From joes@21:1/5 to All on Fri Aug 23 18:08:02 2024
    Am Fri, 23 Aug 2024 14:32:34 +0000 schrieb WM:
    Le 22/08/2024 à 19:24, joes a écrit :
    Am Thu, 22 Aug 2024 11:07:42 +0000 schrieb WM:

    The unit fractions get denser toward 0. They are all positive.
    They all have gaps. This implies a last one if all are existing.
    How so?
    Every point is either in the empty domain or in the populated domain.
    One point is the last one in the populated domain.
    Why? One can always divide the space remaining from a supposed
    least unit fraction to zero.

    --
    Am Sat, 20 Jul 2024 12:35:31 +0000 schrieb WM in sci.math:
    It is not guaranteed that n+1 exists for every n.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From joes@21:1/5 to All on Fri Aug 23 18:06:26 2024
    Am Fri, 23 Aug 2024 14:27:11 +0000 schrieb WM:
    Le 22/08/2024 à 16:19, FromTheRafters a écrit :
    WM formulated the question :

    *If there is a complete chain*, then it has a last member.
    Just as the last saucer completes the tea set?
    No, just as there is a border between populated and empty domains.
    The unit fractions don’t reach 0.

    --
    Am Sat, 20 Jul 2024 12:35:31 +0000 schrieb WM in sci.math:
    It is not guaranteed that n+1 exists for every n.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Jim Burns@21:1/5 to All on Fri Aug 23 14:42:58 2024
    On 8/23/2024 10:32 AM, WM wrote:
    Le 22/08/2024 à 19:24, joes a écrit :
    Am Thu, 22 Aug 2024 11:07:42 +0000 schrieb WM:
    Le 21/08/2024 à 20:14, joes a écrit :

    The unit fractions get denser toward 0.
    They are all positive.

    They all have gaps.
    This implies a last one if all are existing.

    How so?

    Every point is either in the empty domain
    or in the populated domain.

    One point is the last one in the populated domain.

    Only in some cases.

    Split ℚ⁺ the positive rationals into {p²≤2}ꟴ, {2≤p²}ꟴ
    No rational √2 exists.
    No last point in {p²≤2}ꟴ exists.
    No first point in {2≤p²}ꟴ exists.

    Even so,
    each two rationals are separated by a distance > 0.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Fri Aug 23 23:16:05 2024
    Am 23.08.2024 um 21:13 schrieb Chris M. Thomasson:
    On 8/20/2024 10:15 PM, Moebius wrote:
    Am 20.08.2024 um 21:35 schrieb Chris M. Thomasson:

    Do you even now how to make a Cantor Set Fractal?

    Talking about fractals, there's an extremely simple "fractal".

    Just consider the real line from 0 to 1 and the points 1/2, 1/4,
    1/8, ... (ad infinitum).

    If you "zoom in" at 0 bei the factors 2, 4, 8, etc. and just "focus"
    on the (new) "0 ... 1 part" of the "magnified" line, you will always
    "see" the same pattern.

    Noes?

    Right. That is a very simple fractal that shows self similarity all the
    way down for sure.

    Pssssst... Don't tell Mückenheim!

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Jim Burns@21:1/5 to All on Fri Aug 23 18:04:45 2024
    On 8/22/2024 8:16 AM, WM wrote:
    Le 21/08/2024 à 20:34, Moebius a écrit :

    Yeah, it's like claiming:
    "There is an end
    (to the natural numbers),
    because at and above omega
    there is no natural number.

    Of course, but
    omega is somewhat ghostly.
    Do the natnumbers reach till omega?

    ω is an upper.bound of ℕᵈᵉᶠ.
    Of all upper.bounds of ℕᵈᵉᶠ, the lowest is ω.

    Each element of ℕᵈᵉᶠ is not upper.bound of ℕᵈᵉᶠ.
    No upper.bound of ℕᵈᵉᶠ is in ℕᵈᵉᶠ

    Do the natnumbers reach till omega?

    Define
    the natnumbers reach k ⇔
    (∀ᵒʳᵈj≤k:(∃ᵒʳᵈi:j=i∪{i} ⇐ j≠0) ∧ 0<k) ∨ 0=k

    k ∈ ω ⇔ the natnumbers reach k
    The natnumbers only reach elements of ℕᵈᵉᶠ.

    ω, an upper.bound of ℕᵈᵉᶠ, is not.in ℕᵈᵉᶠ.
    The natnumbers do not reach ω

    Is there a gap?

    ∀ᵒʳᵈα: α=α
    (which seems to mean) all ordinals are visibleᵂᴹ

    (which seems to mean) there is no gap.

    Zero is fixed and firm, existing
    with certainty.
    The positive reals reach till zero
    with no doubt.
    There NUF = 0.
    And because of
    ∀n ∈ ℕ: 1/n - 1/(n+1) > 0
    it cannot increase by more than
    1 per point x.

    x = 1/0 :⇔ 0⋅x = 1
    ¬∃x ∈ R: x = 1/0

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Sat Aug 24 02:08:13 2024
    Am 24.08.2024 um 02:05 schrieb Moebius:
    Am 24.08.2024 um 00:04 schrieb Jim Burns:

    x = 1/0  :⇔  0⋅x = 1

    Nope.

    Hint: ¬∃x ∈ R: 0⋅x = 1.

    ¬∃x ∈ R: x = 1/0

    Nonsense.

    Actually: ¬∃x ∈ R: 0⋅x = 1.

    You CAN'T use undefined terms, you fucking asshole.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Sat Aug 24 02:05:21 2024
    Am 24.08.2024 um 00:04 schrieb Jim Burns:

    x = 1/0  :⇔  0⋅x = 1
    ¬∃x ∈ R: x = 1/0

    Nonsense.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Jim Burns@21:1/5 to Moebius on Sat Aug 24 00:30:47 2024
    On 8/23/2024 8:05 PM, Moebius wrote:
    Am 24.08.2024 um 00:04 schrieb Jim Burns:

    x = 1/0  :⇔  0⋅x = 1
    ¬∃x ∈ R: x = 1/0

    Nonsense.

    | 1.3 Stipulative definitions
    |
    | A stipulative definition imparts a meaning to the defined term,
    | and involves no commitment that
    | the assigned meaning agrees with prior uses (if any) of the term.
    | Stipulative definitions are epistemologically special.
    | They yield judgments with epistemological characteristics that
    | are puzzling elsewhere.
    | If one stipulatively defines a “raimex” as, say,
    | a rational, imaginative, experiencing being
    | then the judgment “raimexes are rational” is assured of
    | being necessary, certain, and a priori.

    | See Frege 1914 for a defense of the austere view that,
    | in mathematics at least,
    | only stipulative definitions should be countenanced.

    | Frege, G., 1914, “Logic in Mathematics,”
    | in _Gottlob Frege: Posthumous Writings_
    | edited by H. Hermes, F. Kambartel, and F. Kaulbach,
    | Chicago: University of Chicago Press (1979), pp. 203–250.

    https://plato.stanford.edu/entries/definitions/

    Stipulate.
    x = 1/0 :⇔ 0⋅x = 1

    Lemma.
    ¬∃x ∈ R: x = 1/0

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Sat Aug 24 14:11:53 2024
    Le 24/08/2024 à 00:04, Jim Burns a écrit :
    On 8/22/2024 8:16 AM, WM wrote:
    Le 21/08/2024 à 20:34, Moebius a écrit :

    Yeah, it's like claiming:
    "There is an end
    (to the natural numbers),
    because at and above omega
    there is no natural number.

    Of course, but
    omega is somewhat ghostly.
    Do the natnumbers reach till omega?

    ω is an upper.bound of ℕᵈᵉᶠ.
    Of all upper.bounds of ℕᵈᵉᶠ, the lowest is ω.

    Yes. Nevertheless almost all natural numbers are bewteen ℕᵈᵉᶠ and
    ω.

    Each element of ℕᵈᵉᶠ is not upper.bound of ℕᵈᵉᶠ.
    No upper.bound of ℕᵈᵉᶠ is in ℕᵈᵉᶠ

    Correct.

    Do the natnumbers reach till omega?

    Define
    the natnumbers reach k ⇔
    (∀ᵒʳᵈj≤k:(∃ᵒʳᵈi:j=i∪{i} ⇐ j≠0) ∧ 0<k) ∨ 0=k

    k ∈ ω ⇔ the natnumbers reach k
    The natnumbers only reach elements of ℕᵈᵉᶠ.

    No.

    ω, an upper.bound of ℕᵈᵉᶠ, is not.in ℕᵈᵉᶠ.
    The natnumbers do not reach ω

    ω - 1 is the greates naturak number.
    Easy to understand by the smallest unit fraction.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Sat Aug 24 14:15:42 2024
    Le 23/08/2024 à 20:42, Jim Burns a écrit :
    On 8/23/2024 10:32 AM, WM wrote:
    Le 22/08/2024 à 19:24, joes a écrit :
    Am Thu, 22 Aug 2024 11:07:42 +0000 schrieb WM:
    Le 21/08/2024 à 20:14, joes a écrit :

    The unit fractions get denser toward 0.
    They are all positive.

    They all have gaps.
    This implies a last one if all are existing.

    How so?

    Every point is either in the empty domain
    or in the populated domain.

    One point is the last one in the populated domain.

    Only in some cases.

    In cawsews with distances.

    Split ℚ⁺ the positive rationals into {p²≤2}ꟴ, {2≤p²}ꟴ
    No rational √2 exists.

    But the last rational approximation exists. It is dark.

    Even so,
    each two rationals are separated by a distance > 0.

    Of course. But the necklace analogon is easier to comprehend.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From joes@21:1/5 to All on Sat Aug 24 14:43:45 2024
    Am Sat, 24 Aug 2024 14:17:58 +0000 schrieb WM:
    Le 23/08/2024 à 20:13, Jim Burns a écrit :

    All finiteⁿᵒᵗᐧᵂᴹ ordered sets _and their subsets_
    are 2.ended, except for {}.
    Every set of unit fractions extended over an interval has two ends in
    that interval.
    Except if you include the Häufungspunkt, of course.

    --
    Am Sat, 20 Jul 2024 12:35:31 +0000 schrieb WM in sci.math:
    It is not guaranteed that n+1 exists for every n.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Sat Aug 24 14:21:46 2024
    Le 23/08/2024 à 20:06, joes a écrit :
    Am Fri, 23 Aug 2024 14:27:11 +0000 schrieb WM:
    Le 22/08/2024 à 16:19, FromTheRafters a écrit :
    WM formulated the question :

    *If there is a complete chain*, then it has a last member.
    Just as the last saucer completes the tea set?
    No, just as there is a border between populated and empty domains.
    The unit fractions don’t reach 0.

    Of course not. Therefore they must cease before.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Sat Aug 24 14:20:49 2024
    Le 23/08/2024 à 20:08, joes a écrit :
    Am Fri, 23 Aug 2024 14:32:34 +0000 schrieb WM:
    Le 22/08/2024 à 19:24, joes a écrit :
    Am Thu, 22 Aug 2024 11:07:42 +0000 schrieb WM:

    The unit fractions get denser toward 0. They are all positive.
    They all have gaps. This implies a last one if all are existing.
    How so?
    Every point is either in the empty domain or in the populated domain.
    One point is the last one in the populated domain.
    Why? One can always divide the space remaining from a supposed
    least unit fraction to zero.

    Start from the other side. NUF(x) increases from 0. It cannot get to 2 or
    more without having passede 1. Logic!

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From joes@21:1/5 to All on Sat Aug 24 14:45:26 2024
    Am Sat, 24 Aug 2024 14:21:46 +0000 schrieb WM:
    Le 23/08/2024 à 20:06, joes a écrit :
    Am Fri, 23 Aug 2024 14:27:11 +0000 schrieb WM:
    Le 22/08/2024 à 16:19, FromTheRafters a écrit :
    WM formulated the question :

    *If there is a complete chain*, then it has a last member.
    Just as the last saucer completes the tea set?
    No, just as there is a border between populated and empty domains.
    The unit fractions don’t reach 0.
    Of course not. Therefore they must cease before.
    lolwtfbbq no there is infinite space before

    --
    Am Sat, 20 Jul 2024 12:35:31 +0000 schrieb WM in sci.math:
    It is not guaranteed that n+1 exists for every n.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Sat Aug 24 15:24:01 2024
    Le 24/08/2024 à 16:43, joes a écrit :
    Am Sat, 24 Aug 2024 14:17:58 +0000 schrieb WM:
    Le 23/08/2024 à 20:13, Jim Burns a écrit :

    All finiteⁿᵒᵗᐧᵂᴹ ordered sets _and their subsets_
    are 2.ended, except for {}.
    Every set of unit fractions extended over an interval has two ends in
    that interval.
    Except if you include the Häufungspunkt, of course.

    Häufungspunkte sind makroskopische Quantitäten wie Druck oder Temperatur
    in der Physik. Die genaue Analyse findet Moleküle und Atome. In der
    Mathematik oder besser Mengenlehre (die Mathematik entspricht der makropskopischen Physik) entsprechen dem die dunklen Zahlen.

    Gruß, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Jim Burns@21:1/5 to All on Sat Aug 24 16:16:22 2024
    On 8/24/2024 10:15 AM, WM wrote:
    Le 23/08/2024 à 20:42, Jim Burns a écrit :
    On 8/23/2024 10:32 AM, WM wrote:
    Le 22/08/2024 à 19:24, joes a écrit :
    Am Thu, 22 Aug 2024 11:07:42 +0000 schrieb WM:
    Le 21/08/2024 à 20:14, joes a écrit :

    The unit fractions get denser toward 0.
    They are all positive.

    They all have gaps.
    This implies a last one if all are existing.

    How so?

    Every point is either in the empty domain
    or in the populated domain.

    One point is the last one in the populated domain.

    Only in some cases.

    In cawsews with distances.

    ⎛ Open sets exist.
    ⎝ An open set doesn't hold any of its boundary.

    Split ℚ⁺ the positive rationals into {p²≤2}ꟴ, {2≤p²}ꟴ
    No rational √2 exists.

    But the last rational approximation exists.
    It is dark.

    ⎛ A rational.approximation is best
    ⎜ iff
    ⎝ no smaller.denominated approximation is better.

    An endless sequence (holding no last) exists
    of best rational.approximations to √​̅2 with
    numerators and denominators from ℕᵈᵉᶠ
    1/1, 3/2, 7/5, 17/12, 41/29, 99/70, ...

    Endless:
    A last (closest) best ℕᵈᵉᶠ.approximation
    does not exist.

    ⎛ The rational.sequence is generated from
    ⎜ the endless ℕᵈᵉᶠ.sequence
    ⎜ 0, 1, 2, 5, 12, 29, 70, ...
    ⎜ which has the recursion relation qₙ = 2⋅qₙ₋₁+qₙ₋₂

    ⎜ The '2' comes from
    ⎝ √​̅2-1 = ⅟(2+(√​̅2-1)) = ⅟(2+⅟(2+(√​̅2-1))) = ...

    The approximations 1+qₙ₋₁/qₙ alternate
    above and below √​̅2

    For each non.√​̅2 point,
    a better 1+qₙ₋₁/qₙ exists: qₙ₋₁,qₙ ∈ ℕᵈᵉᶠ

    A last (closest) rational approximation does not exist.

    But the last rational approximation exists.
    It is dark.

    No.
    A last (closest) rational approximation does not exist.

    ----
    For each non.√​̅2 point,
    a better 1+qₙ₋₁/qₙ exists: qₙ₋₁,qₙ ∈ ℕᵈᵉᶠ

    The core argument is the same as for the claim that
    no x > 0 is a lower.bound of ⅟ℕᵈᵉᶠ visibleᵂᴹ.unit.fractions
    but it uses more algebra.

    ⎛ Assume otherwise.
    ⎜ Assume positive β = glb of allᵈᵉᶠ|1+qₙ₋₁/qₙ-√​̅2|

    ⎜ γ is a little larger than β
    ⎜ γ isn't lower.bound of allᵈᵉᶠ|1+qₙ₋₁/qₙ-√​̅2|
    ⎜ 1+qₖ₋₁/qₖ is closer than γ to √​̅2

    ⎜ 1+qₖ/qₖ₊₁ is closer than 1+qₖ₋₁/qₖ
    ⎜ 1+qₖ₊₁/qₖ₊₂ is closer than 1+qₖ/qₖ₊₁
    ⎜ 1+qₖ₊₁/qₖ₊₂ is closer than α such that
    ⎜ α is a little smaller than β

    ⎜ α is smaller than β
    ⎜ α is lower.bound of allᵈᵉᶠ|1+qₙ₋₁/qₙ-√​̅2|
    ⎜ 1+qₖ₊₁/qₖ₊₂ is closer than α
    ⎜ α is not.lower.bound of allᵈᵉᶠ|1+qₙ₋₁/qₙ-√​̅2|
    ⎝ Contradiction.

    Therefore,
    0 = glb of allᵈᵉᶠ|1+qₙ₋₁/qₙ-√​̅2|

    If non.√​̅2 point δ existed such that
    no better 1+qₙ₋₁/qₙ exists: qₙ₋₁,qₙ ∈ ℕᵈᵉᶠ |δ-√​̅2| would be
    positive lower.bound of allᵈᵉᶠ|1+qₙ₋₁/qₙ-√​̅2|

    Since there isn't positive lower.bound |δ-√​̅2|
    there isn't δ better than all 1+qₙ₋₁/qₙ

    And
    a last (closest) rational approximation does not exist.

    Even so,
    each two rationals are separated by a distance > 0.

    Of course.
    But the necklace analogon is easier to comprehend.

    Many of us are more familiar with necklaces which
    have some minimum size of bead (or of whatever).

    For rationals,
    there is a greatest lower bound of distances
    between different rationals,
    but,
    for a minimum distance to exist,
    the greatest lower bound needs to be a distance.
    (There aren't two greatest lower bounds.)

    The greatest lower bound of distances is 0,
    and 0 is not a distance between two rationals.
    The greatest lower bound is not the minimum.
    Nothing else is the minimum.
    The minimum does not exist...

    ...unlike all the necklaces I'm familiar with.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Jim Burns@21:1/5 to All on Sun Aug 25 06:21:01 2024
    On 8/24/2024 10:11 AM, WM wrote:
    Le 24/08/2024 à 00:04, Jim Burns a écrit :
    On 8/22/2024 8:16 AM, WM wrote:
    Le 21/08/2024 à 20:34, Moebius a écrit :

    Yeah, it's like claiming:
    "There is an end
    (to the natural numbers),
    because at and above omega
    there is no natural number.

    Of course, but
    omega is somewhat ghostly.
    Do the natnumbers reach till omega?

    ω is an upper.bound of ℕᵈᵉᶠ.
    Of all upper.bounds of ℕᵈᵉᶠ, the lowest is ω.

    Yes.

    That's a definition of ω

    Nevertheless
    almost all natural numbers are bewteen ℕᵈᵉᶠ and ω.

    Something between ℕᵈᵉᶠ and ω is
    a lower.than.lowest upper.bound of ℕᵈᵉᶠ
    Something between ℕᵈᵉᶠ and ω
    does not exist.

    Each element of ℕᵈᵉᶠ is not upper.bound of ℕᵈᵉᶠ.
    No upper.bound of ℕᵈᵉᶠ is in ℕᵈᵉᶠ

    Correct.

    Do the natnumbers reach till omega?

    Define
    the natnumbers reach k  ⇔
    (∀ᵒʳᵈj≤k:(∃ᵒʳᵈi:j=i∪{i} ⇐ j≠0) ∧ 0<k) ∨ 0=k

    Define
    the natnumbers reach k
    if and only if
    ordinal k and each j before k except 0
    can be stepped.up.to,
    and 0 is before k,
    and the natnumbers reach 0

    Implicit:
    Each non.empty set of ordinals holds a first.

    k ∈ ω  ⇔  the natnumbers reach k
    The natnumbers only reach elements of ℕᵈᵉᶠ.

    No.

    Missing:
    Any other meaning of
    Do the natnumbers reach till omega?

    ω, an upper.bound of ℕᵈᵉᶠ, is not.in ℕᵈᵉᶠ.
    The natnumbers do not reach ω

    ω - 1 is the greates naturak number.

    if
    ω-1 and each j before ω-1 can be stepped.uo.to,
    then
    ω and each j before ω can be stepped.up.to.
    and
    ω+1 and each j before ω+1 can be stepped.up.to.
    and
    ω+2 and each j before ω+2 can be stepped.up.to.
    and
    ...
    and
    ω is merely another big natural in ℕᵈᵉᶠ
    and
    ω is not the least.upper.bound of ℕᵈᵉᶠ AKA ω

    if
    ω-1 and each j before ω-1 canNOT be stepped.uo.to,
    then
    ω-1 is an upper.bound of ℕᵈᵉᶠ
    and
    ω is not the least.upper.bound of ℕᵈᵉᶠ AKA ω

    ω-1 implies ω isn't ω

    Easy to understand by the smallest unit fraction.

    About that smallest unit fraction...
    I have some bad news.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Sun Aug 25 19:41:59 2024
    Le 24/08/2024 à 20:08, FromTheRafters a écrit :
    WM has brought this to us :

    The unit fractions don’t reach 0.

    Of course not. Therefore they must cease before.

    Why must they cease at all?

    They must cease because there is a domain without them.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Sun Aug 25 19:35:09 2024
    Le 25/08/2024 à 12:21, Jim Burns a écrit :
    On 8/24/2024 10:11 AM, WM wrote:

    ω is an upper.bound of ℕᵈᵉᶠ.
    Of all upper.bounds of ℕᵈᵉᶠ, the lowest is ω.

    Yes.

    That's a definition of ω

    Nevertheless
    almost all natural numbers are bewteen ℕᵈᵉᶠ and ω.

    Something between ℕᵈᵉᶠ and ω is
    a lower.than.lowest upper.bound of ℕᵈᵉᶠ

    No. Dark numbers are not any bounds. Bounds are definable.

    Something between ℕᵈᵉᶠ and ω
    does not exist.

    So the blind man argues.

    Each non.empty set of ordinals holds a first.

    Like each set of unit fractions.

    Do the natnumbers reach till omega?

    ω, an upper.bound of ℕᵈᵉᶠ, is not.in ℕᵈᵉᶠ.
    The natnumbers do not reach ω

    ω - 1 is the greates natural number.

    if
    ω-1 and each j before ω-1 can be stepped.uo.to,
    then
    ω and each j before ω can be stepped.up.to.

    Dark numbers cannot be stepped to.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Jim Burns@21:1/5 to All on Sun Aug 25 17:18:34 2024
    On 8/25/2024 3:35 PM, WM wrote:
    Le 25/08/2024 à 12:21, Jim Burns a écrit :
    On 8/24/2024 10:11 AM, WM wrote:
    On 8/24/2024 10:11 AM, WM wrote:
    Le 24/08/2024 à 00:04, Jim Burns a écrit :

    ω is an upper.bound of ℕᵈᵉᶠ.
    Of all upper.bounds of ℕᵈᵉᶠ, the lowest is ω.

    Yes.

    That's a definition of ω

    Nevertheless
    almost all natural numbers are bewteen ℕᵈᵉᶠ and ω.

    Something between ℕᵈᵉᶠ and ω is
    a lower.than.lowest upper.bound of ℕᵈᵉᶠ

    No.
    Dark numbers are not any bounds.
    Bounds are definable.

    ( Upper.boundⁿᵒᵗᐧᵂᴹ ≥ᵉᵃᶜʰ what.is.bounded.

    ⎛ Assume ω > ω-1 ≥ᵉᵃᶜʰ ℕᵈᵉᶠ

    ⎜ ω-1 is lower.than.least upper.boundⁿᵒᵗᐧᵂᴹ of ℕᵈᵉᶠ
    ⎜ Contradiction.

    ⎜ Assume 𝔊 is any darkᵂᴹ number:
    ⎜ ω > 𝔊 ≥ᵉᵃᶜʰ ℕᵈᵉᶠ

    ⎜ 𝔊 is lower.than.least upper.boundⁿᵒᵗᐧᵂᴹ of ℕᵈᵉᶠ
    ⎝ Contradiction.

    Therefore,
    there is no ω-1, there is no darkᵂᴹ 𝔊

    Something between ℕᵈᵉᶠ and ω
    does not exist.

    So the blind man argues.

    Each non.empty set of ordinals holds a first.

    Like each set of unit fractions.

    Ordered largest.first, yes.
    Each non.empty set of unit.fractions holds a largest.

    For each unit.fraction u
    the claim that u is smallest is proved false
    by counter.example ⅟(1+⅟u)

    Not all sets of unit.fractions hold a smallest.
    For example, the set of all unit.fractions doesn't.

    Do the natnumbers reach till omega?

    ω, an upper.bound of ℕᵈᵉᶠ, is not.in ℕᵈᵉᶠ.
    The natnumbers do not reach ω

    ω - 1 is the greates natural number.

    if
    ω-1 and each j before ω-1 can be stepped.uo.to,
    then
    ω and each j before ω can be stepped.up.to.

    Dark numbers cannot be stepped to.

    Darkᵂᴹ numbers are between ω and ℕᵈᵉᶠ
    Darkᵂᴹ numbers don't exist.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Richard Damon@21:1/5 to All on Sun Aug 25 17:18:15 2024
    On 8/25/24 3:41 PM, WM wrote:
    Le 24/08/2024 à 22:16, Jim Burns a écrit :

    Many of us are more familiar with necklaces which
    have some minimum size of bead (or of whatever).

    The unit fractions have no minimum distance but more than nothing.

    For rationals,
    there is a greatest lower bound of distances
    between different rationals,
    but,
    for a minimum distance to exist,
    the greatest lower bound needs to be a distance.

    For a distance to exist in every case mathematics is sufficicient:
    ∀n ∈ ℕ: 1/n - 1/(n+1) > 0 .
    The greatest lower bound of distances is 0,

    The distances between all unit fractions are positive. The GLB is to
    comfort blind persons who cannot think.

    Regards, WM

    But the sum of the infinite series adding up the terms of

    1/n - 1/(n+1)

    never gets to 1, so you never need to stop.

    You logic just condemns Achilles to never be able to pass the tortoise
    as every time he reaches where the tortoise was, the tortoise has moved
    some more so Achilles needs to move again.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Jim Burns@21:1/5 to All on Sun Aug 25 17:57:54 2024
    On 8/25/2024 3:41 PM, WM wrote:
    Le 24/08/2024 à 22:16, Jim Burns a écrit :

    Many of us are more familiar with necklaces which
    have some minimum size of bead (or of whatever).

    The unit fractions have no minimum distance
    but more than nothing.

    Positive real numbers have no minimum positive
    but are each positive.

    A minimum is one of what it's a minimum of.
    0 is not the minimum of the positive real numbers.

    There aren't ever two greatest.lower.bounds.

    If
    a greatest.lower.bound is NOT
    one of what it's greatest.lower.bound of,
    then
    there is NO OTHER greatest.lower.bound which IS
    one of what it's greatest.lower.bound of,
    and
    there is no minimum of them:
    no minimum exists, visibleᵂᴹ or darkᵂᴹ.

    For rationals,
    there is a greatest lower bound of distances
    between different rationals,
    but,
    for a minimum distance to exist,
    the greatest lower bound needs to be a distance.

    For a distance to exist in every case
    mathematics is sufficicient:
    ∀n ∈ ℕ: 1/n - 1/(n+1) > 0 .

    For each n ∈ ℕ:
    1/(n+1) is a counter.example disproving the claim
    that 1/n is the smallest unit.fraction:
    1/n - 1/(n+1) > 0

    The greatest lower bound of distances is 0,

    The distances between all unit fractions are positive.
    The GLB is to comfort blind persons who cannot think.

    Some sets have a greatest.lower.bound not.in it.

    A set with a greatest.lower.bound not.in it
    doesn't have a second greatest.lower.bound in it.
    doesn't have a minimum.
    doesn't have a lower end.
    doesn't have all its non.empty subsets 2.ended.
    is an infinite set.

    'Bye, Bob.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Mon Aug 26 00:04:47 2024
    Am 24.08.2024 um 06:30 schrieb Jim Burns:
    On 8/23/2024 8:05 PM, Moebius wrote:
    Am 24.08.2024 um 00:04 schrieb Jim Burns:

    x = 1/0  :⇔  0⋅x = 1
    ¬∃x ∈ R: x = 1/0

    Nonsense.

    | 1.3 Stipulative definitions
    |
    | A stipulative definition imparts a meaning to the defined term,
    | and involves no commitment that
    | the assigned meaning agrees with prior uses (if any) of the term.
    | Stipulative definitions are epistemologically special.
    | They yield judgments with epistemological characteristics that
    | are puzzling elsewhere.
    | If one stipulatively defines a “raimex” as, say,
    | a rational, imaginative, experiencing being
    | then the judgment “raimexes are rational” is assured of
    | being necessary, certain, and a priori.

    Concerning *predicates*, NOT "names" (referring to non-existing
    objects), man.

    Hint:

    raimex(x) :<-> rational(x) & imaginative(x) & experiencing(x)
    & a_being(x)

    "x is a raimex iff ..."

    After stating this definition we may claim:

    Ax(raimex(x) -> rational(x))

    “All raimexes are rational.”

    https://plato.stanford.edu/entries/definitions/

    Seems you really don't get it. (*sigh*)

    Without proof of

    1. Ex(raimex(x))
    and
    2. AxAy(raimex(x) & raimex(y) -> x = y)

    we may not use the "definition"

    x = the_raimex :<-> rational(x) & imaginative(x) &
    experiencing(x) & a_being(x)

    In other words, we are not allowed to talk about _the_ raimex (not
    having a proof that there is exactly one such such being, i.e. exactly
    one x such that x is a raimex).

    Hence, no this is NOT a proper definition:

    x = 1/0  :⇔  0⋅x = 1

    ...just nonsense.

    Lemma.

    More nonsense. Are you you one of the multiple personalities of
    Mückenheim by any chance?

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Mon Aug 26 00:20:10 2024
    Am 25.08.2024 um 23:57 schrieb Jim Burns:
    On 8/25/2024 3:41 PM, WM wrote:

    For a distance to exist in every case
    mathematics is sufficicient:
    ∀n ∈ ℕ: 1/n - 1/(n+1) > 0 .

    For each n ∈ ℕ:
    1/(n+1) is a counter.example disproving the claim
    that 1/n is the smallest unit.fraction:
    1/n - 1/(n+1) > 0

    In dsm I just told him (Mückenheim):

    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

    Unlike you, however, some people understand that your formula IMPLIES
    that there is no smallest unit fraction. 🙂

    Proof: From ∀n ∈ ℕ: 1/n - 1/(n+1) > 0 it follows: ∀n ∈ ℕ: 1/n > 1/(n+1).
    Because Ax(x e SB <-> En e IN: x = 1/n) it follows (easily): As e SB:
    Es' e SB: s' < s. qed

    For every unit fraction there is a smaller one (hence there can't be a
    smallest unit fraction).

    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Mon Aug 26 02:15:19 2024
    Am 25.08.2024 um 23:18 schrieb Jim Burns:
    On 8/25/2024 3:35 PM, WM wrote:

    Dark numbers are not any bounds.

    Fascinating: So we have that there are "dark numbers" which are smaller (larger) than each and every s e SB (n e IN), but they are no bounds? Huh?!

    Das Mückenheim even know the definition of /bounds/ (of a set)?

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

    Each non.empty set of ordinals holds a first.

    Like each set of unit fractions.

    Fascinating.

    On the other hand, if u is a unit fraction, then 1/(1/s + 1) is a
    smaller one.

    Ordered largest.first, yes.
    Each non.empty set of unit.fractions holds a largest.

    For each unit.fraction u
    the claim that u is smallest is proved false
    by counter.example ⅟(1+⅟u)

    Indeed! :-)

    Not all sets of unit.fractions hold a smallest.
    For example, the set of all unit.fractions doesn't.

    Right. :-)

    ω - 1 is the greates natural number.

    Fascinating. This implies that there is a natural number (namely WM := ω
    - 1) such that WM + 1 is not a natural number.

    On the other hand, this is excluded by the Peano-Axioms (and the
    definition of + on IN) as well as by the axioms and (usual definitions)
    in the context of set theory. (Hint: We can prove there that for each
    and every n e IN n u {n} is in IN too.)

    It seems that this law only holds in mückenmath.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Mon Aug 26 02:34:15 2024
    Am 26.08.2024 um 02:15 schrieb Moebius:
    Am 25.08.2024 um 23:18 schrieb Jim Burns:
    On 8/25/2024 3:35 PM, WM wrote:

    Each non.empty set of ordinals holds a first.

    Like each set of unit fractions.

    Fascinating.

    On the other hand, if u is a unit fraction, then 1/(1/s + 1) is a
    smaller one.

    Ordered largest.first, yes.
    Each non.empty set of unit.fractions holds a largest.

    For each unit.fraction u
    the claim that u is smallest is proved false
    by counter.example ⅟(1+⅟u)

    Indeed! :-)

    Btw. To show this we don't refer to "the smallest unit fraction" WM (<-
    a constant denoting "the smallest unit fraction").

    I mean, we don't introduce (define) WM ("the smallest unit fraction") by
    a "definition" just to show (afterwards) that it does not exist: ~Ex e
    SB: s = WM.

    Of course in a proof by contradiction we may proceed the following way:

    Assume that there IS _a_ smallest unit fractions. i.e.

    Es e SB: As' e SB\{s}: s < s' .

    Let wm (<- an arbitrary name or parameter or ...) be such a unit
    fraction. With other words:

    wm e SB & As' e SB\{wm}: wm < s'

    and hence

    As' e SB\{wm}: wm < s'.

    Now from wm e SB we get that 1/(1/wm + 1) e SB and 1/(1/wm + 1) < wm, contradicting

    As' e SB\{wm}: wm < s' .

    qed.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Mon Aug 26 03:09:07 2024
    Am 26.08.2024 um 03:05 schrieb Moebius:
    Am 26.08.2024 um 00:04 schrieb Moebius:
    Am 24.08.2024 um 06:30 schrieb Jim Burns:

    Seems you really don't get it. (*sigh*)

    Without proof of

              1. Ex(raimex(x))
    and
              2. AxAy(raimex(x) & raimex(y) -> x = y)

    we may not use the "definition"

              x = the_raimex :<-> rational(x) & imaginative(x) &
    experiencing(x) & a_being(x)

    In other words, we are not allowed to talk about _the_ raimex (not
    having a proof that there is exactly one such entity, i.e. exactly one
    x such that x is a raimex).

    If we would, say, allow for the "definition"

               x = 1/0 :<-> 0 * x = 1

    and hence the "lemma"

               ~Ex(x = 1/0) ,

    we would get:

               Ax(x =/= 1/0) .

    Then by specification (AE) we would get:

               1/0 =/= 1/0

    from this, and then by (EI):

               Ex(x =/= x) .

    Not a desirable result.

    Especially not in a context where we have the axiom or theorem

    Ax(x = x) .

    (That's why _one_ of the rules for proper definitions of constants
    requires an existence proof first.)

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Mon Aug 26 03:05:50 2024
    Am 26.08.2024 um 00:04 schrieb Moebius:
    Am 24.08.2024 um 06:30 schrieb Jim Burns:

    Seems you really don't get it. (*sigh*)

    Without proof of

             1. Ex(raimex(x))
    and
         2. AxAy(raimex(x) & raimex(y) -> x = y)

    we may not use the "definition"

             x = the_raimex :<-> rational(x) & imaginative(x) & experiencing(x) & a_being(x)

    In other words, we are not allowed to talk about _the_ raimex (not
    having a proof that there is exactly one such entity, i.e. exactly
    one x such that x is a raimex).

    If we would, say, allow for the "definition"

    x = 1/0 :<-> 0 * x = 1

    and hence the "lemma"

    ~Ex(x = 1/0) ,

    we would get:

    Ax(x =/= 1/0) .

    Then by specification (AE) we would get:

    1/0 =/= 1/0

    from this, and then by (EI):

    Ex(x =/= x) .

    Not a desirable result.

    (That's why _one_ of the rules for proper definitions of constants
    requires an existence proof first.)

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Mon Aug 26 02:43:59 2024
    Am 26.08.2024 um 02:34 schrieb Moebius:
    Am 26.08.2024 um 02:15 schrieb Moebius:
    Am 25.08.2024 um 23:18 schrieb Jim Burns:
    On 8/25/2024 3:35 PM, WM wrote:

    Each non.empty set of ordinals holds a first.

    Like each set of unit fractions.

    Fascinating.

    On the other hand, if u is a unit fraction, then 1/(1/s + 1) is a
    smaller one.

    For each unit.fraction u
    the claim that u is smallest is proved false
    by counter.example ⅟(1+⅟u)

    Indeed! :-)

    Btw. To show this we [usually] don't refer to "the smallest unit fraction"
    WM (<- a constant denoting "the smallest unit fraction").

    I mean, we don't introduce (define) WM ("the smallest unit fraction") by
    a "definition" just to show (afterwards) that it does not exist: ~Ex e
    SB: s = WM.

    Of course, in a proof by contradiction we may proceed the following way:

    Assume that there IS _a_ smallest unit fractions. i.e.

         Es e SB: As' e SB\{s}: s < s' .

    Let wm (<- an arbitrary name or parameter or ...) be such a unit
    fraction.

    We may do this (from a logical point of view) JUST BECAUSE we assumed
    (at the start of the proof) the existence of at least one such unit
    fraction.

    With other words:

    wm e SB & As' e SB\{wm}: wm < s'

    and hence

         As' e SB\{wm}: wm < s'.

    Now from wm e SB we get that 1/(1/wm + 1) e SB and 1/(1/wm + 1) < wm, contradicting

         As' e SB\{wm}: wm < s' .

    qed.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Mon Aug 26 16:08:47 2024
    Am 24.08.2024 um 00:04 schrieb Jim Burns:

    x = 1/0  :⇔  0⋅x = 1

    Using a slight variant of your "definition" it's easy to show why your
    approach (concerning definitions) is not tenable in math:

    Def.: x = 1/0 :⇔ x ∈ IR & 0⋅x = 1

    Now from identity theory (say in the context of FOPL=) we get

    Ax(x = x)

    and hence (by specialisiation, AE):

    1/0 = 1/0 .

    [We may do this, because "1/0" is now - after your definition - a term
    in our system.]

    From this we get (by EI):

    Ex(x = 1/0)

    and from this with our "definition":

    Ex(x ∈ IR & 0⋅x = 1) .

    Not a desirable result.

    _____________________________________________________


    Again, that's why we have to prove an existence claim

    Ex(Px)

    before stating/using the defintion

    x = c :<-> Px .

    Actually, in addition to this proof we also need a proof of "uniquines"
    before ...

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Mon Aug 26 16:23:56 2024
    Am 26.08.2024 um 16:08 schrieb Moebius:

    Again, that's why we have to prove an existence claim

              Ex(Px)

    before stating/using the defintion

              x = c :<-> Px .

    Actually, in addition to this proof we also need a proof of "uniquines" before ...

    Here's an argument for the claim that we need that proof of "uniquines" too.

    Def. (JB style): x = c :<-> x e {0, 1}.

    Well, clearly there is an x such that x e {0, 1}. So, such an x exists.
    Great.

    Now, clearly

    0 e {0, 1}

    and hence from our "definition":

    0 = c (1) .

    And clearly

    1 e {0, 1}

    and hence from our "definition":

    1 = c (2) .

    But from (1) and (2) we get:

    0 = 1 .

    Not a desirable result.

    _____________________________________________________________________________

    Do avoid this undesirable results there's the requirement to prove

    ExPx
    and
    AxAy(Px & Py -> x = y)

    before stating the definition

    x = c :<-> Px ,

    where /c/ is a term not already part of the system (as a primitive term
    or a term introduced by an earlier definition).

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From joes@21:1/5 to All on Mon Aug 26 16:19:10 2024
    Am Sun, 25 Aug 2024 19:35:09 +0000 schrieb WM:
    Le 25/08/2024 à 12:21, Jim Burns a écrit :
    On 8/24/2024 10:11 AM, WM wrote:

    ω is an upper.bound of ℕᵈᵉᶠ.
    Of all upper.bounds of ℕᵈᵉᶠ, the lowest is ω.
    Nevertheless almost all natural numbers are bewteen ℕᵈᵉᶠ and ω.
    Something between ℕᵈᵉᶠ and ω is a lower.than.lowest upper.bound of ℕᵈᵉᶠ
    No. Dark numbers are not any bounds. Bounds are definable.
    That’s the problem.

    Something between ℕᵈᵉᶠ and ω does not exist.
    So the blind man argues.

    Each non.empty set of ordinals holds a first.
    Like each set of unit fractions.
    Proof?

    Do the natnumbers reach till omega?
    ω, an upper.bound of ℕᵈᵉᶠ, is not.in ℕᵈᵉᶠ.
    The natnumbers do not reach ω
    ω - 1 is the greates natural number.
    if ω-1 and each j before ω-1 can be stepped.uo.to,
    then ω and each j before ω can be stepped.up.to.
    Dark numbers cannot be stepped to.
    Too bad.
    --
    Am Sat, 20 Jul 2024 12:35:31 +0000 schrieb WM in sci.math:
    It is not guaranteed that n+1 exists for every n.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Mon Aug 26 18:21:33 2024
    Am 26.08.2024 um 18:19 schrieb joes:
    Am Sun, 25 Aug 2024 19:35:09 +0000 schrieb WM:

    Dark numbers cannot be stepped to.

    Too bad.

    Na, immerhin kann man auf einen von Mückenheim zurückgelassenen Scheißehaufen treten. :-)

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From joes@21:1/5 to All on Mon Aug 26 16:16:23 2024
    Am Sun, 25 Aug 2024 19:47:46 +0000 schrieb WM:
    Le 24/08/2024 à 19:06, Richard Damon a écrit :

    I guess by your finite logic, Achilles can't pass the tortoise,

    Achilles and the tortoise run a race. The tortoise gets a start and the
    race begins (state 0). When Achilles reaches this point, the tortoise
    has advanced further already (state 1). When Achilles reaches that
    point, the tortoise has advanced again (state 2). And so on (states 3,
    4, 5, ...). Since Achilles runs much faster than the tortoise, he will overtake (state ), but only after infinitely many finitely indexed
    states of the described kind. Their number must be completed.
    How is this accomplished? How would this be prevented?

    Otherwise
    Achilles will not overtake. But there must not be a last visible
    finitely indexed state.
    must = can?

    (The last 1000 states Achilles remembers have indices much smaller than
    [Assuming at the point of overtaking]
    How are these even defined there?
    .) This can only be realized by means of dark states.

    According to set theory, all states can be put in bijection with all
    natural numbers. This is impossible as completeness and well-order
    require a last mark.
    Why? What do you think of as (in)complete?

    The three notions "all" and "infinite" and
    "well-ordered" do not match. This dilemma can only be solved by
    refraining from well-order of the set Y of dark-numbered states.
    --
    Am Sat, 20 Jul 2024 12:35:31 +0000 schrieb WM in sci.math:
    It is not guaranteed that n+1 exists for every n.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Mon Aug 26 20:58:08 2024
    Am 26.08.2024 um 20:17 schrieb Jim Burns:
    On 8/26/2024 10:08 AM, Moebius wrote:
    Am 24.08.2024 um 00:04 schrieb Jim Burns:

    x = 1/0  :⇔  0⋅x = 1

    Using a slight variant of your "definition"

    The issue is that

    you are an ignorant idiot.

    bye

    *plonk*

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Jim Burns@21:1/5 to Moebius on Mon Aug 26 14:17:24 2024
    On 8/26/2024 10:08 AM, Moebius wrote:
    Am 24.08.2024 um 00:04 schrieb Jim Burns:

    x = 1/0  :⇔  0⋅x = 1

    Using a slight variant of your "definition"

    The issue is that you think my definition
    makes claims it doesn't make.

    You can show as many ways as you like that
    _the claims you think it makes_ need proof.
    My definition doesn't make them.

    Another variation:
    ( x ≠ 1/0 :⇔ 0⋅x ≠ 1

    Is that more acceptable?
    Why would it be?
    It says the same thing.

    Neither
    ( x ≠ 1/0 :⇔ 0⋅x ≠ 1
    nor
    ( x = 1/0 :⇔ 0⋅x = 1
    claims any of
    x≠1/0 or 0⋅x≠1 or x≠1/0 or 0⋅x≠1

    Using a slight variant of your "definition"
    it's easy to show why your approach
    (concerning definitions)
    is not tenable in math:

    Def.: x = 1/0  :⇔  x ∈ IR & 0⋅x = 1

    Now from identity theory
    (say in the context of FOPL=) we get
    Ax(x = x)

    and hence (by specialisiation, AE):
    1/0 = 1/0 .

    No.

    [We may do this, because "1/0" is now -
    after your definition -
    a term in our system.]

    No.
    Being a term in the language is not sufficient.
    The term needs to refer to an object in the domain.
    1/0 doesn't refer to anything.

    | [...] a valid rule of inference
    | from a truth about each member of a CLASS of individuals
    | to the truth about a particular individual of that CLASS.
    |
    https://en.wikipedia.org/wiki/Universal_instantiation
    (Emphasis added.)
    1/0 isn't a member of the relevant class of individuals,
    something which you point out very thoroughly.
    One consequence of it's non.membership is that
    Universal Instantiation is out of reach.

    Treating non.members as members and deriving nonsense,
    which proves non.members aren't members,
    has a long and glorious history in mathematics, but,
    in order to do that,
    it is necessary to reason using terms which don't refer.

    You want to call that being.a.crank.
    Have at it.
    You will pry my 'ex falso quodlibet' from
    my cold, dead hands.

    ----
    In many treatments of the real numbers, integers, etc,
    proofs of existence, uniqueness, etc, are
    _closely positioned_ to definitions.

    That is where they should be, if one intends to use
    the existence and uniqueness of reals and integers,
    and their sums, products, differences and quotients.

    I think that your objection to my use of 1/0 is that
    it _looks like_ something covered by those early proofs.
    And it isn't.
    But I don't say it is.
    ( x = 1/0 :⇔ 0⋅x = 1
    says
    x=1/0 is as true AND AS FALSE as 0⋅x=1
    and it doesn't say anything else.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Jim Burns@21:1/5 to Moebius on Mon Aug 26 15:06:31 2024
    On 8/26/2024 2:58 PM, Moebius wrote:
    Am 26.08.2024 um 20:17 schrieb Jim Burns:
    On 8/26/2024 10:08 AM, Moebius wrote:
    Am 24.08.2024 um 00:04 schrieb Jim Burns:

    x = 1/0  :⇔  0⋅x = 1

    Using a slight variant of your "definition"

    The issue is that

    you are an ignorant idiot.
    bye
    *plonk*

    ( x ≠ 1/0 :⇔ 0⋅x ≠ 1

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Tue Aug 27 19:26:25 2024
    Le 25/08/2024 à 23:18, Jim Burns a écrit :

    Therefore,
    there is no ω-1,

    If the set of ordinal numbers is complete, then ω-1 precedes ω - by definition.

    Something between ℕᵈᵉᶠ and ω
    does not exist.

    So the blind man argues.

    Or actual infinity does not exist. But then there is no ω, and ℕ = ℕᵈᵉᶠ is potentially infinite only.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Tue Aug 27 19:20:26 2024
    Le 25/08/2024 à 23:18, Richard Damon a écrit :

    But the sum of the infinite series adding up the terms of

    1/n - 1/(n+1)

    never gets to 1,

    It does, but only in the darkness.

    You logic just condemns Achilles to never be able to pass the tortoise
    as every time he reaches where the tortoise was, the tortoise has moved
    some more so Achilles needs to move again.

    Overtaking is possible only in the darkness.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Tue Aug 27 19:36:08 2024
    Le 26/08/2024 à 02:15, Moebius a écrit :
    Am 25.08.2024 um 23:18 schrieb Jim Burns:
    On 8/25/2024 3:35 PM, WM wrote:

    Dark numbers are not any bounds.

    Fascinating: So we have that there are "dark numbers" which are smaller (larger) than each and every s e SB (n e IN), but they are no bounds?

    Dark natural numbers are larger than any visible natural number but
    smaller than their bound omega.
    Dark unit fractions are smaller than any visible unit fractions but larger
    than their bound 0.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Tue Aug 27 22:01:15 2024
    Am 27.08.2024 um 21:34 schrieb Chris M. Thomasson:
    On 8/27/2024 12:20 PM, WM wrote:
    Le 25/08/2024 à 23:18, Richard Damon a écrit :

    But the sum [...] adding up the terms of

    1/n - 1/(n+1)

    never gets to 1,

    1/1 - 1/2 = .5
    1/2 - 1/3 = .1(6)
    1/3 - 1/4 = .08(3)

    Don't forget to sum up the terms:

    (1/1 - 1/2) + (1/2 - 1/3) + (1/3 - 1/4) = ?

    If we look closely we see that most of the terms (...1/k...) can be
    ignored. We just have to consider:

    1/1 - 1/4 = 3/4.

    Check: .5 + .1666... + .08333... = 0.75 = 3/4. (ok)

    Moreover we can prove this way that (as claimed above)

    SUM_(k=1..n) 1/k - 1/(k+1) < 1 (for all n e IN).

    Proof: We consider the sum of the terms for k = 1..n (where n is an
    arbitrary natural number): (1/1 - 1/2) + (1/2 - 1/3) + (1/3 - 1/4) + ...
    + (1/(n-1) - 1/n) + (1/n - 1/(n+1)) = 1/1 - 1/(n+1) = 1 - d, where d >
    0. Hence: SUM_(k=1..n) 1/k - 1/(k+1) < 1. qed

    It does, but only in the darkness.

    Are you a full blown moron or just _mostly_ stupid?

    I'd say BOTH.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Tue Aug 27 22:08:22 2024
    Am 27.08.2024 um 22:07 schrieb Chris M. Thomasson:
    On 8/27/2024 12:36 PM, WM wrote:
    Le 26/08/2024 à 02:15, Moebius a écrit :
    Am 25.08.2024 um 23:18 schrieb Jim Burns:
    On 8/25/2024 3:35 PM, WM wrote:

    Dark numbers are not any bounds.

    Fascinating: So we have that there are "dark numbers" which are
    smaller (larger) than each and every s e SB (n e IN), but they are no
    bounds?

    Dark natural numbers are larger than any visible natural number but
    smaller than their bound omega.
    Dark unit fractions are smaller than any visible unit fractions but
    larger than their bound 0.

    Define visible? lol. ;^) Give me any natural number x. 1/x. Okay, what
    about (1/(x+1))? There is no smallest unit fraction just like there is
    no largest natural number... See?


    No. He is blind. :-)

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Tue Aug 27 22:10:13 2024
    Am 27.08.2024 um 22:08 schrieb Moebius:
    Am 27.08.2024 um 22:07 schrieb Chris M. Thomasson:
    On 8/27/2024 12:36 PM, WM wrote:
    Le 26/08/2024 à 02:15, Moebius a écrit :
    Am 25.08.2024 um 23:18 schrieb Jim Burns:
    On 8/25/2024 3:35 PM, WM wrote:

    Dark numbers are not any bounds.

    Fascinating: So we have that there are "dark numbers" which are
    smaller (larger) than each and every s e SB (n e IN), but they are
    no bounds?

    Dark natural numbers are larger than any visible natural number but
    smaller than their bound omega.
    Dark unit fractions are smaller than any visible unit fractions but
    larger than their bound 0.

    Define visible? lol. ;^) Give me any natural number x. 1/x. Okay, what
    about (1/(x+1))? There is no smallest unit fraction just like there is
    no largest natural number... See?


    No. He is blind. :-)


    "visually challenged"? :-o

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Tue Aug 27 22:27:51 2024
    Am 27.08.2024 um 22:14 schrieb Chris M. Thomasson:
    On 8/27/2024 1:01 PM, Moebius wrote:
    Am 27.08.2024 um 21:34 schrieb Chris M. Thomasson:
    On 8/27/2024 12:20 PM, WM wrote:
    Le 25/08/2024 à 23:18, Richard Damon a écrit :

    But the sum [...] adding up the terms of

    1/n - 1/(n+1)

    never gets to 1,

    1/1 - 1/2 = .5
    1/2 - 1/3 = .1(6)
    1/3 - 1/4 = .08(3)

    Don't forget to sum up the terms:

         (1/1 - 1/2) + (1/2 - 1/3) + (1/3 - 1/4) = ?

    3/4

    Yup. Never equals one... However it "tends" to it...

    Right. Actually, lim_(n->oo) SUM_(k=1..n) 1/k - 1/(k+1) = 1.

    Hence we write "SUM_(k=1..oo) 1/k - 1/(k+1) = 1" and speak of an
    "infinite series" with sum 1 (thouh we do not actually "sum up"
    infinitely many terms).

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Richard Damon@21:1/5 to All on Tue Aug 27 23:18:46 2024
    On 8/27/24 3:26 PM, WM wrote:
    Le 25/08/2024 à 23:18, Jim Burns a écrit :

    Therefore,
    there is no ω-1,

    If the set of ordinal numbers is complete, then ω-1 precedes ω - by definition.

    Something between ℕᵈᵉᶠ and ω
    does not exist.

    So the blind man argues.

    Or actual infinity does not exist. But then there is no ω, and ℕ = ℕᵈᵉᶠ
    is potentially infinite only.

    Regards, WM

    YOur inability to see them doesn't mean they don't exist, just visible
    in the ultra-WM spectrum.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Richard Damon@21:1/5 to All on Tue Aug 27 23:17:34 2024
    On 8/27/24 3:36 PM, WM wrote:
    Le 26/08/2024 à 02:15, Moebius a écrit :
    Am 25.08.2024 um 23:18 schrieb Jim Burns:
    On 8/25/2024 3:35 PM, WM wrote:

    Dark numbers are not any bounds.

    Fascinating: So we have that there are "dark numbers" which are
    smaller (larger) than each and every s e SB (n e IN), but they are no
    bounds?

    Dark natural numbers are larger than any visible natural number but
    smaller than their bound omega.
    Dark unit fractions are smaller than any visible unit fractions but
    larger than their bound 0.

    Regards, WM


    And since the upper bound of the "visible" natural numebers is omega,
    since every visible natural number MUST be followed by the next Natural
    Number (since there isn't a definable maximum visible number, since
    given a visible number, we can always add one to it) and the lower bound
    of the "visible" unit fractions is 0, as any larger finite bound allows
    the creation of a smaller unit fraction below it.

    So, your "dark numbers" are squeezed out of the finite number space into
    some "beyond-finite" number space.

    Perhaps something like the hyper-reals.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Richard Damon@21:1/5 to All on Tue Aug 27 23:24:03 2024
    On 8/27/24 3:20 PM, WM wrote:
    Le 25/08/2024 à 23:18, Richard Damon a écrit :

    But the sum of the infinite series adding up the terms of

    1/n - 1/(n+1)

    never gets to 1,

    It does, but only in the darkness.

    But you never needed to get to darkness.


    You logic just condemns Achilles to never be able to pass the tortoise
    as every time he reaches where the tortoise was, the tortoise has
    moved some more so Achilles needs to move again.

    Overtaking is possible only in the darkness.

    So, we can't SEE Achilles pass the tortoise, so how can we know that he did?


    Regards, WM



    Your logic is just circular, so doesn't actually prove anything except
    your own blindness.

    There is no maximum "visible" natural number, or smallest "visible" unit fraction, so just trying to close your eyes to the truth is just showing
    you are blind to the truth, and stupidly refusing to accept reality.

    Sorry.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From joes@21:1/5 to All on Wed Aug 28 04:20:19 2024
    Am Tue, 27 Aug 2024 19:57:39 +0000 schrieb WM:
    Le 27/08/2024 à 21:31, Moebius a écrit :
    On 8/25/2024 3:45 PM, WM wrote:

    This function exists because nothing contradicts its existence.

    Right. But the values of the function NUF are:
    0 for all real arguments <= 0 and aleph_0 for all real arguments > 0.

    Correction: For all ends of real intervals containing ℵo unit fractions. The interval (0, x) cannot contain ℵo unit fractions unless x is sufficiently large.
    „Sufficient” meaning „not infinitesimal”.

    --
    Am Sat, 20 Jul 2024 12:35:31 +0000 schrieb WM in sci.math:
    It is not guaranteed that n+1 exists for every n.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From joes@21:1/5 to All on Wed Aug 28 04:23:14 2024
    Am Tue, 27 Aug 2024 19:26:25 +0000 schrieb WM:
    Le 25/08/2024 à 23:18, Jim Burns a écrit :

    Therefore, there is no ω-1,
    If the set of ordinal numbers is complete, then ω-1 precedes ω - by definition.
    How does it go again?

    --
    Am Sat, 20 Jul 2024 12:35:31 +0000 schrieb WM in sci.math:
    It is not guaranteed that n+1 exists for every n.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From joes@21:1/5 to All on Wed Aug 28 04:22:08 2024
    Am Tue, 27 Aug 2024 19:20:26 +0000 schrieb WM:
    Le 25/08/2024 à 23:18, Richard Damon a écrit :

    But the sum of the infinite series adding up the terms of
    1/n - 1/(n+1)
    never gets to 1,
    It does, but only in the darkness.
    Better known as the limit.

    You logic just condemns Achilles to never be able to pass the tortoise
    as every time he reaches where the tortoise was, the tortoise has moved
    some more so Achilles needs to move again.
    Overtaking is possible only in the darkness.
    --
    Am Sat, 20 Jul 2024 12:35:31 +0000 schrieb WM in sci.math:
    It is not guaranteed that n+1 exists for every n.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Wed Aug 28 14:47:39 2024
    Am 28.08.2024 um 06:20 schrieb joes:
    Am Tue, 27 Aug 2024 19:57:39 +0000 schrieb WM:
    Le 27/08/2024 à 21:31, Moebius a écrit :
    On 8/25/2024 3:45 PM, WM wrote:

    This function exists because nothing contradicts its existence.

    Right. But the values of the function NUF are:
    0 for all real arguments <= 0 and aleph_0 for all real arguments > 0.

    [Fun fact]: For all ends of real intervals containing ℵo unit fractions. >> The interval (0, x) cannot contain ℵo unit fractions unless x is
    sufficiently large.

    „Sufficient” meaning „not infinitesimal”.

    Right. After all, each and every _real_ number x > 0 is "sufficiently
    large".

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Wed Aug 28 12:47:44 2024
    Le 27/08/2024 à 22:27, Moebius a écrit :

    Hence we write "SUM_(k=1..oo) 1/k - 1/(k+1) = 1" and speak of an
    "infinite series" with sum 1 (thouh we do not actually "sum up"
    infinitely many terms).

    You cannot whatever you try because most are dark.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Wed Aug 28 12:49:17 2024
    Le 28/08/2024 à 01:06, FromTheRafters a écrit :
    WM wrote :
    Le 25/08/2024 à 23:18, Jim Burns a écrit :

    Therefore,
    there is no ω-1,

    If the set of ordinal numbers is complete, then ω-1 precedes ω - by
    definition.

    What is the definition of subtraction here?

    (ω-1) + 1 = ω

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Wed Aug 28 12:45:30 2024
    Le 27/08/2024 à 22:07, "Chris M. Thomasson" a écrit :
    On 8/27/2024 12:36 PM, WM wrote:

    Dark natural numbers are larger than any visible natural number but
    smaller than their bound omega.
    Dark unit fractions are smaller than any visible unit fractions but
    larger than their bound 0.

    Define visible?

    The simplest definition is this: A visible number can be expressed in
    decimals or binaries.

    Okay, what
    about (1/(x+1))?

    For every visible natnumber n also n+1, 2n or n^n^n are visible too.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Wed Aug 28 13:04:57 2024
    Le 28/08/2024 à 06:20, joes a écrit :
    Am Tue, 27 Aug 2024 19:57:39 +0000 schrieb WM:

    The interval (0, x) cannot contain ℵo unit fractions unless x is
    sufficiently large.
    „Sufficient” meaning „not infinitesimal”.

    No. "Sufficient" means that ℵo non-empty finite gaps between unit
    fractions fit into the interval. That is much larger than infinitesimal.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Wed Aug 28 13:01:46 2024
    Le 28/08/2024 à 05:24, Richard Damon a écrit :

    So, we can't SEE Achilles pass the tortoise, so how can we know that he did?

    By the same mathematics which proves the existence of dark states.

    There is no maximum "visible" natural number

    Correct. With n also n+1, 2n and n^n^n are visible. Potential infinity!

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Wed Aug 28 14:51:34 2024
    Am 28.08.2024 um 06:20 schrieb joes:
    Am Tue, 27 Aug 2024 19:36:08 +0000 schrieb WM:
    Le 26/08/2024 à 02:15, Moebius a écrit :
    Am 25.08.2024 um 23:18 schrieb Jim Burns:
    On 8/25/2024 3:35 PM, WM wrote:

    Dark numbers are not any bounds.

    Fascinating: So we have that there are "dark numbers" which are smaller
    (larger) than each and every s e SB (n e IN), but they are no bounds?

    Dark natural numbers are larger than any visible natural number but
    smaller than their bound omega.
    Dark unit fractions are smaller than any visible unit fractions but
    larger than their bound 0.

    This sounds an awful lot like the hyperreal numbers.

    Indeed! :-)

    Mückenheim has been told this already, but he's too dumb to get the message.

    Especially, that there are no hyperreal numbers in IR. (*sigh*)

    WM: "The axiom of Archimedes is wrong!"

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Wed Aug 28 12:51:40 2024
    Le 27/08/2024 à 21:34, "Chris M. Thomasson" a écrit :
    On 8/27/2024 12:20 PM, WM wrote:
    Le 25/08/2024 à 23:18, Richard Damon a écrit :

    You logic just condemns Achilles to never be able to pass the tortoise
    as every time he reaches where the tortoise was, the tortoise has
    moved some more so Achilles needs to move again.

    Overtaking is possible only in the darkness.

    Blah! What a joke.

    Try to enlighten the step where overtaking happens. Fail.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Wed Aug 28 15:05:04 2024
    Am 28.08.2024 um 06:23 schrieb joes:
    Am Tue, 27 Aug 2024 19:26:25 +0000 schrieb WM:
    Le 25/08/2024 à 23:18, Jim Burns a écrit :

    Therefore, there is no ω-1,

    *sigh*

    Therefore there is no ordinal number o such that o + 1 = ω.

    If the set of ordinal numbers is complete, then ω-1 precedes ω - by
    definition.

    How does it go again?

    WM defines "complete" comcerning (sets of) ordinal numbers the following
    way:

    A set of ordinals is /complete/ iff each and every ordinal
    in the set (except 0) has an immediate predecessor (which
    precedes it).

    Simple as that.

    In this sense, {0, 1, 2, 3, ... ω} is not (Mückenheim) complete.

    Though clearly no ordinal between 0 and ω is "missing" - LOL. :-)

    Hint: ~Eo e ORD: An e IN: n < o < ω.

    Hence the term "complete" as defined by Mückenheim is quite "misleading"
    (to say the least).

    We'd better define:

    A set of ordinals is /Mückenheim complete/ iff each and every
    ordinal in the set (except 0) has an immediate predecessor
    (which precedes it).

    Theorem: {0, 1, 2, 3, ... ω} is not Mückenheim complete. :-)

    Though it's not clear what's missing here. :-)

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Wed Aug 28 13:11:10 2024
    Le 28/08/2024 à 14:47, Moebius a écrit :
    Am 28.08.2024 um 06:20 schrieb joes:

    „Sufficient” meaning „not infinitesimal”.

    Right. After all, each and every _real_ number x > 0 is "sufficiently
    large".

    Wrong. "Sufficient" means that ℵo non-empty finite gaps between unit fractions fit into the interval. One gap already is larger some x > 0. Why
    do you think that ℵo non-empty finite gaps are smaller than every x > 0?

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Wed Aug 28 13:07:01 2024
    Le 28/08/2024 à 06:22, joes a écrit :
    Am Tue, 27 Aug 2024 19:20:26 +0000 schrieb WM:
    Le 25/08/2024 à 23:18, Richard Damon a écrit :

    But the sum of the infinite series adding up the terms of
    1/n - 1/(n+1)
    never gets to 1,
    It does, but only in the darkness.
    Better known as the limit.

    Can you count the steps until the limit by visible numbers?

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Wed Aug 28 13:16:46 2024
    Le 28/08/2024 à 15:05, Moebius a écrit :

    We'd better define:

    A set of ordinals is /Mückenheim complete/ iff each and every
    ordinal in the set (except 0)

    0 is not an ordinal. See the recent olympic games. No starter number 0 has
    been seen, let alone won a medal.

    has an immediate predecessor
    (which precedes it).

    Theorem: {0, 1, 2, 3, ... ω} is not Mückenheim complete. :-)

    If ω exists, it proves the completeness of the whole set of ordinals. Why should any ordinals be missing? Because Cantor could not see them?

    Though it's not clear what's missing here. :-)

    Think over that!

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Wed Aug 28 15:17:00 2024
    Am 28.08.2024 um 15:05 schrieb Moebius:
    Am 28.08.2024 um 06:23 schrieb joes:
    Am Tue, 27 Aug 2024 19:26:25 +0000 schrieb WM:
    Le 25/08/2024 à 23:18, Jim Burns a écrit :

    Therefore, there is no ω-1,

    *sigh*

    Therefore there is no ordinal number o such that o + 1 = ω.

    If the set of ordinal numbers is complete, then ω-1 precedes ω - by
    definition.

    How does it go again?

    WM defines "complete" comcerning (sets of) ordinal numbers the following
    way:

        A set of ordinals is /complete/ iff each and every ordinal
            in the set (except 0) has an immediate predecessor (which
            precedes it).

    Simple as that.

    In this sense, {0, 1, 2, 3, ... ω} is not (Mückenheim) complete.

    Though clearly no ordinal between 0 and ω is "missing" - LOL. :-)

    Hint: ~Eo e ORD: An e IN: n < o < ω.

    Hence the term "complete" as defined by Mückenheim is quite
    "misleading" (to say the least).

    He's playing shell games, as usual.

    -------------------------------------------------------------------

    Actually, his argument is: If all moons consist of green cheese, than
    our moon consists of green cheese.

    Yeah! Keep up the good work, Mückenheim!

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From joes@21:1/5 to All on Wed Aug 28 15:06:47 2024
    Am Wed, 28 Aug 2024 13:04:57 +0000 schrieb WM:
    Le 28/08/2024 à 06:20, joes a écrit :
    Am Tue, 27 Aug 2024 19:57:39 +0000 schrieb WM:

    The interval (0, x) cannot contain ℵo unit fractions unless x is
    sufficiently large.
    „Sufficient” meaning „not infinitesimal”.
    No. "Sufficient" means that ℵo non-empty finite gaps between unit
    fractions fit into the interval. That is much larger than infinitesimal.
    So… you agree.

    --
    Am Sat, 20 Jul 2024 12:35:31 +0000 schrieb WM in sci.math:
    It is not guaranteed that n+1 exists for every n.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Wed Aug 28 22:38:07 2024
    Am 28.08.2024 um 21:23 schrieb Chris M. Thomasson:
    On 8/28/2024 5:51 AM, WM wrote:
    Le 27/08/2024 à 21:34, "Chris M. Thomasson" a écrit :
    On 8/27/2024 12:20 PM, WM wrote:
    Le 25/08/2024 à 23:18, Richard Damon a écrit :

    You logic just condemns Achilles to never be able to pass the
    tortoise as every time he reaches where the tortoise was, the
    tortoise has moved some more so Achilles needs to move again.

    Overtaking is possible only in the darkness.

    Blah! What a joke.

    Try to enlighten the step where overtaking happens.

    Quite simple: The "step" (rather /stage/) can be labeled with "omega".

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From joes@21:1/5 to All on Thu Aug 29 10:46:51 2024
    Am Wed, 28 Aug 2024 13:01:46 +0000 schrieb WM:
    Le 28/08/2024 à 05:24, Richard Damon a écrit :

    So, we can't SEE Achilles pass the tortoise, so how can we know that he
    did?
    By the same mathematics which proves the existence of dark states.

    There is no maximum "visible" natural number
    Correct. With n also n+1, 2n and n^n^n are visible. Potential infinity!
    I am confused wrt. to my signature:
    --
    Am Sat, 20 Jul 2024 12:35:31 +0000 schrieb WM in sci.math:
    It is not guaranteed that n+1 exists for every n.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From joes@21:1/5 to All on Thu Aug 29 10:48:25 2024
    Am Wed, 28 Aug 2024 13:11:10 +0000 schrieb WM:
    Le 28/08/2024 à 14:47, Moebius a écrit :
    Am 28.08.2024 um 06:20 schrieb joes:

    „Sufficient” meaning „not infinitesimal”.
    Right. After all, each and every _real_ number x > 0 is "sufficiently
    large".
    Wrong. "Sufficient" means that ℵo non-empty finite gaps between unit fractions fit into the interval. One gap already is larger some x > 0.
    I think you overlooked a „not”.

    Why do you think that ℵo non-empty finite gaps are smaller than every
    x > 0?
    I don’t. Get your quantifiers in order.

    --
    Am Sat, 20 Jul 2024 12:35:31 +0000 schrieb WM in sci.math:
    It is not guaranteed that n+1 exists for every n.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Thu Aug 29 13:13:20 2024
    Le 29/08/2024 à 12:48, joes a écrit :
    Am Wed, 28 Aug 2024 13:11:10 +0000 schrieb WM:

    Why do you think that ℵo non-empty finite gaps are smaller than every
    x > 0?
    I don’t.

    How many would you accept?

    Get your quantifiers in order.

    This order is just that in question: Can two or more unit fractions fit
    into every interval (0, x)?

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Thu Aug 29 13:15:17 2024
    Le 29/08/2024 à 13:00, FromTheRafters a écrit :

    He seems to think that n being some undisclosed (dark) natural number
    means that n+1 is merely another undisclosed (dark) natural number and
    you cannot pair (thinking of matching,

    No. If n is a visible nabtuarl number, then also n^n^n is also a visible natural number. That is potential infinity.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Thu Aug 29 13:23:03 2024
    Le 28/08/2024 à 22:38, Moebius a écrit :

    Try to enlighten the step where overtaking happens.

    Quite simple: The "step" (rather /stage/) can be labeled with "omega".

    Yes. That is a number without finite initial segment. A dark number.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Thu Aug 29 13:16:30 2024
    Le 29/08/2024 à 12:46, joes a écrit :
    Am Wed, 28 Aug 2024 13:01:46 +0000 schrieb WM:

    There is no maximum "visible" natural number
    Correct. With n also n+1, 2n and n^n^n are visible. Potential infinity!
    I am confused wrt. to my signature:

    That concerns dark natural numbers.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Richard Hachel@21:1/5 to All on Thu Aug 29 13:23:52 2024
    Le 29/08/2024 à 15:13, WM a écrit :
    Le 29/08/2024 à 12:48, joes a écrit :
    Am Wed, 28 Aug 2024 13:11:10 +0000 schrieb WM:

    Why do you think that ℵo non-empty finite gaps are smaller than every
    x > 0?
    I don’t.

    How many would you accept?

    Get your quantifiers in order.

    This order is just that in question: Can two or more unit fractions fit into every interval (0, x)?

    Regards, WM

    New NEMO.

    https://www.nemoweb.net/ (and not news2.nemoweb)

    identifiers are the same

    R.H.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Thu Aug 29 13:34:14 2024
    Le 28/08/2024 à 16:00, FromTheRafters a écrit :
    WM presented the following explanation :
    Le 27/08/2024 à 22:07, "Chris M. Thomasson" a écrit :
    On 8/27/2024 12:36 PM, WM wrote:

    Dark natural numbers are larger than any visible natural number but
    smaller than their bound omega.
    Dark unit fractions are smaller than any visible unit fractions but larger >>>> than their bound 0.

    Define visible?

    The simplest definition is this: A visible number can be expressed in
    decimals or binaries.

    Can be? Or is? Or has previously been?

    Is or has previously been. If not yet expressed in the system, it is dark
    in the system. But small dark numbers can become visisble. (They have been called grey numbers.)

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Thu Aug 29 13:35:55 2024
    Le 28/08/2024 à 16:10, FromTheRafters a écrit :
    on 8/28/2024, WM supposed :
    Le 28/08/2024 à 14:47, Moebius a écrit :
    Am 28.08.2024 um 06:20 schrieb joes:

    „Sufficient” meaning „not infinitesimal”.

    Right. After all, each and every _real_ number x > 0 is "sufficiently
    large".

    Wrong. "Sufficient" means that ℵo non-empty finite gaps between unit
    fractions fit into the interval. One gap already is larger some x > 0. Why do
    you think that ℵo non-empty finite gaps are smaller than every x > 0?

    Because of the way the reals are constructed.

    Not a reason - and wrong.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Thu Aug 29 13:37:03 2024
    Le 28/08/2024 à 17:06, joes a écrit :
    Am Wed, 28 Aug 2024 13:04:57 +0000 schrieb WM:
    Le 28/08/2024 à 06:20, joes a écrit :
    Am Tue, 27 Aug 2024 19:57:39 +0000 schrieb WM:

    The interval (0, x) cannot contain ℵo unit fractions unless x is
    sufficiently large.
    „Sufficient” meaning „not infinitesimal”.
    No. "Sufficient" means that ℵo non-empty finite gaps between unit
    fractions fit into the interval. That is much larger than infinitesimal.
    So… you agree.

    Yes, I misread.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From joes@21:1/5 to All on Thu Aug 29 15:42:46 2024
    Am Thu, 29 Aug 2024 13:13:20 +0000 schrieb WM:
    Le 29/08/2024 à 12:48, joes a écrit :
    Am Wed, 28 Aug 2024 13:11:10 +0000 schrieb WM:

    Why do you think that ℵo non-empty finite gaps are smaller than every
    x > 0?
    I don’t.
    How many would you accept?
    Nothing is smaller than all x.

    Get your quantifiers in order.
    However, the number of unit fractions less than any given x is infinite.

    This order is just that in question: Can two or more unit fractions fit
    into every interval (0, x)?
    --
    Am Sat, 20 Jul 2024 12:35:31 +0000 schrieb WM in sci.math:
    It is not guaranteed that n+1 exists for every n.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From joes@21:1/5 to All on Thu Aug 29 15:38:59 2024
    Am Thu, 29 Aug 2024 13:15:17 +0000 schrieb WM:
    Le 29/08/2024 à 13:00, FromTheRafters a écrit :

    He seems to think that n being some undisclosed (dark) natural number
    means that n+1 is merely another undisclosed (dark) natural number and
    you cannot pair (thinking of matching,
    No. If n is a visible nabtuarl number, then also n^n^n is also a visible natural number. That is potential infinity.
    By induction, they all are.

    --
    Am Sat, 20 Jul 2024 12:35:31 +0000 schrieb WM in sci.math:
    It is not guaranteed that n+1 exists for every n.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Thu Aug 29 21:42:48 2024
    Am 29.08.2024 um 20:53 schrieb Chris M. Thomasson:
    On 8/29/2024 6:15 AM, WM wrote:
    Le 29/08/2024 à 13:00, FromTheRafters a écrit :

    He seems to think that n being some undisclosed (dark) natural number
    means that n+1 is merely another undisclosed (dark) natural number
    and you cannot pair (thinking of matching,

    No. If n is a visible nabtuarl number, then also n^n^n is also a
    visible natural number. That is potential infinity.

    if n is a natural number then n + 1 is a natural number.

    I'm thinking of a number!

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Jim Burns@21:1/5 to All on Thu Aug 29 17:06:10 2024
    On 8/29/2024 9:34 AM, WM wrote:
    Le 28/08/2024 à 16:00, FromTheRafters a écrit :
    WM presented the following explanation :

    The simplest definition is this:
    A visible number can be expressed in decimals or binaries.

    Can be? Or is? Or has previously been?

    Is or has previously been.

    And that supersedes 'can be'?

    If not yet expressed in the system,
    it is dark in the system.
    But small dark numbers can become visisble.

    If they can become visible,
    then they are well.ordered and
    have immediate successors and predecessors, except 0.

    If they are well.ordered and
    have immediate successors and predecessors, except 0,
    then we can claim that
    they are well.ordered and
    have immediate successors and predecessors, except 0,
    and it is true without exception.

    (They have been called grey numbers.)

    I am disappointed at the absence of
    flying.rainbow.sparkle.numbers.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From joes@21:1/5 to All on Fri Aug 30 07:21:46 2024
    Am Thu, 29 Aug 2024 13:34:14 +0000 schrieb WM:
    Le 28/08/2024 à 16:00, FromTheRafters a écrit :
    WM presented the following explanation :
    Le 27/08/2024 à 22:07, "Chris M. Thomasson" a écrit :
    On 8/27/2024 12:36 PM, WM wrote:

    Dark natural numbers are larger than any visible natural number but
    smaller than their bound omega.
    Dark unit fractions are smaller than any visible unit fractions but
    larger than their bound 0.

    Define visible?

    The simplest definition is this: A visible number can be expressed in
    decimals or binaries.

    Can be? Or is? Or has previously been?

    Is or has previously been. If not yet expressed in the system, it is
    dark in the system. But small dark numbers can become visisble. (They
    have been called grey numbers.)
    By induction that goes for every number.

    --
    Am Sat, 20 Jul 2024 12:35:31 +0000 schrieb WM in sci.math:
    It is not guaranteed that n+1 exists for every n.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Fri Aug 30 12:13:25 2024
    Am 30.08.2024 um 09:21 schrieb joes:
    Am Thu, 29 Aug 2024 13:37:03 +0000 schrieb WM:
    Le 28/08/2024 à 17:06, joes a écrit :
    Am Wed, 28 Aug 2024 13:04:57 +0000 schrieb WM:
    Le 28/08/2024 à 06:20, joes a écrit :
    Am Tue, 27 Aug 2024 19:57:39 +0000 schrieb WM:

    The interval (0, x) cannot contain ℵo unit fractions unless x is >>>>>> sufficiently large.

    „Sufficient” meaning „not infinitesimal”.

    No. "Sufficient" means that ℵo non-empty finite gaps between unit
    fractions fit into the interval. That is much larger than
    infinitesimal.

    So… you agree.

    Yes, I misread.

    Thus: The interval (0, x) contains finitely many unit fractions only
    for infinitesimal x.

    Actually, it either contains NO unit fractions (if x = 0 or x is
    infinitesimal but > 0) or it contains infinitely many (ℵo) unit fractions.

    Proof: If x = 0 then no unit fraction is in (0, x) (since in this case
    (0, x) is empty). If x is infinitesimal but > 0, then (by definition)
    for all n e IN: x < 1/n. Hence no unit fraction is in (0, x). If on the
    other hand x e IR, x > 0, and there is an unit fraction u such that u <
    x, then (0, x) contains (at least) the infinitely many unit fractions u,
    1/(1/u + 1), 1/(1/u + 2), 1/(1/u + 3), ... (hence it contains ℵo unit fractions). qed

    So no matter if x > 0 is infinitesimal or not: NUF(x) =/= 1.

    Hence especially for all x e IR, x > 0: NUF(x) =/= 1. In fact, for all x
    e IR: NUF(x) e {0, aleph_0}.

    WM is a crank.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Fri Aug 30 12:51:53 2024
    Le 29/08/2024 à 18:15, FromTheRafters a écrit :
    on 8/29/2024, WM supposed :
    Le 29/08/2024 à 13:00, FromTheRafters a écrit :

    He seems to think that n being some undisclosed (dark) natural number means >>> that n+1 is merely another undisclosed (dark) natural number and you cannot >>> pair (thinking of matching,

    No. If n is a visible nabtuarl number, then also n^n^n is also a visible
    natural number. That is potential infinity.

    What about n+n if n is visible? or n+1?

    Of course they are visible. The collection of visible numbers is
    potentially infinite. It reaches as far as induction reaches. But *if
    actual infinity is existing*, then almost all natural numbers are not
    reached by induction.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Fri Aug 30 12:46:18 2024
    Le 29/08/2024 à 17:42, joes a écrit :
    Am Thu, 29 Aug 2024 13:13:20 +0000 schrieb WM:
    Le 29/08/2024 à 12:48, joes a écrit :
    Am Wed, 28 Aug 2024 13:11:10 +0000 schrieb WM:

    Why do you think that ℵo non-empty finite gaps are smaller than every >>>> x > 0?
    I don’t.
    How many would you accept?
    Nothing is smaller than all x.

    How man unit fractions are lessorequal than all unit fractions?
    How man unit fraction are lessorequal every unt fractions.

    Get your quantifiers in order.
    However, the number of unit fractions less than any given x is infinite.

    This is the question: Can two unit fractions be lessorequal than all unit fractions?

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Fri Aug 30 12:59:47 2024
    Le 30/08/2024 à 12:13, Moebius a écrit :
    Am 30.08.2024 um 09:21 schrieb joes:

    Thus: The interval (0, x) contains finitely many unit fractions only
    for infinitesimal x.

    Actually, it either contains NO unit fractions (if x = 0 or x is infinitesimal but > 0) or it contains infinitely many (ℵo) unit fractions.

    That contradicts the fact that ℵo unit fractions occupy an interval that
    can be reduced.

    So no matter if x > 0 is infinitesimal or not: NUF(x) =/= 1.

    Are there two unit fractions possible lessorequal than all unit fractions?

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Fri Aug 30 12:48:35 2024
    Le 29/08/2024 à 18:05, FromTheRafters a écrit :
    WM formulated the question :
    Le 28/08/2024 à 16:00, FromTheRafters a écrit :
    WM presented the following explanation :
    Le 27/08/2024 à 22:07, "Chris M. Thomasson" a écrit :
    On 8/27/2024 12:36 PM, WM wrote:

    Dark natural numbers are larger than any visible natural number but >>>>>> smaller than their bound omega.
    Dark unit fractions are smaller than any visible unit fractions but >>>>>> larger than their bound 0.

    Define visible?

    The simplest definition is this: A visible number can be expressed in
    decimals or binaries.

    Can be? Or is? Or has previously been?

    Is or has previously been. If not yet expressed in the system, it is dark in >> the system. But small dark numbers can become visisble. (They have been
    called grey numbers.)

    Oh no! Grey numbers? You're pulling my leg now huh? How would you
    distinguish a small enough dark or grey number from a fully dark larger number?

    Grey numbers are not my idea. They can only be distinguished after having become visible. Dark numbers cannot be distinguished.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Fri Aug 30 13:01:08 2024
    Le 30/08/2024 à 09:21, joes a écrit :
    Am Thu, 29 Aug 2024 13:34:14 +0000 schrieb WM:
    Le 28/08/2024 à 16:00, FromTheRafters a écrit :
    WM presented the following explanation :
    Le 27/08/2024 à 22:07, "Chris M. Thomasson" a écrit :
    On 8/27/2024 12:36 PM, WM wrote:

    Dark natural numbers are larger than any visible natural number but >>>>>> smaller than their bound omega.
    Dark unit fractions are smaller than any visible unit fractions but >>>>>> larger than their bound 0.

    Define visible?

    The simplest definition is this: A visible number can be expressed in
    decimals or binaries.

    Can be? Or is? Or has previously been?

    Is or has previously been. If not yet expressed in the system, it is
    dark in the system. But small dark numbers can become visisble. (They
    have been called grey numbers.)
    By induction that goes for every number.

    *If actual infinity exists*, then induction fails to reach most numbers.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Fri Aug 30 13:02:27 2024
    Le 30/08/2024 à 09:21, joes a écrit :
    Am Thu, 29 Aug 2024 13:37:03 +0000 schrieb WM:
    Le 28/08/2024 à 17:06, joes a écrit :
    Am Wed, 28 Aug 2024 13:04:57 +0000 schrieb WM:
    Le 28/08/2024 à 06:20, joes a écrit :
    Am Tue, 27 Aug 2024 19:57:39 +0000 schrieb WM:

    The interval (0, x) cannot contain ℵo unit fractions unless x is >>>>>> sufficiently large.
    „Sufficient” meaning „not infinitesimal”.
    No. "Sufficient" means that ℵo non-empty finite gaps between unit
    fractions fit into the interval. That is much larger than
    infinitesimal.
    So… you agree.
    Yes, I misread.
    Thus: The interval (0, x) contains finitely many unit fractions only
    for infinitesimal x.

    Every gap between two unit fractions is finite, not infinitesimal.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Richard Damon@21:1/5 to All on Fri Aug 30 09:20:29 2024
    On 8/30/24 9:01 AM, WM wrote:
    Le 30/08/2024 à 09:21, joes a écrit :
    Am Thu, 29 Aug 2024 13:34:14 +0000 schrieb WM:
    Le 28/08/2024 à 16:00, FromTheRafters a écrit :
    WM presented the following explanation :
    Le 27/08/2024 à 22:07, "Chris M. Thomasson" a écrit :
    On 8/27/2024 12:36 PM, WM wrote:

    Dark natural numbers are larger than any visible natural number but >>>>>>> smaller than their bound omega.
    Dark unit fractions are smaller than any visible unit fractions but >>>>>>> larger than their bound 0.

    Define visible?

    The simplest definition is this: A visible number can be expressed in >>>>> decimals or binaries.

    Can be? Or is? Or has previously been?

    Is or has previously been. If not yet expressed in the system, it is
    dark in the system. But small dark numbers can become visisble. (They
    have been called grey numbers.)
    By induction that goes for every number.

    *If actual infinity exists*, then induction fails to reach most numbers.

    Regards, WM


    Only in YOUR BROKEN finite logic.

    The problem is all in your head, which got blown up when your logic
    system exploded in the inconsistancies of you using finite logic on
    infinite sets.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Richard Damon@21:1/5 to All on Fri Aug 30 09:23:04 2024
    On 8/30/24 8:59 AM, WM wrote:
    Le 30/08/2024 à 12:13, Moebius a écrit :
    Am 30.08.2024 um 09:21 schrieb joes:

    Thus: The interval (0, x) contains finitely many unit fractions only
    for infinitesimal x.

    Actually, it either contains NO unit fractions (if x = 0 or x is
    infinitesimal but > 0) or it contains infinitely many (ℵo) unit
    fractions.

    That contradicts the fact that ℵo unit fractions occupy an interval that can be reduced.

    So no matter if x > 0 is infinitesimal or not: NUF(x) =/= 1.

    Are there two unit fractions possible lessorequal than all unit fractions?

    Regards, WM


    No, because nothing is smaller than itself, and two unequal order things
    must have an order.

    But there ARE two unit fractions less than ANY given unit fraction.

    You just apply the wrong qualifiers because you logic system is broken.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Richard Damon@21:1/5 to All on Fri Aug 30 09:26:57 2024
    On 8/30/24 9:02 AM, WM wrote:
    Le 30/08/2024 à 09:21, joes a écrit :
    Am Thu, 29 Aug 2024 13:37:03 +0000 schrieb WM:
    Le 28/08/2024 à 17:06, joes a écrit :
    Am Wed, 28 Aug 2024 13:04:57 +0000 schrieb WM:
    Le 28/08/2024 à 06:20, joes a écrit :
    Am Tue, 27 Aug 2024 19:57:39 +0000 schrieb WM:

    The interval (0, x) cannot contain ℵo unit fractions unless x is >>>>>>> sufficiently large.
    „Sufficient” meaning „not infinitesimal”.
    No. "Sufficient" means that ℵo non-empty finite gaps between unit
    fractions fit into the interval. That is much larger than
    infinitesimal.
    So… you agree.
    Yes, I misread.
    Thus: The interval (0, x) contains finitely many unit fractions only
    for infinitesimal x.

    Every gap between two unit fractions is finite, not infinitesimal.

    Regards, WM

    Right, but the sum of all the gaps of any finite number of distance
    between the unit fractions leave room for more.

    Thus, for ANY finite interval, (0, x) you can put an INFINTE number of
    unit fractions in it.

    Because, while the gap between any two is finite, it becomes vanishingly
    small so you can fit an infinite number of them into that finite space.

    Something that seems to be beyound your understanding.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From joes@21:1/5 to All on Fri Aug 30 15:17:51 2024
    Am Fri, 30 Aug 2024 12:59:47 +0000 schrieb WM:
    Le 30/08/2024 à 12:13, Moebius a écrit :
    Am 30.08.2024 um 09:21 schrieb joes:

    Thus: The interval (0, x) contains finitely many unit fractions only
    for infinitesimal x.
    Actually, it either contains NO unit fractions (if x = 0 or x is
    infinitesimal but > 0) or it contains infinitely many (ℵo) unit
    fractions.
    That contradicts the fact that ℵo unit fractions occupy an interval that can be reduced.
    What do you mean by „reducing”? That the number of unit fractions
    stays infinite when cutting off the right?

    So no matter if x > 0 is infinitesimal or not: NUF(x) =/= 1.
    Are there two unit fractions possible lessorequal than all unit
    fractions?
    --
    Am Sat, 20 Jul 2024 12:35:31 +0000 schrieb WM in sci.math:
    It is not guaranteed that n+1 exists for every n.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From joes@21:1/5 to All on Fri Aug 30 15:15:54 2024
    Am Fri, 30 Aug 2024 13:08:14 +0000 schrieb WM:
    Le 30/08/2024 à 03:09, Richard Damon a écrit :
    On 8/29/24 9:27 AM, WM wrote:
    Le 29/08/2024 à 01:48, Richard Damon a écrit :
    On 8/28/24 8:57 AM, WM wrote:
    Le 28/08/2024 à 04:13, Richard Damon a écrit :

    Well NUF(x) does not exist, but that doesn't say that infinity is
    not actual,
    So the unit fractions are actually existing but their number isn't?
    There number exists, it is aleph_0.
    You just can't count them from the "end" that doesn't have an end.
    Because you can't start at an end that isn't there.
    0 is below the end. Hence there is an end.
    Does not follow.

    Try to tell me the actual number you are going to start at.
    I start with NUF(0) = 0.
    That is not a unit fraction.

    Logic that depends on the existance of something that doesn't exist is
    just broken.
    --
    Am Sat, 20 Jul 2024 12:35:31 +0000 schrieb WM in sci.math:
    It is not guaranteed that n+1 exists for every n.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to All on Fri Aug 30 15:29:22 2024
    Le 30/08/2024 à 15:23, Richard Damon a écrit :
    On 8/30/24 8:59 AM, WM wrote:
    Le 30/08/2024 à 12:13, Moebius a écrit :
    Am 30.08.2024 um 09:21 schrieb joes:

    So no matter if x > 0 is infinitesimal or not: NUF(x) =/= 1.

    Are there two unit fractions possible lessorequal than all unit fractions? >>
    No, because nothing is smaller than itself, and two unequal order things
    must have an order.

    Not both can be the smallest. Hence only one is the first.

    But there ARE two unit fractions less than ANY given unit fraction.

    Of course. Any given unit fraction can be given and therefore is visible.

    You just apply the wrong qualifiers because you logic system is broken.

    No. I apply this way in oder to show the more intelligent readers among
    you, than there is NUF(x) = 1.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Richard Damon@21:1/5 to All on Fri Aug 30 11:47:35 2024
    On 8/30/24 11:29 AM, WM wrote:
    Le 30/08/2024 à 15:23, Richard Damon a écrit :
    On 8/30/24 8:59 AM, WM wrote:
    Le 30/08/2024 à 12:13, Moebius a écrit :
    Am 30.08.2024 um 09:21 schrieb joes:

    So no matter if x > 0 is infinitesimal or not: NUF(x) =/= 1.

    Are there two unit fractions possible lessorequal than all unit
    fractions?

    No, because nothing is smaller than itself, and two unequal order
    things must have an order.

    Not both can be the smallest. Hence only one is the first.

    But since there WILL be another smaller than it, it won't be the
    smallest, just the smallest of those mentioned so far, not of all.


    But there ARE two unit fractions less than ANY given unit fraction.

    Of course. Any given unit fraction can be given and therefore is visible.

    And thus, none can be the smallest, as for *ANY* given unit fraction,
    there is a smaller one.

    If there is something smaller than you, you can not be the smallest.


    You just apply the wrong qualifiers because you logic system is broken.

    No. I apply this way in oder to show the more intelligent readers among
    you, than there is NUF(x) = 1.


    No, it shows that there CAN'T be an finite x where NUF(x) = 1, as there
    will always be at least two unit fractions below it.

    Regards, WM



    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Fri Aug 30 18:35:58 2024
    Am 30.08.2024 um 17:17 schrieb joes:
    Am Fri, 30 Aug 2024 12:59:47 +0000 schrieb WM:
    Le 30/08/2024 à 12:13, Moebius a écrit :
    Am 30.08.2024 um 09:21 schrieb joes:

    Thus: The interval (0, x) contains finitely many unit fractions only
    for infinitesimal x.

    Actually, it either contains NO unit fractions (if x = 0 or x is
    infinitesimal but > 0) or it contains infinitely many (ℵo) unit
    fractions.

    That contradicts [bla bla bla]

    Of course, NOT. :-)

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Fri Aug 30 18:34:28 2024
    Am 30.08.2024 um 17:15 schrieb joes:
    Am Fri, 30 Aug 2024 13:08:14 +0000 schrieb WM:

    0 is below the end. Hence there is an end.

    Does not follow.

    Actually, it does!

    If we have

    0 < the_smallest_unit_fraction (WM: "the end")

    we may derive (in the context of FOPL)

    Ex(x = the_smallest_unit_fraction & 0 < x)

    and from this:

    Ex(x = the_smallest_unit_fraction)
    "the_smallest_unit_fraction exists"

    And from this "of course" we get: there is a
    smallest unit fraction. (WM: "there is an end") :-P

    On the other hand, (actually) the term "the_smallest_unit_fraction"
    (with the intended meaning) cannot be defined (i.e. introduced by a
    proper definition), since there is no smallest unit fraction.

    Logic that depends on the existance of something that doesn't exist is
    just broken.

    Yeah. At least in the context of classical logic.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Jim Burns@21:1/5 to All on Fri Aug 30 13:31:04 2024
    On 8/30/2024 9:02 AM, WM wrote:
    Le 30/08/2024 à 09:21, joes a écrit :

    [...]

    Every gap between two unit fractions is finite,
    not infinitesimal.

    The greatest.lower.bound of
    gaps between two unit fractions
    is 0, which is
    not a gap between two unit fractions.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Jim Burns@21:1/5 to All on Fri Aug 30 13:18:56 2024
    On 8/30/2024 8:51 AM, WM wrote:
    Le 29/08/2024 à 18:15, FromTheRafters a écrit :

    [...]

    The collection of visible numbers is potentially infinite.

    Nothing in the set of visible numbers
    is ever not.in the set of visible numbers.

    Nothing not.in the set of visible numbers
    is ever in the set of visible numbers.

    It reaches as far as induction reaches.
    But *if actual infinity is existing*, then
    almost all natural numbers are not reached by induction.

    Each natural number has a positive reciprocal.
    ⅟𝔊 > 0

    Each positive reciprocal is undercut by
    a visible unit.fraction.
    ⅟𝔊 > ⅟k > 0

    Each natural number with a reciprocal undercut by
    a visible unit.fraction
    is surpassed by a visible number.
    k > 𝔊

    Each natural number surpassed by a visible number
    is reached by induction.
    P(0) ∧ ∀j∈ℕ:P(j)⇒P(j+1) ⟹ P(k) ∧ P(𝔊)

    But *if actual infinity is existing*, then
    almost all natural numbers are not reached by induction.

    Your personal 'actual infinity' does not exist.
    It requires some set B, subset C ⊆ B, superset A ⊇ B
    non.2.ended C and A ⊇ B ⊇ C ⊈ A

    Never A ⊇ B ⊇ C ⊈ A exist.
    Your personal 'actual infinity' does not exist.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to Chris M. Thomasson on Mon Sep 2 18:56:37 2024
    On 01.09.2024 21:09, Chris M. Thomasson wrote:
    On 8/31/2024 8:27 PM, Moebius wrote:

    In general, for all x e IR, x > 0: NUF(x) = aleph_0.

    Don't get confused by that nonsense. Everybody knows that unit fractions
    are different from each other. Therefore they cannot be counted at the
    same x, let alone at less than all positive x, i.e., at zero.

    How does that fit with WM who thinks there is a smallest unit fraction
    to start counting from?

    I do not think that but I prove that by the simple fact that not more
    than one unit fraction can be lessequal than all unit fractions.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Richard Damon@21:1/5 to All on Mon Sep 2 13:13:46 2024
    On 9/2/24 12:56 PM, WM wrote:
    On 01.09.2024 21:09, Chris M. Thomasson wrote:
    On 8/31/2024 8:27 PM, Moebius wrote:

    In general, for all x e IR, x > 0: NUF(x) = aleph_0.

    Don't get confused by that nonsense. Everybody knows that unit fractions
    are different from each other. Therefore they cannot be counted at the
    same x, let alone at less than all positive x, i.e., at zero.

    How does that fit with WM who thinks there is a smallest unit fraction
    to start counting from?

    I do not think that but I prove that by the simple fact that not more
    than one unit fraction can be lessequal than all unit fractions.

    Regards, WM


    Except that it starts with the incorrect assumption that such a unit
    fraction exists.

    Since for *ANY* unit fraction, (including your claimed one) there always
    exist at least one more (and in fact an infinite number of them) that is actually smaller than it, there can not be a "smallest" one.

    Since for any finite x > 0 you choose, there exists an n = floor(1/x)
    and the values of 1/(n+1), 1/(n+2), 1/(n+3) ... 1/(n+k) ... that are
    smaller than x, we see that there can not be a smallest unit fraction.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Richard Damon@21:1/5 to All on Tue Sep 3 07:26:09 2024
    On 9/3/24 7:19 AM, WM wrote:
    On 02.09.2024 19:13, Richard Damon wrote:
    On 9/2/24 12:56 PM, WM wrote:
    On 01.09.2024 21:09, Chris M. Thomasson wrote:
    On 8/31/2024 8:27 PM, Moebius wrote:

    In general, for all x e IR, x > 0: NUF(x) = aleph_0.

    Don't get confused by that nonsense. Everybody knows that unit
    fractions are different from each other. Therefore they cannot be
    counted at the same x, let alone at less than all positive x, i.e., at
    zero.

    How does that fit with WM who thinks there is a smallest unit
    fraction to start counting from?

    I do not think that but I prove that by the simple fact that not more
    than one unit fraction can be lessequal than all unit fractions.

    Except that it starts with the incorrect assumption that such a unit fraction exists.

    No, it shows that no unit fractions exist unless a first one exists.

    Regards, WM

    Sol you think that 1/1 doesn't exist?

    I guess you system just doesn't have NUMBERS.

    Sorry, you are just proving your stupidity.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to Richard Damon on Tue Sep 3 13:19:44 2024
    On 02.09.2024 19:13, Richard Damon wrote:
    On 9/2/24 12:56 PM, WM wrote:
    On 01.09.2024 21:09, Chris M. Thomasson wrote:
    On 8/31/2024 8:27 PM, Moebius wrote:

    In general, for all x e IR, x > 0: NUF(x) = aleph_0.

    Don't get confused by that nonsense. Everybody knows that unit
    fractions are different from each other. Therefore they cannot be
    counted at the same x, let alone at less than all positive x, i.e., at
    zero.

    How does that fit with WM who thinks there is a smallest unit
    fraction to start counting from?

    I do not think that but I prove that by the simple fact that not more
    than one unit fraction can be lessequal than all unit fractions.

    Except that it starts with the incorrect assumption that such a unit fraction exists.

    No, it shows that no unit fractions exist unless a first one exists.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to Richard Damon on Tue Sep 3 13:29:23 2024
    On 03.09.2024 13:26, Richard Damon wrote:
    On 9/3/24 7:19 AM, WM wrote:

    No, it shows that no unit fractions exist unless a first one exists.

    Sol you think that 1/1 doesn't exist?

    No, I know that 1/1 does not exist unless the smallest unit fraction exists.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From WM@21:1/5 to Chris M. Thomasson on Tue Sep 3 13:27:10 2024
    On 02.09.2024 20:47, Chris M. Thomasson wrote:
    On 9/2/2024 9:56 AM, WM wrote:
    On 01.09.2024 21:09, Chris M. Thomasson wrote:
    On 8/31/2024 8:27 PM, Moebius wrote:

    In general, for all x e IR, x > 0: NUF(x) = aleph_0.

    Don't get confused by that nonsense. Everybody knows that unit
    fractions are different from each other. Therefore they cannot be
    counted at the same x, let alone at less than all positive x, i.e., at
    zero.

    I suppose you think you can prove there is a largest natural number as
    well?

    The proof with unit fractions is more convincing because 0 has been
    better accepted than ω. And it is really simple: At 0 there are no unit fractions. Then their set increases but all have different positions.

    Regards, WM

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Richard Damon@21:1/5 to All on Tue Sep 3 22:55:10 2024
    On 9/3/24 7:31 AM, WM wrote:
    On 02.09.2024 19:13, Richard Damon wrote:
    On 9/2/24 12:56 PM, WM wrote:
    On 01.09.2024 21:09, Chris M. Thomasson wrote:
    On 8/31/2024 8:27 PM, Moebius wrote:

    In general, for all x e IR, x > 0: NUF(x) = aleph_0.

    Don't get confused by that nonsense. Everybody knows that unit
    fractions are different from each other. Therefore they cannot be
    counted at the same x, let alone at less than all positive x, i.e.,
    at zero.

    How does that fit with WM who thinks there is a smallest unit
    fraction to start counting from?

    I do not think that but I prove that by the simple fact that not more
    than one unit fraction can be lessequal than all unit fractions.

    Except that it starts with the incorrect assumption that such a unit
    fraction exists.

    No, it shows that no unit fractions exist unless a first one exists.

    Regards, WM

    But 1/1 is the FIRST unit fraction.

    You just can't count from the other end (that doesn't HAVE an end)

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Richard Damon@21:1/5 to All on Tue Sep 3 23:04:38 2024
    On 9/3/24 7:27 AM, WM wrote:
    On 02.09.2024 20:47, Chris M. Thomasson wrote:
    On 9/2/2024 9:56 AM, WM wrote:
    On 01.09.2024 21:09, Chris M. Thomasson wrote:
    On 8/31/2024 8:27 PM, Moebius wrote:

    In general, for all x e IR, x > 0: NUF(x) = aleph_0.

    Don't get confused by that nonsense. Everybody knows that unit
    fractions are different from each other. Therefore they cannot be
    counted at the same x, let alone at less than all positive x, i.e.,
    at zero.

    I suppose you think you can prove there is a largest natural number as
    well?

    The proof with unit fractions is more convincing because 0 has been
    better accepted than ω. And it is really simple: At 0 there are no unit fractions. Then their set increases but all have different positions.

    Regards, WM


    But there isn't a "first" from that direction, just like there is no
    "last" Natural Number.

    That is just your problem, you don't understand the fact that "finite"
    means can get arbitrary small, and thus there doesn't need to be a
    "smallest", and in fact, there CAN'T be in the infinite set.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Richard Damon@21:1/5 to All on Tue Sep 3 22:47:49 2024
    On 9/3/24 7:29 AM, WM wrote:
    On 03.09.2024 13:26, Richard Damon wrote:
    On 9/3/24 7:19 AM, WM wrote:

    No, it shows that no unit fractions exist unless a first one exists.

    Sol you think that 1/1 doesn't exist?

    No, I know that 1/1 does not exist unless the smallest unit fraction
    exists.

    Regards, WM


    WHy?

    1/1 BY DEFINITION exists.

    No smalllest unit fraction, BY DEFINITION exists.

    Thus, your logic, BY DEFIHITION doesn't actualy exists.

    Sorry, you just proved your brain exploded with your inconsistancy.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)