3 added 76 characters in body

Hello,

Given a sequence $S$ indexed by the finite ordinals, a limit ordinal $\alpha$, and $k \in \mathbb{N}$, define $S_{\alpha+k}$(the extension of $S$ to $\alpha+k$) to be the sum over the products of all $k+1$ tuples of elements taken from {$S_\beta| \beta < \alpha$} if the sum exists. Also, define $(S+k)$ for $k \in \mathbb{N}$ to be the sequence $(S+k)_n = S_{k+n}$, essentially "dropping" the first k terms .up to index $k$.

For example, $S_\omega$ is the standard sum of a series from Calculus, $S_{\omega+1} = \sum_{n=1}(S_n \cdot \sum_{k=n+1}^\infty S_k)$, and in general $S_{\alpha+1} = \sum_{n=0}S_n sum_{n=1}S_n (S+n)_\alpha$.

I've managed to convince myself it has a few self-consistent properties:

• If $S_\alpha$ exists, then $(S+k)_\alpha$ exists.
• If $S_\alpha$ exists and $\beta < \alpha$, then $S_\beta$ exists.

My questions are:

1. Has this concept been studied before, and if so can you provide references? I'm more concerned about the formal properties of these sequences, such as the algebra it generates. I suspect there's some paper or book on Generating Functions that would cover it.

2. Given a set S of Complex numbers and an ordinal $\alpha$, you can create a new set $S_\alpha$ containing $s_\beta$ for every $\beta <= \alpha$ and every sequence $s$ of numbers taken from $S$. Is there a paper that gives more detail on this operation? Interesting choices for $S$ might be the set of all roots of unity, or the set of zeros from some analytic function.

3. Except for the constant 0 sequence, is it true that if you repeatedly transfinitely extend a sequence you will find a large enough ordinal where the sum does not exist? If so, what is the largest ordinal(or the supremum of all such ordinals) possible to extend a sequence to?

4. My definition should work for countable ordinals, but I'm not entirely sure it's well-defined for anything larger. Is there a more natural/general definition I should be using that captures the concept better?

Thank you,

-- Michael Burge

2 added 3 characters in body

Hello,

Given a sequence $S$ indexed by the finite ordinals, a limit ordinal $\alpha$, and $k \in \mathbb{N}$, define $S_{\alpha+k}$(the extension of $S$ to $\alpha+k$) to be the sum over the products of all $k+1$ tuples of elements taken from {$S_\beta| \beta < \alpha$} if the sum exists. Also, define $(S+k)$ for $k \in \mathbb{N}$ to be the sequence $(S+k)_n = S_{k+n}$, essentially "dropping" the first k terms.

For example, $S_\omega$ is the standard sum of a series from Calculus, and in general $S_{\alpha+1} = \sum_{n=0}S_n (S+n)_\alpha$.

I've managed to convince myself it has a few self-consistent properties:

• If $S_\alpha$ exists, then $(S+k)_\alpha$ exists.
• If $S_\alpha$ exists and $\beta < \alpha$, then $S_\beta$ exists.

My questions are:

1. Has this concept been studied before, and if so can you provide references? I'm more concerned about the formal properties of these sequences, such as the algebra it generates. I suspect there's some paper or book on Generating Functions that would cover it.

2. Given a set S of real Complex numbers and an ordinal $\alpha$, you can create a new set $S_\alpha$ containing $s_\beta$ for every $\beta <= \alpha$ and every sequence $s$ of numbers taken from $S$. Is there a paper that gives more detail on this operation? Interesting choices for $S$ might be the set of all roots of unity, or the set of zeros from some analytic function.

3. Except for the constant 0 sequence, is it true that if you repeatedly transfinitely extend a sequence you will find a large enough ordinal where the sum does not exist? If so, what is the largest ordinal(or the supremum of all such ordinals) possible to extend a sequence to?

4. My definition should work for countable ordinals, but I'm not entirely sure it's well-defined for anything larger. Is there a more natural/general definition I should be using that captures the concept better?

Thank you,

-- Michael Burge

1

# Transfinite Sums Related to a Sequence

Hello,

Given a sequence $S$ indexed by the finite ordinals, a limit ordinal $\alpha$, and $k \in \mathbb{N}$, define $S_{\alpha+k}$(the extension of $S$ to $\alpha+k$) to be the sum over the products of all $k+1$ tuples of elements taken from {$S_\beta| \beta < \alpha$} if the sum exists. Also, define $(S+k)$ for $k \in \mathbb{N}$ to be the sequence $(S+k)_n = S_{k+n}$, essentially "dropping" the first k terms.

For example, $S_\omega$ is the standard sum of a series from Calculus, and in general $S_{\alpha+1} = \sum_{n=0}S_n (S+n)_\alpha$.

I've managed to convince myself it has a few self-consistent properties:

• If $S_\alpha$ exists, then $(S+k)_\alpha$ exists.
• If $S_\alpha$ exists and $\beta < \alpha$, then $S_\beta$ exists.

My questions are:

1. Has this concept been studied before, and if so can you provide references? I'm more concerned about the formal properties of these sequences, such as the algebra it generates. I suspect there's some paper or book on Generating Functions that would cover it.

2. Given a set S of real numbers and an ordinal $\alpha$, you can create a new set $S_\alpha$ containing $s_\beta$ for every $\beta <= \alpha$ and every sequence $s$ of numbers taken from $S$. Is there a paper that gives more detail on this operation? Interesting choices for $S$ might be the set of all roots of unity, or the set of zeros from some analytic function.

3. Except for the constant 0 sequence, is it true that if you repeatedly transfinitely extend a sequence you will find a large enough ordinal where the sum does not exist? If so, what is the largest ordinal(or the supremum of all such ordinals) possible to extend a sequence to?

4. My definition should work for countable ordinals, but I'm not entirely sure it's well-defined for anything larger. Is there a more natural/general definition I should be using that captures the concept better?

Thank you,

-- Michael Burge