Description: Define a general-purpose
operation that builds an infinite sequence
(i.e. a function on the natural numbers ) whose value at an index
is a function of its previous value and the value of an input sequence
at that index. This definition is complicated, but fortunately it is
not intended to be used directly. Instead, the only purpose of this
definition is to provide us with an object that has the properties
expressed by seq1 4670 and seqsuc 4671. Typically, those are the main
theorems that would be used in practice.
The first operand is the operation that is applied to the previous value
and the value of the input sequence (second operand). For example, for
the operation ,
an input sequence
with values 1, 1/2, 1/4,
1/8,... would be transformed into the output sequence  
with values 1, 3/2, 7/4, 15/8,.., so that       ,
      3/2, etc. In other words,
 
transforms a sequence into an infinite series.
  means "the sum of F(n)
from n = 1 to infinity
is 2". Since limits are unique (climuni 4884), then by eusn 1913
and
unisn 1932 the "sum of F(n) from n = 1 to
infinity" can be expressed as
     (provided the sequence converges) and
evaluates to 2 in this example.
Internally, a recursive function is defined whose values are ordered
pairs starting at        . The first member of the
ordered pair is a counter used to select the appropriate value of the
input sequence .
The first
constructs this function
on , and the
converse of the second maps to
. |