Balanced Boolean function 2026-10-25
A Boolean function on a finite nonempty domain is balanced when it is zero on exactly half the inputs and one on the other half. For a one-bit domain, the balanced functions are and , while the remaining two functions are constant functions. The Deutsch algorithm distinguishes these two classes with one Boolean quantum oracle query in the absence of noise.
Continuous real-valued functions on a space with a countable dense subset are determined by their restrictions to that subset. The equality set of two such functions is closed and contains the dense subset. Hence there are at most such functions. If the domain is nonempty, distinct constant functions give the matching lower bound.
Cardinality of continuous real functions 2026-10-31
The set of continuous functions has cardinality . Constant functions provide the lower bound. Restriction to the dense set is injective, since continuity determines a function from its values there. Real sequences have cardinality , by encoding a sequence using its countably many rational lower cuts. Restriction therefore supplies the upper bound and Cantor-Schröder-Bernstein gives equality.
Composition of partial functions Created 2026-10-05 Updated 2026-11-05
For partial functions and , their function composition is defined precisely onFor example, composing with , as real partial functions, gives only on .
More generally, strict composition of partial functions makes defined only if every is defined and is defined on the resulting tuple. An argument discarded by the outer function must still be defined: the expression with the everywhere-zero constant function remains undefined at zero. A representation in a programming language using lazy evaluation therefore needs an explicit check of the intermediate definedness conditions.
Constancy theorem 2026-10-25
A differentiable function on an interval whose derivative is identically zero is a constant function. Indeed, for any two arguments , the mean value theorem on gives . For an interval with endpoints included, continuity at those endpoints is required. A disconnected domain may have different constants on different components.
Constant function Created 2026-09-24 Updated 2026-10-14
On a nonempty domain of a function , a constant function has one fixed value in its codomain:For example, on the real line is a horizontal graph. Its image of a function is the singleton even though its domain of a function has infinitely many inputs. A constant function from the real line to the real numbers has derivative zero and every nonzero real period of a function; there is no smallest positive period. It supplies a reference level from which variation can be measured.
A constant map between vector spaces is a linear map only when its value is the zero vector, since a linear map must preserve zero. A nonzero constant map is still an affine map. In a Fourier series, the constant term records the period average, while the other terms describe oscillation around that level.
Constant of integration Created 2026-10-14 Updated 2026-10-31
On a connected open interval, if , every antiderivative of has the form , where is a constant function. Indeed, two solutions satisfy : the zero derivative on a connected open set principle makes their difference constant. In one dimension, the mean value theorem proves this on any closed subinterval. [ref]
https://www.jirka.org/ra/html/sec_mvt.html. Lebl, Basic Analysis I, Proposition 4.2.6: zero derivative on an interval
An initial condition or boundary condition can determine . If a particular antiderivative is and , thenFor , and , this gives . Without that reference value, choosing simply selects one member of the family.
The freedom has a physical meaning in a simple kinematic model. A velocity , with constant acceleration , determines position only as . The initial condition selects ; changing the starting position does not change the prescribed velocity.
For the differential equation on , the antiderivative is . The boundary condition gives . Discarding the constant of integration therefore needs a specified condition or an approximation that quantifies its effect. On a domain with several connected components, the freedom is larger: antiderivatives on disconnected domains require a separate constant on each component.
If is an infinite set with its cofinite topology and is a Hausdorff space, every continuous map is a constant function. Otherwise two distinct image points would have disjoint open neighbourhoods. Their inverse images would be nonempty disjoint open sets of , contradicting its hyperconnected space property.
For example, from with its cofinite topology into the real line with its usual Euclidean metric is not continuous: the inverse image of the open interval is , which is not open in the infinite domain. A continuous real-valued readout on that domain can only report one value. Finite cofinite domains are different: their discrete topology allows arbitrary functions into any topological space.
A continuous map from a nonempty finite product space of infinite sets with their cofinite topologies to a Hausdorff space is a constant function. Fixing all but one coordinate gives a continuous map from an infinite cofinite topology, so changing that coordinate does not change the value. Any two points in a finite Cartesian product can be joined by finitely many one-coordinate changes. This proves the assertion. In particular every real-valued continuous function on is constant when is the real line equipped with the cofinite topology.
Decision-tree depth Created 2026-09-28 Updated 2026-10-14
The decision-tree depth of a Boolean function is the smallest possible maximum number of input coordinates queried along any root-to-leaf graph path of a decision tree computing :The actual depth of a particular decision tree can exceed this optimum. A constant function admits a depth-zero tree even though an inefficient algorithm could inspect its entire input before returning that constant. Expected query cost and coordinate revealment additionally require an input probability distribution; does not. The three-bit majority decision tree and three-bit parity both have optimal decision-tree depth three, although only the former has the two-query shortcuts described above.
Entire function Created 2026-09-24 Updated 2026-10-14
An entire function is a holomorphic function whose domain of a function is the whole complex plane. Its derivative exists at every . Every polynomial, the complex exponential function , the product , and the complex sine function are entire functions. The Taylor series of an entire function about any finite centre converges throughout the complex plane.
The complex exponential function is a particularly revealing entire function. Writing , Euler's formula givesThus the complex exponential function never takes the value zero. Conversely, for any , choose an argument of . All its preimages under the complex exponential function areHere is the real natural logarithm, and ranges over the integers. Substitution gives ; equality of moduli and arguments shows these are all the solutions. The complex exponential function therefore has image exactly , with infinitely many preimages for each nonzero value.
Under the complex exponential, vertical lines become circles, horizontal lines become rays, and inputs separated by 2 pi i have the same image
. Details. In the pictured vertical strip , the real part sets the modulus between and , while the imaginary part sets the argument modulo . The two drawn bands each make one full turn around the same annulus; their corresponding points differ by and have identical images. Allowing all real gives every positive modulus, so the whole complex plane covers every nonzero output.
An entire function has exceptionally strong global constraints. The Liouville theorem says that a bounded function which is also an entire function must be a constant function. Accordingly, the nonconstant entire functions above are unbounded somewhere in the complex plane, even when their restrictions to the real axis are bounded: the complex sine function satisfies , growing through the hyperbolic sine. The Little Picard theorem adds a different constraint: an unbounded nonconstant entire function still cannot leave two distinct complex values out of its image. These results make entire functions useful when global bounds or restrictions on the image can establish rigidity without solving for the function explicitly.
In the opening of his 1880 memoir, Émile Picard credits Karl Weierstrass with the terminology of entire functions and describes them by everywhere-convergent power series. [ref]
https://numdam.org/articles/10.24033/asens.187/. Picard, Mémoire sur les fonctions entières (1880), p. 145
Extreme value theorem Created 2026-09-24 Updated 2026-10-14
A real-valued function that is continuous on a nonempty compact space attains both a global minimum and a global maximum. In particular, for a continuous function on a nonempty closed interval, there are points such thatThe important word is “attains”: the best values occur at actual allowed inputs, rather than merely being approached. The interval version is [ref].
For a worked example, take on . Its global minimum is , and its global maximum is . Nonnegativity gives the first answer; on the specified closed interval gives the second. The endpoint is essential: looking only for a zero derivative would find the minimum and miss the maximum.
An attained minimum and maximum on a closed interval, compared with excluded endpoints and a discontinuous endpoint value
. Details. For comparison, the continuous function on the open interval has infimum and supremum , but neither is a value of . Even a closed domain is insufficient without continuity: define for , and . On , its supremum is , approached by for , but every function value is strictly less than . This endpoint change makes discontinuous, preventing attainment. On the unbounded real line, the continuous function has neither a global minimum nor a global maximum. These examples show what can fail when a hypothesis is dropped; functions outside the hypotheses may still have extrema.
The extreme value theorem is an existence tool for optimization: first establish that a continuous objective function on a nonempty compact feasible set has a best value, then investigate where it occurs. It neither locates the optimizing point nor promises uniqueness or differentiability. For example, the absolute value function on has its global minimum at zero although no derivative exists there; a constant function has every input as a minimizer. This role in optimization is explained in University of Toronto MAT237 notes, section 1.4: compactness and the extreme value theorem.
A short proof outline identifies the mechanism. The continuous image of a compact space is compact; a nonempty compact subset of the real line contains its infimum and supremum. For a closed interval, one can instead choose inputs whose outputs approach the supremum, extract a convergent subsequence by the Bolzano-Weierstrass theorem, and use continuity to make its limiting output equal that supremum. The closed interval retains the limiting input. Repeating the argument for the infimum supplies the minimum.
Finite coloring Created 2026-09-24 Updated 2026-10-07
Finite Ramsey theorem Created 2026-09-24 Updated 2026-10-14
Fix positive integers with . There is an integer , depending only on , such that every finite coloringhas a subset of size for which the restriction of a function to is a constant function. Here , and denotes the collection of all -element subsets of , rather than its binomial coefficient cardinality. The notation abbreviates this property. Thus is a homogeneous set for a colouring; when , the monochromatic set consists of its -element subsets, not its individual elements. This is the finite assertion in Ramsey's original Theorem B, p. 267.
For , this is the pigeonhole principle, with sharp threshold . For instance, every red-blue coloring of five objects has three of one color; four objects can split two and two. For , and , the sharp threshold is six, as shown by the Ramsey number for triangles. Coloring pairs makes this a problem about edges of a complete graph. For larger , the analogous viewpoint uses a hypergraph.
The finite Ramsey theorem lets an existence argument discard most of a large finite set while retaining a prescribed amount of uniform structure. Its threshold applies to every coloring; one does not need an assumption that colors were assigned randomly. A diagonal compactness argument deduces finite existence from Ramsey's theorem, but does not by itself identify the smallest threshold. For pairs, a Ramsey number makes that optimization explicit.
Finite-rank operator Created 2026-09-24 Updated 2026-11-05
A finite-rank operator is a linear map whose image is finite-dimensional. A bounded finite-rank operator between normed spaces is compact: the image of its unit ball is bounded inside a finite-dimensional subspace, where bounded sets have compact closure.
For example, on has one-dimensional image, consisting of constant functions. Boundedness follows from Cauchy-Schwarz. Finite rank alone does not supply continuity for an arbitrary everywhere-defined linear map on an infinite-dimensional normed space; the compactness assertion requires the boundedness hypothesis.
Fourier series Created 2026-09-24 Updated 2026-10-13
A Fourier series describes a periodic function through sines and cosines whose frequencies are integer multiples of one base frequency. These Fourier harmonics give a useful alternative to describing the value at every input: each Fourier coefficient measures how much of one oscillating pattern is present. For a real, integrable function of period , the real form isThe cosine formula includes ; the sine formula uses . Thus is the mean value over a period, not itself. The symbol associates a function with its Fourier coefficients; an equality requires a specified kind of convergence, such as pointwise convergence. For general period , replace by and the coefficient prefactor by . Fourier orthogonality explains why integrating against one mode removes the others. [ref]
https://ocw.mit.edu/courses/res-18-015-topics-in-fourier-analysis-spring-2024/mitres_18_015_s24_lec01.pdf. Daniel Stroock, Basic Theory of Fourier Series: orthogonality and periodic expansions
.For a finite example, takeIts mean is , its real Fourier coefficients are , , , and all other vanish. At , the three contributions add to . The function is already a trigonometric polynomial, so retaining these modes reconstructs it exactly. Here is an angular coordinate in radians; if it instead represents time, a base angular frequency must supply the corresponding units.
The change of viewpoint is useful because many linear problems act separately on these modes. The second derivative maps to and maps in the same way. Consequently a differential equation that is complicated for a whole profile can become a simpler calculation for each Fourier harmonic. A linear time-invariant system similarly has a separate response to each complex exponential. Superposition combines the responses when the relevant sums and operations are justified. [ref]
https://ocw.mit.edu/ans7870/18/18.013a/textbook/HTML/chapter30/section08.html. MIT Calculus with Applications, section 30.8: Fourier series and forced responses
.The infinite case contains a subtlety absent from the finite example. Under pointwise convergence of a piecewise smooth Fourier series, the value at a jump discontinuity is the average of the two one-sided limits. For a square-integrable function, the complex Fourier series instead converges in the norm: the integrated squared error tends to zero. Neither statement says that the error becomes small everywhere at once. A square wave shows the difference vividly through the Gibbs phenomenon.
A historical source for this connection between profiles and modes is Joseph Fourier's 1822 book Théorie analytique de la chaleur. Chapter III develops expansions in sines and cosines while studying the propagation of heat. The heat equation gives a continuing application of this approach. [ref].
Full transformation monoid 2026-10-14
The full transformation monoid consists of every self-map of , with function composition as its binary operation. For , there are four functions: the identity function , the swap , and the constant functions . Their composition order matters: , whereas . Thus associativity does not imply commutativity.
Only and are bijections, and their inverse elements are themselves. They form a two-element group within this monoid. The constant functions instead satisfy and , so they are idempotent elements of a semigroup. Such irreversible transformations explain why the monoid setting is useful even when a group would be too restrictive.
Function class Created 2026-09-29 Updated 2026-11-05
A function class is a set whose elements are functions, usually with a common domain of a function and codomain. For example,is a class of constant functions. A function class need not be a vector space: here has constant value two and lies outside .
An individual member is a function, or map; the class collects such members. This keeps statements about one transformation distinct from statements about a family of possible transformations.
Fundamental period of a function Created 2026-10-14 Updated 2026-10-20
The fundamental period is the least positive period of a function, when one exists. For it is one; for it is . A periodic function need not have a fundamental period: a constant function has every positive period, and periodic function without a least positive period is a nonconstant exception. Every nonconstant real-valued function that is continuous and periodic on the real line does have a least positive period.
Interval root exclusion 2026-10-14
Interval root exclusion certifies that a function has no zero of a function on when a valid interval enclosure excludes zero. For on , the interval square range yields , which excludes zero. Direct interval arithmetic yields and is inconclusive, even though the function has no zero of a function there.
Knowing only that a calculated interval enclosure contains zero does not certify a zero of a function: it may contain unattainable values. Even the positive constant function has a valid, loose interval enclosure . A separate existence argument, such as reliable opposite endpoint signs together with continuity in the intermediate value theorem, is required; see root bracket and bisection method. Interval subdivision can resolve some inconclusive pieces, but remaining pieces must be reported as unresolved unless an existence argument succeeds. This makes interval root exclusion useful for systematically discarding regions in a search.
// Target: analysis.bigb



