Additive composite expansion Created 2026-09-24 Updated 2026-10-14
An additive composite expansion combines an inner expansion and an outer expansion by subtracting their common behavior in the overlap region:
The subtraction removes the part counted twice. Near the boundary layer, the outer expansion cancels the overlap contribution; away from the boundary layer, the inner expansion cancels it. An error estimate is needed to establish accuracy across the whole domain.[ref]
For the singular perturbation problem , , , the outer solution is one, the leading inner expansion is , and their overlap is one. Thus . With , comparison with the exact normalized solution gives
The supremum norm error is therefore exponentially small on the entire interval, even though the outer solution alone has error one. This is an error bound for function values; errors in derivatives have additional powers of .
The composite satisfies the differential equation exactly but has right boundary condition . Dividing it by restores that boundary condition and recovers the exact solution. This example makes both the strength and the limit of matching explicit: it gives a global approximation, while finite- normalization can still carry information beyond every algebraic order.
Banach algebra Created 2026-09-24 Updated 2026-11-05
A Banach algebra is an associative algebra over or whose norm makes it a Banach space and satisfies submultiplicativity:
An identity is an additional assumption; when present, its normalization should be stated if needed. Submultiplicativity makes multiplication continuous, and completeness makes norm-controlled infinite algebraic operations possible.[ref]
Examples include bounded linear operators on a Banach space with composition and the operator norm, and continuous complex-valued functions on a compact Hausdorff space with pointwise multiplication and the supremum norm. The former is generally noncommutative, whereas the latter is commutative. A closed subalgebra of a Banach algebra inherits both the product estimate and completeness.
For , the powers satisfy , so the Neumann series constructs . This simple estimate connects analysis to invertibility and leads to the spectrum of an element and holomorphic functional calculus.
Banach star-algebra 2026-10-31
A Banach star-algebra is a complex Banach algebra equipped with a continuous algebra involution. Thus the involution is conjugate-linear, reverses products, and squares to the identity. Some conventions additionally require ; this is the isometric convention. In the unital case the involution fixes the unit. The C-star identity is a stronger additional condition. The algebra of continuous complex-valued functions on a compact Hausdorff space, with pointwise operations, complex conjugation and the supremum norm, satisfies both the isometric condition and the C-star identity.
Bellman equation Created 2026-09-24 Updated 2026-10-14
A Bellman equation expresses the dynamic programming principle as a recurrence relation for a value function: optimize the current reward plus the best attainable continuation. Let be a dynamic programming state, the allowed actions at time , the immediate reward, and the next dynamic programming state. With terminal time and terminal reward , the deterministic finite-horizon Bellman equation is
Here measures total reward from time through the terminal reward. Start with and evaluate backwards; the terminal condition anchors the recurrence relation. For finite nonempty action sets, finite rewards, and finite terminal rewards, a maximum exists at each step. If an optimum need not be attained, use a supremum. A minimization problem instead uses a minimum or infimum. The 0-1 knapsack problem above is the same comparison between an immediate item value plus a continuation and the continuation after skipping. See Bertsekas, MIT lecture 2: the backwards recursion.
In a Markov decision process, the next dynamic programming state is random. If denotes the expected immediate reward and is a discount factor, the finite-horizon Bellman equation becomes
The conditional expectation averages over the next dynamic programming state before choosing the current action; that action cannot use a future outcome that has not yet been observed. For a finite state space with transition probabilities , the continuation term is . Taking gives the undiscounted finite-horizon problem. With a discount factor , rewards steps ahead carry a factor , including the terminal reward. A maximizing action for each specifies a Markov policy, which contains decisions rather than just optimal scores.
For an infinite horizon with a finite state space, finite nonempty action sets, time-independent transition probabilities, bounded rewards , and a discount factor , the optimal value function satisfies
In this setting the maximizing dynamic programming operator is a contraction mapping in the supremum norm, so the Banach fixed-point theorem gives a unique bounded fixed point and convergence of repeated application to it. See Bertsekas, MIT lecture 15: bounded discounted problems. These hypotheses matter: with one state, one action, zero reward, and , the Bellman equation is merely , so every finite constant is a fixed point, although the actual total-reward value function is zero. The average-reward Bellman equation and Hamilton-Jacobi-Bellman equation address other settings with their own conditions.
Take the continuous function on . It is Lipschitz continuous with Lipschitz constant one, but is not differentiable at . For , the sample values are , so
This is already a useful warning: the Bernstein polynomial is built from grid values but is not generally their polynomial interpolation.
Figure 1.
Bernstein polynomials approximate the values of an absolute value function, including its corner
. The black target is on ; colored curves are the explicitly computed Bernstein polynomials of degrees , , , and . Each has exact endpoint values and a smooth middle. These are theoretical functions, not measured data. Details.
Every finite approximant is differentiable, and symmetry makes its derivative zero at the center. The target instead has left derivative and right derivative . Smooth curves can therefore approach a corner in supremum norm while their center derivatives have no target value to approach. The Lipschitz error bound for Bernstein approximation quantifies the improvement in values.
At the sampling point , the polynomial inside the Bernstein polynomial has value . The falling factorial identity and the binomial theorem prove the displayed formula. For fixed , both the input and its scalar factor tend uniformly to as grows. The supremum norm contraction of the Bernstein polynomial therefore gives for .
Given in a normed vector space and a vector subspace , an element is a best approximation if . Existence is automatic for a finite-dimensional vector subspace: a minimizing sequence can be bounded by the triangle inequality, and a subsequence converges by compactness in finite dimension. An arbitrary infinite-dimensional vector subspace need not contain a minimizer. The norm matters: best uniform approximation uses the supremum norm, while approximation minimizes integrated absolute error.
Bielecki norm method Created 2026-09-29 Updated 2026-11-05
The Bielecki norm method changes the norm used for an integral contraction mapping, allowing a larger time interval without changing the underlying continuous functions. On for a Banach space , use
For with a uniformly -Lipschitz continuous right-hand side,
Thus makes a contraction mapping. On a fixed finite interval this weighted supremum norm is equivalent to the usual one. The Banach fixed-point theorem applies when maps the chosen complete function space into itself.
For integration from to , the weight gives the alternative bound for . Both versions reduce the integral operator bound by choosing a weight, rather than by claiming that a local existence theorem automatically gives a global solution for an arbitrary nonlinear vector field.
Bounded continuous functions Created 2026-10-07 Updated 2026-10-14
Bounded continuous functions on a topological space form a Banach space with the supremum norm. A uniform limit is continuous and bounded, proving completeness. This space differs from the bounded uniformly continuous functions: free-transport composition is jointly continuous in time and position, but need not be continuous in the global sup norm as time varies.
Bounded Lipschitz norm 2026-10-14
The bounded Lipschitz norm combines the Lipschitz constant and supremum norm of a bounded real-valued Lipschitz function on a metric space. Both summands satisfy the triangle inequality; the supremum term makes the sum definite even on constant functions. Its unit ball requires the sum of the two bounds to be at most one, a stronger requirement than bounding each separately by one.
Bounded scalar functions on an index set Created 2026-10-05 Updated 2026-10-06
For an arbitrary set and scalar field , this is the space of bounded functions with the supremum norm . Uniform limits of Cauchy sequences prove it is a Banach space. For it is the l-infinity sequence space; for the empty index set it is the zero space, with norm zero.
B-spline interpolation operator norm Created 2026-10-07 Updated 2026-10-14
For distinct interpolation sites and an invertible B-spline collocation matrix, the interpolant is , where samples data and . Sampling and basis synthesis have operator norms at most one in the supremum norm. For the reverse inequality, realize the signs of a maximal absolute row sum of as values of a continuous function of norm one, and apply uniform-norm stability of a B-spline basis. This yields both displayed bounds.
For a nonnegative partition-normalized B-spline basis, the synthesis linear map has operator norm one. Its condition number is consequently , with the supremum norm on the spline space and the maximum norm on its coefficients. The uniform-norm stability of a B-spline basis bounds this number independently of the spline knot sequence when the order is fixed. This is different from the condition number of a particular sampled B-spline collocation matrix.
The displayed supremum norm is finite on every entire function, positive on every nonzero one by the identity theorem, and submultiplicative under pointwise multiplication. It is not complete: partial geometric sums are Cauchy on the disk but their limit there extends meromorphically with a pole at two. More generally, no complete algebra norm exists on all entire functions because the coordinate function has algebraic spectrum of an element equal to the whole complex plane.
Let and . The set is a compact metric space for the supremum norm metric. Every member is a sequence tending to zero.
For any sequence in , successively extract a convergent subsequence in each compact interval , then take diagonal indices. The coordinate limits define . For any , coordinatewise differences in the tail are bounded by , independently of the sequence index. This tends to zero as , while finitely many initial coordinates converge together. Hence the diagonal subsequence converges in the supremum norm. This proves sequential compactness, equivalent to compactness for metric spaces.
Compact-open topology Created 2026-09-28 Updated 2026-11-05
For topological spaces , the compact-open topology on has subbasic sets
where is compact and is open. Finite intersections of such conditions describe neighborhoods of a continuous map. This definition does not require a metric on either space.
For a metric target and continuous functions, it is the topology of uniform convergence on compact subsets. In the scalar case, the compact seminorms describe it. If is a locally compact space and a Hausdorff space, this compact control also agrees with locally uniform convergence, because each point has a compact neighborhood.
On , control on every interval is sufficient. It permits functions such as translated compactly supported bumps to converge to zero on every compact set while retaining the same global supremum norm. The compact-open topology records local approximation rather than a bound over an unbounded domain all at once.
The image of in the L1 space is a meagre set. The canonical map is a bounded linear operator from the Banach space with its supremum norm, since . It is not onto: the indicator of has no continuous function representative. Continuity would force values zero throughout and one throughout , contradicting continuity at . The operator range category dichotomy therefore proves the claim. Continuous ramps also show directly that this image is not closed, since their L1 norm distance to that indicator is for .
The continuous functions from the p-adic integers to the P-adic numbers form a Banach space over with supremum norm . Compactness of the domain bounds the norm, and uniform convergence in the complete codomain proves completeness. Translation and the forward difference operator are bounded operators, with .
C-star algebra Created 2026-09-24 Updated 2026-11-05
A C-star algebra is a complex Banach algebra with an algebra involution satisfying the C-star identity
The algebra involution is conjugate-linear, reverses products and obeys . An identity need not be present.[ref]
Examples include complex matrices with the operator norm and conjugate transpose, bounded linear operators on a Hilbert space with the operator adjoint, and on a Hausdorff space that is a locally compact space with pointwise complex conjugation and the supremum norm. The identity ties the norm to the algebraic product and involution: it implies spectral radius norm equality for normal elements and makes an injective C-star homomorphism an isometry. This rigidity permits continuous functional calculus for normal C-star elements.