Approximation¶

Version: v2 · 2026-08-30 · History
Prime #: 10
Origin domain: Mathematics
Also from: Physics, Engineering & Design
Related primes: Abstraction

Core Idea¶

Representing a complex entity with a simpler, "good-enough" model.

How would you explain it like I'm…

Good-Enough Answer

If someone asks how many jellybeans are in a big jar, you don't count every one. You guess close, like "about 200," because that's good enough. An approximation is a good-enough answer you use because the perfect one is too hard to figure out.

Close-enough stand-in

An approximation is when you swap a hard, exact thing for a simpler version that's close enough. Pi is really 3.14159..., but in class you use 3.14 because the extra digits don't matter for your problem. The important rule is that you know how far off your answer might be, and you know your task can handle that much error. If you don't track the error, you're not approximating; you're just guessing and hoping.

Tractable surrogate with known error

Approximation is the deliberate trade of an exact, intractable target for a simpler surrogate you can actually compute with, in exchange for a bounded and known error. Every real approximation specifies four things: the exact object being stood in for, the simpler surrogate used in its place, an error measure relating the two, and the tolerance the use case can absorb. A weather forecaster's model isn't the real atmosphere, but it's good enough to predict tomorrow's rain. The discipline lives or dies on whether you can name the error. Calculus, polynomial approximation, and numerical methods all formalized this idea historically.

Approximation is the deliberate substitution of a tractable surrogate for an intractable target, accepting a bounded and known error in exchange for the ability to compute, reason, or act. Every approximation specifies four elements: the exact object being stood in for, the simpler surrogate used in its place, an error measure relating the two, and the tolerance the use case can absorb. The decisive commitment is that the error is controlled and named — by a strict bound, an asymptotic estimate, or a probabilistic guarantee — and that the purpose can demonstrably absorb it. Historically the discipline was formalized through calculus (Newton's infinitesimal method), Chebyshev's polynomial approximation theory (1854), and Weierstrass's density theorem (1885). Without a named error and a named tolerance, what remains is not approximation but guessing dressed in technical vocabulary.

Broad Use¶

Central to decision-making under uncertainty, numerical simulations, and pragmatic reasoning.

Clarity¶

Provides "good enough" models to navigate uncertainty, e.g., Newtonian mechanics for everyday physics.

Manages Complexity¶

Uses simpler representations that are "good enough," saving time and effort.

Abstract Reasoning¶

Promotes pragmatic reasoning by balancing precision and efficiency.

Knowledge Transfer¶

Foundational in simulation, engineering tolerances, and heuristic problem-solving.

Example¶

Engineers approximate π as 3.14 in calculations where higher precision isn't critical.

Relationships to Other Abstractions¶

Current abstraction Approximation Prime

Parents (1) — more general patterns this builds on

Approximation is a decomposition of Representation Prime

Approximation is the specific shape representation takes when the medium deliberately differs from the target by a bounded, named error.

Children (98) — more specific cases that build on this

Absorbing boundary condition Domain-specific is a kind of Approximation

The proposed strict upward parent is prime:approximation.
Alpha max plus beta min algorithm Domain-specific is a kind of Approximation

The proposed strict upward parent is prime:approximation.
Approximation Algorithm Domain-specific is a kind of Approximation

prime:approximation is the immediate parent: the algorithm returns a controlled good-enough result rather than exact optimum.
Asymptotic analysis Domain-specific is a kind of Approximation

The proposed strict upward parent is prime:approximation.
Beam Propagation Method Domain-specific is a kind of Approximation

Approximation is the strict parent by specialization.

▸ Show 93 more

Bézier surface Domain-specific is a kind of Approximation
The proposed strict upward parent is `prime:approximation`.
Boole's rule Domain-specific is a kind of Approximation
The proposed strict upward parent is `prime:approximation`.
Born–Mayer equation Domain-specific is a kind of Approximation
The proposed strict upward parent is `prime:approximation`.
Classical XY model Domain-specific is a kind of Approximation
The proposed strict upward parent is `prime:approximation`.
Colombeau algebra Domain-specific is a kind of Approximation
The proposed strict upward parent is `prime:approximation`.
Computational model Domain-specific is a kind of Approximation
The proposed strict upward parent is `prime:approximation`.
Davies equation Domain-specific is a kind of Approximation
The proposed strict upward parent is `prime:approximation`.
Development (topology) Domain-specific is a kind of Approximation
The proposed strict upward parent is `prime:approximation`.
Diamond principle Domain-specific is a kind of Approximation
The proposed strict upward parent is `prime:approximation`.
Differential of a function Domain-specific is a kind of Approximation
The proposed strict upward parent is `prime:approximation`.
Directional Derivative Domain-specific is a kind of Approximation
**Approximation** is the strict available parent because a directional derivative is the coefficient of the first-order local approximation along a chosen path.
Discrete dipole approximation Domain-specific is a kind of Approximation
The proposed strict upward parent is `prime:approximation`.
Discrete ordinates method Domain-specific is a kind of Approximation
Discrete ordinates method instantiates Approximation because it replaces a continuous angular transport field and integral with a finite weighted representation whose error can be refined and diagnosed.
Dynamical mean-field theory Domain-specific is a kind of Approximation
The proposed strict upward parent is `prime:approximation`.
Effective Mass (Solid-State Physics) Domain-specific is a kind of Approximation
**Approximation** is the strict parent because effective mass replaces a detailed band or quasiparticle response with a free-particle-like surrogate under explicit regime and error controls.
Einstein–Brillouin–Keller method Domain-specific is a kind of Approximation
The proposed strict upward parent is `prime:approximation`.
Empirical valence bond Domain-specific is a kind of Approximation
The proposed strict upward parent is `prime:approximation`.
Ergun equation Domain-specific is a kind of Approximation
Ergun Equation instantiates Approximation because it compresses unresolved packed-bed flow into an empirically calibrated two-term pressure-loss relation.
Euler–Bernoulli beam theory Domain-specific is a kind of Approximation
The proposed strict upward parent is `prime:approximation`.
Explicit algebraic stress model Domain-specific is a kind of Approximation
The proposed strict upward parent is `prime:approximation`.
Finite difference Domain-specific is a kind of Approximation
The proposed strict upward parent is `prime:approximation`.
Finite Difference Method Domain-specific is a kind of Approximation
The proposed parent is **Approximation**: FDM replaces a differential operator and continuous solution with a tractable grid surrogate, supplies an error measure, and refines that surrogate toward the target.
Finite Element Method Domain-specific is a kind of Approximation
The proposed parent is **Approximation**: FEM replaces an infinite-dimensional variational solution with a tractable finite-dimensional surrogate, supplies norms and error bounds, and supports systematic refinement.
Fixed-precision arithmetic Domain-specific is a kind of Approximation
The proposed strict upward parent is `prime:approximation`.
Formally smooth map Domain-specific is a kind of Approximation
The proposed strict upward parent is `prime:approximation`.
Fully polynomial-time approximation scheme Domain-specific is a kind of Approximation
The proposed strict upward parent is `prime:approximation`.
Fuzzy finite element Domain-specific is a kind of Approximation
The proposed strict upward parent is `prime:approximation`.
Gaussian process emulator Domain-specific is a kind of Approximation
The proposed strict upward parent is `prime:approximation`.
Gauss–Jacobi Quadrature Domain-specific is a kind of Approximation
Gauss–Jacobi quadrature is a strict instance of **Approximation**.
Harmonic Balance Domain-specific is a kind of Approximation
**Approximation** is the proposed immediate parent.
Hartree–Fock method Domain-specific is a kind of Approximation
The proposed strict upward parent is `prime:approximation`.
Henyey–Greenstein phase function Domain-specific is a kind of Approximation
The proposed strict upward parent is `prime:approximation`.
Holstein–Herring method Domain-specific is a kind of Approximation
Holstein–Herring Method instantiates Approximation because it replaces unstable total-energy subtraction with a controlled large-separation surface-flux evaluation whose error is tied to an asymptotic regime.
Kramers–Moyal expansion Domain-specific is a kind of Approximation
The proposed strict upward parent is `prime:approximation`.
Lanczos Approximation Domain-specific is a kind of Approximation
**Approximation** is the strict parent because the finite formula delivers a controlled good-enough representation of Γ.
Lanczos resampling Domain-specific is a kind of Approximation
The proposed strict upward parent is `prime:approximation`.
Lebesgue's lemma Domain-specific is a kind of Approximation
The proposed strict upward parent is `prime:approximation`.
Leimkuhler–Matthews method Domain-specific is a kind of Approximation
The proposed strict upward parent is `prime:approximation`.
Lie-to-children Domain-specific is a kind of Approximation
The proposed strict upward parent is `prime:approximation`.
Linear least squares Domain-specific is a kind of Approximation
The proposed strict upward parent is `prime:approximation`.
Lumen method Domain-specific is a kind of Approximation
The proposed strict upward parent is `prime:approximation`.
Marcinkiewicz interpolation theorem Domain-specific is a kind of Approximation
The proposed strict upward parent is `prime:approximation`.
May spectral sequence Domain-specific is a kind of Approximation
The proposed strict upward parent is `prime:approximation`.
Method of image charges Domain-specific is a kind of Approximation
The proposed strict upward parent is `prime:approximation`.
Method stub Domain-specific is a kind of Approximation
The proposed strict upward parent is `prime:approximation`.
Mie potential Domain-specific is a kind of Approximation
The proposed strict upward parent is `prime:approximation`.
Model compression Domain-specific is a kind of Approximation
The proposed strict upward parent is `prime:approximation`.
Motion interpolation Domain-specific is a kind of Approximation
The proposed strict upward parent is `prime:approximation`.
Multi-Configuration Time-Dependent Hartree Domain-specific is a kind of Approximation
**Approximation** is the proposed minimal parent: MCTDH is a strict, controlled approximation by an adaptive variational manifold.
Multifit algorithm Domain-specific is a kind of Approximation
The proposed strict upward parent is `prime:approximation`.
N-electron valence state perturbation theory Domain-specific is a kind of Approximation
The proposed strict upward parent is `prime:approximation`.
Natural Element Method Domain-specific is a kind of Approximation
**Approximation** is the strict parent.
Orthogonality principle Domain-specific is a kind of Approximation
The proposed strict upward parent is `prime:approximation`.
Osculating plane Domain-specific is a kind of Approximation
The proposed strict upward parent is `prime:approximation`.
Perfect spline Domain-specific is a kind of Approximation
The proposed strict upward parent is `prime:approximation`.
Point-normal triangle Domain-specific is a kind of Approximation
Point-Normal Triangle instantiates Approximation because it replaces an unknown smooth surface region with a computable cubic patch constrained by sparse point-normal data.
Princeton Ocean Model Domain-specific is a kind of Approximation
The proposed strict upward parent is `prime:approximation`.
Proto-value function Domain-specific is a kind of Approximation
The proposed strict upward parent is `prime:approximation`.
Regge calculus Domain-specific is a kind of Approximation
The proposed strict upward parent is `prime:approximation`.
Relaxation (approximation) Domain-specific is a kind of Approximation
The proposed strict upward parent is `prime:approximation`.
Riemann sum Domain-specific is a kind of Approximation
The proposed strict upward parent is `prime:approximation`.
Rule of 72 Domain-specific is a kind of Approximation
The proposed strict upward parent is `prime:approximation`.
Runge–Kutta method (SDE) Domain-specific is a kind of Approximation
The proposed strict upward parent is `prime:approximation`.
Semicomputable function Domain-specific is a kind of Approximation
The proposed strict upward parent is `prime:approximation`.
Shortcuts to adiabaticity Domain-specific is a kind of Approximation
The proposed strict upward parent is `prime:approximation`.
Simon–Glatzel equation Domain-specific is a kind of Approximation
The proposed strict upward parent is `prime:approximation`.
Spectral method Domain-specific is a kind of Approximation
The proposed strict upward parent is `prime:approximation`.
Stone–Weierstrass Theorem Domain-specific is a kind of Approximation
Stone–Weierstrass is a strict specialization of **Approximation**: it supplies an exact structural criterion under which arbitrary continuous targets admit uniformly close representatives from a subalgebra.
Subderivative Domain-specific is a kind of Approximation
The proposed strict upward parent is `prime:approximation`.
Supersymmetric WKB approximation Domain-specific is a kind of Approximation
The proposed strict upward parent is `prime:approximation`.
Tangent measure Domain-specific is a kind of Approximation
The proposed strict upward parent is `prime:approximation`.
Tau-leaping Domain-specific is a kind of Approximation
The proposed strict upward parent is `prime:approximation`.
Taylor series Domain-specific is a kind of Approximation
The proposed strict upward parent is `prime:approximation`.
Test particle Domain-specific is a kind of Approximation
The proposed strict upward parent is `prime:approximation`.
Trilinear Interpolation Domain-specific is a kind of Approximation
**Approximation** is the strict parent because the unknown interior field value is replaced by a controlled local surrogate.
Truncation error Domain-specific is a kind of Approximation
The proposed strict upward parent is `prime:approximation`.
Virtual fundamental class Domain-specific is a kind of Approximation
The proposed strict upward parent is `prime:approximation`.
Wigner Surmise Domain-specific is a kind of Approximation
**Approximation** is the strict parent because the exact 2×2 spacing law is used as a good-enough representation of the harder large-matrix law.
Zero differential overlap Domain-specific is a kind of Approximation
The proposed strict upward parent is `prime:approximation`.
Asymptotic Behavior Prime is a kind of Approximation
Asymptotic behaviour is 'a special, disciplined kind of approximation' — the limiting move of keeping only the dominant term and classifying by growth class.
Dimensionality Reduction Prime is a kind of Approximation
Dimensionality Reduction is a kind of approximation: a low-dimensional surrogate stands in for high-dimensional data with controlled loss.
Estimation Prime is a kind of Approximation
The accepted reference-grade review places Estimation under Approximation because the child instantiates or depends on the parent's broader structure while retaining its own constitutive identity.
Heuristic Prime is a kind of Approximation
A heuristic is a specialization of approximation in which a tractable rule of judgment is substituted for exhaustive optimal analysis.
Monte Carlo Simulation Prime is a kind of Approximation
Monte Carlo simulation is a kind of approximation that substitutes a sampled empirical distribution for an intractable analytical target.
Nonparametric Methods Prime is a kind of Approximation
Nonparametric Methods are a kind of approximation: ranks and flexible estimators substitute tractable surrogates for unspecified distributions.
L-Reduction Domain-specific presupposes Approximation
L-reduction **instantiates `prime:transformation`**.
Eight-Node Quadratic Serendipity Quadrilateral (Q8) Domain-specific is part of Approximation
The minimal proposed parent is **`prime:approximation`** through a strict compositional relation.
Randomized Rounding Domain-specific presupposes Approximation
**Approximation — strict prerequisite and proposed parent.** The method deliberately replaces exact discrete optimization with a tractable relaxation and produces a feasible result whose loss is bounded relative to the true optimum.
Spectral Element Method Domain-specific presupposes Approximation
Spectral Element Method compositionally presupposes **Approximation**: it replaces the exact PDE solution by a tractable piecewise-polynomial surrogate and evaluates accuracy in declared norms as \(h\) or \(p\) changes.
Engineering Tolerances Prime presupposes Approximation
Engineering tolerances presuppose approximation because defining permissible ranges around a nominal target is bounded-error substitution applied to manufacturing.
Progressive Refinement from Core Model Prime presupposes Approximation
Progressive refinement from a core model presupposes approximation because each successive correction is a controlled error term added to a tractable baseline.
Design Prototyping Prime is a decomposition of Approximation
Design prototyping is the specific shape approximation takes when a tractable physical or interactive surrogate stands in for the eventual full product.
Perturbation Theory Prime is a decomposition of Approximation
Perturbation theory is the specific shape approximation takes when an intractable problem is split into a solvable part plus a small expansion parameter.

Hierarchy path (1) — routes to 1 parentless root

Approximation → Representation → Abstraction

Not to Be Confused With¶

Approximation is not Bayesian Updating because Bayesian updating is the process of revising probability estimates as new evidence arrives; approximation is the use of a simplified or imprecise representation in place of exact values to gain computational tractability—Bayesian updating is about belief revision; approximation is about representation simplification.
Approximation is not Monte Carlo Simulation because Monte Carlo simulation uses random sampling to estimate solutions to complex problems; approximation is the use of a simplified or inexact value in place of the true value—Monte Carlo is a computational method; approximation is a representation strategy.
Approximation is not Heuristic because a heuristic is a practical rule that produces good results efficiently; approximation is the use of a simplified representation with known error bounds—heuristics are practical rules; approximation is representation simplification.
Approximation is not Probability because probability is the calibrated quantification of uncertainty; approximation is the use of an inexact value to represent a quantity—probability is about uncertainty quantification; approximation is about representation simplification.
Approximation is not Refinement because refinement is the iterative improvement of a candidate toward adequacy through feedback cycles; approximation is a single-step replacement of exact values with simplified ones for tractability—refinement is iterative improvement; approximation is static simplification.