Bound variable¶

A variable occurrence governed by a quantifier, function parameter, summation, integral, or other binder within its specified scope.

Version: v1 · 2026-09-28 · History
Domain-specific #: 8254
Domain group: Formal Sciences
Origin domain: Mathematics
Subdomains: Formal Logic and Variable Binding, Mathematical Logic → Mathematics
Aliases: Apparent variable (historical)

Core Idea¶

A bound variable is an occurrence controlled by a binder in a formal expression. A quantifier, summation, integral, limit, or function definition introduces a variable and a syntactic scope; matching occurrences within that scope get their local role from the binder rather than from an external assignment. The first classification is occurrence-level because the same printed symbol may be free elsewhere.

The familiar summation ∑_{k=1}^{10} f(k,n) illustrates the distinction: k is locally bound while n remains an external parameter. Binding does not make the surrounding domain irrelevant: the truth of a quantified statement can depend on which values a bound symbol ranges over. Nested binders can shadow earlier names, and a substitution that unintentionally brings a free symbol under a binder can change meaning through variable capture.

How would you explain it like I'm…

Inside-Only Names

If a teacher says 'every kid gets a sticker,' the words 'every kid' just mean 'each one, one at a time' inside that sentence — they don't point to one special kid. That's like a bound variable: a name that only has meaning inside its own little instruction. A name that points to someone from outside, like 'give Sam a sticker,' is different.

Letters That Stay Inside

In math, a bound variable is a letter whose meaning is controlled by something in the expression itself, like 'for every x' or a sum sign. For example, in 'add up k for k = 1 to 10,' the letter k just runs through 1, 2, 3 and so on — it has no value outside the sum. A free variable, by contrast, gets its value from outside. In a sum like 'add up k times n for k = 1 to 10,' k is bound but n is free. The same letter can be bound in one place and free in another, so you have to check each place it appears.

Variables Governed by Binders

A bound variable is an occurrence of a variable that is controlled by a binder — such as a quantifier (for all, there exists), a summation, an integral, a limit or a function definition. The binder introduces the variable and a scope, and occurrences inside that scope take their role from the binder rather than from an outside value. In ∑_{k=1}^{10} f(k, n), k is bound while n is a free parameter. Whether a variable is bound is judged occurrence by occurrence, since the same symbol can be bound in one place and free in another. Binding doesn't make the range irrelevant: 'there exists x with x² = 2' is true over the real numbers but false over the rationals. When substituting, you must avoid variable capture — accidentally putting a free symbol under a binder that uses the same name, which changes the meaning.

A bound variable is an occurrence of a variable within the scope of a binder in a formal expression. Binders — quantifiers, summation and product operators, integrals, limits, lambda abstraction and function definitions — introduce a variable together with a syntactic scope, and matching occurrences within that scope receive their role from the binder rather than from an external assignment. Classification is occurrence-level: the same symbol may be bound in one place and free elsewhere. In ∑_{k=1}^{10} f(k, n), k is locally bound while n is an external parameter. Binding does not remove dependence on the domain: the truth of a quantified formula can depend on the range of the bound variable. Nested binders can shadow outer bindings of the same name, and substitution must avoid variable capture, where a free variable is inadvertently brought under a binder, changing the meaning. Bound variables can be consistently renamed without changing meaning, provided no capture results.

Scope of Application¶

Literal uses require an expression with a specified binder, variable occurrence, and syntactic scope.

Logic. Classifies variable occurrences within quantified formulas.
Mathematical operators. Distinguishes summation, integration, and limit indices from external parameters.
Function and lambda notation. Tracks parameter scope, renaming, and nested shadowing.
Formal substitution. Avoids variable capture when rewriting expressions.

Clarity¶

For one variable occurrence, find the binder and trace its scope. In ∑_k f(k,n), k is bound but n is free. The same printed letter can have different status elsewhere. Binding is not merely receiving a runtime value; quantifier domains and nested shadowing still matter, and careless substitution can capture a formerly free occurrence.

Manages Complexity¶

The concept compresses many notations into one relation among binder, scope, and occurrence. This makes variable renaming and dependence transparent, while revealing why nested scopes and careless substitution can change a formula without changing its visible variable names much.

Abstract Reasoning¶

Choose an exact variable occurrence rather than only its symbol name.
Identify every binder that could govern that occurrence.
Trace the syntactic scope and choose the effective nearest binder.
Mark remaining ungoverned occurrences as free parameters.
Check domain assumptions, shadowing, and possible capture before renaming or substitution.

Knowledge Transfer¶

The binder–scope–occurrence test transfers literally among logic, sums, integrals, functions, and lambda expressions once each syntax supplies a binding convention. It does not mean every variable that receives a computational value is formally bound, and a statistical dummy variable is a separate term despite the lexical overlap.

Neighborhood in Abstraction Space¶

Bound variable sits in a moderately populated region (45^th percentile for distinctiveness): it has near-neighbors but no dense thicket of look-alikes.

Family — Language Structure & Grammar Formalisms (23 abstractions)

Nearest neighbors

Computed from structural-signature embeddings · 2026-10-08