Discussion:
An infinite set is always "maintained"
(too old to reply)
William
2022-09-01 16:24:38 UTC
Permalink
If you argue that all numbers leave the intersection but [a set of] infinitely many numbers do not leave the contributing endsegments, then you are outside of logic and reason.
Indeed. But there is no unchanging set of infinitely many numbers that does not "leave the endsegments" . There is only a decreasing sequence of sets
with no last element.
mitchr...@gmail.com
2022-09-01 19:20:12 UTC
Permalink
If you argue that all numbers leave the intersection but [a set of] infinitely many numbers do not leave the contributing endsegments, then you are outside of logic and reason.
Indeed. But there is no unchanging set of infinitely many numbers that does not "leave the endsegments" . There is only a decreasing sequence of sets
with no last element.
How do you contain infinite set elements?

Mitchell Raemsch
FromTheRafters
2022-09-01 19:28:17 UTC
Permalink
Post by ***@gmail.com
If you argue that all numbers leave the intersection but [a set of]
infinitely many numbers do not leave the contributing endsegments, then you
are outside of logic and reason.
Indeed. But there is no unchanging set of infinitely many numbers that does
not "leave the endsegments" . There is only a decreasing sequence of sets
with no last element.
How do you contain infinite set elements?
With curly brackets.
mitchr...@gmail.com
2022-09-01 19:51:02 UTC
Permalink
Post by FromTheRafters
Post by ***@gmail.com
If you argue that all numbers leave the intersection but [a set of]
infinitely many numbers do not leave the contributing endsegments, then you
are outside of logic and reason.
Indeed. But there is no unchanging set of infinitely many numbers that does
not "leave the endsegments" . There is only a decreasing sequence of sets
with no last element.
How do you contain infinite set elements?
With curly brackets.
That can't be done. Just as there are no countable infinities.
zelos...@gmail.com
2022-09-05 05:33:54 UTC
Permalink
Post by ***@gmail.com
Post by FromTheRafters
Post by ***@gmail.com
If you argue that all numbers leave the intersection but [a set of]
infinitely many numbers do not leave the contributing endsegments, then you
are outside of logic and reason.
Indeed. But there is no unchanging set of infinitely many numbers that does
not "leave the endsegments" . There is only a decreasing sequence of sets
with no last element.
How do you contain infinite set elements?
With curly brackets.
That can't be done. Just as there are no countable infinities.
of course there is, N is countably infinite, so is Q, Z and many others, R is uncountably infinite.
zelos...@gmail.com
2022-09-05 05:33:29 UTC
Permalink
Post by ***@gmail.com
If you argue that all numbers leave the intersection but [a set of] infinitely many numbers do not leave the contributing endsegments, then you are outside of logic and reason.
Indeed. But there is no unchanging set of infinitely many numbers that does not "leave the endsegments" . There is only a decreasing sequence of sets
with no last element.
How do you contain infinite set elements?
Mitchell Raemsch
A set either has infinite or finite cardinality. There is no "how", it just does. Because it is not physical
Sergio
2022-09-01 19:33:22 UTC
Permalink
Post by William
If you argue that all numbers leave the intersection but [a set of] infinitely many numbers do not leave the contributing endsegments, then you are outside of logic and reason.
Indeed. But there is no unchanging set of infinitely many numbers that does not "leave the endsegments" . There is only a decreasing sequence of sets
with no last element.
....there are no maintenance people to "maintain" your infinite set.

Please use the curly brackets instead => { }

and electrify them to keep all infinity of the Ants inside.
WM
2022-09-01 20:35:23 UTC
Permalink
If you argue that all numbers leave the intersection but [a set of] infinitely many numbers do not leave the contributing endsegments, then you are outside of logic and reason.
Indeed. But there is no unchanging set of infinitely many numbers that does not "leave the endsegments" .
There is an infinite set not leaving. Inclusion monotony proves that thre is an unchanging infinite subset to all the infinite sets.
There is only a decreasing sequence of sets
with no last element.
You cannot imagine a decreasing sequence of infinite sets?
Use the intervals a_n = [0, ω + 1/n].Their intersection ist infinite.

Regards, WM
William
2022-09-01 20:49:22 UTC
Permalink
On Thursday, September 1, 2022 at 5:35:28 PM UTC-3, WM wrote:
deed. But there is no unchanging set of infinitely many numbers that does not "leave the endsegments" .
Post by WM
There is an infinite set not leaving. Inclusion monotony proves that thre is an unchanging infinite subset to all the infinite sets.
Nope. Not unchanging
Post by WM
Post by William
There is only a decreasing sequence of sets
with no last element.
You cannot imagine a decreasing sequence of infinite sets?
Sure I can. I can even imagine a decreasing sequence of infinite sets of natural numbers.
Post by WM
Use the intervals a_n = [0, ω + 1/n].Their intersection ist infinite.
So what? The a_n are not sets of natural numbers
ω + 1/n is not a natural number. so [0, ω + 1/n] is not an interval of natural numbers.
b_n=[n,ω) is an interval of natural numbers. (ω is not an element of b_n for any n). The intersection is empty
For each n, b_n is infinite. The *elements* of b_n are finite.
WM
2022-09-02 12:38:56 UTC
Permalink
deed. But there is no unchanging set of infinitely many numbers that does not "leave the endsegments" .
Post by WM
There is an infinite set not leaving. Inclusion monotony proves that thre is an unchanging infinite subset to all the infinite sets.
Nope. Not unchanging
Decreasing., But the infinite core is same in all infinite sets.
Post by WM
Post by William
There is only a decreasing sequence of sets
with no last element.
You cannot imagine a decreasing sequence of infinite sets?
Sure I can. I can even imagine a decreasing sequence of infinite sets of natural numbers.
Post by WM
Use the intervals a_n = [0, ω + 1/n].Their intersection ist infinite.
So what? The a_n are not sets of natural numbers
ω + 1/n is not a natural number. so [0, ω + 1/n] is not an interval of natural numbers.
But this example shows that you general refusal is unfounded.
b_n=[n,ω) is an interval of natural numbers. (ω is not an element of b_n for any n). The intersection is empty
No, the intersection is infinite since all sets contribute an infinite subset.

Regards, WM
Sergio
2022-09-02 13:18:16 UTC
Permalink
Post by WM
deed. But there is no unchanging set of infinitely many numbers that does not "leave the endsegments" .
Post by WM
There is an infinite set not leaving. Inclusion monotony proves that thre is an unchanging infinite subset to all the infinite sets.
Nope. Not unchanging
Decreasing., But the infinite core is same in all infinite sets.
Still wrong, all endsegments are infinite, and the same size. there is no "core".

Core Ants.
Post by WM
Post by WM
Post by William
There is only a decreasing sequence of sets
with no last element.
You cannot imagine a decreasing sequence of infinite sets?
Sure I can. I can even imagine a decreasing sequence of infinite sets of natural numbers.
Post by WM
Use the intervals a_n = [0, ω + 1/n].Their intersection ist infinite.
So what? The a_n are not sets of natural numbers
ω + 1/n is not a natural number. so [0, ω + 1/n] is not an interval of natural numbers.
But this example shows that you general refusal is unfounded.
no, your example is just flat wrong, and bad, sloppy math, and is REJECTED by this newsgroup.
Post by WM
b_n=[n,ω) is an interval of natural numbers. (ω is not an element of b_n for any n). The intersection is empty
No, the intersection is bla bla...
Bla Bla Ants of the Intersection
Post by WM
Regards, WM
Ross A. Finlayson
2022-09-02 17:02:37 UTC
Permalink
Post by WM
deed. But there is no unchanging set of infinitely many numbers that does not "leave the endsegments" .
Post by WM
There is an infinite set not leaving. Inclusion monotony proves that thre is an unchanging infinite subset to all the infinite sets.
Nope. Not unchanging
Decreasing., But the infinite core is same in all infinite sets.
Still wrong, all endsegments are infinite, and the same size. there is no "core".
Core Ants.
Post by WM
Post by WM
Post by William
There is only a decreasing sequence of sets
with no last element.
You cannot imagine a decreasing sequence of infinite sets?
Sure I can. I can even imagine a decreasing sequence of infinite sets of natural numbers.
Post by WM
Use the intervals a_n = [0, ω + 1/n].Their intersection ist infinite.
So what? The a_n are not sets of natural numbers
ω + 1/n is not a natural number. so [0, ω + 1/n] is not an interval of natural numbers.
But this example shows that you general refusal is unfounded.
no, your example is just flat wrong, and bad, sloppy math, and is REJECTED by this newsgroup.
Post by WM
b_n=[n,ω) is an interval of natural numbers. (ω is not an element of b_n for any n). The intersection is empty
No, the intersection is bla bla...
Bla Bla Ants of the Intersection
Post by WM
Regards, WM
Oh, ..., I thought ants were mathematical.

Intersection of what?
William
2022-09-02 14:33:59 UTC
Permalink
Post by WM
b_n=[n,ω) is an interval of natural numbers. (ω is not an element of b_n for any n). The intersection is empty
No, the intersection is infinite since all sets contribute an infinite subset.
All sets contribute an infinite subset, but not the same infinite subset. There is no common subset.
WM
2022-09-02 20:12:19 UTC
Permalink
Post by WM
b_n=[n,ω) is an interval of natural numbers. (ω is not an element of b_n for any n). The intersection is empty
No, the intersection is infinite since all sets contribute an infinite subset.
All sets contribute an infinite subset, but not the same infinite subset. There is no common subset.
You are wrong. Show me the first b_n which has not infinitely many elements in common with all its predecessors. You can't.

But if you could, then, as soon as there is no longer an infinite common subset, the next state of affairs is a finite common subset by the very definition of endsegments, i.e., simple mathematics: ∀k ∈ ℕ: E(k+1) = E(k) \ {k} .

To deny it by the analogy that
∀k ∈ ℕ ∃m ∈ ℕ: k < m ==> ∃m ∈ ℕ ∀k ∈ ℕ: k < m
is an invalid conclusion, is an invalid conclusion and shows naivety.

Regards, WM
William
2022-09-02 20:59:18 UTC
Permalink
Post by WM
Post by WM
b_n=[n,ω) is an interval of natural numbers. (ω is not an element of b_n for any n). The intersection is empty
No, the intersection is infinite since all sets contribute an infinite subset.
All sets contribute an infinite subset, but not the same infinite subset. There is no common subset.
You are wrong. Show me the first b_n which has not infinitely many elements in common with all its predecessors. You can't.
So what?
Post by WM
But if you could, then, as soon as there is no longer an infinite common subset,
This never happens. So what? At every step there is a common subset, but it changes. There is no one set contained in all common subsets. There is no "infinite core".
--
William Hughes
WM
2022-09-03 20:12:22 UTC
Permalink
Post by William
Post by WM
Post by WM
b_n=[n,ω) is an interval of natural numbers. (ω is not an element of b_n for any n). The intersection is empty
No, the intersection is infinite since all sets contribute an infinite subset.
All sets contribute an infinite subset, but not the same infinite subset. There is no common subset.
You are wrong. Show me the first b_n which has not infinitely many elements in common with all its predecessors. You can't.
So what?
No take the consequences.
Post by William
Post by WM
But if you could, then, as soon as there is no longer an infinite common subset,
This never happens. So what? At every step there is a common subset, but it changes. There is no one set contained in all common subsets.
As soon as there is no longer an infinite common set, the next state of affairs is a finite set by the very definition of endsegments, i.e., simple mathematics: ∀k ∈ ℕ: E(k+1) = E(k) \ {k} .

To deny it by the analogy that
∀k ∈ ℕ ∃m ∈ ℕ: k < m ==> ∃m ∈ ℕ ∀k ∈ ℕ: k < m
is an invalid conclusion, is an invalid conclusion and shows naivety.
Post by William
There is no "infinite core".
Then the core must be reduced step by step. It is impossible to jump over more than one number lost.

Regards, WM
William
2022-09-03 20:29:01 UTC
Permalink
Post by WM
Post by William
Post by WM
But if you could, then, as soon as there is no longer an infinite common subset,
This never happens. So what? At every step there is a common subset, but it changes. There is no one set contained in all common subsets.
As soon as there is no longer an infinite common set,
This does not happen.
WM
2022-09-04 14:08:29 UTC
Permalink
Post by William
Post by WM
Post by William
Post by WM
But if you could, then, as soon as there is no longer an infinite common subset,
This never happens. So what? At every step there is a common subset, but it changes. There is no one set contained in all common subsets.
As soon as there is no longer an infinite common set,
This does not happen.
As long as there is an infinite common set, the intersection is this infinite common set.

Regards, WM
Sergio
2022-09-04 14:20:25 UTC
Permalink
Post by WM
Post by William
Post by WM
Post by William
Post by WM
But if you could, then, as soon as there is no longer an infinite common subset,
This never happens. So what? At every step there is a common subset, but it changes. There is no one set contained in all common subsets.
As soon as there is no longer an infinite common set,
This does not happen.
As long as there is an infinite common set, the intersection is this infinite common set.
there isn't, so there is not.
Post by WM
Regards, WM
Gus Gassmann
2022-09-04 14:36:27 UTC
Permalink
On Sunday, 4 September 2022 at 11:08:34 UTC-3, WM wrote:
[...]
Post by WM
As long as there is an infinite common set, the intersection is this infinite common set.
Another epiphany! Wow!

Unfortunately, if you have an infinite collection of end segments, then no end segment E(n+1) can contain any natural number contained in FISON(n). Since an infinite collection of end segments does not have an element with maximum index K, this means that the intersection is empty.
WM
2022-09-06 10:46:18 UTC
Permalink
Post by Gus Gassmann
[...]
Post by WM
As long as there is an infinite common set, the intersection is this infinite common set.
Unfortunately, if you have an infinite collection of end segments, then no end segment E(n+1) can contain any natural number contained in FISON(n).
An infinite endsegment has an infinite contents together with all infinite endsegments.
Post by Gus Gassmann
Since an infinite collection of end segments does not have an element with maximum index K, this means that the intersection is
dark.

Regards, WM
Sergio
2022-09-06 14:06:54 UTC
Permalink
Post by WM
Post by Gus Gassmann
[...]
Post by WM
As long as there is an infinite common set, the intersection is this infinite common set.
Unfortunately, if you have an infinite collection of end segments, then no end segment E(n+1) can contain any natural number contained in FISON(n).
An infinite endsegment has an infinite contents together with all infinite endsegments.
Wrong

corrected: An endsegment has an infinite number of elements.

Fact: The intersection of all endsegments is empty.
Post by WM
Post by Gus Gassmann
Since an infinite collection of end segments does not have an element with maximum index K, this means that the intersection is
.
Empty.
Post by WM
Regards, WM
Gus Gassmann
2022-09-06 15:42:11 UTC
Permalink
Post by WM
Post by Gus Gassmann
[...]
Post by WM
As long as there is an infinite common set, the intersection is this infinite common set.
Unfortunately, if you have an infinite collection of end segments, then no end segment E(n+1) can contain any natural number contained in FISON(n).
An infinite endsegment has an infinite contents together with all infinite endsegments.
This gobbledygook of yours is so grotesque, it is not even false.
Post by WM
Post by Gus Gassmann
Since an infinite collection of end segments does not have an element with maximum index K, this means that the intersection is
dark.
Well, you seem to be taking "dark" and "empty" as synonymous. Very well. Your skull cavity is both empty and dark.
William
2022-09-04 14:44:40 UTC
Permalink
Post by WM
Post by William
Post by WM
As soon as there is no longer an infinite common set,
This does not happen.
As long as there is an infinite common set, the intersection is this infinite common set.
Nope. The "infinite common set" changes. The intersection does not change
WM
2022-09-06 10:49:37 UTC
Permalink
Post by WM
Post by William
Post by WM
As soon as there is no longer an infinite common set,
This does not happen.
As long as there is an infinite common set, the intersection is this infinite common set.
Nope. The "infinite common set" changes. The intersection does not change
The intersection of infinite endsegments is infinite.

Regards, WM
zelos...@gmail.com
2022-09-06 12:38:06 UTC
Permalink
Post by WM
Post by WM
Post by William
Post by WM
As soon as there is no longer an infinite common set,
This does not happen.
As long as there is an infinite common set, the intersection is this infinite common set.
Nope. The "infinite common set" changes. The intersection does not change
The intersection of infinite endsegments is infinite.
Regards, WM
It isn't, you assert it but it isn't!
WM
2022-09-07 13:11:23 UTC
Permalink
Post by ***@gmail.com
Post by WM
The intersection of infinite endsegments is infinite.
It isn't, you assert it but it isn't!
Then all endsegments contain infinite sets, but no element of one endsegment E(k) is in the infinite sets of some other emdsegments. What are they consisting of?

Regards, WM
Sergio
2022-09-07 13:29:20 UTC
Permalink
Post by WM
Post by ***@gmail.com
Post by WM
The intersection of infinite endsegments is infinite.
It isn't, you assert it but it isn't!
Then all endsegments contain infinite sets,
Wrong.
1 All endsegments are infinite by definition.
2 All endsegments contain elements, not sets.
Post by WM
but no element of one endsegment E(k) is in the infinite sets of some other emdsegments.
Wrong. 3 is in E(1), E(2), E(3)
Post by WM
What are they consisting of?
You tell me, its your imagination posting this garbage.
Post by WM
Regards, WM
Gus Gassmann
2022-09-07 13:31:18 UTC
Permalink
Post by ***@gmail.com
Post by WM
The intersection of infinite endsegments is infinite.
It isn't, you assert it but it isn't!
Then all endsegments contain infinite sets, but no element of one endsegment E(k) is in the infinite sets of some other emdsegments. What are they consisting of?
Boring!!!! Every end segment E(n) is the set of natural numbers {n + k: k = 0 OR k in |N}. And yes, it is clear that for every n in |N, card(E(n)) = card(|N). Your continued babbling to the contrary is just that --- babbling, without any substance, proof, or even motivation.
Fritz Feldhase
2022-09-07 14:03:24 UTC
Permalink
[...] but no element of one endsegment E(k) is in the infinite sets of some other endsegments. What are they consisting of?
What does he even want claim here? Looks like some sort of a quantifier shift to me.
Boring!!!! Every end segment E(n) is the set of natural numbers {n + k: k = 0 OR k in |N}. And yes, it is clear that for every n in |N, card(E(n)) = card(|N). Your continued babbling to the contrary is just that --- babbling, without any substance, proof, or even motivation.
Ross A. Finlayson
2022-09-07 15:28:34 UTC
Permalink
Post by Fritz Feldhase
[...] but no element of one endsegment E(k) is in the infinite sets of some other endsegments. What are they consisting of?
What does he even want claim here? Looks like some sort of a quantifier shift to me.
Boring!!!! Every end segment E(n) is the set of natural numbers {n + k: k = 0 OR k in |N}. And yes, it is clear that for every n in |N, card(E(n)) = card(|N). Your continued babbling to the contrary is just that --- babbling, without any substance, proof, or even motivation.
Come on now, Fritz, "Come on, WM, even Ross tries to save you".


The quantifier shift at all, indeed.

Universal quantifier? Make four:
for-each, for-any, for-every, for-all.
There are orders implied by the quantifiers,
and orders implied in the quantifiers.

Existential quantifier? Unique existential quantifier.
FromTheRafters
2022-09-07 20:48:31 UTC
Permalink
Post by WM
Post by ***@gmail.com
Post by WM
The intersection of infinite endsegments is infinite.
It isn't, you assert it but it isn't!
Then all endsegments contain infinite sets
Yes, if they are defined as FISON complement sets. With FISON {1,2,3,4}
we automatically have endsegment {5,6,7,8,...} which contains, for
example, {5,7,9,11,...} and {6,8,10,12,...} as subsets which are both
infinite sets.

What good does this do you in your quest?

Sergio
2022-09-06 14:07:56 UTC
Permalink
Post by WM
Post by WM
Post by William
Post by WM
As soon as there is no longer an infinite common set,
This does not happen.
As long as there is an infinite common set, the intersection is this infinite common set.
Nope. The "infinite common set" changes. The intersection does not change
The intersection of infinite endsegments is infinite.
Corrected: The intersection of all endsegments is empty.
Post by WM
Regards, WM
Troll.
William
2022-09-07 17:20:31 UTC
Permalink
Post by WM
Post by WM
Post by William
Post by WM
As soon as there is no longer an infinite common set,
This does not happen.
As long as there is an infinite common set, the intersection is this infinite common set.
Nope. The "infinite common set" changes. The intersection does not change
The intersection of infinite endsegments is infinite.
Nope. The intersection of a set of endsegments with smallest endsegment is infinite. The intersection of a set of endsegments with no smallest endsedgment is empty.
WM
2022-09-07 20:22:21 UTC
Permalink
Post by William
Post by WM
Post by WM
As long as there is an infinite common set, the intersection is this infinite common set.
Nope. The "infinite common set" changes.
But it remains infinite.
Post by William
The intersection does not change
Only if there is a last endsegment.
Post by William
Post by WM
The intersection of infinite endsegments is infinite.
Nope.
Yes. Here is the proof:
∀k ∈ ℕ: ∩{E(1), E(2), ..., E(k)} = E(k) /\ |E(k)| = ℵ₀
Find an endsegment that is not addressed here and indexed by an elements of the infinite set ℕ.
Post by William
The intersection of a set of endsegments with smallest endsegment is infinite.
Yes.
Post by William
The intersection of a set of endsegments with no smallest endsedgment is empty.
No, it is not existing.

Only the intersection of a set of endsegments with empty endsegment is empty. Inclusion monotony.

Regards, WM
mitchr...@gmail.com
2022-09-07 20:36:31 UTC
Permalink
Post by WM
Post by William
Post by WM
Post by WM
As long as there is an infinite common set, the intersection is this infinite common set.
Nope. The "infinite common set" changes.
But it remains infinite.
Post by William
The intersection does not change
Only if there is a last endsegment.
Post by William
Post by WM
The intersection of infinite endsegments is infinite.
Nope.
∀k ∈ ℕ: ∩{E(1), E(2), ..., E(k)} = E(k) /\ |E(k)| = ℵ₀
Find an endsegment that is not addressed here and indexed by an elements of the infinite set ℕ.
Post by William
The intersection of a set of endsegments with smallest endsegment is infinite.
Yes.
Post by William
The intersection of a set of endsegments with no smallest endsedgment is empty.
No, it is not existing.
Only the intersection of a set of endsegments with empty endsegment is empty. Inclusion monotony.
Regards, WM
How are you going to put together an infinite set of infinite elements?
You can't assemble infinity complete outside of the Continuum Hypothesis.


Mitchell Raemsch
FromTheRafters
2022-09-03 22:39:01 UTC
Permalink
Post by WM
Post by William
Post by WM
Post by William
Post by WM
b_n=[n,ω) is an interval of natural numbers. (ω is not an element of b_n
for any n). The intersection is empty
No, the intersection is infinite since all sets contribute an infinite subset.
All sets contribute an infinite subset, but not the same infinite subset.
There is no common subset.
You are wrong. Show me the first b_n which has not infinitely many elements
in common with all its predecessors. You can't.
So what?
No take the consequences.
Post by William
Post by WM
But if you could, then, as soon as there is no longer an infinite common subset,
This never happens. So what? At every step there is a common subset, but it
changes. There is no one set contained in all common subsets.
As soon as there is no longer an infinite common set, the next state of
affairs is a finite set by the very definition of endsegments, i.e., simple
mathematics: ∀k ∈ ℕ: E(k+1) = E(k) \ {k} .
If E(some natural number) is your endsegment, and it appears on both
sides of an equation, how does this equation 'define' what an
endsegment is?
Tom Bola
2022-09-03 23:01:25 UTC
Permalink
Post by FromTheRafters
Post by WM
Post by William
Post by WM
Post by William
Post by WM
b_n=[n,ω) is an interval of natural numbers. (ω is not an element of b_n
for any n). The intersection is empty
No, the intersection is infinite since all sets contribute an infinite subset.
All sets contribute an infinite subset, but not the same infinite subset.
There is no common subset.
You are wrong. Show me the first b_n which has not infinitely many elements
in common with all its predecessors. You can't.
So what?
No take the consequences.
Post by William
Post by WM
But if you could, then, as soon as there is no longer an infinite common subset,
This never happens. So what? At every step there is a common subset, but it
changes. There is no one set contained in all common subsets.
As soon as there is no longer an infinite common set, the next state of
affairs is a finite set by the very definition of endsegments, i.e., simple
mathematics: ∀k ∈ ℕ: E(k+1) = E(k) \ {k} .
If E(some natural number) is your endsegment, and it appears on both
sides of an equation, how does this equation 'define' what an
endsegment is?
WM can't hear you - too complicated given his IQ and he is also dreaming...
Fritz Feldhase
2022-09-04 02:14:57 UTC
Permalink
Post by WM
by the very definition of endsegments, i.e., simple
mathematics: ∀k ∈ ℕ: E(k+1) = E(k) \ {k} .
[...] how does this equation 'define' what an
endsegment is?
It's part of a recursive definition, you silly dimwit!

Of course, in addition we need E(1) = IN.
FromTheRafters
2022-09-04 11:46:07 UTC
Permalink
Post by Fritz Feldhase
Post by WM
by the very definition of endsegments, i.e., simple
mathematics: ∀k ∈ ℕ: E(k+1) = E(k) \ {k} .
[...] how does this equation 'define' what an
endsegment is?
It's part of a recursive definition, you silly dimwit!
Of course, in addition we need E(1) = IN.
Thanks for part of a good answer.
Fritz Feldhase
2022-09-04 12:38:56 UTC
Permalink
Post by FromTheRafters
Post by Fritz Feldhase
Post by WM
by the very definition of endsegments, i.e., simple
mathematics: ∀k ∈ ℕ: E(k+1) = E(k) \ {k} .
[...] how does this equation 'define' what an
endsegment is?
It's part of a recursive definition, you silly dimwit!
Of course, in addition we need E(1) = IN.
Thanks for part of a good answer.
You are welcome!

Funny thing: These "defining equations" allow for a simple proof (by induction) that for all n e IN: E(n) Is infinite (contrary to WM's claims).

Proof (by induction): E(1) = IN, hence E(1) is infinite. If E(n0) is infinite (for some n0 e IN), then certainly E(n0+1) = E(n0) \ {n0} is infinite (too). Hence (by induction) for all n e IN: E(n) is infinite. qed

It's a pitty that WM is not able to USE his
Post by FromTheRafters
Post by Fritz Feldhase
Post by WM
simple mathematics: ∀k ∈ ℕ: E(k+1) = E(k) \ {k}
for any real math.
Sergio
2022-09-04 13:09:17 UTC
Permalink
Post by Fritz Feldhase
Post by FromTheRafters
Post by Fritz Feldhase
Post by WM
by the very definition of endsegments, i.e., simple
mathematics: ∀k ∈ ℕ: E(k+1) = E(k) \ {k} .
[...] how does this equation 'define' what an
endsegment is?
It's part of a recursive definition, you silly dimwit!
Of course, in addition we need E(1) = IN.
Thanks for part of a good answer.
You are welcome!
Funny thing: These "defining equations" allow for a simple proof (by induction) that for all n e IN: E(n) Is infinite (contrary to WM's claims).
Proof (by induction): E(1) = IN, hence E(1) is infinite. If E(n0) is infinite (for some n0 e IN), then certainly E(n0+1) = E(n0) \ {n0} is infinite (too). Hence (by induction) for all n e IN: E(n) is infinite. qed
It's a pitty that WM is not able to USE his
Post by FromTheRafters
Post by Fritz Feldhase
Post by WM
simple mathematics: ∀k ∈ ℕ: E(k+1) = E(k) \ {k}
for any real math.
No worries, as equation is a set of characters, you can plow it back in, like fertilizer, thusly;

( E ∀ { k ∈ \ ℕ E = k 1 ) k ) k : } + (

or

} k { \ ) k ( E = ) 1 + k ( E : ℕ ∈ k ∀
FromTheRafters
2022-09-04 13:25:27 UTC
Permalink
Post by Fritz Feldhase
Post by FromTheRafters
Post by Fritz Feldhase
Post by WM
by the very definition of endsegments, i.e., simple
mathematics: ∀k ∈ ℕ: E(k+1) = E(k) \ {k} .
[...] how does this equation 'define' what an
endsegment is?
It's part of a recursive definition, you silly dimwit!
Of course, in addition we need E(1) = IN.
Thanks for part of a good answer.
You are welcome!
Funny thing: These "defining equations" allow for a simple proof (by
induction) that for all n e IN: E(n) Is infinite (contrary to WM's claims).
Proof (by induction): E(1) = IN, hence E(1) is infinite. If E(n0) is infinite
(for some n0 e IN), then certainly E(n0+1) = E(n0) \ {n0} is infinite (too).
Hence (by induction) for all n e IN: E(n) is infinite. qed
It's a pitty that WM is not able to USE his
Post by FromTheRafters
Post by Fritz Feldhase
Post by WM
simple mathematics: ∀k ∈ ℕ: E(k+1) = E(k) \ {k}
for any real math.
It shows the relation between one 'endsegment' and the next. He already
defined his endsegment as natural numbers greater than k when he
defined his FISONs (which are always finite, so no need for the "F") as
natural numbers less than or equal to k.

E(1) does not equal the naturals in muckymath. Initial segments are all
non-zero natural numbers less than or equal to k, and k+1 and beyond
are the successive endsegment indices.

Unless he switches to the naturals the rest of us use, in which case he
should 'define' the terms he is using.
Fritz Feldhase
2022-09-04 13:57:06 UTC
Permalink
Post by FromTheRafters
Post by Fritz Feldhase
Post by FromTheRafters
Post by Fritz Feldhase
Post by WM
by the very definition of endsegments, i.e., simple
mathematics: ∀k ∈ ℕ: E(k+1) = E(k) \ {k} .
[...] how does this equation 'define' what an
endsegment is?
It's part of a recursive definition, you silly dimwit!
Of course, in addition we need E(1) = IN.
Thanks for part of a good answer.
You are welcome!
Funny thing: These "defining equations" allow for a simple proof (by
induction) that for all n e IN: E(n) Is infinite (contrary to WM's claims).
Proof (by induction): E(1) = IN, hence E(1) is infinite. If E(n0) is infinite
(for some n0 e IN), then certainly E(n0+1) = E(n0) \ {n0} is infinite (too).
Hence (by induction) for all n e IN: E(n) is infinite. qed
It's a pitty that WM is not able to USE his
Post by FromTheRafters
Post by Fritz Feldhase
Post by WM
simple mathematics: ∀k ∈ ℕ: E(k+1) = E(k) \ {k}
for any real math.
It shows the relation between one 'endsegment' and the next.
Indeed!
Post by FromTheRafters
He already defined his endsegment as <bla>
Nope.

Actually, E(k) = {n e IN : n >= k} for all k e IN
in the context of mückenmath.

Yes, I KNOW that this means that E(k) =/= IN \ F(k),
with F(k) = {n e IN : n <= k} for all k e IN.
Post by FromTheRafters
E(1) does not equal the naturals in muckymath.
It does, dumbo.

My advice: Shut up and fuck off!

Alternatively you might try to learn from your betters.
Sergio
2022-09-04 14:19:08 UTC
Permalink
Post by Fritz Feldhase
Post by FromTheRafters
Post by Fritz Feldhase
Post by FromTheRafters
Post by Fritz Feldhase
Post by WM
by the very definition of endsegments, i.e., simple
mathematics: ∀k ∈ ℕ: E(k+1) = E(k) \ {k} .
[...] how does this equation 'define' what an
endsegment is?
It's part of a recursive definition, you silly dimwit!
Of course, in addition we need E(1) = IN.
Thanks for part of a good answer.
You are welcome!
Funny thing: These "defining equations" allow for a simple proof (by
induction) that for all n e IN: E(n) Is infinite (contrary to WM's claims).
Proof (by induction): E(1) = IN, hence E(1) is infinite. If E(n0) is infinite
(for some n0 e IN), then certainly E(n0+1) = E(n0) \ {n0} is infinite (too).
Hence (by induction) for all n e IN: E(n) is infinite. qed
It's a pitty that WM is not able to USE his
Post by FromTheRafters
Post by Fritz Feldhase
Post by WM
simple mathematics: ∀k ∈ ℕ: E(k+1) = E(k) \ {k}
for any real math.
It shows the relation between one 'endsegment' and the next.
Indeed!
Post by FromTheRafters
He already defined his endsegment as <bla>
Nope.
Actually, E(k) = {n e IN : n >= k} for all k e IN
in the context of mückenmath.
dangerous statement => "in the context of mückenmath" it causes finite bathtubs to potentially leak to infinity
Post by Fritz Feldhase
Yes, I KNOW that this means that E(k) =/= IN \ F(k),
with F(k) = {n e IN : n <= k} for all k e IN.
Post by FromTheRafters
E(1) does not equal the naturals in muckymath.
dangerous statement => "in muckymath" it causes Achilles to get Framed and lose big time to fat slow but rich turtle
Post by Fritz Feldhase
It does, dumbo.
My advice: Shut up and fuck off!
Alternatively you might try to learn from your betters.
I'm here, what is your question I can learn you?
FromTheRafters
2022-09-04 16:02:07 UTC
Permalink
Post by Fritz Feldhase
Post by FromTheRafters
Post by Fritz Feldhase
Post by FromTheRafters
Post by Fritz Feldhase
Post by WM
by the very definition of endsegments, i.e., simple
mathematics: ∀k ∈ ℕ: E(k+1) = E(k) \ {k} .
[...] how does this equation 'define' what an
endsegment is?
It's part of a recursive definition, you silly dimwit!
Of course, in addition we need E(1) = IN.
Thanks for part of a good answer.
You are welcome!
Funny thing: These "defining equations" allow for a simple proof (by
induction) that for all n e IN: E(n) Is infinite (contrary to WM's claims).
Proof (by induction): E(1) = IN, hence E(1) is infinite. If E(n0) is
infinite (for some n0 e IN), then certainly E(n0+1) = E(n0) \ {n0} is
infinite (too). Hence (by induction) for all n e IN: E(n) is infinite. qed
It's a pitty that WM is not able to USE his
Post by FromTheRafters
Post by Fritz Feldhase
Post by WM
simple mathematics: ∀k ∈ ℕ: E(k+1) = E(k) \ {k}
for any real math.
It shows the relation between one 'endsegment' and the next.
Indeed!
Post by FromTheRafters
He already defined his endsegment as <bla>
Nope.
Actually, E(k) = {n e IN : n >= k} for all k e IN
in the context of mückenmath.
Yes, I KNOW that this means that E(k) =/= IN \ F(k),
with F(k) = {n e IN : n <= k} for all k e IN.
Post by FromTheRafters
E(1) does not equal the naturals in muckymath.
It does, dumbo.
My advice: Shut up and fuck off!
Alternatively you might try to learn from your betters.
There is no 'FISON' ending in zero, so no 'endsegment' starting at one.
Fritz Feldhase
2022-09-04 16:19:06 UTC
Permalink
Post by FromTheRafters
Post by Fritz Feldhase
Post by FromTheRafters
Post by Fritz Feldhase
Post by FromTheRafters
Post by Fritz Feldhase
Post by WM
by the very definition of endsegments, i.e., simple
mathematics: ∀k ∈ ℕ: E(k+1) = E(k) \ {k} .
[...] how does this equation 'define' what an
endsegment is?
It's part of a recursive definition, you silly dimwit!
Of course, in addition we need E(1) = IN.
Thanks for part of a good answer.
You are welcome!
Funny thing: These "defining equations" allow for a simple proof (by
induction) that for all n e IN: E(n) Is infinite (contrary to WM's claims).
Proof (by induction): E(1) = IN, hence E(1) is infinite. If E(n0) is
infinite (for some n0 e IN), then certainly E(n0+1) = E(n0) \ {n0} is
infinite (too). Hence (by induction) for all n e IN: E(n) is infinite. qed
It's a pitty that WM is not able to USE his
Post by FromTheRafters
Post by Fritz Feldhase
Post by WM
simple mathematics: ∀k ∈ ℕ: E(k+1) = E(k) \ {k}
for any real math.
It shows the relation between one 'endsegment' and the next.
Indeed!
Post by FromTheRafters
He already defined his endsegment as <bla>
Nope.
Actually, E(k) = {n e IN : n >= k} for all k e IN
in the context of mückenmath.
Yes, I KNOW that this means that E(k) =/= IN \ F(k),
with F(k) = {n e IN : n <= k} for all k e IN.
Post by FromTheRafters
E(1) does not equal the naturals in muckymath.
It does, dumbo.
My advice: Shut up and fuck off!
Alternatively you might try to learn from your betters.
There is no 'FISON' ending in zero, so no 'endsegment' starting at one.
WHAT'S THE MATTER WITH YOU FUCKING ASSHOLE FULL OF SHIT?!

Hint:

FISONs: F(1) = {1}, F(2) = {1, 2}, F(3) = {1, 2, 3}, ...
endsegments: E(1) = {1, 2, 3, ...}, E(2) = {2, 3, 4, ...}, E(3) = {3, 4, 5, ...}

AND NOW FUCK OF, YOU SILLY ASSHOLE!
Sergio
2022-09-04 16:52:21 UTC
Permalink
Post by Fritz Feldhase
Post by FromTheRafters
Post by Fritz Feldhase
Post by FromTheRafters
Post by Fritz Feldhase
Post by FromTheRafters
Post by Fritz Feldhase
Post by WM
by the very definition of endsegments, i.e., simple
mathematics: ∀k ∈ ℕ: E(k+1) = E(k) \ {k} .
[...] how does this equation 'define' what an
endsegment is?
It's part of a recursive definition, you silly dimwit!
Of course, in addition we need E(1) = IN.
Thanks for part of a good answer.
You are welcome!
Funny thing: These "defining equations" allow for a simple proof (by
induction) that for all n e IN: E(n) Is infinite (contrary to WM's claims).
Proof (by induction): E(1) = IN, hence E(1) is infinite. If E(n0) is
infinite (for some n0 e IN), then certainly E(n0+1) = E(n0) \ {n0} is
infinite (too). Hence (by induction) for all n e IN: E(n) is infinite. qed
It's a pitty that WM is not able to USE his
Post by FromTheRafters
Post by Fritz Feldhase
Post by WM
simple mathematics: ∀k ∈ ℕ: E(k+1) = E(k) \ {k}
for any real math.
It shows the relation between one 'endsegment' and the next.
Indeed!
Post by FromTheRafters
He already defined his endsegment as <bla>
Nope.
Actually, E(k) = {n e IN : n >= k} for all k e IN
in the context of mückenmath.
Yes, I KNOW that this means that E(k) =/= IN \ F(k),
with F(k) = {n e IN : n <= k} for all k e IN.
Post by FromTheRafters
E(1) does not equal the naturals in muckymath.
It does, dumbo.
My advice: Shut up and fuck off!
Alternatively you might try to learn from your betters.
There is no 'FISON' ending in zero, so no 'endsegment' starting at one.
WHAT'S THE MATTER WITH YOU FUCKING ASSHOLE FULL OF SHIT?!
FISONs: F(1) = {1}, F(2) = {1, 2}, F(3) = {1, 2, 3}, ...
endsegments: E(1) = {1, 2, 3, ...}, E(2) = {2, 3, 4, ...}, E(3) = {3, 4, 5, ...}
AND NOW FUCK OF, YOU SILLY ASSHOLE!
so F(0) and E(0) are up for grabs ?



I hereby, declare and now royally assign forever: F(0) = {} AND E(0) as the set of counting numbers + 0 = {0, 1, 2, 3, ...}

EVERYBODY GOT THAT ?

For completeness, What about F(-k) and E(-k) ?? they apply in the case where you move sheeps from one field to another field, lose count and have to
start over.
Fritz Feldhase
2022-09-04 17:34:16 UTC
Permalink
Post by Sergio
On Sunday, September 4, 2022 at 6:02:19 PM UTC+2, FromTheRafters wrote nonsense.
WHAT'S THE MATTER WITH YOU FUCKING ASSHOLE FULL OF SHIT?!
FISONs: F(1) = {1}, F(2) = {1, 2}, F(3) = {1, 2, 3}, ...
endsegments: E(1) = {1, 2, 3, ...}, E(2) = {2, 3, 4, ...}, E(3) = {3, 4, 5, ...}
AND NOW FUCK OF, YOU SILLY ASSHOLE!
so F(0) and E(0) are up for grabs ?
Note that 0 !e IN in this context (i. e. for WM).

Now we have:

F: IN --> P(IN) with F(n) = {m e IN : m <= n} for all n e IN.
E: IN --> P(IN) with E(n) = {m e IN : m >= n} for all n e IN.

Hence "F(0)" and "E(0)" are not defined.
FromTheRafters
2022-09-04 18:55:46 UTC
Permalink
Post by Sergio
Post by Fritz Feldhase
Post by FromTheRafters
Post by Fritz Feldhase
Post by FromTheRafters
Post by Fritz Feldhase
Post by FromTheRafters
Post by Fritz Feldhase
Post by WM
by the very definition of endsegments, i.e., simple
mathematics: ∀k ∈ ℕ: E(k+1) = E(k) \ {k} .
[...] how does this equation 'define' what an
endsegment is?
It's part of a recursive definition, you silly dimwit!
Of course, in addition we need E(1) = IN.
Thanks for part of a good answer.
You are welcome!
Funny thing: These "defining equations" allow for a simple proof (by
induction) that for all n e IN: E(n) Is infinite (contrary to WM's claims).
Proof (by induction): E(1) = IN, hence E(1) is infinite. If E(n0) is
infinite (for some n0 e IN), then certainly E(n0+1) = E(n0) \ {n0} is
infinite (too). Hence (by induction) for all n e IN: E(n) is infinite. qed
It's a pitty that WM is not able to USE his
Post by FromTheRafters
Post by Fritz Feldhase
Post by WM
simple mathematics: ∀k ∈ ℕ: E(k+1) = E(k) \ {k}
for any real math.
It shows the relation between one 'endsegment' and the next.
Indeed!
Post by FromTheRafters
He already defined his endsegment as <bla>
Nope.
Actually, E(k) = {n e IN : n >= k} for all k e IN
in the context of mückenmath.
Yes, I KNOW that this means that E(k) =/= IN \ F(k),
with F(k) = {n e IN : n <= k} for all k e IN.
Post by FromTheRafters
E(1) does not equal the naturals in muckymath.
It does, dumbo.
My advice: Shut up and fuck off!
Alternatively you might try to learn from your betters.
There is no 'FISON' ending in zero, so no 'endsegment' starting at one.
WHAT'S THE MATTER WITH YOU FUCKING ASSHOLE FULL OF SHIT?!
FISONs: F(1) = {1}, F(2) = {1, 2}, F(3) = {1, 2, 3}, ...
endsegments: E(1) = {1, 2, 3, ...}, E(2) = {2, 3, 4, ...}, E(3) = {3, 4, 5, ...}
AND NOW FUCK OF, YOU SILLY ASSHOLE!
so F(0) and E(0) are up for grabs ?
F(0) is all natural numbers less than or equal to zero. For muckymath,
where zero is not a natural number (when he doesn't want it to be) it
doesn't exist. The associated endsegment starts at undefined plus one.
Post by Sergio
I hereby, declare and now royally assign forever: F(0) = {} AND E(0) as the
set of counting numbers + 0 = {0, 1, 2, 3, ...}
Here the index of the endsegment should match the cardinality of the
FISON which is n+1 so F(0) should be associated with E(1) shouldn't it?
Post by Sergio
EVERYBODY GOT THAT ?
In that case, a FISON is all natural numbers strictly less than n which
makes n the index for the endsegment, and n minus one the 'greatest'
element in the FISON.
Post by Sergio
For completeness, What about F(-k) and E(-k) ?? they apply in the case where
you move sheeps from one field to another field, lose count and have to start
over.
Mitch would be so ashamed of you for even suggesting such a thing.
Ross A. Finlayson
2022-09-04 19:27:29 UTC
Permalink
Post by FromTheRafters
Post by Sergio
Post by Fritz Feldhase
Post by FromTheRafters
Post by Fritz Feldhase
Post by FromTheRafters
Post by Fritz Feldhase
Post by FromTheRafters
Post by Fritz Feldhase
Post by WM
by the very definition of endsegments, i.e., simple
mathematics: ∀k ∈ ℕ: E(k+1) = E(k) \ {k} .
[...] how does this equation 'define' what an
endsegment is?
It's part of a recursive definition, you silly dimwit!
Of course, in addition we need E(1) = IN.
Thanks for part of a good answer.
You are welcome!
Funny thing: These "defining equations" allow for a simple proof (by
induction) that for all n e IN: E(n) Is infinite (contrary to WM's claims).
Proof (by induction): E(1) = IN, hence E(1) is infinite. If E(n0) is
infinite (for some n0 e IN), then certainly E(n0+1) = E(n0) \ {n0} is
infinite (too). Hence (by induction) for all n e IN: E(n) is infinite. qed
It's a pitty that WM is not able to USE his
Post by FromTheRafters
Post by Fritz Feldhase
Post by WM
simple mathematics: ∀k ∈ ℕ: E(k+1) = E(k) \ {k}
for any real math.
It shows the relation between one 'endsegment' and the next.
Indeed!
Post by FromTheRafters
He already defined his endsegment as <bla>
Nope.
Actually, E(k) = {n e IN : n >= k} for all k e IN
in the context of mückenmath.
Yes, I KNOW that this means that E(k) =/= IN \ F(k),
with F(k) = {n e IN : n <= k} for all k e IN.
Post by FromTheRafters
E(1) does not equal the naturals in muckymath.
It does, dumbo.
My advice: Shut up and fuck off!
Alternatively you might try to learn from your betters.
There is no 'FISON' ending in zero, so no 'endsegment' starting at one.
WHAT'S THE MATTER WITH YOU FUCKING ASSHOLE FULL OF SHIT?!
FISONs: F(1) = {1}, F(2) = {1, 2}, F(3) = {1, 2, 3}, ...
endsegments: E(1) = {1, 2, 3, ...}, E(2) = {2, 3, 4, ...}, E(3) = {3, 4, 5, ...}
AND NOW FUCK OF, YOU SILLY ASSHOLE!
so F(0) and E(0) are up for grabs ?
F(0) is all natural numbers less than or equal to zero. For muckymath,
where zero is not a natural number (when he doesn't want it to be) it
doesn't exist. The associated endsegment starts at undefined plus one.
Post by Sergio
I hereby, declare and now royally assign forever: F(0) = {} AND E(0) as the
set of counting numbers + 0 = {0, 1, 2, 3, ...}
Here the index of the endsegment should match the cardinality of the
FISON which is n+1 so F(0) should be associated with E(1) shouldn't it?
Post by Sergio
EVERYBODY GOT THAT ?
In that case, a FISON is all natural numbers strictly less than n which
makes n the index for the endsegment, and n minus one the 'greatest'
element in the FISON.
Post by Sergio
For completeness, What about F(-k) and E(-k) ?? they apply in the case where
you move sheeps from one field to another field, lose count and have to start
over.
Mitch would be so ashamed of you for even suggesting such a thing.
"Vector methods: 1) addition of vectors, ..."
Ross A. Finlayson
2022-09-04 19:31:13 UTC
Permalink
Post by Sergio
Post by Fritz Feldhase
Post by FromTheRafters
Post by Fritz Feldhase
Post by FromTheRafters
Post by Fritz Feldhase
Post by FromTheRafters
Post by Fritz Feldhase
Post by WM
by the very definition of endsegments, i.e., simple
mathematics: ∀k ∈ ℕ: E(k+1) = E(k) \ {k} .
[...] how does this equation 'define' what an
endsegment is?
It's part of a recursive definition, you silly dimwit!
Of course, in addition we need E(1) = IN.
Thanks for part of a good answer.
You are welcome!
Funny thing: These "defining equations" allow for a simple proof (by
induction) that for all n e IN: E(n) Is infinite (contrary to WM's claims).
Proof (by induction): E(1) = IN, hence E(1) is infinite. If E(n0) is
infinite (for some n0 e IN), then certainly E(n0+1) = E(n0) \ {n0} is
infinite (too). Hence (by induction) for all n e IN: E(n) is infinite. qed
It's a pitty that WM is not able to USE his
Post by FromTheRafters
Post by Fritz Feldhase
Post by WM
simple mathematics: ∀k ∈ ℕ: E(k+1) = E(k) \ {k}
for any real math.
It shows the relation between one 'endsegment' and the next.
Indeed!
Post by FromTheRafters
He already defined his endsegment as <bla>
Nope.
Actually, E(k) = {n e IN : n >= k} for all k e IN
in the context of mückenmath.
Yes, I KNOW that this means that E(k) =/= IN \ F(k),
with F(k) = {n e IN : n <= k} for all k e IN.
Post by FromTheRafters
E(1) does not equal the naturals in muckymath.
It does, dumbo.
My advice: Shut up and fuck off!
Alternatively you might try to learn from your betters.
There is no 'FISON' ending in zero, so no 'endsegment' starting at one.
WHAT'S THE MATTER WITH YOU FUCKING ASSHOLE FULL OF SHIT?!
FISONs: F(1) = {1}, F(2) = {1, 2}, F(3) = {1, 2, 3}, ...
endsegments: E(1) = {1, 2, 3, ...}, E(2) = {2, 3, 4, ...}, E(3) = {3, 4, 5, ...}
AND NOW FUCK OF, YOU SILLY ASSHOLE!
so F(0) and E(0) are up for grabs ?
I hereby, declare and now royally assign forever: F(0) = {} AND E(0) as the set of counting numbers + 0 = {0, 1, 2, 3, ...}
EVERYBODY GOT THAT ?
For completeness, What about F(-k) and E(-k) ?? they apply in the case where you move sheeps from one field to another field, lose count and have to
start over.
Oh, this is where instead "it's all the way to the end and back".

"The counting forward is same as counting backward: except one is
learning the count and the other is knowing the count".
FromTheRafters
2022-09-04 18:37:18 UTC
Permalink
Post by Fritz Feldhase
Post by FromTheRafters
Post by Fritz Feldhase
Post by FromTheRafters
Post by Fritz Feldhase
Post by FromTheRafters
Post by Fritz Feldhase
Post by WM
by the very definition of endsegments, i.e., simple
mathematics: ∀k ∈ ℕ: E(k+1) = E(k) \ {k} .
[...] how does this equation 'define' what an
endsegment is?
It's part of a recursive definition, you silly dimwit!
Of course, in addition we need E(1) = IN.
Thanks for part of a good answer.
You are welcome!
Funny thing: These "defining equations" allow for a simple proof (by
induction) that for all n e IN: E(n) Is infinite (contrary to WM's claims).
Proof (by induction): E(1) = IN, hence E(1) is infinite. If E(n0) is
infinite (for some n0 e IN), then certainly E(n0+1) = E(n0) \ {n0} is
infinite (too). Hence (by induction) for all n e IN: E(n) is infinite. qed
It's a pitty that WM is not able to USE his
Post by FromTheRafters
Post by Fritz Feldhase
Post by WM
simple mathematics: ∀k ∈ ℕ: E(k+1) = E(k) \ {k}
for any real math.
It shows the relation between one 'endsegment' and the next.
Indeed!
Post by FromTheRafters
He already defined his endsegment as <bla>
Nope.
Actually, E(k) = {n e IN : n >= k} for all k e IN
in the context of mückenmath.
Yes, I KNOW that this means that E(k) =/= IN \ F(k),
with F(k) = {n e IN : n <= k} for all k e IN.
Post by FromTheRafters
E(1) does not equal the naturals in muckymath.
It does, dumbo.
My advice: Shut up and fuck off!
Alternatively you might try to learn from your betters.
There is no 'FISON' ending in zero, so no 'endsegment' starting at one.
WHAT'S THE MATTER WITH YOU FUCKING ASSHOLE FULL OF SHIT?!
FISONs: F(1) = {1}, F(2) = {1, 2}, F(3) = {1, 2, 3}, ...
endsegments: E(1) = {1, 2, 3, ...}, E(2) = {2, 3, 4, ...}, E(3) = {3, 4, 5, ...}
AND NOW FUCK OF, YOU SILLY ASSHOLE!
You are confused. He takes the elements from the set of natural numbers
and partitions them into two complementary ordered sets.

{1,2,3,4,5} <---- Initial Segment of Naturals. Natural numbers less
than or equal to n -- in this case n equals five.

https://proofwiki.org/wiki/Definition:Initial_Segment_of_Natural_Numbers

{6,7,8,9,...} <---- and its complement, the endsegment, whose index is,
in this case, n+1 or six.

the index for E(1) would have to be F(0)+1 except WM has no zero as an
element of the naturals.
Fritz Feldhase
2022-09-04 18:46:29 UTC
Permalink
Post by Fritz Feldhase
Post by FromTheRafters
Post by Fritz Feldhase
Post by FromTheRafters
Post by Fritz Feldhase
Post by FromTheRafters
Post by Fritz Feldhase
Post by WM
by the very definition of endsegments, i.e., simple
mathematics: ∀k ∈ ℕ: E(k+1) = E(k) \ {k} .
[...] how does this equation 'define' what an
endsegment is?
It's part of a recursive definition, you silly dimwit!
Of course, in addition we need E(1) = IN.
Thanks for part of a good answer.
You are welcome!
Funny thing: These "defining equations" allow for a simple proof (by
induction) that for all n e IN: E(n) Is infinite (contrary to WM's claims).
Proof (by induction): E(1) = IN, hence E(1) is infinite. If E(n0) is
infinite (for some n0 e IN), then certainly E(n0+1) = E(n0) \ {n0} is
infinite (too). Hence (by induction) for all n e IN: E(n) is infinite. qed
It's a pitty that WM is not able to USE his
Post by FromTheRafters
Post by Fritz Feldhase
Post by WM
simple mathematics: ∀k ∈ ℕ: E(k+1) = E(k) \ {k}
for any real math.
It shows the relation between one 'endsegment' and the next.
Indeed!
Post by FromTheRafters
He already defined his endsegment as <bla>
Nope.
Actually, E(k) = {n e IN : n >= k} for all k e IN
in the context of mückenmath.
Yes, I KNOW that this means that E(k) =/= IN \ F(k),
with F(k) = {n e IN : n <= k} for all k e IN.
Post by FromTheRafters
E(1) does not equal the naturals in muckymath.
It does, dumbo.
My advice: Shut up and fuck off!
Alternatively you might try to learn from your betters.
There is no 'FISON' ending in zero, so no 'endsegment' starting at one.
WHAT'S THE MATTER WITH YOU FUCKING ASSHOLE FULL OF SHIT?!
FISONs: F(1) = {1}, F(2) = {1, 2}, F(3) = {1, 2, 3}, ...
endsegments: E(1) = {1, 2, 3, ...}, E(2) = {2, 3, 4, ...}, E(3) = {3, 4, 5, ...}
AND NOW FUCK OF, YOU SILLY ASSHOLE!
I said FUCK OF, YOU FUCKING ASSHOLE FULL OF SHIT!
FromTheRafters
2022-09-04 18:59:50 UTC
Permalink
Post by Fritz Feldhase
Post by Fritz Feldhase
Post by FromTheRafters
Post by Fritz Feldhase
Post by FromTheRafters
Post by Fritz Feldhase
Post by FromTheRafters
Post by Fritz Feldhase
Post by WM
by the very definition of endsegments, i.e., simple
mathematics: ∀k ∈ ℕ: E(k+1) = E(k) \ {k} .
[...] how does this equation 'define' what an
endsegment is?
It's part of a recursive definition, you silly dimwit!
Of course, in addition we need E(1) = IN.
Thanks for part of a good answer.
You are welcome!
Funny thing: These "defining equations" allow for a simple proof (by
induction) that for all n e IN: E(n) Is infinite (contrary to WM's claims).
Proof (by induction): E(1) = IN, hence E(1) is infinite. If E(n0) is
infinite (for some n0 e IN), then certainly E(n0+1) = E(n0) \ {n0} is
infinite (too). Hence (by induction) for all n e IN: E(n) is infinite. qed
It's a pitty that WM is not able to USE his
Post by FromTheRafters
Post by Fritz Feldhase
Post by WM
simple mathematics: ∀k ∈ ℕ: E(k+1) = E(k) \ {k}
for any real math.
It shows the relation between one 'endsegment' and the next.
Indeed!
Post by FromTheRafters
He already defined his endsegment as <bla>
Nope.
Actually, E(k) = {n e IN : n >= k} for all k e IN
in the context of mückenmath.
Yes, I KNOW that this means that E(k) =/= IN \ F(k),
with F(k) = {n e IN : n <= k} for all k e IN.
Post by FromTheRafters
E(1) does not equal the naturals in muckymath.
It does, dumbo.
My advice: Shut up and fuck off!
Alternatively you might try to learn from your betters.
There is no 'FISON' ending in zero, so no 'endsegment' starting at one.
WHAT'S THE MATTER WITH YOU FUCKING ASSHOLE FULL OF SHIT?!
FISONs: F(1) = {1}, F(2) = {1, 2}, F(3) = {1, 2, 3}, ...
endsegments: E(1) = {1, 2, 3, ...}, E(2) = {2, 3, 4, ...}, E(3) = {3, 4, 5, ...}
AND NOW FUCK OF, YOU SILLY ASSHOLE!
I said FUCK OF, YOU FUCKING ASSHOLE FULL OF SHIT!
Calm down, and off is spelled with two Fs.
Fritz Feldhase
2022-09-04 19:33:29 UTC
Permalink
Post by FromTheRafters
off is spelled with two Fs.
Right.

So FUCK OFF, YOU FUCKING ASSHOLE FULL OF SHIT!
FromTheRafters
2022-09-04 19:41:42 UTC
Permalink
Post by Fritz Feldhase
Post by FromTheRafters
off is spelled with two Fs.
Right.
So FUCK OFF, YOU FUCKING ASSHOLE FULL OF SHIT!
That's better.
Ross A. Finlayson
2022-09-04 19:29:10 UTC
Permalink
Post by FromTheRafters
Post by Fritz Feldhase
Post by FromTheRafters
Post by Fritz Feldhase
Post by FromTheRafters
Post by Fritz Feldhase
Post by FromTheRafters
Post by Fritz Feldhase
Post by WM
by the very definition of endsegments, i.e., simple
mathematics: ∀k ∈ ℕ: E(k+1) = E(k) \ {k} .
[...] how does this equation 'define' what an
endsegment is?
It's part of a recursive definition, you silly dimwit!
Of course, in addition we need E(1) = IN.
Thanks for part of a good answer.
You are welcome!
Funny thing: These "defining equations" allow for a simple proof (by
induction) that for all n e IN: E(n) Is infinite (contrary to WM's claims).
Proof (by induction): E(1) = IN, hence E(1) is infinite. If E(n0) is
infinite (for some n0 e IN), then certainly E(n0+1) = E(n0) \ {n0} is
infinite (too). Hence (by induction) for all n e IN: E(n) is infinite. qed
It's a pitty that WM is not able to USE his
Post by FromTheRafters
Post by Fritz Feldhase
Post by WM
simple mathematics: ∀k ∈ ℕ: E(k+1) = E(k) \ {k}
for any real math.
It shows the relation between one 'endsegment' and the next.
Indeed!
Post by FromTheRafters
He already defined his endsegment as <bla>
Nope.
Actually, E(k) = {n e IN : n >= k} for all k e IN
in the context of mückenmath.
Yes, I KNOW that this means that E(k) =/= IN \ F(k),
with F(k) = {n e IN : n <= k} for all k e IN.
Post by FromTheRafters
E(1) does not equal the naturals in muckymath.
It does, dumbo.
My advice: Shut up and fuck off!
Alternatively you might try to learn from your betters.
There is no 'FISON' ending in zero, so no 'endsegment' starting at one.
WHAT'S THE MATTER WITH YOU FUCKING ASSHOLE FULL OF SHIT?!
FISONs: F(1) = {1}, F(2) = {1, 2}, F(3) = {1, 2, 3}, ...
endsegments: E(1) = {1, 2, 3, ...}, E(2) = {2, 3, 4, ...}, E(3) = {3, 4, 5, ...}
AND NOW FUCK OF, YOU SILLY ASSHOLE!
You are confused. He takes the elements from the set of natural numbers
and partitions them into two complementary ordered sets.
{1,2,3,4,5} <---- Initial Segment of Naturals. Natural numbers less
than or equal to n -- in this case n equals five.
https://proofwiki.org/wiki/Definition:Initial_Segment_of_Natural_Numbers
{6,7,8,9,...} <---- and its complement, the endsegment, whose index is,
in this case, n+1 or six.
the index for E(1) would have to be F(0)+1 except WM has no zero as an
element of the naturals.
x + -x
Fritz Feldhase
2022-09-04 16:26:22 UTC
Permalink
Post by FromTheRafters
Proof (by induction): E(1) = IN, hence E(1) is infinite. [...]
E(1) does not equal the naturals in muckymath.
*sigh*

Hint: "With E(1) = ℕ all is said. But that should be known meanwhile." (WM, sci.math)

Hope this helps.
Sergio
2022-09-04 17:00:34 UTC
Permalink
Post by Fritz Feldhase
Post by FromTheRafters
Proof (by induction): E(1) = IN, hence E(1) is infinite. [...]
E(1) does not equal the naturals in muckymath.
*sigh*
Hint: "With E(1) = ℕ all is said. But that should be known meanwhile." (WM, sci.math)
Hope this helps.
remember muckymath(t) is time dependent

muckymath(t1) =/= muckymath(t2)
FromTheRafters
2022-09-04 19:07:14 UTC
Permalink
Post by Fritz Feldhase
Post by FromTheRafters
Proof (by induction): E(1) = IN, hence E(1) is infinite. [...]
E(1) does not equal the naturals in muckymath.
*sigh*
Hint: "With E(1) = ℕ all is said. But that should be known meanwhile." (WM, sci.math)
Hope this helps.
It doesn't. The index for the endsegment should be the same as the
greatest element of the associated FISON *plus* one. Where is the
associated FISON for E(1) if E(1) is all of the natural numbers?
Fritz Feldhase
2022-09-04 19:35:44 UTC
Permalink
Post by FromTheRafters
Post by Fritz Feldhase
Post by FromTheRafters
Proof (by induction): E(1) = IN, hence E(1) is infinite. [...]
E(1) does not equal the naturals in muckymath.
*sigh*
Hint: "With E(1) = ℕ all is said. But that should be known meanwhile." (WM, sci.math)
Hope this helps.
It doesn't.
"There was no hope for him this time: it was the third stroke." (James Joyce, Dubliners)
WM
2022-09-06 10:55:33 UTC
Permalink
Post by FromTheRafters
Post by Fritz Feldhase
Post by FromTheRafters
Proof (by induction): E(1) = IN, hence E(1) is infinite. [...]
E(1) does not equal the naturals in muckymath.
*sigh*
Hint: "With E(1) = ℕ all is said. But that should be known meanwhile." (WM, sci.math)
Hope this helps.
It doesn't. The index for the endsegment should be the same as the
greatest element of the associated FISON *plus* one.
That would be possible, perhaps even better. But I have originally defined it in this way:
F(n) = {1, 2, 3, ..., n}
E(n) = {n, n+1, n+2, ...}
E(1) = ℕ = {1, 2, 3, ...}
And it would cause confusion to change that.

Regards, WM
FromTheRafters
2022-09-06 12:01:54 UTC
Permalink
Post by WM
Post by FromTheRafters
Post by Fritz Feldhase
Post by FromTheRafters
Proof (by induction): E(1) = IN, hence E(1) is infinite. [...]
E(1) does not equal the naturals in muckymath.
*sigh*
Hint: "With E(1) = ℕ all is said. But that should be known meanwhile." (WM, sci.math)
Hope this helps.
It doesn't. The index for the endsegment should be the same as the
greatest element of the associated FISON *plus* one.
That would be possible, perhaps even better. But I have originally defined it
in this way: F(n) = {1, 2, 3, ..., n}
E(n) = {n, n+1, n+2, ...}
E(n) then intersects F(n) at n when they are supposed to be the
disjoint (complementary) subsets of the newly partitioned naturals. But
okay, muckymath is bulletproof with the axiom of because I (WM) said
so.

Carry on.
Ross A. Finlayson
2022-09-06 14:08:30 UTC
Permalink
Post by FromTheRafters
Post by WM
Post by FromTheRafters
Post by Fritz Feldhase
Post by FromTheRafters
Proof (by induction): E(1) = IN, hence E(1) is infinite. [...]
E(1) does not equal the naturals in muckymath.
*sigh*
Hint: "With E(1) = ℕ all is said. But that should be known meanwhile." (WM,
sci.math)
Hope this helps.
It doesn't. The index for the endsegment should be the same as the
greatest element of the associated FISON *plus* one.
That would be possible, perhaps even better. But I have originally defined it
in this way: F(n) = {1, 2, 3, ..., n}
E(n) = {n, n+1, n+2, ...}
E(n) then intersects F(n) at n when they are supposed to be the
disjoint (complementary) subsets of the newly partitioned naturals. But
okay, muckymath is bulletproof with the axiom of because I (WM) said
so.
Carry on.
Think of it this way: "it had carried on then for whatever reason,
the condition changed: it's the same axiomatic system, including a dynamic".

That simply changes what is the parallel condition in the finite,
to be just the same way, axiomatic in dynamics.

Then, all your moot arguments are compressible to a pinhead.
Ross A. Finlayson
2022-09-06 15:19:10 UTC
Permalink
Post by FromTheRafters
Post by WM
Post by FromTheRafters
Post by Fritz Feldhase
Post by FromTheRafters
Proof (by induction): E(1) = IN, hence E(1) is infinite. [...]
E(1) does not equal the naturals in muckymath.
*sigh*
Hint: "With E(1) = ℕ all is said. But that should be known meanwhile." (WM,
sci.math)
Hope this helps.
It doesn't. The index for the endsegment should be the same as the
greatest element of the associated FISON *plus* one.
That would be possible, perhaps even better. But I have originally defined it
in this way: F(n) = {1, 2, 3, ..., n}
E(n) = {n, n+1, n+2, ...}
E(n) then intersects F(n) at n when they are supposed to be the
disjoint (complementary) subsets of the newly partitioned naturals. But
okay, muckymath is bulletproof with the axiom of because I (WM) said
so.
Carry on.
Think of it this way: "it had carried on then for whatever reason,
the condition changed: it's the same axiomatic system, including a dynamic".
That simply changes what is the parallel condition in the finite,
to be just the same way, axiomatic in dynamics.
Then, all your moot arguments are compressible to a pinhead.
The axiomatic and dynamic, is much simpler and better,
than argument, in terms of unending argument and regress.

Though it involves reasoning facilities, axiomatics is dynamic
in the sense of the very strong axiomatic, what must entail
all reasoning facilities: at least this simple axiomatic is simply
dynamic: whatever all faults in reasoning reduce to induction.

The utterly and fundamentally technical, here for the infinite
there's that WM's failed induction over a related rates system,
because his relation that is proportional is first not second
that there is an infinite rate, (respectively not a largest finite rate).

Then, having the proportional that runs out together is a related
rate, any matter of proportion in time.

This assumes a linear constant rate of time at least from every
object in space-time, or the local rate down to zero.

Which leaves though both sides having brought down the
others' reasoning, while still having to leave them together.

Then, this leads immediately to my slates and the state of
modern axiomatics in continuum analysis, neatly out.
Ross A. Finlayson
2022-09-06 15:36:36 UTC
Permalink
Post by Ross A. Finlayson
Post by FromTheRafters
Post by WM
Post by FromTheRafters
Post by Fritz Feldhase
Post by FromTheRafters
Proof (by induction): E(1) = IN, hence E(1) is infinite. [...]
E(1) does not equal the naturals in muckymath.
*sigh*
Hint: "With E(1) = ℕ all is said. But that should be known meanwhile." (WM,
sci.math)
Hope this helps.
It doesn't. The index for the endsegment should be the same as the
greatest element of the associated FISON *plus* one.
That would be possible, perhaps even better. But I have originally defined it
in this way: F(n) = {1, 2, 3, ..., n}
E(n) = {n, n+1, n+2, ...}
E(n) then intersects F(n) at n when they are supposed to be the
disjoint (complementary) subsets of the newly partitioned naturals. But
okay, muckymath is bulletproof with the axiom of because I (WM) said
so.
Carry on.
Think of it this way: "it had carried on then for whatever reason,
the condition changed: it's the same axiomatic system, including a dynamic".
That simply changes what is the parallel condition in the finite,
to be just the same way, axiomatic in dynamics.
Then, all your moot arguments are compressible to a pinhead.
The axiomatic and dynamic, is much simpler and better,
than argument, in terms of unending argument and regress.
Though it involves reasoning facilities, axiomatics is dynamic
in the sense of the very strong axiomatic, what must entail
all reasoning facilities: at least this simple axiomatic is simply
dynamic: whatever all faults in reasoning reduce to induction.
The utterly and fundamentally technical, here for the infinite
there's that WM's failed induction over a related rates system,
because his relation that is proportional is first not second
that there is an infinite rate, (respectively not a largest finite rate).
Then, having the proportional that runs out together is a related
rate, any matter of proportion in time.
This assumes a linear constant rate of time at least from every
object in space-time, or the local rate down to zero.
Which leaves though both sides having brought down the
others' reasoning, while still having to leave them together.
Then, this leads immediately to my slates and the state of
modern axiomatics in continuum analysis, neatly out.
"It's easy to be a troll when mathematics does all the work of being right. "


"Shannon is sometimes given credit for Nyquist theorem,
where it may be so that Shannon and "continuity is result
of rationals" have that Shannon's results in signal theory
and for information theory, for information theory, and,
signal theory, with respect to formalism and here with
formalism in foundations, have that "no, it is not so that
'continuity is result of rationals', it's not to be implied
that it's a point of Shannon's when connecting signal theory
and properties of continuous sampling theorems, except
to illustrate the entire connection here in the abstract."

Then, that "I said so", is basically that mostly I have
studied the formalism of the line continuity and the
field continuity, with respect to the signal continuity,
and continuous functions which is the usual formalism. "
Sergio
2022-09-06 15:46:36 UTC
Permalink
Post by Ross A. Finlayson
Post by FromTheRafters
Post by WM
Post by FromTheRafters
Post by Fritz Feldhase
Post by FromTheRafters
Proof (by induction): E(1) = IN, hence E(1) is infinite. [...]
E(1) does not equal the naturals in muckymath.
*sigh*
Hint: "With E(1) = ℕ all is said. But that should be known meanwhile." (WM,
sci.math)
Hope this helps.
It doesn't. The index for the endsegment should be the same as the
greatest element of the associated FISON *plus* one.
That would be possible, perhaps even better. But I have originally defined it
in this way: F(n) = {1, 2, 3, ..., n}
E(n) = {n, n+1, n+2, ...}
E(n) then intersects F(n) at n when they are supposed to be the
disjoint (complementary) subsets of the newly partitioned naturals. But
okay, muckymath is bulletproof with the axiom of because I (WM) said
so.
Carry on.
Think of it this way: "it had carried on then for whatever reason,
the condition changed: it's the same axiomatic system, including a dynamic".
That simply changes what is the parallel condition in the finite,
to be just the same way, axiomatic in dynamics.
Then, all your moot arguments are compressible to a pinhead.
The axiomatic and dynamic, is much simpler and better,
than argument, in terms of unending argument and regress.
Though it involves reasoning facilities, axiomatics is dynamic
in the sense of the very strong axiomatic, what must entail
all reasoning facilities: at least this simple axiomatic is simply
dynamic: whatever all faults in reasoning reduce to induction.
The utterly and fundamentally technical, here for the infinite
there's that WM's failed induction over a related rates system,
because his relation that is proportional is first not second
that there is an infinite rate, (respectively not a largest finite rate).
Then, having the proportional that runs out together is a related
rate, any matter of proportion in time.
This assumes a linear constant rate of time at least from every
object in space-time, or the local rate down to zero.
Which leaves though both sides having brought down the
others' reasoning, while still having to leave them together.
Then, this leads immediately to my slates and the state of
modern axiomatics in continuum analysis, neatly out.
"It's easy to be a troll when mathematics does all the work of being right."
"Shannon is sometimes given credit for Nyquist theorem,
where it may be so that Shannon and "continuity is result
of rationals" have that Shannon's results in signal theory
and for information theory, for information theory, and,
signal theory, with respect to formalism and here with
formalism in foundations, have that "no, it is not so that
'continuity is result of rationals', it's not to be implied
that it's a point of Shannon's when connecting signal theory
and properties of continuous sampling theorems, except
to illustrate the entire connection here in the abstract."
agree, its abstraction.
Then, that "I said so", is basically that mostly I have
studied the formalism of the line continuity and the
field continuity, with respect to the signal continuity,
and continuous functions which is the usual formalism. "
line integrals too ?
Ross A. Finlayson
2022-09-06 15:59:19 UTC
Permalink
Post by Sergio
Post by Ross A. Finlayson
Post by FromTheRafters
Post by WM
Post by FromTheRafters
Post by Fritz Feldhase
Post by FromTheRafters
Proof (by induction): E(1) = IN, hence E(1) is infinite. [...]
E(1) does not equal the naturals in muckymath.
*sigh*
Hint: "With E(1) = ℕ all is said. But that should be known meanwhile." (WM,
sci.math)
Hope this helps.
It doesn't. The index for the endsegment should be the same as the
greatest element of the associated FISON *plus* one.
That would be possible, perhaps even better. But I have originally defined it
in this way: F(n) = {1, 2, 3, ..., n}
E(n) = {n, n+1, n+2, ...}
E(n) then intersects F(n) at n when they are supposed to be the
disjoint (complementary) subsets of the newly partitioned naturals. But
okay, muckymath is bulletproof with the axiom of because I (WM) said
so.
Carry on.
Think of it this way: "it had carried on then for whatever reason,
the condition changed: it's the same axiomatic system, including a dynamic".
That simply changes what is the parallel condition in the finite,
to be just the same way, axiomatic in dynamics.
Then, all your moot arguments are compressible to a pinhead.
The axiomatic and dynamic, is much simpler and better,
than argument, in terms of unending argument and regress.
Though it involves reasoning facilities, axiomatics is dynamic
in the sense of the very strong axiomatic, what must entail
all reasoning facilities: at least this simple axiomatic is simply
dynamic: whatever all faults in reasoning reduce to induction.
The utterly and fundamentally technical, here for the infinite
there's that WM's failed induction over a related rates system,
because his relation that is proportional is first not second
that there is an infinite rate, (respectively not a largest finite rate).
Then, having the proportional that runs out together is a related
rate, any matter of proportion in time.
This assumes a linear constant rate of time at least from every
object in space-time, or the local rate down to zero.
Which leaves though both sides having brought down the
others' reasoning, while still having to leave them together.
Then, this leads immediately to my slates and the state of
modern axiomatics in continuum analysis, neatly out.
"It's easy to be a troll when mathematics does all the work of being right."
"Shannon is sometimes given credit for Nyquist theorem,
where it may be so that Shannon and "continuity is result
of rationals" have that Shannon's results in signal theory
and for information theory, for information theory, and,
signal theory, with respect to formalism and here with
formalism in foundations, have that "no, it is not so that
'continuity is result of rationals', it's not to be implied
that it's a point of Shannon's when connecting signal theory
and properties of continuous sampling theorems, except
to illustrate the entire connection here in the abstract."
agree, its abstraction.
Then, that "I said so", is basically that mostly I have
studied the formalism of the line continuity and the
field continuity, with respect to the signal continuity,
and continuous functions which is the usual formalism. "
line integrals too ?
Sure, mathematics does all the work of being right.

Line integrals are difficult also rudimentary.

Solving all WM's problems in related rates,
and with assigning the limits as opaque,
results why what falls out.

The line integral, introduced after the area integral,
and for surface integrals in a similar sense, and
the path of integration, is that there is the path integral.

Then, it is also some "bridge integral". I.e., the path
is defined according to its bounds, what for example, is
the "path integral, add up where it's been", for the
bridge integral, partition where it's going".

The line integral is often contrived "end-of-the-line" interal,
i.e., "a line integral is always attached". But, of course
it's still the exact same interpretation, "the length of the line".


Now, I just introduced or "defined", bridge integral, though
it's usually just the shortest line integral, that also happens
for attachments across the square or the angle, what's drawn out.

(Square, radial, anti-logarithmic, ....)

That the differential is anti-integral is vice-versa.

The antilogarithm or power, is for tables: under linear inputs, usually.

Paint cans are volume but usually define what area they cover.

Why are you bringing line integral into it? Isn't that contrived
for either the catenary or parabolic?
Sergio
2022-09-07 13:41:31 UTC
Permalink
Post by Ross A. Finlayson
Post by Sergio
Post by Ross A. Finlayson
Post by FromTheRafters
Post by WM
Post by FromTheRafters
Post by Fritz Feldhase
Post by FromTheRafters
Proof (by induction): E(1) = IN, hence E(1) is infinite. [...]
E(1) does not equal the naturals in muckymath.
*sigh*
Hint: "With E(1) = ℕ all is said. But that should be known meanwhile." (WM,
sci.math)
Hope this helps.
It doesn't. The index for the endsegment should be the same as the
greatest element of the associated FISON *plus* one.
That would be possible, perhaps even better. But I have originally defined it
in this way: F(n) = {1, 2, 3, ..., n}
E(n) = {n, n+1, n+2, ...}
E(n) then intersects F(n) at n when they are supposed to be the
disjoint (complementary) subsets of the newly partitioned naturals. But
okay, muckymath is bulletproof with the axiom of because I (WM) said
so.
Carry on.
Think of it this way: "it had carried on then for whatever reason,
the condition changed: it's the same axiomatic system, including a dynamic".
That simply changes what is the parallel condition in the finite,
to be just the same way, axiomatic in dynamics.
Then, all your moot arguments are compressible to a pinhead.
The axiomatic and dynamic, is much simpler and better,
than argument, in terms of unending argument and regress.
Though it involves reasoning facilities, axiomatics is dynamic
in the sense of the very strong axiomatic, what must entail
all reasoning facilities: at least this simple axiomatic is simply
dynamic: whatever all faults in reasoning reduce to induction.
The utterly and fundamentally technical, here for the infinite
there's that WM's failed induction over a related rates system,
because his relation that is proportional is first not second
that there is an infinite rate, (respectively not a largest finite rate).
Then, having the proportional that runs out together is a related
rate, any matter of proportion in time.
This assumes a linear constant rate of time at least from every
object in space-time, or the local rate down to zero.
Which leaves though both sides having brought down the
others' reasoning, while still having to leave them together.
Then, this leads immediately to my slates and the state of
modern axiomatics in continuum analysis, neatly out.
"It's easy to be a troll when mathematics does all the work of being right."
"Shannon is sometimes given credit for Nyquist theorem,
where it may be so that Shannon and "continuity is result
of rationals" have that Shannon's results in signal theory
and for information theory, for information theory, and,
signal theory, with respect to formalism and here with
formalism in foundations, have that "no, it is not so that
'continuity is result of rationals', it's not to be implied
that it's a point of Shannon's when connecting signal theory
and properties of continuous sampling theorems, except
to illustrate the entire connection here in the abstract."
agree, its abstraction.
Then, that "I said so", is basically that mostly I have
studied the formalism of the line continuity and the
field continuity, with respect to the signal continuity,
and continuous functions which is the usual formalism. "
line integrals too ?
Sure, mathematics does all the work of being right.
Line integrals are difficult also rudimentary.
Solving all WM's problems in related rates,
and with assigning the limits as opaque,
results why what falls out.
The line integral, introduced after the area integral,
and for surface integrals in a similar sense, and
the path of integration, is that there is the path integral.
Then, it is also some "bridge integral". I.e., the path
is defined according to its bounds, what for example, is
the "path integral, add up where it's been", for the
bridge integral, partition where it's going".
The line integral is often contrived "end-of-the-line" interal,
i.e., "a line integral is always attached". But, of course
it's still the exact same interpretation, "the length of the line".
Now, I just introduced or "defined", bridge integral, though
it's usually just the shortest line integral, that also happens
for attachments across the square or the angle, what's drawn out.
(Square, radial, anti-logarithmic, ....)
That the differential is anti-integral is vice-versa.
The antilogarithm or power, is for tables: under linear inputs, usually.
Paint cans are volume but usually define what area they cover.
Why are you bringing line integral into it? Isn't that contrived
for either the catenary or parabolic?
google line integrals,
Just testing to see how much math you know, like a sounding, this one is by the Deep One less four quarters.
Ross A. Finlayson
2022-09-07 15:42:26 UTC
Permalink
Post by Sergio
Post by Ross A. Finlayson
Post by Sergio
Post by Ross A. Finlayson
Post by FromTheRafters
Post by WM
Post by FromTheRafters
Post by Fritz Feldhase
Post by FromTheRafters
Proof (by induction): E(1) = IN, hence E(1) is infinite. [...]
E(1) does not equal the naturals in muckymath.
*sigh*
Hint: "With E(1) = ℕ all is said. But that should be known meanwhile." (WM,
sci.math)
Hope this helps.
It doesn't. The index for the endsegment should be the same as the
greatest element of the associated FISON *plus* one.
That would be possible, perhaps even better. But I have originally defined it
in this way: F(n) = {1, 2, 3, ..., n}
E(n) = {n, n+1, n+2, ...}
E(n) then intersects F(n) at n when they are supposed to be the
disjoint (complementary) subsets of the newly partitioned naturals. But
okay, muckymath is bulletproof with the axiom of because I (WM) said
so.
Carry on.
Think of it this way: "it had carried on then for whatever reason,
the condition changed: it's the same axiomatic system, including a dynamic".
That simply changes what is the parallel condition in the finite,
to be just the same way, axiomatic in dynamics.
Then, all your moot arguments are compressible to a pinhead.
The axiomatic and dynamic, is much simpler and better,
than argument, in terms of unending argument and regress.
Though it involves reasoning facilities, axiomatics is dynamic
in the sense of the very strong axiomatic, what must entail
all reasoning facilities: at least this simple axiomatic is simply
dynamic: whatever all faults in reasoning reduce to induction.
The utterly and fundamentally technical, here for the infinite
there's that WM's failed induction over a related rates system,
because his relation that is proportional is first not second
that there is an infinite rate, (respectively not a largest finite rate).
Then, having the proportional that runs out together is a related
rate, any matter of proportion in time.
This assumes a linear constant rate of time at least from every
object in space-time, or the local rate down to zero.
Which leaves though both sides having brought down the
others' reasoning, while still having to leave them together.
Then, this leads immediately to my slates and the state of
modern axiomatics in continuum analysis, neatly out.
"It's easy to be a troll when mathematics does all the work of being right."
"Shannon is sometimes given credit for Nyquist theorem,
where it may be so that Shannon and "continuity is result
of rationals" have that Shannon's results in signal theory
and for information theory, for information theory, and,
signal theory, with respect to formalism and here with
formalism in foundations, have that "no, it is not so that
'continuity is result of rationals', it's not to be implied
that it's a point of Shannon's when connecting signal theory
and properties of continuous sampling theorems, except
to illustrate the entire connection here in the abstract."
agree, its abstraction.
Then, that "I said so", is basically that mostly I have
studied the formalism of the line continuity and the
field continuity, with respect to the signal continuity,
and continuous functions which is the usual formalism. "
line integrals too ?
Sure, mathematics does all the work of being right.
Line integrals are difficult also rudimentary.
Solving all WM's problems in related rates,
and with assigning the limits as opaque,
results why what falls out.
The line integral, introduced after the area integral,
and for surface integrals in a similar sense, and
the path of integration, is that there is the path integral.
Then, it is also some "bridge integral". I.e., the path
is defined according to its bounds, what for example, is
the "path integral, add up where it's been", for the
bridge integral, partition where it's going".
The line integral is often contrived "end-of-the-line" interal,
i.e., "a line integral is always attached". But, of course
it's still the exact same interpretation, "the length of the line".
Now, I just introduced or "defined", bridge integral, though
it's usually just the shortest line integral, that also happens
for attachments across the square or the angle, what's drawn out.
(Square, radial, anti-logarithmic, ....)
That the differential is anti-integral is vice-versa.
The antilogarithm or power, is for tables: under linear inputs, usually.
Paint cans are volume but usually define what area they cover.
Why are you bringing line integral into it? Isn't that contrived
for either the catenary or parabolic?
google line integrals,
Just testing to see how much math you know, like a sounding, this one is by the Deep One less four quarters.
"That was the greatest comic tour de force that anybody had seen in a long time."

(Roger Rabbit)


The line integral was introduced after the catenary problem,
basically at the end of otherwise a chapter in the text, instead
of starting a new chaper, the "advanced calculus". So, I wanted
to make the line integral the same as the quarter-bend, but instead
it was both amounting to the catenary via parabola, and, that
I want to solve the catenary in the parabola, but, otherwise the
line integral was let down to line elements and ds.

Then the surface integral, after surfaces of revolution, or paint cans,
then the path of integration is free for what it is, what it amounts to.

So, I'd imagine several line integral setups for usual problems of
what is the length according to perimeter, circumference, besides
as wise the square, and quadratic, in the elements, and the paths.
This is where according to the paths there are elements that are
integrable, that any contrivance in symmetry or exhaust, or relation
in measure here length, is for usual geometric and stateful examples,
in terms of how and why they are line elements and path elements.

The "advanced calculus", ..., here when it got to "yes I have derived this
Green's function accordingly, but, what I want is instead for example
different elements", then though later after gradient descent and
Stokes, then again out through the Hamiltonian what really though
is for the Hermitian, then to flow and what is fluid mechanics and
fluid dynamics, then again it was "still these are Green's functions
after Stokes, 'advanced calculus'", I've studied the advanced calculus,
and have several texts, but surely most my exposure is peripheral.

I.e. the brief tableau for the determinantal, the "dot product is ...
derivative anti-integral placeholder-element", is for people to
learn inner and outer products and wedge and dot and so on.

And why and how it's computable.

Read this "Exterior derivative" Wiki: https://en.wikipedia.org/wiki/Exterior_derivative
Then you'll notice it's as if I intend to paste the above into it.
Ross A. Finlayson
2022-09-07 16:02:58 UTC
Permalink
Post by Ross A. Finlayson
Post by Ross A. Finlayson
Post by FromTheRafters
Post by WM
Post by FromTheRafters
Post by Fritz Feldhase
Post by FromTheRafters
Proof (by induction): E(1) = IN, hence E(1) is infinite. [...]
E(1) does not equal the naturals in muckymath.
*sigh*
Hint: "With E(1) = ℕ all is said. But that should be known meanwhile." (WM,
sci.math)
Hope this helps.
It doesn't. The index for the endsegment should be the same as the
greatest element of the associated FISON *plus* one.
That would be possible, perhaps even better. But I have originally defined it
in this way: F(n) = {1, 2, 3, ..., n}
E(n) = {n, n+1, n+2, ...}
E(n) then intersects F(n) at n when they are supposed to be the
disjoint (complementary) subsets of the newly partitioned naturals. But
okay, muckymath is bulletproof with the axiom of because I (WM) said
so.
Carry on.
Think of it this way: "it had carried on then for whatever reason,
the condition changed: it's the same axiomatic system, including a dynamic".
That simply changes what is the parallel condition in the finite,
to be just the same way, axiomatic in dynamics.
Then, all your moot arguments are compressible to a pinhead.
The axiomatic and dynamic, is much simpler and better,
than argument, in terms of unending argument and regress.
Though it involves reasoning facilities, axiomatics is dynamic
in the sense of the very strong axiomatic, what must entail
all reasoning facilities: at least this simple axiomatic is simply
dynamic: whatever all faults in reasoning reduce to induction.
The utterly and fundamentally technical, here for the infinite
there's that WM's failed induction over a related rates system,
because his relation that is proportional is first not second
that there is an infinite rate, (respectively not a largest finite rate).
Then, having the proportional that runs out together is a related
rate, any matter of proportion in time.
This assumes a linear constant rate of time at least from every
object in space-time, or the local rate down to zero.
Which leaves though both sides having brought down the
others' reasoning, while still having to leave them together.
Then, this leads immediately to my slates and the state of
modern axiomatics in continuum analysis, neatly out.
"It's easy to be a troll when mathematics does all the work of being right. "
"Shannon is sometimes given credit for Nyquist theorem,
where it may be so that Shannon and "continuity is result
of rationals" have that Shannon's results in signal theory
and for information theory, for information theory, and,
signal theory, with respect to formalism and here with
formalism in foundations, have that "no, it is not so that
'continuity is result of rationals', it's not to be implied
that it's a point of Shannon's when connecting signal theory
and properties of continuous sampling theorems, except
to illustrate the entire connection here in the abstract."
Then, that "I said so", is basically that mostly I have
studied the formalism of the line continuity and the
field continuity, with respect to the signal continuity,
and continuous functions which is the usual formalism. "
https://en.wikipedia.org/wiki/Category:Generalized_functions
Sergio
2022-09-07 16:15:28 UTC
Permalink
Post by Ross A. Finlayson
Post by Ross A. Finlayson
Post by Ross A. Finlayson
Post by FromTheRafters
Post by WM
Post by FromTheRafters
Post by Fritz Feldhase
Post by FromTheRafters
Proof (by induction): E(1) = IN, hence E(1) is infinite. [...]
E(1) does not equal the naturals in muckymath.
*sigh*
Hint: "With E(1) = ℕ all is said. But that should be known meanwhile." (WM,
sci.math)
Hope this helps.
It doesn't. The index for the endsegment should be the same as the
greatest element of the associated FISON *plus* one.
That would be possible, perhaps even better. But I have originally defined it
in this way: F(n) = {1, 2, 3, ..., n}
E(n) = {n, n+1, n+2, ...}
E(n) then intersects F(n) at n when they are supposed to be the
disjoint (complementary) subsets of the newly partitioned naturals. But
okay, muckymath is bulletproof with the axiom of because I (WM) said
so.
Carry on.
Think of it this way: "it had carried on then for whatever reason,
the condition changed: it's the same axiomatic system, including a dynamic".
That simply changes what is the parallel condition in the finite,
to be just the same way, axiomatic in dynamics.
Then, all your moot arguments are compressible to a pinhead.
The axiomatic and dynamic, is much simpler and better,
than argument, in terms of unending argument and regress.
Though it involves reasoning facilities, axiomatics is dynamic
in the sense of the very strong axiomatic, what must entail
all reasoning facilities: at least this simple axiomatic is simply
dynamic: whatever all faults in reasoning reduce to induction.
The utterly and fundamentally technical, here for the infinite
there's that WM's failed induction over a related rates system,
because his relation that is proportional is first not second
that there is an infinite rate, (respectively not a largest finite rate).
Then, having the proportional that runs out together is a related
rate, any matter of proportion in time.
This assumes a linear constant rate of time at least from every
object in space-time, or the local rate down to zero.
Which leaves though both sides having brought down the
others' reasoning, while still having to leave them together.
Then, this leads immediately to my slates and the state of
modern axiomatics in continuum analysis, neatly out.
"It's easy to be a troll when mathematics does all the work of being right. "
"Shannon is sometimes given credit for Nyquist theorem,
where it may be so that Shannon and "continuity is result
of rationals" have that Shannon's results in signal theory
and for information theory, for information theory, and,
signal theory, with respect to formalism and here with
formalism in foundations, have that "no, it is not so that
'continuity is result of rationals', it's not to be implied
that it's a point of Shannon's when connecting signal theory
and properties of continuous sampling theorems, except
to illustrate the entire connection here in the abstract."
Then, that "I said so", is basically that mostly I have
studied the formalism of the line continuity and the
field continuity, with respect to the signal continuity,
and continuous functions which is the usual formalism. "
https://en.wikipedia.org/wiki/Category:Generalized_functions
https://en.wikipedia.org/wiki/Pseudo-differential_operator

WM is a Pseudo-math operator
Sergio
2022-09-06 15:42:11 UTC
Permalink
Post by Ross A. Finlayson
Post by FromTheRafters
Post by WM
Post by FromTheRafters
Post by Fritz Feldhase
Post by FromTheRafters
Proof (by induction): E(1) = IN, hence E(1) is infinite. [...]
E(1) does not equal the naturals in muckymath.
*sigh*
Hint: "With E(1) = ℕ all is said. But that should be known meanwhile." (WM,
sci.math)
Hope this helps.
It doesn't. The index for the endsegment should be the same as the
greatest element of the associated FISON *plus* one.
That would be possible, perhaps even better. But I have originally defined it
in this way: F(n) = {1, 2, 3, ..., n}
E(n) = {n, n+1, n+2, ...}
E(n) then intersects F(n) at n when they are supposed to be the
disjoint (complementary) subsets of the newly partitioned naturals. But
okay, muckymath is bulletproof with the axiom of because I (WM) said
so.
Carry on.
Think of it this way: "it had carried on then for whatever reason,
the condition changed: it's the same axiomatic system, including a dynamic".
That simply changes what is the parallel condition in the finite,
to be just the same way, axiomatic in dynamics.
Then, all your moot arguments are compressible to a pinhead.
The axiomatic and dynamic, is much simpler and better,
than argument, in terms of unending argument and regress.
WM denies axioms exist, however he uses his statements as axioms
Post by Ross A. Finlayson
Though it involves reasoning facilities, axiomatics is dynamic
in the sense of the very strong axiomatic, what must entail
all reasoning facilities: at least this simple axiomatic is simply
dynamic: whatever all faults in reasoning reduce to induction.
The utterly and fundamentally technical, here for the infinite
there's that WM's failed induction over a related rates system,
because his relation that is proportional is first not second
that there is an infinite rate, (respectively not a largest finite rate).
yea, today's infinite rate is the highest in 40 years!
Post by Ross A. Finlayson
Then, having the proportional that runs out together is a related
rate, any matter of proportion in time.
This assumes a linear constant rate of time at least from every
object in space-time, or the local rate down to zero.
Which leaves though both sides having brought down the
others' reasoning, while still having to leave them together.
Then, this leads immediately to my slates and the state of
modern axiomatics in continuum analysis, neatly out.
Sergio
2022-09-06 14:12:41 UTC
Permalink
Post by Fritz Feldhase
Post by FromTheRafters
Proof (by induction): E(1) = IN, hence E(1) is infinite. [...]
E(1) does not equal the naturals in muckymath.
*sigh*
Hint: "With E(1) = ℕ all is said. But that should be known meanwhile." (WM, sci.math)
Hope this helps.
It doesn't. The index for the endsegment should be the same as the greatest element of the associated FISON *plus* one.
That would be possible, perhaps even better. But I have originally defined it in this way: F(n) = {1, 2, 3, ..., n}
E(n) = {n, n+1, n+2, ...}
E(n) then intersects F(n) at n when they are supposed to be the disjoint (complementary) subsets of the newly partitioned naturals. But okay, muckymath
is bulletproof with the axiom of because I (WM) said so.
Carry on.
so if he stops at k (FISON), then he really already started at k (Endsegment) ?

so the intersection of FISON(k) and Endesgment(k) is k
Ross A. Finlayson
2022-09-06 14:17:41 UTC
Permalink
Post by Sergio
Post by Fritz Feldhase
Post by FromTheRafters
Proof (by induction): E(1) = IN, hence E(1) is infinite. [...]
E(1) does not equal the naturals in muckymath.
*sigh*
Hint: "With E(1) = ℕ all is said. But that should be known meanwhile." (WM, sci.math)
Hope this helps.
It doesn't. The index for the endsegment should be the same as the greatest element of the associated FISON *plus* one.
That would be possible, perhaps even better. But I have originally defined it in this way: F(n) = {1, 2, 3, ..., n}
E(n) = {n, n+1, n+2, ...}
E(n) then intersects F(n) at n when they are supposed to be the disjoint (complementary) subsets of the newly partitioned naturals. But okay, muckymath
is bulletproof with the axiom of because I (WM) said so.
Carry on.
so if he stops at k (FISON), then he really already started at k (Endsegment) ?
so the intersection of FISON(k) and Endesgment(k) is k
In his McDuck cart with you right along, ....
FromTheRafters
2022-09-06 16:11:52 UTC
Permalink
Post by Sergio
Post by WM
Post by FromTheRafters
Post by Fritz Feldhase
Post by FromTheRafters
Proof (by induction): E(1) = IN, hence E(1) is infinite. [...]
E(1) does not equal the naturals in muckymath.
*sigh*
Hint: "With E(1) = ℕ all is said. But that should be known meanwhile."
(WM, sci.math)
Hope this helps.
It doesn't. The index for the endsegment should be the same as the
greatest element of the associated FISON *plus* one.
That would be possible, perhaps even better. But I have originally defined
it in this way: F(n) = {1, 2, 3, ..., n}
E(n) = {n, n+1, n+2, ...}
E(n) then intersects F(n) at n when they are supposed to be the disjoint
(complementary) subsets of the newly partitioned naturals. But okay,
muckymath is bulletproof with the axiom of because I (WM) said so.
Carry on.
so if he stops at k (FISON), then he really already started at k (Endsegment) ?
so the intersection of FISON(k) and Endesgment(k) is k
It looks that way to me. His first FISON's end should be one less than
his index for its associated endsegment.

These are well ordered sets and E(1) implies an associated ISON ending
in zero -- which is undefined in |N*. His

You can't just have a successor function, you need an initial element.
Zero is a bad choice for an initial element in the non-zero naturals.

There are those whom take the entire set {0,1,2,3,...} to be an
endsegment, but that was not stipulated in his "definition" and can
create more problems with his wishy-washy axioms.
Fritz Feldhase
2022-09-06 17:26:05 UTC
Permalink
Post by FromTheRafters
Post by Sergio
so the intersection of FISON(k) and Endesgment(k) is k
It looks that way to me.
Then look again, since it is {k}, not k.
Gus Gassmann
2022-09-06 17:32:54 UTC
Permalink
Post by Fritz Feldhase
Post by FromTheRafters
Post by Sergio
so the intersection of FISON(k) and Endesgment(k) is k
It looks that way to me.
Then look again, since it is {k}, not k.
It's {k}not easy... SCNR
Fritz Feldhase
2022-09-06 17:20:23 UTC
Permalink
Post by Sergio
so the intersection of FISON(k) and Endesgment(k) is k
No. It's {k}.
Sergio
2022-09-07 13:44:56 UTC
Permalink
Post by Fritz Feldhase
Post by Sergio
so the intersection of FISON(k) and Endesgment(k) is k
No. It's {k}.
correctomund{o}! it is a set for sure.
Sergio
2022-09-06 14:09:00 UTC
Permalink
Post by WM
Post by FromTheRafters
Post by Fritz Feldhase
Post by FromTheRafters
Proof (by induction): E(1) = IN, hence E(1) is infinite. [...]
E(1) does not equal the naturals in muckymath.
*sigh*
Hint: "With E(1) = ℕ all is said. But that should be known meanwhile." (WM, sci.math)
Hope this helps.
It doesn't. The index for the endsegment should be the same as the
greatest element of the associated FISON *plus* one.
You did not define it.
Post by WM
F(n) = {1, 2, 3, ..., n}
E(n) = {n, n+1, n+2, ...}
E(1) = ℕ = {1, 2, 3, ...}
And it would cause confusion to change that.
Regards, WM
Ross A. Finlayson
2022-09-06 14:11:12 UTC
Permalink
Post by Sergio
Post by WM
Post by FromTheRafters
Post by Fritz Feldhase
Post by FromTheRafters
Proof (by induction): E(1) = IN, hence E(1) is infinite. [...]
E(1) does not equal the naturals in muckymath.
*sigh*
Hint: "With E(1) = ℕ all is said. But that should be known meanwhile." (WM,
sci.math)
Hope this helps.
It doesn't. The index for the endsegment should be the same as the
greatest element of the associated FISON *plus* one.
You did not define it.
Post by WM
F(n) = {1, 2, 3, ..., n}
E(n) = {n, n+1, n+2, ...}
E(1) = ℕ = {1, 2, 3, ...}
And it would cause confusion to change that.
Regards, WM
It's only copies of references of real mathematical resources, anyways.
WM
2022-09-04 14:10:42 UTC
Permalink
Post by FromTheRafters
Post by WM
As soon as there is no longer an infinite common set, the next state of
affairs is a finite set by the very definition of endsegments, i.e., simple
mathematics: ∀k ∈ ℕ: E(k+1) = E(k) \ {k} .
If E(some natural number) is your endsegment, and it appears on both
sides of an equation, how does this equation 'define' what an
endsegment is?
With E(1) = ℕ all is said. But that should be known meanwhile.

Regards, WM
Sergio
2022-09-04 14:22:27 UTC
Permalink
Post by WM
Post by FromTheRafters
Post by WM
As soon as there is no longer an infinite common set, the next state of
affairs is a finite set by the very definition of endsegments, i.e., simple
mathematics: ∀k ∈ ℕ: E(k+1) = E(k) \ {k} .
If E(some natural number) is your endsegment, and it appears on both
sides of an equation, how does this equation 'define' what an
endsegment is?
With E(1) = ℕ all is said. But that should be known meanwhile.
Regards, WM
∀k ∈ ℕ: E(k+1) = E(k) \ {k} only shows the relationship between two adjacent endsegments.

it is not a step by step equation, that is bad math.
Fritz Feldhase
2022-09-04 02:21:19 UTC
Permalink
As soon as there is no longer an infinite common set, the next state of affairs is <bla>
Hint: For each and every n e IN there is a common infinte subset of the sets E(1), ..., E(n), namely E(n).

So no "next state of affairs".

You are incredible dumb, Mückenheim!
WM
2022-09-04 14:12:49 UTC
Permalink
Post by Fritz Feldhase
As soon as there is no longer an infinite common set, the next state of affairs is <bla>
Hint: For each and every n e IN there is a common infinte subset of the sets E(1), ..., E(n), namely E(n).
And other endsegments than indexed by each and every n e IN are not available and do not fill an infinite set and do not change the infinity of the common subset.

Regards, WM
Sergio
2022-09-04 14:24:06 UTC
Permalink
Post by WM
Post by Fritz Feldhase
As soon as there is no longer an infinite common set, the next state of affairs is <bla>
Hint: For each and every n e IN there is a common infinte subset of the sets E(1), ..., E(n), namely E(n).
And other endsegments than indexed by each and every n e IN are not available and do not fill an infinite set and do not change the infinity of the common subset.
Regards, WM
why are they "not available" ?

What is your common subset ?


any answers or are you just making stuff up ?
Fritz Feldhase
2022-09-02 14:42:45 UTC
Permalink
Post by William
b_n = [n,ω) is an interval of natural numbers. (ω is not an element of b_n for any n).
Well, let's say IN n [n,ω) is an interval of natural numbers. (ω is not an element of b_n for any n).
Post by William
The intersection is empty
Right.
Post by William
No,
Yes.
Post by William
the intersection is infinite
No, it isn't.
Post by William
since all sets contribute an infinite subset.
Nope, this fact doe NOT imply that the intersection of all b_n (with n e IN) is infinite . Non sequitur.

Und jetzt hau endlich ab, Du Spinner!
WM
2022-09-02 20:13:26 UTC
Permalink
Post by Fritz Feldhase
Post by William
b_n = [n,ω) is an interval of natural numbers. (ω is not an element of b_n for any n).
Well, let's say IN n [n,ω) is an interval of natural numbers. (ω is not an element of b_n for any n).
Post by William
The intersection is empty
Right.
Post by William
No,
Yes.
Post by William
the intersection is infinite
No, it isn't.
As soon as there is no longer an infinite common set, the next state of affairs is a finite set by the very definition of endsegments, i.e., simple mathematics: ∀k ∈ ℕ: E(k+1) = E(k) \ {k} .

To overlook this shows incompetence in mathematics and logic.

To deny it by the analogy that
∀k ∈ ℕ ∃m ∈ ℕ: k < m ==> ∃m ∈ ℕ ∀k ∈ ℕ: k < m
is an invalid conclusion, is an invalid conclusion and shows naivety.

Regards, WM
Sergio
2022-09-03 02:17:24 UTC
Permalink
Post by WM
Post by Fritz Feldhase
Post by William
b_n = [n,ω) is an interval of natural numbers. (ω is not an element of b_n for any n).
Well, let's say IN n [n,ω) is an interval of natural numbers. (ω is not an element of b_n for any n).
Post by William
The intersection is empty
Right.
Post by William
No,
Yes.
Post by William
the intersection is infinite
No, it isn't.
As soon as there is no longer an infinite common set,
there is no common infinite set.


Go back to your potentially infinite book, and find none of the math there applies to infinite sets.
Post by WM
the next state of affairs is a finite set by the very definition of endsegments, i.e., simple mathematics: ∀k ∈ ℕ: E(k+1) = E(k) \ {k} .
that equation does not define an endsegment.
Post by WM
To overlook this shows incompetence in mathematics and logic.
which you have in spades.
Post by WM
To deny it by the analogy that
∀k ∈ ℕ ∃m ∈ ℕ: k < m ==> ∃m ∈ ℕ ∀k ∈ ℕ: k < m
is an invalid conclusion, is an invalid conclusion and shows naivety.
red herring
Post by WM
Regards, WM
Ross A. Finlayson
2022-09-03 17:07:59 UTC
Permalink
Post by Sergio
Post by WM
Post by Fritz Feldhase
Post by William
b_n = [n,ω) is an interval of natural numbers. (ω is not an element of b_n for any n).
Well, let's say IN n [n,ω) is an interval of natural numbers. (ω is not an element of b_n for any n).
Post by William
The intersection is empty
Right.
Post by William
No,
Yes.
Post by William
the intersection is infinite
No, it isn't.
As soon as there is no longer an infinite common set,
there is no common infinite set.
Go back to your potentially infinite book, and find none of the math there applies to infinite sets.
Post by WM
the next state of affairs is a finite set by the very definition of endsegments, i.e., simple mathematics: ∀k ∈ ℕ: E(k+1) = E(k) \ {k} .
that equation does not define an endsegment.
Post by WM
To overlook this shows incompetence in mathematics and logic.
which you have in spades.
Post by WM
To deny it by the analogy that
∀k ∈ ℕ ∃m ∈ ℕ: k < m ==> ∃m ∈ ℕ ∀k ∈ ℕ: k < m
is an invalid conclusion, is an invalid conclusion and shows naivety.
red herring
Post by WM
Regards, WM
No it's:

∀k ∈ ℕ ∃m ∈ ℕ: k < m ==> ∀m2 ∈ ℕ ∃k2 ∈ ℕ ∃m3 ∈ ℕ: k2 < m3, ∃j ∈ ℕ: k2 < m, ~∃l ∈ ℕ, l < j, ~(m2< m3 ^ ~ m2 < m3)


I.e. there is "always only proving the properties of natural numbers
that have exists m>n while also not for zero".

I.e., saying "exists m , ..., in N", is follows "exists N, exists < in N, exists m in N, ...".
Ross A. Finlayson
2022-09-06 16:05:27 UTC
Permalink
Post by Ross A. Finlayson
Post by Sergio
Post by WM
Post by Fritz Feldhase
Post by William
b_n = [n,ω) is an interval of natural numbers. (ω is not an element of b_n for any n).
Well, let's say IN n [n,ω) is an interval of natural numbers. (ω is not an element of b_n for any n).
Post by William
The intersection is empty
Right.
Post by William
No,
Yes.
Post by William
the intersection is infinite
No, it isn't.
As soon as there is no longer an infinite common set,
there is no common infinite set.
Go back to your potentially infinite book, and find none of the math there applies to infinite sets.
Post by WM
the next state of affairs is a finite set by the very definition of endsegments, i.e., simple mathematics: ∀k ∈ ℕ: E(k+1) = E(k) \ {k} .
that equation does not define an endsegment.
Post by WM
To overlook this shows incompetence in mathematics and logic.
which you have in spades.
Post by WM
To deny it by the analogy that
∀k ∈ ℕ ∃m ∈ ℕ: k < m ==> ∃m ∈ ℕ ∀k ∈ ℕ: k < m
is an invalid conclusion, is an invalid conclusion and shows naivety.
red herring
Post by WM
Regards, WM
∀k ∈ ℕ ∃m ∈ ℕ: k < m ==> ∀m2 ∈ ℕ ∃k2 ∈ ℕ ∃m3 ∈ ℕ: k2 < m3, ∃j ∈ ℕ: k2 < m, ~∃l ∈ ℕ, l < j, ~(m2< m3 ^ ~ m2 < m3)
I.e. there is "always only proving the properties of natural numbers
that have exists m>n while also not for zero".
I.e., saying "exists m , ..., in N", is follows "exists N, exists < in N, exists m in N, ...".
That it's "<->".

Writing out what combines mutual implication instead of some otherwise
plain direct implication, is besides cases in logic, conclusions in logic.
Fritz Feldhase
2022-09-03 18:21:01 UTC
Permalink
Post by WM
∀k ∈ ℕ: E(k+1) = E(k) \ {k} .
that equation does not define an endsegment.
Right. But together with

E(0) it defined the sequence (E_n)_(n e IN) /of endsegments/ recursively.

From that sequence we may get the set of all endsegments:

ENDSEG := {E_n c IN : n e IN}.

Then we may define:

endsegement(E) :<-> E e ENDSEG.

Of course we may also define /endsegment/ directly:

endsegement(E) :<-> En e IN: E = E_n ,

and then define the set ENDSEG of all endsegments using /endsegement/:

ENDSEG := {E c IN : endsegement(E)}.
Post by WM
Post by WM
To deny it by the analogy that
∀k ∈ ℕ ∃m ∈ ℕ: k < m ==> ∃m ∈ ℕ ∀k ∈ ℕ: k < m
is an invalid conclusion, is an invalid conclusion and <bla bla>
Well, a "quantifier shift" is indeed a logical fallacy.

WM just likes to commit this error _whenever it's possible_.
Post by WM
red herring
This idiot does not understand ANY math.
Sergio
2022-09-03 20:23:14 UTC
Permalink
Post by Fritz Feldhase
Post by WM
∀k ∈ ℕ: E(k+1) = E(k) \ {k} .
that equation does not define an endsegment.
Right. But together with
E(0) it defined the sequence (E_n)_(n e IN) /of endsegments/ recursively.
ENDSEG := {E_n c IN : n e IN}.
endsegement(E) :<-> E e ENDSEG.
endsegement(E) :<-> En e IN: E = E_n ,
ENDSEG := {E c IN : endsegement(E)}.
Post by WM
Post by WM
To deny it by the analogy that
∀k ∈ ℕ ∃m ∈ ℕ: k < m ==> ∃m ∈ ℕ ∀k ∈ ℕ: k < m
is an invalid conclusion, is an invalid conclusion and <bla bla>
Well, a "quantifier shift" is indeed a logical fallacy.
WM just likes to commit this error _whenever it's possible_.
Post by WM
red herring
This idiot does not understand ANY math.
WM has the super Ego of a PHD in physics, and thinks he knows Math exceptionally well, however in this newsgroup he cannot get a passing grade in
beginning algebra.

Makes me think of one of the math Books he wrote, I think most of it is plagerized now, the book covers too much ground, too fast, and many sections
seem chopped out of other books.
Tom Bola
2022-09-03 21:19:31 UTC
Permalink
Post by Sergio
Post by Fritz Feldhase
Post by WM
∀k ∈ ℕ: E(k+1) = E(k) \ {k} .
that equation does not define an endsegment.
Right. But together with
E(0) it defined the sequence (E_n)_(n e IN) /of endsegments/ recursively.
ENDSEG := {E_n c IN : n e IN}.
endsegement(E) :<-> E e ENDSEG.
endsegement(E) :<-> En e IN: E = E_n ,
ENDSEG := {E c IN : endsegement(E)}.
Post by WM
Post by WM
To deny it by the analogy that
∀k ∈ ℕ ∃m ∈ ℕ: k < m ==> ∃m ∈ ℕ ∀k ∈ ℕ: k < m
is an invalid conclusion, is an invalid conclusion and <bla bla>
Well, a "quantifier shift" is indeed a logical fallacy.
WM just likes to commit this error _whenever it's possible_.
Post by WM
red herring
This idiot does not understand ANY math.
WM has the super Ego of a PHD in physics, and thinks he knows Math exceptionally well, however in this newsgroup he cannot get a passing grade in
beginning algebra.
Makes me think of one of the math Books he wrote, I think most of it is plagerized now, the book covers too much ground, too fast, and many sections
seem chopped out of other books.
It is also an abhoring kind of person...
Fritz Feldhase
2022-09-01 20:51:10 UTC
Permalink
Post by WM
Inclusion monotony proves that thre is an unchanging infinite subset to all the infinite sets.
No, it doesn't, Du psychotisches Arschloch voller Scheiße!
Post by WM
the intervals a_n = [0, ω + 1/n].
Mückenheim, Sie sind eindeutig nicht mehr ganz dicht.
Sergio
2022-09-01 21:18:05 UTC
Permalink
Post by WM
If you argue that all numbers leave the intersection but [a set of] infinitely many numbers do not leave the contributing endsegments, then you are outside of logic and reason.
Indeed. But there is no unchanging set of infinitely many numbers that does not "leave the endsegments" .
There is an infinite set not leaving.
Wrong, sets do not come and go as they please.
Post by WM
Inclusion monotony proves that thre is an unchanging infinite subset to all the infinite sets.
And just how does it prove it ? what is it ?

it is: one unchanging infinite subset to all the infinite sets

so Prove it. I dont see how you can do that, "All infinite sets" ?
Post by WM
There is only a decreasing sequence of sets
with no last element.
You cannot imagine a decreasing sequence of infinite sets?
Use the intervals a_n = [0, ω + 1/n].Their intersection ist infinite.
that's redundant, (you can throw 1/n out)

a_n = a_n+1 = a_n+2 so what is the intersection ?
Post by WM
Regards, WM
mitchr...@gmail.com
2022-09-04 20:23:57 UTC
Permalink
If you argue that all numbers leave the intersection but [a set of] infinitely many numbers do not leave the contributing endsegments, then you are outside of logic and reason.
Indeed. But there is no unchanging set of infinitely many numbers that does not "leave the endsegments" . There is only a decreasing sequence of sets
with no last element.
Who is going to put together infinite element set? A function projected by man still doesn't ever complete infinity.
zelos...@gmail.com
2022-09-05 05:34:24 UTC
Permalink
Post by ***@gmail.com
If you argue that all numbers leave the intersection but [a set of] infinitely many numbers do not leave the contributing endsegments, then you are outside of logic and reason.
Indeed. But there is no unchanging set of infinitely many numbers that does not "leave the endsegments" . There is only a decreasing sequence of sets
with no last element.
Who is going to put together infinite element set? A function projected by man still doesn't ever complete infinity.
It is not a computer function you retard

the set N is already infinite.
Loading...