Agnew's theorem characterizes term rearrangements that preserve convergence of series. It was proposed by American mathematician Ralph Palmer Agnew.
Let p be a permutation of , i.e., a bijective function . Then the following two statements are equivalent: [1]
Let us split in intervals:
where and for any .
Let us also consider a permutation composed of an infinite number of permutations that permute numbers within corresponding intervals:
Since each maps to itself, it follows that maps to:
Hence, the total number of intervals in the image under of equals 1 plus whatever number of additional intervals is created by .
Permutation can create at most additional intervals by mapping the first half of its interval, , in an interleaving fashion:
If the lengths of the intervals are bounded, i.e., , then permutation can create at most additional intervals, fulfilling the criterion in Agnew's theorem. Therefore, any may be used.
This means that the terms of any convergent series may be rearranged freely within groups, if the lengths of these groups are bounded by a constant.
Permutations that mirror their interval:
permutations that perform right circular shifts of their interval by positions ():
and permutations that are the inverses of the interleaving permutations described above:
all create 1 additional interval, fulfilling the criterion in Agnew's theorem.
Permutations that rearrange their interval as blocks can create at most additional intervals. If the number of these blocks is bounded, then the criterion in Agnew's theorem is fulfilled.
This means that within groups of arbitrary unbounded length the terms of any convergent series may be mirrored, circularly shifted and rearranged in blocks (if the number of these blocks is bounded by a constant); terms at even positions within groups may be gathered at the beginning of the group (in the same order).
The permutations described by Agnew's theorem can transform a divergent series into a convergent one. Let us consider a permutation as described above with intervals increasing and being interleaving permutations described above. Such does not fulfill the criterion in Agnew's theorem, therefore, there exists a convergent series such that is either divergent or converges to a different sum. But it can't converge to a different sum: the inverse permutation is composed of inverses of interleaving permutations , which all fulfill the criterion in Agnew's theorem, therefore would converge to the same sum as . This means that must be divergent.
However, if we require both and to satisfy the criterion in Agnew's theorem, then will preserve both convergence (with the same sum) and divergence. (If it didn't preserve divergence, then the inverse wouldn't preserve convergence.)
In fact, such permutations preserve absolute convergence (with the same sum), conditional convergence (with the same sum) and divergence. (All permutations preserve absolute convergence with the same sum; a conditionally convergent series can't be turned into an absolutely convergent one because the reverse permutation wouldn't preserve absolute convergence.)
This means that, when dealing with a series for which it is unknown whether it converges and what type of convergence it has, its terms may be rearranged using permutations , such that both and map to at most intervals, without changing the type of convergence/divergence of the series.
In mathematics, a series is, roughly speaking, the operation of adding infinitely many quantities, one after the other, to a given starting quantity. The study of series is a major part of calculus and its generalization, mathematical analysis. Series are used in most areas of mathematics, even for studying finite structures through generating functions. In addition to their ubiquity in mathematics, infinite series are also widely used in other quantitative disciplines such as physics, computer science, statistics and finance.
In mathematics, the branch of real analysis studies the behavior of real numbers, sequences and series of real numbers, and real functions. Some particular properties of real-valued sequences and functions that real analysis studies include convergence, limits, continuity, smoothness, differentiability and integrability.
In the mathematical field of analysis, uniform convergence is a mode of convergence of functions stronger than pointwise convergence. A sequence of functions converges uniformly to a limiting function on a set as the function domain if, given any arbitrarily small positive number , a number can be found such that each of the functions differs from by no more than at every pointin. Described in an informal way, if converges to uniformly, then how quickly the functions approach is "uniform" throughout in the following sense: in order to guarantee that differs from by less than a chosen distance , we only need to make sure that is larger than or equal to a certain , which we can find without knowing the value of in advance. In other words, there exists a number that could depend on but is independent of , such that choosing will ensure that for all . In contrast, pointwise convergence of to merely guarantees that for any given in advance, we can find such that, for that particular, falls within of whenever .
In calculus, Taylor's theorem gives an approximation of a -times differentiable function around a given point by a polynomial of degree , called the -th-order Taylor polynomial. For a smooth function, the Taylor polynomial is the truncation at the order of the Taylor series of the function. The first-order Taylor polynomial is the linear approximation of the function, and the second-order Taylor polynomial is often referred to as the quadratic approximation. There are several versions of Taylor's theorem, some giving explicit estimates of the approximation error of the function by its Taylor polynomial.
In mathematics, the floor function (or greatest integer function) is the function that takes as input a real number x, and gives as output the greatest integer less than or equal to x, denoted ⌊x⌋ or floor(x). Similarly, the ceiling function maps x to the smallest integer greater than or equal to x, denoted ⌈x⌉ or ceil(x).
In mathematics, a power series is an infinite series of the form
In mathematics, an infinite series of numbers is said to converge absolutely if the sum of the absolute values of the summands is finite. More precisely, a real or complex series is said to converge absolutely if for some real number Similarly, an improper integral of a function, is said to converge absolutely if the integral of the absolute value of the integrand is finite—that is, if A convergent series that is not absolutely convergent is called conditionally convergent.
In mathematics, the limit of a sequence is the value that the terms of a sequence "tend to", and is often denoted using the symbol. If such a limit exists, the sequence is called convergent. A sequence that does not converge is said to be divergent. The limit of a sequence is said to be the fundamental notion on which the whole of mathematical analysis ultimately rests.
In mathematics, an alternating series is an infinite series of the form
In mathematical analysis, Cesàro summation assigns values to some infinite sums that are not necessarily convergent in the usual sense. The Cesàro sum is defined as the limit, as n tends to infinity, of the sequence of arithmetic means of the first n partial sums of the series.
In mathematics, more specifically in mathematical analysis, the Cauchy product is the discrete convolution of two infinite series. It is named after the French mathematician Augustin-Louis Cauchy.
In mathematical analysis, the alternating series test is the method used to show that an alternating series is convergent when its terms (1) decrease in absolute value, and (2) approach zero in the limit. The test was used by Gottfried Leibniz and is sometimes known as Leibniz's test, Leibniz's rule, or the Leibniz criterion. The test is only sufficient, not necessary, so some convergent alternating series may fail the first part of the test.
In mathematics, a series is the sum of the terms of an infinite sequence of numbers. More precisely, an infinite sequence defines a series S that is denoted
In mathematics, the Riemann series theorem, also called the Riemann rearrangement theorem, named after 19th-century German mathematician Bernhard Riemann, says that if an infinite series of real numbers is conditionally convergent, then its terms can be arranged in a permutation so that the new series converges to an arbitrary real number, or diverges. This implies that a series of real numbers is absolutely convergent if and only if it is unconditionally convergent.
In mathematics, specifically functional analysis, a series is unconditionally convergent if all reorderings of the series converge to the same value. In contrast, a series is conditionally convergent if it converges but different orderings do not all converge to that same value. Unconditional convergence is equivalent to absolute convergence in finite-dimensional vector spaces, but is a weaker property in infinite dimensions.
In number theory, the law of quadratic reciprocity, like the Pythagorean theorem, has lent itself to an unusually large number of proofs. Several hundred proofs of the law of quadratic reciprocity have been published.
In mathematics, convergence tests are methods of testing for the convergence, conditional convergence, absolute convergence, interval of convergence or divergence of an infinite series .
In mathematics, especially measure theory, a set function is a function whose domain is a family of subsets of some given set and that (usually) takes its values in the extended real number line which consists of the real numbers and
In mathematics, for a sequence of complex numbers a1, a2, a3, ... the infinite product
In analytic number theory, a Dirichlet series, or Dirichlet generating function (DGF), of a sequence is a common way of understanding and summing arithmetic functions in a meaningful way. A little known, or at least often forgotten about, way of expressing formulas for arithmetic functions and their summatory functions is to perform an integral transform that inverts the operation of forming the DGF of a sequence. This inversion is analogous to performing an inverse Z-transform to the generating function of a sequence to express formulas for the series coefficients of a given ordinary generating function.