Skip to content

Approximation

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

Local relationship map for ApproximationParents appear above the current abstraction, mutual partners to the right, and children below. Node labels state whether each abstraction is prime or domain-specific; colors identify relation types.ApproximationPRIMEPrime abstraction: Representation — is a decomposition ofRepresentationPRIMEPrime abstraction: Engineering Tolerances — presupposesEngineeringTolerancesPRIMEPrime abstraction: Progressive Refinement from Core Model — presupposesProgressive Ref…PRIMEPrime abstraction: Design Prototyping — is a decomposition ofDesignPrototypingPRIMEPrime abstraction: Perturbation Theory — is a decomposition ofPerturbationTheoryPRIMEPrime abstraction: Asymptotic Behavior — is a kind ofAsymptoticBehaviorPRIMEPrime abstraction: Dimensionality Reduction — is a kind ofDimensionalityReductionPRIMEPrime abstraction: Heuristic — is a kind ofHeuristicPRIMEPrime abstraction: Monte Carlo Simulation — is a kind ofMonte CarloSimulationPRIMEPrime abstraction: Nonparametric Methods — is a kind ofNonparametricMethodsPRIME

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 (9) — more specific cases that build on this

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

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

Hierarchy path (1) — routes to 1 parentless root

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.