Take , the nonnegative integers, and , the positive integers. Choose the injections
Here is an inclusion map, while reaches only the positive even integers. In particular, is not a bijection: it misses every positive odd integer. Simply using the inverse function of on its image misses input zero.
The remedy is to follow the alternating injections starting at the missing input zero:
The subscripts distinguish an input in from an output in , even when their numerical values agree. The resulting subset of is . Its sequence of members satisfies and , giving by mathematical induction. Define the function
Figure 1.
A bijection moves only the sequence
. The upper row alternates the original injections and . Solid blue arrows are the chosen bijection on ; dashed gray arrows only continue the chain. Below, examples outside use and keep their numerical values. Every displayed number belongs to the explicitly constructed example. Details.
The image covers all the positive members of exactly once. The other inputs cover exactly once by staying fixed. These output sets are disjoint and their union is , proving that is a bijection. In particular, , , , while and .
For completeness, its inverse function is
The familiar bijection also works, but this example shows something more specific: the two chosen injections can repair the missing zero by moving only a sparse sequence of inputs. The repair never has to shift the entire set.
Spectral Weyl sequence Created 2026-10-06 Updated 2026-11-05
For a bounded self-adjoint operator , a spectral Weyl sequence at consists of unit vectors with . Such a sequence exists exactly at points of the spectrum of a bounded operator. If no sequence exists, the shifted operator is bounded below, with closed range and zero kernel. Self-adjointness then makes its range dense, so it is invertible. This spectral criterion is different from the equidistribution Weyl criterion.
Suppose are bounded functions on the same nonempty set, and the supremum norm of their difference is at most . Then their optimal values differ by at most the same amount:
Indeed, for every , so ; exchange and for the other direction. Adding a constant shifts a supremum by that constant, a basic compatibility between upper bounds and addition.[ref]
For a chosen example on , take and . Their supremum error is , since . Completing the square gives
Thus has maximum zero at , while has maximum at . The change in optimal value, , is smaller than the certified bound . For the vertical translation , the bound is exact: its supremum error and optimal-value change are both .
Figure 1.
Uniform error controls the optimal value; maximizing inputs require additional control
. Original polynomial examples on . Left: and lie within a vertical error band of , while their maxima differ by . Right: the small tilts and have maximizing inputs and for every ; solid lines use and dashed lines use . These chosen examples are not measured errors or claims about an arbitrary optimizer. Details.
A stable optimal value does not guarantee a stable maximizing input. On , the two linear functions and satisfy
For every positive , their unique maximizing inputs remain two units apart, at and . Both functions approach the flat zero function, which has many maximizing inputs. Consequently an accurate objective function value is not by itself a certificate that the optimizing decision is accurate.
The estimate also gives a convenient consequence of uniform convergence. If converges uniformly to a bounded function on a nonempty , then for the bounded tail of the sequence. Uniform control handles the changing input that defines the best value. Pointwise convergence alone supplies no such control; the existing examples under uniform convergence illustrate that distinction.
Let and give each factor of the usual topology of the real line. The familiar standard basis vectors extend to unit sequences with when and zero otherwise. Their finite linear combinations are exactly the finitely supported sequences, rather than all of .
For every fixed coordinate , for all . Therefore in the product topology. More directly, any basic cylinder set containing zero contains every with : all of its tested coordinates are then zero. The moving unit entry escapes every fixed finite collection of observations.
Figure 1.
A moving unit entry escapes each fixed finite-coordinate cylinder
. Only coordinates 1 and 3 are tested in the displayed cylinder, with values required to lie between minus one-half and one-half. All later coordinates remain unrestricted. The finite display illustrates the pattern; the threshold argument in the text applies to every finite coordinate set. Details.
In the l-infinity sequence space of bounded real sequences, however,
Thus the same sequence does not converge to zero in the supremum norm. Here the comparison is between the subspace topology inherited from the product topology and the norm topology on . The supremum norm is not a finite-valued norm on all of , which also contains unbounded sequences. In the box topology on , the neighborhood of zero excludes every , so is not a convergent sequence with limit zero there either.
Stateless iterator 2026-10-24
An iterator whose future observable sequence can be produced without changing cursor state. An infinite constant sequence is an example: removing its first element leaves the same sequence. A permanently empty iterator is another. Such cases show why an iterator interface does not logically force every implementing object to be mutable, although ordinary finite nonempty traversals need progress state somewhere.
Strict buffer 2026-10-31
A process with finite positive capacity whose output sequence is a prefix of its input sequence and whose input-output length discrepancy never exceeds that capacity. While active, it offers input whenever non-full and output whenever nonempty; upstream closure drains retained data, while downstream closure cancels delivery.
A strictly increasing subsequence selects indices of a sequence with . Equal values cannot both occur in it. Its maximum possible length is , with ; in general for the weak longest increasing subsequence. Use strict comparisons in the dynamic programming recurrence relation and replace the first tail at least as large as the next value in the binary search algorithm.
Strong operator topology Created 2026-09-28 Updated 2026-11-05
On the bounded linear operators between normed vector spaces, the strong operator topology is generated by the seminorms , one for every . Thus a net converges to precisely when for each fixed vector . This defines a topology, including cases where sequences alone do not characterize it.
Convergence in operator norm implies convergence in the strong operator topology, since . The converse fails even for orthogonal projections. On the Hilbert space , let retain the first coordinates. The tail of a square-summable sequence tends to zero, so for every , but . An increasing sequence of finite-dimensional approximations can therefore converge strongly without uniformly approximating every unit vector.
Subscript 2026-11-05
A subscript is a component placed below the usual baseline of a base expression, commonly at a smaller size. It can label a term of a sequence, as in , or identify a matrix entry, as in . Its position does not by itself determine the mathematical meaning of the label.
In TeX, x_i attaches a single-token subscript, while x_{i+1} groups a compound subscript. In MathML, msub supplies a base and subscript as separate children. Their layout uses baseline shifts and clearances rather than putting both components on the ordinary text baseline.[ref]
For example, keeps together as one attached component. A mathematical typesetting style controls the treatment of the smaller expression. An OpenType MATH table can supply the font-specific placement data. This is why adding an underscore as an ordinary printed glyph would not reproduce the layout.
Subsequential limit Created 2026-10-14 Updated 2026-10-25
A subsequential limit of a sequence is a value approached by some subsequence with strictly increasing indices . For , the subsequences at even integers and odd integers give subsequential limits one and minus one. A finite value appearing among only finitely many initial terms does not become a subsequential limit merely by being a member of the image of a function represented by the sequence.
For a bounded sequence of real numbers, its subsequential limits form a nonempty bounded set that is also a closed set. The Bolzano-Weierstrass theorem guarantees nonemptiness, and its extreme values are the limit inferior and limit superior. The sequence in sparse peaks can determine a limit superior has the two subsequential limits zero and one, despite almost all indices in the natural density sense carrying zero.
Subshift of finite type 2026-10-14
A subshift of finite type is a closed subset of a finite-alphabet full shift defined by finitely many forbidden finite words, with the restricted left shift. After replacing symbols by sufficiently long blocks, its constraints can be described by a zero-one symbolic transition matrix. In this presentation, membership means that every consecutive pair follows an allowed transition. The resulting sequence space is a compact metric space and the restricted left shift is a homeomorphism.
Subtree-size balance 2026-10-24
The condition that each binary-tree vertex has child subtrees whose node counts differ by at most one. Recursively choosing the middle entry of an index interval establishes this condition at every vertex, with exactly one allocated node per entry. No ordering assumption on the stored values is needed for the balance property or for reproducing the input's inorder sequence.
Suffix sum Created 2026-10-20 Updated 2026-11-05
For a finite sequence , its suffix sums are , with . They satisfy , so one backward pass computes all of them in additions.
For , the suffix sums are including the empty suffix. A range sum on is . Thus suffix sums provide the same constant-time range queries as prefix sums, with the accumulation direction reversed.
Sum Created 2026-09-24 Updated 2026-11-05
A finite sum is the result of repeated addition of its terms, written for example . The empty sum is zero. In an abelian group, associativity and commutativity make a finite sum independent of its grouping and the order of its terms.
For an infinite sequence of real or complex terms, a sum requires a limit of a sequence: the partial sums must converge to a finite value. This is a convergent series. For example, , while has no finite sum. Writing a summation symbol alone does not establish convergence.
If a sequence in a metric space has , the triangle inequality gives for . The tail of this convergent series tends to zero and bounds every later pair, proving the Cauchy sequence condition. In particular, an increment bound with and gives by the geometric series. Unlike checking a small latest step, this bounds all remaining movement.
This sufficient condition is not necessary. The real sequence converges to zero and is therefore a Cauchy sequence, although has a divergent sum. Cancellation allows convergence despite infinite accumulated absolute values of the successive changes.
Suppose a numerical sequence has period from index , and let . For with , split the required sum into complete periods and a tail of length . Every complete period contributes , proving the formula in the title. Precomputed prefix sums of one period make the tail lookup constant time. If this periodic sequence consists of the first differences of another sequence, the same formula extrapolates that original sequence by adding the initial value at .
Supremum can fail to be attained at an oscillatory endpoint Created 2026-10-06 Updated 2026-11-05
Define a bounded function on by
It is continuous away from zero, but its supremum is and it has no global maximum. For every , , and . On the other hand,
The strict pointwise bound proves nonattainment, while this sequence proves that no smaller upper bound works. The extreme value theorem fails to apply because of the discontinuity at zero. Defining an endpoint value below its oscillatory limit superior cannot repair that missing hypothesis.
Symbolic potential Created 2026-10-14 Updated 2026-11-05
A symbolic potential is a real-valued function on a symbolic sequence space, for example on a finite full shift. Its orbit sum
weights a length- orbit segment in a partition function. Here is the left shift. The potential can encode geometric contraction or a chosen statistical preference; it is not determined by the alphabet alone.
Its variation at depth is
Summable variations mean . If and agree on their first symbols, their shifted sequences agree for symbols at step . Therefore
The right side stays bounded independently of . This uniform orbit-weight distortion is what allows a reference tail to be changed without changing topological pressure.
For a potential depending only on , every variation with is zero. The choice generates independent-symbol weights, while a geometric potential of an expanding map instead describes inverse-branch contraction.
The tail diameter of a sequence in a metric space is , allowing . The bounds are nonincreasing as grows because fewer pairs remain. A sequence is a Cauchy sequence exactly when . The supremum need not be attained: for , even though no two finite terms achieve that difference. For , for every . For the harmonic numbers, for every , because each remaining tail is unbounded.