Re: A simple question about integers

From: Angus Rodgers (angus_prune_at_bigfoot.com)
Date: 09/15/04


Date: Wed, 15 Sep 2004 08:33:55 +0100

On Wed, 15 Sep 2004 08:31:08 +0200, Gottfried Helms
<helms@uni-kassel.de> wrote:

>Am 15.09.04 04:01 schrieb Eray Ozkural exa:
>> Angus Rodgers <angus_prune@bigfoot.com> wrote in message
>> news:<5lvdk0lnnki8hpsrlcj2ajfifltom9uud2@4ax.com>...
>>
>>>The long answer is also `no'. What I mean is that even
>>>if you try to embed Z into a larger structure which has
>>>some of the same properties as Z, but which also contains
>>>`numbers' with infinite decimal expansions, such as:
>>>
>>> ...57803170965
>>>
>>>- leaving aside the question of what this would `mean' -
>>>
>>>then you are not going to be able to define addition in
>>>your new structure in any way resembling addition in Z:
>>>because in a case where there is no `carrying' you will
>>>certainly want to perform addition digitwise (e.g. in Z,
>>>320 + 539 = 859 because 0 + 9 = 9, 2 + 3 = 5, 3 + 5 = 8),
>>>but this forces you to define the sum of the above number
>>>with the following (equally reasonable-looking) `number':
>>>
>>> ...42196829034
>>>
>>>as:
>>>
>>> ...99999999999
>>>
>>>and you will not even be able to add 1 to that `number'
>>>in any sensible-looking way.
>>>
>>>I don't see any way around this. Do you?
>>
>>
>> I don't either.
>>
>There are two more problems with that:
> such a definition, written down or not, introduces the
> concept of divergent series, where we know, that results
> may be arbitrary depending simply on the order of operations.
> [...]

That's not necessarily a problem, because there is no problem
with the concept of a formal power series - considered simply
as the sequence of ``detached coefficients'' of the powers of
a notional ``indeterminate'' (say \theta).

(This is a standard construction, identical with the standard
construction of polynomials, except that the requirement for
all but finitely many of the coefficients to be 0 is dropped.)

One could try to define, quite formally,

 (\sum a_n \theta^n) + (\sum b_n \theta^n) =
 \sum (a_n + b_n) \theta^n

 (\sum a_n \theta^n)(\sum b_n \theta^n) =
 \sum (\sum a_ib_{n - i}) \theta^n

where a_n, b_n are arbitrary integers, and there is an
equivalence relation by which one can reduce any formal
sum to one in which the coefficients are single digits
relative to the chosen base of numeration r (e.g. 10),
perhaps by taking the quotient by the principal ideal
<\theta - r>.

(This may be nonsense, of course - I stopped trying to
follow it through, when I realised you couldn't always
carry 1 when all but finitely many digits are = r - 1,
and you couldn't restrict yourself to sequences without
this property, as is shown by the example above.)

> the more serious problem in that way is, that with arbitray
> sequence of digits we even cannnot define a greater/smaller
> order between two such numbers... since they have no
> highest digit.

I don't think this is obvious. One could at least *try*
to define a structure of ``infinite nonnegative integers'',
considered as infinite decimal expansions (or expansions
to another base); define a < b if and only if there exists
c such that a + c = b; and then try to prove things about
this relation (such as totality, i.e. either a < b, a = b,
or a > b) - with the hope of then being able to embed this
``big N'' structure into a ``big Z'' structure, in much the
same way as Z can be constructed from N.

But none of this is any good if you have a ``number'', n,
for which you cannot even define n + 1 - so it all looks
pretty abortive, to me at least.

(Pity - it almost looked like fun for a while.)

-- 
Angus Rodgers
(angus_prune@ eats spam; reply to angusrod@)
Contains mild peril


Relevant Pages

  • Re: November 25 is Infinite Clause day!!
    ... infinite length are computable the conclusion of Cantor's proof relies ... on the existence of a new sequence of digits which is clearly non ... your construction can never be realised. ... places in the sequence are all covered. ...
    (sci.math)
  • Re: Ultimate debunking of Cantors Theory
    ... as a result of the construction. ... the Cantor construction fails in base 2. ... if one pairs off digits starting from the binary ... 1's while every list entry is a finite sequence of 1's. ...
    (sci.math)
  • Re: The complete infinite binary tree has only countably many infinite paths.
    ... ones from all paths used to construct the tree. ... And we know that a sequence with n digits is finite for ALL n. ... a sequence with n digits is a rational number. ... I have never seen a construction with infinitely many digits. ...
    (sci.logic)
  • Re: abundance of irrationals!)
    ... In the competition of having most digits 1 the list ... In my construction they win by 13: ... There we have all numbers with a finite sequence of digits 1. ...
    (sci.math)
  • Re: user defined function that converts string to float
    ... > I need user defined function that converts string to float in c. ... initial, possibly empty, sequence of white-space characters (as ... point character, then an optional exponent part as defined in ... then a nonempty sequence of hexadecimal digits ...
    (comp.lang.c)