Mathematics & Formal Systems

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

• 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.
• 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.
• 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.
• 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.
• 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.
• 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.
• 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.
• 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.
• 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.
• 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.
• 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.
• 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.
• 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.
• 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.
• 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.
• 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.
• 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.
• 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.
• 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.
• 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.
• 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.
• 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.
• 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.
• 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.
• 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.
• 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.
• 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.
• 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.
• 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.