Mathematics & Formal Systems¶

← Back to Domain-Specific Abstractions by Domain

376 domain-specific abstractions whose origin domain is Mathematics & Formal Systems.

(B, N) Pair — A BN-pair is an ambient group equipped with generating subgroups whose quotient-normalizer data form a Coxeter system and control Bruhat cells, parabolic subgroups, and building geometry.
A-paracompact Space — A topological space in which every open cover has a locally finite refinement, without requiring that the refining family itself be open.
AD+ — Woodin’s strengthening of the Axiom of Determinacy that combines dependent choice for reals, ordinal determinacy below Theta, and infinity-Borel definability for every set of reals.
Age (Model Theory) — The isomorphism-closed class of finitely generated structures that embed into a fixed model, recording exactly its finite or finitely generated local patterns.
Airy Process — A family of stationary stochastic edge-limit processes whose Fredholm-determinant finite-dimensional laws describe spatial KPZ and random-matrix fluctuations under characteristic initial geometries.
Aleksandrov–Rassias Problem — Ask when a mapping between real normed spaces that preserves one prescribed distance must preserve every distance and therefore be an isometry.
Alexander Duality — Convert reduced homology of the complement of a qualifying compact subspace of a sphere into reduced cohomology of the subspace with the exact degree reversal q ↦ n−q−1.
Algebra over a Ring — An R-module equipped with an R-bilinear internal multiplication, with associativity, unity, and commutativity imposed only at the explicitly declared convention tier.
Algebraic cobordism — Provide the universal oriented cohomology theory for smooth algebraic varieties, encoding projective pushforwards and first Chern classes through the universal one-dimensional commutative formal group law.
Algebraic stack — A stack with algebraic representability and smooth-cover conditions that generalizes schemes and algebraic spaces while retaining automorphism data in moduli problems.
Analytic semigroup — Extend a strongly continuous operator semigroup holomorphically into a complex-time sector, linking sectorial generators to parabolic regularization.
Antilinear Map — An additive map between complex vector spaces that transports scalar multiplication through complex conjugation, so A(lambda v) = conjugate(lambda) A(v) rather than lambda A(v).
Apollonian Gasket — An Apollonian gasket is the fractal residual structure of an infinite circle packing formed by recursively filling every curvilinear triangular gap among three mutually tangent circles with its uniquely tangent incircle.
Arithmetic Progression — Generate an ordered numeric sequence by repeatedly adding one fixed common difference, making every term affine in its discrete index.
Auslander–Reiten theory — A representation-theoretic framework organizing indecomposable modules and morphisms through almost-split sequences and Auslander–Reiten quivers.
Axiom of countable choice — Assert that every countable family of nonempty sets admits a choice function, retaining a strictly weaker set-theoretic commitment than full Choice and a different strength from Dependent Choice.
Aztec Diamond — Use an order-indexed diamond-shaped square-lattice region whose domino exact covers support a power-of-two enumeration, reversible shuffling, path representations, and an arctic-circle limit shape.
Bailey–Borwein–Plouffe Formula — A base-16 rational series for π whose radix alignment lets modular exponentiation recover hexadecimal or binary digits at a distant position without first generating the intervening expansion.
Bailout Embedding — Embed a dynamical system in a larger phase space whose transverse dynamics repel trajectories from unwanted unstable regions and contract them back onto selected stable invariant motion.
Balayage — An operator that sweeps an interior measure onto a domain boundary while preserving its Newtonian potential outside the closed domain.
Banach Space — Complete a normed real or complex vector space so every norm-Cauchy approximation sequence converges to an element of the same space, making limits compatible with linear combination and continuous-operator analysis.
Bates Distribution — The probability distribution of the arithmetic mean of n independent identically distributed uniform random variables, a scaled Irwin–Hall sum.
Bauer Maximum Principle — A convex upper-semicontinuous function on a nonempty compact convex set attains its maximum at an extreme point.
Baumslag–Gersten Group — The two-generator one-relator group whose conjugation tower couples an ascending HNN structure to unusually large filling complexity, non-residual finiteness, and a sharply non-elementary yet tractable word problem.
Bayes Factor — The ratio of the marginal likelihoods of the data under two specific models, isolating the data's weight of evidence between them and updating prior model odds to posterior odds multiplicatively — with an automatic Occam penalty on flexible models.
Bicyclic semigroup — Use the universal monoid generated by two elements whose product in one order is the identity while the reverse product is not, yielding a canonical countable inverse-semigroup test object.
Binary relation — Represent which ordered pairs from two declared sets stand in a relation by selecting a subset of their Cartesian product, enabling converse, composition, closure, and relational properties.
Bisection Method — Locate a zero of a continuous real function by preserving an opposite-sign interval and repeatedly replacing it with the sign-changing half, obtaining a deterministic enclosure whose width halves at every step.
Bockstein homomorphism — Construct the degree-shifting connecting homomorphism in homology or cohomology induced by a short exact sequence of coefficient groups, detecting whether a class lifts through the middle coefficient object.
Borel Functional Calculus — Assign a Borel-measurable scalar function to an operator by integrating it against the operator's spectral measure, extending continuous and polynomial evaluation while preserving algebraic and spectral relations.
Borel Set — A subset generated from a topological space’s open sets by complement and countable union, equivalently an element of the topology-generated Borel σ-algebra.
Borel–de Siebenthal Theory — Classify connected maximal-rank subgroups of a compact connected Lie group by retaining a maximal torus and reading admissible full-rank root subsystems from its extended Dynkin diagram.
Boundary Value Problem — A differential equation on a domain paired with conditions on the domain's boundary, such that the interior solution is a derived consequence of the law plus the edge data rather than freely specified — the equilibrium counterpart of the marchable initial value problem.
Bounded deformation — Place a vector field in BD when its symmetrized distributional derivative is a finite Radon measure, retaining the infinitesimal-strain quantity required by elasticity and fracture while allowing more singular displacement behavior than bounded variation.
Box Spline — A compactly supported multivariate piecewise-polynomial function generated from a finite multiset of direction vectors, equivalently by repeated convolution of uniform segment measures or projection of a higher-dimensional box.
Bundle metric — A smoothly varying nondegenerate bilinear form on each fibre of a vector bundle.
Burnside Problem — Ask when a finitely generated group whose elements all have finite order must itself be finite, separating the general, bounded-exponent, and restricted finite-quotient versions whose answers differ.
Cage (Graph Theory) — An r-regular graph of girth g having the minimum possible number of vertices among all graphs with that degree and girth.
Caliber (mathematics) — Classify a cardinal as a caliber of a topological space when every equally large family of nonempty open sets contains an equally large subfamily sharing one common point, with caliber-star and precaliber variants kept distinct.
Carleman's equation — Recover an unknown density on a finite interval from a first-kind integral equation with logarithmic kernel, retaining the endpoint weight and the exceptional interval-length solvability condition.
Catholic Semigroup — A semigroup whose inverse-set map separates elements: no two distinct elements have exactly the same set of semigroup inverses.
Cayley Transform — A fractional-linear transformation that maps suitable skew-adjoint or Lie-algebra elements to orthogonal/unitary group elements—and, in a scalar form, maps a line or half-plane to a circle—while excluding points where the denominator is singular.
Cellular algebra — Equip an associative algebra with a poset-indexed cellular basis and involution whose multiplication is triangular modulo lower cells, enabling standard cell modules and representation-theoretic filtrations.
Character Theory — The study of group representations through trace-valued class functions whose orthogonality and arithmetic encode irreducible decomposition and group structure.
Classification of Discontinuities — A real-analysis taxonomy that diagnoses failure of continuity by the existence, finiteness, equality, and function-value agreement of one-sided limits.
Clique (Graph Theory) — A vertex subset of an undirected graph in which every two distinct vertices are adjacent, equivalently an induced complete subgraph.
Clone (Universal Algebra) — Collect finitary operations on one carrier so that every projection is present and arbitrary finitary substitution of member operations produces another member.
Closed Preordered Set — A preorder is closed to a stated chain length when every descending chain shorter than that length has a common lower bound, so transfinite strengthening can continue through limit stages without leaving the order.
Closed Set — Certify with one structural bit that no legitimate process inside a set — taking a limit (topology) or applying an operation (algebra) — can carry you outside it, discharging every boundary check in a proof at once.
Coefficient — A multiplicative factor attached to a term in an algebraic expression, series, equation or linear combination, determining that term's scale under a stated basis or representation.
Coin Problem — Find the largest nonnegative integer not representable as a nonnegative integer combination of given coprime positive denominations—the Frobenius number of their numerical semigroup.
Collectionwise Normal Space — Separate every discrete indexed family of closed sets at once by matching pairwise-disjoint open neighborhoods, extending ordinary two-set normality to arbitrary family size.
Compact Operator — A bounded linear operator that sends bounded sets to relatively compact sets, giving infinite-dimensional problems finite-dimensional-like approximation and spectral behavior.
Compactness — Certify that a space is finite-like — every open cover has a finite subcover, equivalently every sequence a convergent subsequence — so a whole package of existence theorems fires automatically on it and fails without it.
Complete Heyting algebra — Combine arbitrary joins and meets with Heyting implication, equivalently requiring finite meets to distribute over arbitrary joins, to form the algebraic objects called frames.
Complete variety — An algebraic variety whose projection after product with any variety is a closed map, the algebro-geometric analogue of compactness.
Computer-Assisted Proof — Establish a mathematical theorem with a proof whose evidential chain materially depends on machine-generated search, exhaustive case checking, rigorous computation, or formal proof checking.
Condensed Detachment — An inference rule that unifies an implication’s antecedent with a minor premise and detaches the most general resulting consequent.
Condition Number — Quantify the worst local amplification of admissible relative input perturbations into relative output changes for a specified mathematical problem, point, and choice of norms.
Conditioned Disjunction — A ternary Boolean connective whose middle argument selects the first branch when true and the third branch when false: [p,q,r] = (q ∧ p) ∨ (¬q ∧ r).
Conductor (ring theory) — The largest ideal shared by a commutative ring and an extension ring, equal to the annihilator of the quotient; when the extension is the normalization, it measures the smaller ring's failure to be integrally closed.
Congruence ideal — An ideal measuring congruences between an eigencomponent and the complementary part of an arithmetic algebra, commonly obtained from the image of an annihilator under a quotient character.
Conical surface — Generate a two-napped ruled surface as the union of complete straight lines through one fixed apex and points of a directrix, preserving the apex singularity and distinguishing the general object from a solid cone or circular special case.
Conjugate Gradient Method — A Krylov-subspace solver for symmetric positive-definite linear systems that builds mutually A-conjugate directions while minimizing the associated quadratic.
Constant Term — The coefficient of the multiplicative-identity monomial in a polynomial, series, or Laurent expression—the component independent of every declared variable and recoverable by evaluation at zero only when negative powers are absent.
Contact graph — Represent a family of geometric objects by one vertex per object and an edge exactly when two objects satisfy a declared boundary-contact relation without prohibited interior overlap or crossing, making the permitted notion of touching part of the graph class.
Continuous Group Action — An action of a topological group on a topological space whose joint evaluation map is continuous, organizing the space into compatible orbits, stabilizers, fixed-point sets, and an orbit quotient.
Conway polyhedron notation — Encode a polyhedral construction as a seed symbol preceded by right-to-left composable operators such as dual, ambo, truncate, and kis, preserving an auditable operator history.
Covariant (Invariant Theory) — A polynomial map between group representations that transforms equivariantly, carrying the symmetry action on its input into the corresponding action on its output.
Covering design — Choose fixed-size blocks from a finite point set so every required smaller subset lies in at least one block, and minimize the number of blocks through the covering number under explicit parameter and multiplicity conventions.
Covering Set — Certify that every term of a modularly periodic integer sequence has a divisor from one finite prime set by covering every index class with a periodic divisibility congruence.
Creative and Productive Sets — Formalize effective diagonal escape: a productive set computably supplies an element outside any enumerated subset of itself, while a creative set is enumerable and has a productive complement.
Credal Set — Represent imprecise probabilistic belief by a set of admissible probability measures, deriving lower and upper expectations as envelopes while keeping convexity, closure, conditioning, and independence choices explicit.
Crinkled Arc — A continuous Hilbert-space curve whose chords over nonoverlapping parameter intervals are orthogonal, yielding a nowhere-tangent path with a unique normalized form up to reparameterization and unitary equivalence.
Cross Section (Geometry) — Expose the geometry of a body by intersecting it with a plane or, in higher dimension, a hyperplane, retaining the induced lower-dimensional figure together with the cutter's position and orientation.
Cross-Covariance Matrix — The rectangular matrix of pairwise second central moments between the components of two random vectors, preserving direction, units, and linear transformation structure.
Cross-listed Classification — Assign a bridging work several classifications at once — one focal primary plus any number of secondaries — so it stays findable from every domain it spans, without forcing a single arbitrary home or minting a hybrid category.
Crossed Product Algebra — An algebra built from an algebra and a group action so adjoined group operators implement the action by conjugation, with a specified analytic completion where required.
Cubic Graph — A graph in which every vertex has degree exactly three, creating a sparse regular class with distinctive matching, coloring, symmetry, and Hamiltonicity theory.
Cubical Set — Represent a combinatorial or homotopical object as a contravariant set-valued functor on a declared cube category, with functorial face, degeneracy, and optional richer cube operations.
Cumulant — Encode a probability law by the coefficients of the logarithm of its generating function, so independent sums become coefficientwise addition and joint cumulants isolate connected dependence.
Curvelet Transform — A directional multiscale transform with parabolically scaled, increasingly elongated fine-scale elements that sparsely represent smooth curves and curved singularities.
Cyclic Algebra — A central simple algebra built from a cyclic Galois extension K/F, a generator sigma, and a scalar a, with a twisting element u satisfying u^n=a and uk=sigma(k)u.
Cyclic Number — Encode a repeating unit fraction as a digit block whose consecutive nonzero multiples appear as cyclic rotations of that block in a fixed base.
Cyclically Ordered Group — Equip a group with a ternary cyclic order that is preserved by multiplication on both sides, making the algebraic translations act as orientation-preserving symmetries of a circle-like order.
Cylinder set — A subset of a Cartesian product determined by restrictions on only finitely many coordinates, forming basic sets for product topology and generators for cylinder sigma-algebras.
Cylinder Set Measure — A consistent family of finite-dimensional distributions represented on the cylinder algebra of an infinite-dimensional linear space, often only finitely additive until an extension or radonification criterion produces a genuine countably additive measure.
Cylindrical Algebraic Decomposition — Partition real coordinate space into finitely many connected semialgebraic cells that are cylindrically compatible under projection and sign-invariant for a declared polynomial family.
Cylindrification — Extend a numbering by pairing every original index with an ignored auxiliary coordinate, creating infinitely many computably organized names for each numbered object and converting ordinary reducibility comparisons into one-one form.
Daniell Integral — A function-first integration construction that extends a positive monotone-continuous linear functional from an elementary function lattice and derives measure afterward.
Decimal — A radix-ten numeral system and notation in which place positions encode powers of ten for integer and fractional quantities.
Dedekind cut — Represent a boundary in a linear order by a downward-closed lower part with no greatest element, constructing order completion and the real numbers from rational cuts.
Degree diameter problem — Maximize the number of vertices in a finite graph subject to simultaneous maximum-degree and diameter bounds, comparing constructions with the breadth-first Moore upper bound.
Delone Set — A metric-space point set with both a positive uniform-separation bound and a finite covering-radius bound, so it is nowhere arbitrarily crowded and nowhere arbitrarily sparse.
Dense Graph — A graph whose edge population is a substantial, usually non-vanishing fraction of all possible vertex pairs, placing it in the quadratic-edge rather than sparse regime under a declared asymptotic convention.
Derivative — The limit of a difference quotient, f′(x) = lim_{h→0}[f(x+h)−f(x)]/h, that turns 'rate of change at a single point' into a defined object — simultaneously the tangent slope, the best local linear approximation, and the output's sensitivity to an infinitesimal input nudge.
Descartes Number — An odd composite integer equipped with a coprime factorization D=km that satisfies the perfect-number divisor-sum equation only when the composite factor m is formally treated as a single prime-like factor.
Determinacy — Classify a specified perfect-information win-or-lose game by whether one player has a strategy that defeats every possible counterplay.
Determinant — Map a square matrix or finite-dimensional endomorphism to the unique normalized alternating multilinear scalar that tracks invertibility, oriented volume scaling, and composition multiplicatively.
Diagonal Morphism — For an object with a categorical self-product, select the unique map into that product whose composites with both projections are the identity.
Diamond Operation — Combine two simplicial sets by gluing the endpoint faces of their product cylinder to the respective factors, producing a simplicial set over the 1-simplex that is categorically equivalent to their join.
Differential equation — A mathematical equation relating an unknown function to its own derivatives, encoding the law that a quantity's rate of change depends on its current state — so specifying the local rule plus initial or boundary conditions fixes the entire trajectory.
Directional Derivative — The instantaneous rate of change of a function at a point when the input moves along one specified vector, computed as a one-dimensional path limit and, under differentiability, by applying the derivative to that vector.
Dirichlet Eta Function — Extend the alternating reciprocal-power series into an entire complex function tied to zeta by η(s)=(1−2^(1−s))ζ(s), gaining convergence on Re(s)>0 and a characteristic extra zero lattice.
Dirichlet Kernel — The finite symmetric Fourier-mode selector whose periodic convolution produces an ordinary Fourier partial sum.
Doob Decomposition Theorem — An adapted integrable discrete-time process splits uniquely into its initial value, a martingale of one-step surprises, and a predictable cumulative conditional drift.
Double (manifold) — The boundaryless manifold formed by gluing two copies of a manifold with boundary point-for-point along their entire common boundary.
Du Bois singularity — Classify a reduced characteristic-zero scheme by requiring its structure sheaf to agree quasi-isomorphically with degree zero of the Du Bois complex, equivalently through a log-resolution criterion.
Dual curve — The curve in the dual projective plane whose points correspond to tangent lines of a given plane curve.
Dual System — Pair two vector spaces by a nondegenerate bilinear form so each separates points of the other and determines weak, polar, and compatible locally convex structures.
Dyson Brownian Motion — Evolve an ordered spectrum as coupled Brownian particles whose inverse-gap drift prevents collisions and encodes eigenvalue repulsion inherited from stochastic motion of a symmetry-class matrix.
Eckmann–Hilton Duality — Generate and test homotopy-theoretic counterpart concepts by expressing a construction categorically and reversing its arrows, with adjunctions and universal properties guiding—but never automatically validating—the transfer.
Edge Tessellation — A congruent polygonal tiling closed under reflection across every tile edge, so one tile and its edge reflections generate the entire tiling.
Eells–Kuiper Manifold — Recognize the exceptional closed manifolds in dimensions 2, 4, 8, or 16 that admit a three-critical-point Morse function and have projective-plane-like compactification and cohomology structure.
Elliptic Divisibility Sequence — An integer divisibility sequence generated by the nonlinear recurrence of elliptic-curve division polynomials, translating multiplication of a rational point into term divisibility, height growth, ranks of apparition, and primitive-divisor structure.
Equilateral Dimension — Measure how large an exactly pairwise-equidistant subset a metric space can support, with the distance scale and attainment convention stated explicitly.
Euclidean Space — Combine finite-dimensional real affine structure with a positive-definite inner product so displacement, distance, angle, orthogonality, projection, and rigid motion form one coherent flat geometry.
Euler Line — The line of a non-equilateral triangle on which its circumcenter, centroid, orthocenter, and nine-point center lie in fixed affine ratios.
Euler sequence — A canonical exact sequence of sheaves on projective space relating relative differentials to twists of the structure sheaf.
Euler's identity — Relate the constants e, i, π, 1, and 0 through the exact equality e^(iπ)+1=0, obtained by evaluating Euler's complex-exponential formula at a half-turn in radians.
Exotic R4 — A smooth four-manifold homeomorphic but not diffeomorphic to ordinary Euclidean four-space, exposing the unique dimension-four split between topological and smooth equivalence.
Expansive Homeomorphism — A homeomorphism of a compact metric space for which every distinct point pair is separated by at least one forward or backward iterate beyond one fixed positive expansivity scale.
Exponential Integrator — A time-integration method that propagates a selected linear part through its exponential and approximates the remaining variation-of-constants contribution.
Exterior Algebra — Turn alternating multilinear combinations of a module into ordinary linear algebra by quotienting its tensor algebra so every repeated degree-one factor vanishes, producing a graded wedge product with a universal mapping property.
External Ray — A constant-angle curve in an exterior conformal coordinate that approaches a Julia-set or connectedness-locus boundary from infinity and may land at a boundary point.
Factorial Number System — A mixed-radix positional representation with factorial place values and digit bound 0 through i at the i-factorial place, giving every nonnegative integer a unique expansion and a natural rank/unrank bridge to permutations.
Feasible Region — Turn an optimization problem's list of constraints into a single geometric set — the intersection of everything they permit — whose shape (empty, convex, bounded, its boundary) governs whether a solution exists, where it sits, and which methods will find it.
Fiber Product of Schemes — The universal scheme of pairs of maps compatible over a common base, realized affinely by a tensor product and serving as the engine of base change, scheme-theoretic fibers, and intersections.
Fibred Category — Organize categories of objects varying over a base category so every base morphism admits a universal cartesian pullback, making reindexing coherent up to canonical isomorphism.
Field (Algebraic) — Guarantee that you can always add, subtract, multiply, and divide by anything non-zero by demanding one axiom package — two commutative-group operations bound by distributivity — which certifies the whole apparatus of linear algebra in a single membership check.
Field Boundary Marker — Route a paper, person, or proposal to the right expert community by committing a labeled research-field category at decision time — bundling a named field, a membership convention, and a routing use — that holds operationally while staying silent on what the work 'really' is.
Field of fractions — The smallest field containing an integral domain, constructed from equivalence classes of ratios of its elements with nonzero denominators.
Finite Difference Coefficient — A stencil weight determined by derivative order, evaluation point, sample-node offsets, and polynomial exactness so their weighted samples approximate the target derivative with a declared truncation order.
Finite Difference Method — A numerical method samples a differential equation on a discrete grid, replaces derivatives with finite-difference stencils, closes the resulting algebraic system, and analyzes truncation error, stability, and convergence under refinement.
Finite Element Method — A numerical method poses a boundary-value problem in weak form, chooses piecewise finite-dimensional trial and test spaces over a mesh, assembles local element contributions, and solves the resulting global algebraic system with controlled approximation error.
Finite subdivision rule — A finite recursive prescription replacing each tile type by a patterned subdivision to generate successively finer cell structures.
Finite-Valued Logic — A logic is characterized by a finite logical matrix: finitely many semantic values, designated values defining consequence, and truth functions interpreting its connectives.
Flat Vector Bundle — A vector bundle with a zero-curvature linear connection has homotopy-invariant parallel transport, locally constant transition data, and a monodromy representation.
Flattening — A dimensionless axial-compression measure for an ellipse or spheroid, ordinarily the semiaxis difference divided by the semimajor axis, with explicitly convertible alternative normalizations.
Flexible Algebra — Retain the reassociation identity (xy)x = x(yx) when full associativity is absent, forcing the associator to vanish whenever its first and third arguments coincide.
Flux Limiter — A local nonlinear control function limits high-order numerical flux corrections near nonsmooth data while retaining more accurate transport in smooth regions.
Formal derivative — Differentiate polynomials or formal power series algebraically by multiplying each coefficient by its exponent and lowering that exponent, without invoking limits or convergence.
Fourier Transform — Decompose a function into a weighted superposition of complex exponentials, recording each frequency's amplitude and phase — an invertible, energy-preserving change of basis that diagonalizes every translation-invariant operation, so convolution becomes pointwise multiplication.
Fourier–Motzkin Elimination — Project a finite system of linear inequalities onto fewer variables by separating one variable's lower and upper bounds and emitting every cross-bound consistency inequality.
Fredholm Kernel — An element of the completed projective tensor product of a Banach-space dual with a Banach space, represented by an absolutely summable series of elementary tensors and canonically inducing a nuclear operator.
Friendly-index set — Collect every edge-label imbalance attainable from nearly balanced binary vertex labelings of a graph, yielding a set-valued graph invariant rather than one selected labeling.
Frobenius Formula — Recover irreducible character values of a symmetric group from partitions and conjugacy-cycle data by extracting a specified monomial coefficient from a product of a Vandermonde factor and power sums.
Frontal Solver — Factor a sparse assembled system by advancing a dense active front, assembling each local contribution when it enters and eliminating a variable as soon as its last contribution has arrived.
Fréchet Mean — Any point minimizing expected or empirical squared metric distance to observations, generalizing the Euclidean arithmetic mean to nonlinear metric spaces.
Functor — A structure-preserving map between categories that carries objects and morphisms while respecting identities and composition — the two axioms that make it a licence to transport theorems from one category to another along its rails.
Fundamental Groupoid — The groupoid whose objects are points of a space and whose arrows are fixed-endpoint homotopy classes of paths, retaining path components and all basepoint fundamental groups in one functorial invariant.
Fusion Category — Model finitely many particle-like object types with semisimple direct-sum decomposition, duals, and an associative tensor product whose decomposition coefficients form finite fusion rules.
Galois Theory — Relate a field extension to its automorphism group so subgroup structure encodes intermediate fields and polynomial solvability becomes a symmetry question.
Gamma Function — The unique positive log-convex extension of shifted factorial on the positive reals, represented by Euler's integral and continued meromorphically to the complex plane with simple poles at the nonpositive integers and no zeros.
Gelfand–Naimark–Segal construction — A construction sending a state on a C-star algebra to a cyclic star-representation on a Hilbert space, establishing the converse correspondence as well.
Generic property — A mathematical property holding outside a negligible exceptional set under a declared measure-theoretic, topological or algebraic notion of genericity.
Geodesic — A geometry-relative straight path whose tangent transports parallel to itself, yielding locally length-minimizing curves for a Riemannian metric while permitting broader affine and spacetime forms.
Girth (Graph Theory) — Assign an undirected graph the length of its shortest cycle, using infinity for an acyclic graph, to quantify how far local neighborhoods remain tree-like.
Good Spanning Tree — Select a rooted spanning tree of a fixed plane embedding whose non-tree edges avoid ancestor chords and occur in left, child-tree, and right blocks around every vertex, enabling ordered planar graph drawings and visibility representations.
Graph Coloring Game — An adversarial sequential graph-coloring process in which players alternately make legal color assignments, one seeking a complete proper coloring and the other seeking to create an uncolorable position.
Graph Duality — Pair a planar graph with a dual by placing a vertex inside each face and joining faces that share an edge, so vertices swap with faces and problems translate across a lossless table — paths become cuts, colorings become face colorings — letting you solve whichever side is easier.
Graph of a Function — Represent a function by the set of ordered input–output pairs selected by its evaluation rule, preserving every domain element with exactly one associated value while separating the graph from a plotted picture or graph-theoretic network.
Graph Sphericity — The least Euclidean dimension in which a graph can be represented as the intersection graph of congruent spheres, equivalently unit balls under the adopted convention.
Gromov–Hausdorff convergence — A convergence notion for metric spaces defined by their Gromov–Hausdorff distance tending to zero after comparison in common ambient metrics.
Grothendieck Local Duality — Over a Noetherian local ring with a normalized dualizing complex, Matlis duals of maximal-ideal local cohomology are identified with completed Ext groups into that dualizing object.
Grothendieck Space — A Banach space whose continuous-dual sequences gain weak convergence whenever they converge weak-star, equivalently forcing every bounded operator into c0 or any separable Banach space to be weakly compact.
Grundy Number — The largest number of colors that first-fit vertex coloring can be forced to use over all vertex orderings measures a graph's worst-case greedy order sensitivity.
Hadamard matrix — Arrange signs in a square matrix so every pair of distinct rows, and therefore columns, is orthogonal, equivalently satisfying the exact Gram identity \(HH^{\mathsf T}=nI\).
Hadwiger number — The largest integer k such that the complete graph on k vertices occurs as a minor of a given undirected graph.
Hamming Scheme — The association scheme on fixed-length words over a finite alphabet whose relation classes are indexed by Hamming distance.
Harmonic conjugate — Pair real harmonic functions whose gradients satisfy the Cauchy-Riemann rotation so they form the real and imaginary parts of one holomorphic function, subject to global topological existence and additive-constant ambiguity.
Harrop Formula — An intuitionistic formula built so disjunctions and existential quantifiers occur only in negative positions, yielding a stable, computationally disciplined fragment and inspiring hereditary-Harrop logic programming.
Hausdorff Maximal Principle — The choice-equivalent principle that every chain in any partially ordered set extends to an inclusion-maximal chain.
Haven (Graph Theory) — Assign every deletion set smaller than a stated order to a surviving connected component in a nested or pairwise-touching way, certifying an evader's coherent refuge and dualizing bounded treewidth.
Hecke Character — A continuous complex quasicharacter of a global field's idèle class group whose local components, conductor, and infinity type generate a Hecke L-function.
Hedgehog Space — Join a cardinal-indexed family of unit intervals at one origin and metrize the result so paths on different spines pass through the common center.
Hermite normal form — A canonical echelon-like matrix form over the integers used to represent lattices and solve integer-coordinate linear systems.
Hessenberg Matrix — Constrain a square matrix to be triangular except for one adjacent off-diagonal band, yielding a similarity-reachable form that preserves eigenvalues while making QR iteration and related computations substantially cheaper.
Holomorphic vector bundle — A complex vector bundle over a complex manifold whose total space is complex and whose projection map is holomorphic.
Homogeneous Graph — A graph whose every isomorphism between finite induced subgraphs extends to an automorphism of the entire graph, making all finite local copies globally interchangeable.
Homotopy Hypothesis — Assert that homotopy types of spaces and suitably weak infinity-groupoids present equivalent homotopy theories, with paths, homotopies, and all higher homotopies represented as invertible higher morphisms.
Hosoya Index — Count every matching of a graph, including the empty matching, to obtain a graph invariant used in matching theory and as a molecular topological descriptor.
Howson Property — A group has the Howson property when the intersection of every two finitely generated subgroups is again finitely generated, making finite generation closed under binary subgroup intersection.
Hyperbolic quaternion — Extend real scalars by three anticommuting square-\(+1\) units, producing a four-dimensional unital nonassociative algebra whose associator and quadratic form distinguish it from Hamilton and split quaternions.
Hyperperfect number — Classify a natural number by the parameterized divisor-sum constraint n = 1 + k(σ(n) − n − 1), with perfect numbers as the k = 1 boundary case.
Image (of a Function) — The set of values a function actually produces — im(f) = {f(x) : x in X} — a subset of the declared codomain that records what a map reaches rather than what it could in principle reach.
Inclusion map — The canonical injective function from a subset or subobject into its containing object that sends every element to itself viewed in the larger context.
Independent and Identically Distributed Random Variables — Model a collection of random variables as mutually independent draws from one common probability distribution, separating repeated sampling from dependence and distributional drift.
Index Group — Take the discrete component group of the invertible elements of a unital Banach algebra by quotienting them by the connected component containing the identity.
Indiscernibles — Choose elements or tuples whose finite subconfigurations satisfy exactly the same formulas over a declared parameter set whenever their index patterns agree, creating model-theoretic symmetry that supports controlled constructions and automorphisms.
Induced representation — Extend a subgroup representation to the ambient group through a universal construction on cosets or tensoring over group algebras.
Infinitesimal — A nonzero mathematical quantity smaller in magnitude than every positive standard real scale, made rigorous only relative to a specified non-Archimedean, nilpotent, or formal framework.
Interior — Grade membership in a set by robustness rather than bare inclusion: a point lies in the interior only if some open neighborhood of it fits entirely inside the set, giving it room to spare in every direction.
Irreducible polynomial — Classify a nonzero nonunit polynomial as irreducible relative to a declared coefficient ring when every factorization forces at least one factor to be a unit, with field and primitive-polynomial conventions kept explicit.
K-Topology — The topology on the real line generated by ordinary open intervals together with intervals having K={1/n} deleted, a canonical finer-than-Euclidean counterexample that is Hausdorff but not regular.
Kernel — The set of inputs a structure-preserving map sends to the identity of its target — the map's null directions — collected as a genuine subobject that carries the map's information loss and, via triviality, rank-nullity, and the isomorphism theorem, controls injectivity and reconstructs the faithful part.
Kleene–Brouwer Order — Linearize finite sequences so every proper extension precedes its prefix and incomparable sequences follow the first differing coordinate, turning branch structure into an order whose well-foundedness detects infinite paths.
Knaster–Kuratowski–Mazurkiewicz Lemma — A simplex-covering intersection theorem: if each face is covered by the closed sets indexed by that face’s vertices, then every indexed set shares a common point, converting boundary-compatible local coverage into global coexistence.
Kushner–Stratonovich Equation — Evolve a hidden continuous-time state's normalized conditional law by combining generator-driven prediction with an observation-filtration innovation correction weighted by conditional covariance.
Laakso Space — A Laakso-construction metric-measure space that is Ahlfors Q-regular for prescribed Q greater than one and supports a weak Poincare inequality despite potentially non-integer Hausdorff dimension.
Lanczos Approximation — Evaluate the gamma function at fixed precision by factoring out its dominant asymptotic behavior and approximating the remaining analytic factor with a short precomputed rational sum.
LaSalle's Invariance Principle — Conclude that trajectories approach the largest invariant subset of the region where a nonincreasing Lyapunov function stops decreasing, extending asymptotic-stability proofs beyond strictly negative derivatives.
Law of sines — Relate each side of a triangle to the sine of its opposite angle through one common ratio equal to the circumdiameter in Euclidean geometry, enabling triangle solution while preserving the side-side-angle ambiguous case and curvature-specific variants.
Legendre Polynomials — The uniquely normalized polynomial sequence orthogonal on [-1,1] with unit weight and solving Legendre's differential equation.
Lie Algebra Extension — A Lie algebra fitting into a short exact sequence with a specified ideal as kernel and a specified Lie algebra as quotient, with splitting and cohomology encoding how the parts combine.
Limit (Category Theory) — A terminal cone over a diagram, through which every other cone factors by a unique mediating morphism.
Linear fractional transformation — An invertible map represented by a ratio of two linear expressions, including Mobius transformations over suitable scalar or algebraic settings.
Literal (Mathematical Logic) — Use an atomic formula or its negation as a signed atomic unit whose polarity supports clauses, normal forms, resolution, satisfiability assignments, and complementary-pair reasoning.
Local diffeomorphism — Map smooth manifolds so that every source point has a neighborhood carried diffeomorphically onto an open target neighborhood, without requiring global injectivity.
Local property — A property that holds around each point or on sufficiently small neighborhoods, even if a corresponding global property may fail.
Locally simply connected space — Require every point to have a neighborhood basis of simply connected open sets, separating local loop triviality from global simple connectedness and weaker semilocal conditions.
Loss Function — A real-valued rule assigning penalty to an action or prediction under a realized state or target, whose expectation or sample aggregate defines the risk to minimize.
Malliavin Derivative — Differentiate a random functional with respect to infinitesimal perturbations of its underlying Gaussian noise, producing a Hilbert-valued gradient whose adjoint is the Skorokhod divergence.
Markov Renewal Process — Model a sequence of jump states and jump times with a kernel whose joint next-state and holding-time law depends only on the current embedded state, yielding a semi-Markov process between jumps.
Markov's Principle — A constructive-logical schema allowing double-negated existence of a witness for a decidable predicate on the natural numbers to be converted into positive existence, reflecting the legitimacy of unbounded search.
Matching — Cast a pairing problem as a largest (or minimum-cost, or perfect) set of pairwise vertex-disjoint edges on an explicit graph, then split on bipartiteness to select the theorems and polynomial-time algorithm that solve it.
Mathematical structure — Endow one or more carrier sets with declared operations, relations, distinguished elements, topology, measure, or other typed data satisfying axioms, so objects are compared by morphisms and isomorphisms that preserve the selected structure rather than incidental presentation.
Matrix — Encode a linear map, a system Ax=b, a bilinear form, or a graph's adjacencies as one rectangular array under a single arithmetic, so derived quantities like rank and a menu of factorizations (LU, QR, spectral, SVD) read the structure off directly.
Matrix Pencil — Treat a pair of same-sized matrices as the affine one-parameter family A−λB, whose finite and infinite generalized eigenvalues and singular structure remain meaningful even when B cannot be inverted.
Matrix-Free Methods — Solve large linear, eigenvalue, or nonlinear subproblems through an operator-application interface that computes matrix–vector products on demand without assembling or storing the full coefficient or Jacobian matrix.
Maximal Ideal — A proper two-sided ideal maximal under inclusion, equivalently one whose quotient ring is simple—and, for a commutative unital ring, a field.
Maximum Theorem — Guarantee continuity of a parametric optimum's value and upper hemicontinuity of its maximizer correspondence when objective and compact feasible correspondence vary continuously.
McKay Graph — Encode tensoring by a fixed finite-group representation as a multiplicity-weighted quiver on irreducible representations, turning fusion rules into adjacency, paths, spectra, and—in the SU(2) case—affine ADE structure.
Measure space — Bind a set, a sigma-algebra of measurable subsets, and a countably additive nonnegative measure into the ambient structure on which almost-everywhere reasoning and integration are defined.
Mennicke symbol — A map from admissible element pairs of a Dedekind domain to an abelian group satisfying the Mennicke identities used in congruence-subgroup analysis.
Metric dimension (graph theory) — The minimum size of a vertex subset whose distance vectors uniquely identify every graph vertex.
Metric projection — Map a point to the set of points in a designated subset that minimize its metric distance, retaining nonexistence and nonuniqueness unless geometry supplies stronger guarantees.
Minority Game — Model any anti-coordination setting as an odd population repeatedly choosing between two actions where only the minority side wins, reading collective volatility off one control parameter — strategy diversity relative to population — that fixes a sharp crowded-versus-dilute phase transition.
Mixed Strategy Equilibrium — Solve a game with no stable deterministic play by having each player randomize over their actions in exactly the proportions that leave every opponent indifferent, so no one can profitably deviate.
Modular product of graphs — A graph product on the Cartesian product of two vertex sets whose adjacency encodes agreement of adjacency or nonadjacency in the factor graphs.
Monotonic Function — Map one ordered set into another while preserving comparison direction everywhere, or reverse that direction everywhere in the antitone variant, so input order constrains output order globally.
Moreau Envelope — Smooth a proper lower-semicontinuous convex function by infimizing its value plus a quadratic distance penalty, linking nonsmooth optimization to the proximal map.
Multilinear form — A scalar-valued map of several vector arguments that is linear separately in each argument.
Multiplicative Function — Recognize an arithmetic function normalized at one whose value on a product of coprime positive integers factors into the product of their values, thereby reducing global behavior to independently specified prime-power data.
Multitree — A directed acyclic graph in which every ordered pair of vertices has at most one directed path, equivalently a DAG whose reachability order is diamond-free.
Narayana Polynomials — Package the Narayana distribution of a Catalan family into a polynomial whose coefficient of each power counts objects with a specified statistic, retaining the Catalan total at one while exposing symmetry, unimodality, real-rootedness, and specializations.
Natural Number — The successor-generated arithmetic carrier for finite counting and ordinal indexing, equipped with induction and recursion from a distinguished first element.
Nikodym Set — Construct a full-measure planar set whose every point lies on a line that otherwise avoids the set, exposing an extreme mismatch between global size and linewise incidence.
Nimber — Assign an impartial normal-play game position the unique Nim-heap value determined recursively by the minimum excluded values of its options and composed by nim-sum.
Nine-Point Conic — The conic through the six side midpoints and three diagonal points determined by a complete quadrangle, with circle and hyperbola cases governed by the quadrangle geometry.
Non-Archimedean Ordered Field — An ordered field whose scale outruns every natural-number bound, yielding infinitely large elements, their infinitesimal reciprocals, and a natural hierarchy of finite and infinite magnitudes.
Nonnegative Matrix — A real matrix constrained entrywise to the nonnegative orthant, forming a convex cone closed under addition and multiplication and linking directed-graph structure to Perron–Frobenius spectral behavior.
Norm — Extract a single non-negative magnitude from a vector obeying three axioms (positive definiteness, absolute homogeneity, triangle inequality), where the choice among L¹, L², and L^∞ is a consequential modeling decision read off the unit ball's geometry.
Norm Form — The homogeneous degree-n polynomial obtained by expressing the field norm of a degree-n extension in coordinates relative to a chosen base-field basis.
Normal Order of an Arithmetic Function — Describe the typical size of an arithmetic function by relative approximation on a natural-density-one set, while allowing infinitely many sparse and arbitrarily large exceptions.
Null Set — Classify a measurable subset as negligible when its measure is zero, allowing it to be ignored by almost-everywhere statements without requiring it to be empty.
Numbering (Computability Theory) — A surjective coding from natural numbers onto a countable class of mathematical objects, used to transport computability, reducibility, and effective enumeration questions from objects to their indices.
Nut Graph — A finite simple graph whose adjacency matrix has a one-dimensional kernel generated by a vector nonzero at every vertex, making zero a simple eigenvalue with full vertex support.
Open Set — A subset in which every point has neighborhood room entirely inside it — and, via three axioms on the whole collection τ, the primitive that IS a space's topology, letting continuity, compactness, and connectedness be defined with no distance function.
Operator Ideal — A class of bounded linear maps between Banach spaces that contains finite-rank operators, is linear in each source–target component, and is stable under arbitrary bounded pre- and post-composition.
Overspill — Infer that an internal property holding for every standard natural number must also hold at some unlimited hypernatural, because internal predicates cannot cut out exactly the external standard initial segment.
P-Matrix — A real square matrix whose every principal minor is strictly positive, equivalently guaranteeing a unique solution to every associated linear complementarity problem.
Parallelogram Law — Test whether a norm comes from an inner product by requiring the squared lengths of every vector pair's sum and difference to equal twice the sum of their squared lengths, with polarization recovering the unique inner product.
Paranormal Operator — A bounded Hilbert-space operator whose first and second iterates satisfy a norm-growth inequality, forming a class broader than hyponormal operators but narrower than arbitrary normaloid operators.
Pascal's rule — Decompose the family of fixed-size subsets by whether they contain a distinguished element, yielding the binomial-coefficient recurrence that generates Pascal's triangle.
Pettis integral — Integrate a Banach-space-valued function weakly by requiring every continuous linear functional to yield an ordinary scalar integral represented by one vector for each measurable set.
Phragmen–Brouwer theorem — A theorem schema equating a separation property for unions of disjoint closed sets with unicoherence under specified local and global connectedness hypotheses.
Pi — The dimensionless mathematical constant equal to a Euclidean circle's circumference divided by its diameter, equivalently characterized through analysis, with an irrational transcendental value near 3.14159.
Picard–Lefschetz Theory — Analyze how the topology of fibers changes around isolated critical values of a complex map by encoding vanishing cycles and the monodromy transformations generated by loops around those values.
Planarity — The graph property of admitting a crossing-free drawing in the plane — pinned by Kuratowski/Wagner to a finite obstruction (no K₅ or K₃,₃) and by Euler's formula to a density bound, which is why a shelf of NP-hard problems turns polynomial on planar graphs.
Plane of Rotation — Represent a simple Euclidean rotation by the oriented two-dimensional subspace in which vectors turn, leaving its orthogonal complement fixed.
Positive harmonic function — Characterize a nonnegative harmonic function on the unit disc as the Poisson integral of a unique finite positive boundary measure, with normalization at the origin fixing the measure's total mass.
Principal Ideal — Form the smallest ideal containing one ring element, using all allowed left, right, or two-sided ring multiples and additive closure.
Prior Probability — Represent uncertainty about a parameter or hypothesis before the focal evidence is incorporated by assigning it a probability distribution that will be combined with a likelihood.
Probability Distribution — The complete specification of how probability mass or density is spread over a random variable's possible values — a measure that, once compressed to a named parametric family, encodes shape, moments, tails, and a generative claim about the process producing the data.
Probability Mass Function — Represent a discrete random variable’s law by the nonnegative singleton probabilities p(x)=P(X=x), whose sum over its countable support equals one.
Problem of Points — Divide the stake of an interrupted race-to-a-target game by each player's conditional probability of eventually winning, computed from the current score and the agreed continuation model rather than from points already accumulated.
Product of Rings — The Cartesian product of a family of rings with coordinatewise operations, characterized by projection homomorphisms satisfying the categorical-product universal property.
Profinite Integer — An element of the inverse-limit ring of all finite residue rings of the integers—a compatible residue modulo every positive integer, equivalently one p-adic integer for every prime.
Proportionality (mathematics) — A relation in which corresponding quantities maintain a constant ratio, or under inverse proportionality a constant product.
Pseudometric space — Equip a set with a symmetric, nonnegative, triangle-inequality distance that may assign zero separation to distinct points, with metric quotient obtained by identifying zero-distance classes.
q-Analog — A mathematically natural q-parameter deformation of an object, identity, or theorem that recovers a designated classical counterpart, usually at q approaching 1.
Quadratic Equation — A one-variable degree-two polynomial equality whose coefficient triple, discriminant, and root formulas provide a complete solution classification over a declared scalar domain.
Quadratic Field — A quadratic field is a degree-two extension of the rational field, equivalently a uniquely determined field Q(sqrt(d)) for a squarefree integer d other than 1, with d positive in the real case and negative in the imaginary case.
Quadratic Space — A vector space equipped with a quadratic form, carrying isotropy, radical, orthogonality, and equivalence structure that depends essentially on the base field.
Quartic reciprocity — A family of reciprocity theorems relating the solvability of fourth-power congruences after interchanging the relevant prime moduli.
Quasi-arithmetic mean — Average values by mapping them through a continuous strictly monotone generator, taking an arithmetic mean in transformed coordinates, and mapping the result back.
Quasi-Open Map — Map every nonempty open subset of a topological domain to a set with nonempty interior, retaining a weakened openness guarantee without requiring the image itself to be open.
Quasiconvex Function — A real-valued function on a convex domain whose sublevel sets are convex, preserving convex feasibility under every threshold without requiring the stronger convex-function inequality.
Quasigroup — Equip a set with a closed binary operation for which either missing operand in an equation is uniquely recoverable, equivalently making every left and right translation a bijection, without requiring identity or associativity.
Quasiregular Representation — The unitary representation generated by a group action on an L2 space of a homogeneous or measured space, with a square-root Radon–Nikodym factor correcting any merely quasi-invariant measure.
Quasisymmetric map — Control relative metric distortion by requiring every ratio of two distances from a common base point to be bounded through one homeomorphic control function.
Quaternion-Kähler Manifold — A Riemannian manifold of dimension divisible by four whose Levi-Civita holonomy lies in Sp(n)Sp(1), carrying a parallel rank-three quaternionic structure rather than a globally selected complex structure.
Quillen Adjunction — An adjoint pair between model categories whose left member preserves cofibrations and trivial cofibrations, equivalently whose right member preserves fibrations and trivial fibrations.
Quotient Graph — Collapse each block of a vertex partition into one quotient vertex and push original adjacency through the block map, compressing a graph while recording which aggregate vertices remain connected.
Random Variable — Translate an uncertain event into a measurable function X: Ω → ℝ on a probability space, so that a number attaches to each outcome and the whole apparatus of expectation, distribution, and convergence becomes computable before any value is observed.
Rank (Linear Algebra) — Read the effective dimensionality of a matrix or linear map as one integer — the number of linearly independent columns (equivalently rows) — so that solvability, invertibility, and reachability all reduce to comparing that count against a relevant dimension.
Ratio Test — Classify absolute convergence or divergence of a series from the eventual magnitude ratio of successive nonzero terms: below one converges, above one diverges, and equality to one is inconclusive.
Reach (Mathematics) — Measure the largest open Euclidean tube around a closed set in which every point has a unique nearest point on the set, exposing the first scale at which metric projection becomes ambiguous.
Real Representation — A representation of a group, algebra, or related structure on a vector space over the real numbers, with equivalence and irreducibility tested over R rather than inferred from a complexification alone.
Real-valued function — A function whose codomain is the real numbers.
Redheffer Star Product — An associative partial product on compatibly partitioned linear operators that closes connected input/output ports, eliminates the resulting internal feedback variables, and returns the external scattering operator of the composite system.
Reduct — Forget selected symbols from a logical or algebraic signature while keeping the same underlying set and exactly the inherited interpretations of every symbol that remains.
Reduction (Computability Theory) — Compare decision sets by an effective procedure that converts access to a solver for B into a solver for A, with the allowed access defining the reducibility notion.
Refactorable number — Classify a positive integer as refactorable when the number of its positive divisors divides the integer itself.
Reflexive closure — The smallest reflexive binary relation containing a given relation, obtained by adjoining every identity pair on the underlying set.
Remmert–Stein Theorem — Under a strict component-dimension gap, the closure across a lower-dimensional analytic exceptional set of an analytic subset remains analytic.
Restricted isometry property — A matrix property requiring approximate norm preservation on all sufficiently sparse vectors, thereby controlling the geometry needed for stable sparse recovery.
Riemann–Liouville integral — A parameterized fractional-integration operator that extends repeated antiderivation from positive integer orders to noninteger orders.
Ring — A set with two operations — an abelian group under addition and an associative multiplication coupled to it by the distributive law — whose axiom tier and ideal structure unlock a single body of theory (quotients, homomorphisms, factorization) across integers, polynomials, and matrices at once.
Ring Homomorphism — Map one ring to another while preserving addition, multiplication, and—under the declared unital convention—the multiplicative identity, so kernels, images, quotients, and composition retain ring structure.
Ringed Space — A topological space equipped with a sheaf of rings assigning locally compatible ring-valued algebraic data to every open set and restriction maps to inclusions.
Root System — Encode reflection symmetry by a finite spanning set of Euclidean vectors closed under root reflections, with integral Cartan pairings in the crystallographic setting.
Root Test — Classify an infinite series using the limit superior of the nth roots of its term magnitudes: below one gives absolute convergence, above one gives divergence, and one is inconclusive.
Ruled Surface — A surface swept by a one-parameter family of straight lines, locally represented as a directrix plus a variable multiple of a ruling direction.
Ruzsa–Szemerédi Problem — An extremal-combinatorics problem asking how dense an n-vertex graph can be when every edge lies in exactly one triangle, equivalently how many triples can be chosen with no three supported on six vertices.
Sastry Automorphism — A characteristic-two field automorphism admitting a nonzero quadruple that satisfies the Type I or Type II Sastry–Bombieri identity system arising from Ree-group embeddings in F4.
Schauder Fixed-Point Theorem — A continuous self-map of a nonempty closed convex set has a fixed point when its image is relatively compact in the surrounding locally convex space.
Schneider–Lang Theorem — Bounds the complex points where a derivative-stable family of controlled-growth meromorphic functions can simultaneously take values in a number field when the family contains two algebraically independent functions.
Schnirelmann Density — Measure a set of positive integers by the least fraction it occupies in any initial segment, making early gaps permanently visible and enabling quantitative sumset and additive-basis theorems.
Schröder–Bernstein Property — The property of a specified mathematical class, embedding relation, and equivalence notion that mutual embeddability forces equivalence, making the embedding preorder antisymmetric after quotienting by that equivalence.
Schur's property — A normed-space property under which every weakly convergent sequence also converges in norm.
Second Fundamental Form — Encode how an immersed surface or submanifold bends in its ambient space by pairing tangent directions with the normal component of their ambient derivative, yielding normal curvature and the shape operator under explicit sign and normal conventions.
Secondary Measure — An auxiliary positive measure derived from an initial moment measure so that its secondary-polynomial sequence becomes orthogonal, with the pair linked by a reciprocal Stieltjes-transform relation.
Seifert Surface — Span an oriented knot or link by a compact connected orientable embedded surface, turning a one-dimensional embedding into a two-dimensional carrier from which genus, linking forms, and knot invariants can be derived.
Simplex Graph — Transform an undirected graph into a bipartite median graph whose vertices are all cliques, including the empty clique, with adjacency given by adding or deleting exactly one original vertex.
Simplicial Presheaf — A simplicial presheaf is a contravariant functor from a category to simplicial sets, equivalently a simplicial object in set-valued presheaves, combining sectionwise homotopy data with functorial restriction.
Slow Manifold — An invariant or approximately invariant lower-dimensional manifold in a fast–slow dynamical system on which the reduced long-timescale evolution occurs after nearby fast variables relax toward it.
Smooth Number — A positive integer is B-smooth when every prime divisor is at most the declared bound B, making its factorization lie entirely within a small-prime factor base.
Solvmanifold — A homogeneous manifold of a connected solvable Lie group, with compact lattice quotients forming the special convention central to topology and Lie theory.
Space-Filling Curve — A continuous surjection from a one-dimensional interval onto a higher-dimensional region, typically built as the uniform limit of recursively refined approximating paths.
Sphericon — Form a developable one-surface roller by bisecting a 90-degree bicone, rotating one half by a quarter turn, and rejoining so its meandering roll brings the whole surface into ground contact.
Spin Connection — A connection on a spinor bundle that lifts an orthonormal-frame or Lorentz connection to spin representations, enabling covariant differentiation and parallel transport of spinor fields and coupling fermions consistently to curved geometry.
SQ-Universal Group — Require every countable group to embed as a subgroup of some quotient of one host group, preserving the exact quotient-then-subgroup quantifier pattern.
Stack (Mathematics) — Organize objects varying over a Grothendieck site as a category fibred in groupoids whose isomorphisms form sheaves and whose compatible local objects glue effectively to a global object.
Standard model (set theory) — Interpret the membership symbol of a set-theoretic structure as actual membership restricted to its domain, separating semantic standardness from transitivity and inner-model conditions.
Standard Part Function — Map each finite hyperreal to the unique real number infinitesimally close to it, thereby passing from a nonstandard approximation to its ordinary real shadow.
Stone duality — Relate Boolean and related ordered algebraic structures contravariantly to compact topological or ordered spaces so algebraic elements become distinguished subsets and homomorphisms reverse into continuous maps.
Strictly positive measure — Require a measure on a topological measurable space to assign positive measure to every nonempty open set, equivalently giving the measure full topological support under standard regularity conventions.
Strictly Singular Operator — Identify a bounded linear operator that fails to preserve norm from below on every infinite-dimensional subspace, so no infinite-dimensional restriction is an isomorphic embedding even though finite-dimensional behavior may remain well conditioned.
Strong duality — Assert that a typed primal optimization problem and its dual attain equal optimal objective values, while keeping zero gap distinct from feasibility, attainment, and optimality certificates.
Structure Theorem for Finitely Generated Modules over a Principal Ideal Domain — A classification theorem stating that every finitely generated module over a principal ideal domain decomposes into a finite free part and uniquely determined cyclic torsion factors, in invariant-factor or elementary-divisor form.
Superpartient Ratio — In ancient and medieval ratio theory, a reduced greater-to-lesser ratio (n+a):n with 1<a<n, containing the lesser once plus more than one of its aliquot parts.
Symmetric group — Form the group of every bijection from a set to itself under composition, with finite S_n containing n! permutations and organizing cycle type, parity, actions, and universal embeddings of finite groups.
Symmetrization — Map a multivariable function, tensor, or representation vector to its permutation-invariant component by summing or averaging over a symmetric-group action.
Synthetic differential geometry — A topos-theoretic formalization of differential geometry that encodes smooth infinitesimal behavior synthetically rather than through classical limit analysis.
Tarski's Plank Problem — Relate geometric coverage to directional thickness: any finite family of Euclidean planks covering a convex body must have total plank width at least the body's minimum width.
Tensor — A multilinear map over a vector space, represented in coordinates by an indexed array whose components co-vary contravariantly and covariantly under change of basis so the underlying geometric object stays invariant — the transformation law being what makes it a tensor rather than a mere array.
Tensor representation — A representation of a general linear or matrix group obtained from finite tensor products of a fundamental representation and its dual, including their irreducible factors.
Ternary Quartic — A homogeneous polynomial form of total degree four in exactly three variables, carrying a fifteen-coefficient parameter space whose positivity, zero locus, and linear-change invariants support distinct algebraic and geometric analyses.
The Monkey and the Coconuts — A named family of recreational Diophantine puzzles in which successive actors repeat the same division-and-remainder rule and a terminal division constrains the unknown initial pile.
Thurston Elliptization Conjecture — A proved three-manifold classification theorem: a closed three-manifold has finite fundamental group exactly when it admits a spherical metric of constant positive sectional curvature.
Tilting theory — Use a self-orthogonal finite-projective-dimension module or analogous tilting object to construct an endomorphism algebra and transport controlled homological information between representation categories.
Topological Degree Theory — Assign an integer-valued signed preimage count that survives admissible homotopy, so a nonzero degree certifies that a continuous map hits the target even when individual solutions cannot be found or tracked.
Topological Space — Capture the minimum data continuity needs by pairing a set with a collection of its subsets — the open sets, closed under arbitrary unions and finite intersections — so that continuity, compactness, and connectedness can be defined with no reference to distance.
Transitive Set — A set that contains every member of each of its members, equivalently a set T satisfying union(T) subseteq T.
Transport of Structure — Define operations, relations, or other structure on one mathematical carrier through a chosen equivalence so that the equivalence becomes structure-preserving by construction.
Transversal (Combinatorics) — A collision-free assignment that chooses one member from each indexed set, equivalently a matching that saturates the family side of its incidence graph.
Tree (Graph Theory) — Characterize a connected acyclic graph — equivalently, one with a unique path between every pair of vertices, or exactly n−1 edges on n vertices — so that recognizing the structure by any one handle imports the bridge-everywhere, fundamental-cycle, and cheapest-connector consequences for free.
Tree (Set Theory) — Organize a partially ordered set so every node's strict predecessors form a well-order, turning ancestry into ordinal height while allowing branching and transfinite limit levels.
Trilinear Interpolation — Estimate a value inside an axis-aligned rectangular grid cell by tensor-product linear interpolation of the eight corner values along three coordinates.
Trivial Representation — A representation whose entire acting group operates as the identity, or whose acting Lie algebra operates as zero, making every vector invariant and exposing invariant multiplicity.
Turán Graph — The balanced complete r-partite graph T(n,r), formed by making nearly equal vertex blocks independent and joining every cross-block pair, uniquely maximizing edges among n-vertex graphs with no K_(r+1).
Ulam number — Generate a seed-dependent increasing integer sequence by repeatedly choosing the least larger integer having exactly one representation as a sum of two distinct earlier terms.
Ultraweak Topology — Topologize a von Neumann algebra as the weak-* dual of its predual, so a net converges exactly when every normal linear functional converges on it.
Unavoidable Pattern — Require that, over every finite alphabet, some alphabet-dependent length threshold forces every longer word to contain a contiguous nonerasing morphic instance of the pattern.
Uniform space — A set equipped with a uniform structure that formalizes relative closeness and supports uniform continuity, convergence, and completeness without a chosen metric.
Unisolvent Point Set — A finite sampling set for which evaluation on a declared finite-dimensional function space is injective, equivalently making interpolation uniquely solvable when the dimensions match.
Univariate — A mathematical or statistical expression, function, distribution or analysis involving exactly one variable rather than a jointly varying tuple.
Universal property — Define a mathematical object not by its internal construction but by the unique pattern of maps it sustains with every other object in a class — a commuting-diagram condition plus a unique-mediating-morphism clause that pins the object down up to unique isomorphism.
Untouchable Number — A positive integer lying outside the image of the aliquot-sum function, classified by the nonexistence of any positive integer whose proper divisors sum to it.
V-Ring (Ring Theory) — Classify a ring by requiring every simple module on a specified side to be injective, equivalently forcing radical and maximal-ideal intersection properties across all modules or ideals.
Venn Diagram — Represent a finite family of sets by closed contours that realize every possible inside/outside membership zone, then mark those zones to express intersections, unions, complements, emptiness, or occupancy.
Volume Element — A local top-dimensional density or form that converts coordinate cells into invariant geometric volume, transforming by a Jacobian and arising from coordinate, metric, Gram-determinant, or orientation data.
Von Neumann Paradox — A planar paradoxical equidecomposition in which finitely many nonmeasurable pieces are rearranged by area-preserving affine transformations to duplicate a bounded figure or equidecompose bounded sets with nonempty interior.
Wave Equation — A second-order hyperbolic field equation that equates temporal acceleration with spatial curvature, encoding finite-speed propagation, traveling and standing modes, energy transport, and initial-boundary-value dynamics.
Wavelet — A localized, oscillating template function whose scaled and translated copies form a basis that resolves a signal simultaneously in position and scale, producing a sparse two-dimensional coefficient plane where features localize in both axes at once — the precondition being a sampled signal with scale-localized, transient structure.
Weak Trace-Class Operator — A compact Hilbert-space operator whose singular values decay at least at harmonic order, placing it in the weak Schatten ideal where ordinary trace summability can fail but singular traces become available.
Weinstein Conjecture — Every Reeb vector field determined by a contact form on a closed contact manifold has at least one closed periodic orbit, a theorem in dimension three and an open assertion in full higher-dimensional generality.
Well-posed problem — Classify a mathematical problem as well posed relative to declared data and solution spaces when a solution exists, is unique, and depends continuously on the data.
Whitehead Theorem — A weak homotopy equivalence between CW complexes is a homotopy equivalence, so component and homotopy-group data detect the full homotopy type inside the CW setting.
Wilf Equivalence — Two permutation classes are Wilf equivalent when they contain the same number of permutations at every length, equivalently when their ordinary generating functions coincide.
Wirtinger Derivatives — Decompose the real differential of a function on complex coordinates into formal derivatives with respect to each variable and its conjugate, exposing holomorphic and antiholomorphic change without pretending nonholomorphic functions are complex-differentiable.
X-Ray Transform — Map a spatial function or field to its integrals over every line, producing projection data from which the source may be reconstructed under stated geometric and analytic conditions.
Zero-Sum Problem — Determine how long a sequence over a finite abelian group must be before a subsequence with zero group-sum and prescribed length properties is unavoidable.
Étale Algebra — A finite-dimensional commutative algebra over a field that is a finite product of finite separable field extensions, and therefore becomes a finite product of copies of the base after separable closure.