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.

Structural Signature¶

Sig role-phrases:

Variable occurrence — Identifies one occurrence of a symbol in the expression rather than classifying the printed name everywhere. It is constitutive. Counterfactual: Without an occurrence there is nothing whose binding status can be tested.
Binding operator or declaration — Introduces the local variable and associates it with an operation or domain. It is constitutive. Counterfactual: A symbol merely appearing in an expression is not bound without a governing binder.
Syntactic scope — Delimits the region within which that binder governs matching occurrences. It is constitutive. Counterfactual: The same symbol outside scope can remain free.
Free-parameter contrast — Tracks what information must come from the surrounding context after local binding is accounted for. It is diagnostic. Counterfactual: Confusing free and bound occurrences changes dependence of the expression.
Domain and renaming discipline — Separates binding syntax from the values available to the operator and prevents capture under substitution. It is operating condition. Counterfactual: A bound variable can still range over different domains and careless renaming can alter meaning.

What It Is Not¶

It is not a property of a letter irrespective of where that letter appears.
It is not the same as a free parameter supplied by the outer expression.
It is not merely a program variable assigned a particular runtime value; formal binding concerns scope.
It is not semantically independent of the domain over which a quantifier or operator ranges.
Closest near-miss. In a sum ∑_k f(k,n), k is bound and n free; the shared surface form 'variable' does not confer one status on every occurrence.

Scope of Application¶

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¶

Locate a particular occurrence, its nearest governing binder, and the binder's scope. In ∑_k f(k,n), k is bound and n free; a repeated letter elsewhere may have another status. Do not confuse syntactic binding with assigning a numerical value. After syntax is fixed, specify the quantifier's or operator's domain before interpreting the expression.

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.

Examples¶

Canonical¶

In ∑_{k=1}^{10} f(k,n), the summation binds k over the indicated index range; n remains a free parameter that can change the result. Renaming k consistently does not change the mathematical value, but substituting for n may.

Mapped back: Variable occurrence → k occurrences in the summand; Binding operator or declaration → summation index k=1,…,10; Syntactic scope → summand f(k,n); Free-parameter contrast → n remains external; Domain and renaming discipline → k ranges over indicated integers and may be consistently renamed.

Applied / In Practice¶

In ∀x ∃y φ(x,y,z), the quantifiers bind x and y within their following formula while z is free. Reusing x under an inner binder would shadow the outer x only within that inner scope.

Mapped back: Variable occurrence → x and y in φ; Binding operator or declaration → universal x and existential y quantifiers; Syntactic scope → the formula governed by each quantifier; Free-parameter contrast → z has no local quantifier; Domain and renaming discipline → truth depends on domain; inner x could shadow outer x.

Structural Tensions¶

T1 — Same Printed Name versus Occurrence-Specific Status. One symbol may be free in a surrounding expression and bound inside a smaller subexpression, so binding cannot be inferred from spelling alone.

Diagnostic: Which occurrence lies under which binder?

T2 — Local Syntactic Binding versus External Semantic Domain. A quantified variable is locally bound yet the domain it ranges over can still change a formula's truth.

Diagnostic: What does the binder range over after scope has been established?

Structural–Framed Character¶

A provisional portable skeleton is a local declaration governing occurrences within a delimited scope. A bound variable is an occurrence controlled by a quantifier, summation, integral, lambda, or other binder under the syntax's rules; “known value” is not equivalent.

Evaluative weight: Low; it is a formal status, not a constraint on importance. Human-practice-bound: Moderate, because formal languages define binding conventions while scope follows syntax. Institutional origin: Logic and mathematics use variants, not one notation. Vocabulary travels: Expressions can be compared after identifying binders and occurrence scopes. Import versus recognize: Recognize binding by syntactic governance; calling any assigned program value “bound” imports a different sense.

Its character: A formal-language occurrence category with portable scope logic and binder-dependent semantics.

Structural Core vs. Domain Accent¶

Skeletal core. A declaration controls variable occurrences inside a bounded region.

Domain-bound accent. Quantifiers, sums, integrals, and lambda binders specify local values under formal syntax.

Why not prime. Local control is broad; without scoped variable occurrences the term is analogy.

Approved root. The catalog does not offer a strict broader variable-occurrence-with-binder node. A quantifier or summation is a binding operator and may compose this relation, but no such operator alone subsumes all bound variables across the listed notations.
Related — free variable, lambda abstraction, quantifier, and variable capture. They are contrast, binder forms, or failure mode rather than synonyms for the bound occurrence.

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

Not to Be Confused With¶

Free variable. Tell: Lacks a local governing binder and depends on outer context.
Runtime assignment. Tell: A value in program execution does not by itself establish formal syntactic binding.
Statistical dummy variable. Tell: A categorical indicator is unrelated to the older bound-variable synonym.
Variable capture. Tell: An erroneous change of binding status during substitution, not the ordinary bound occurrence.

References¶

Frozen Wikipedia discovery revision: https://en.wikipedia.org/wiki/Free_variables_and_bound_variables (revision 1368231711).
Preserved source candidate: https://www.people.vcu.edu/~rhammack/BookOfProof/
Preserved source candidate: https://wals.info/chapter/105
Preserved source candidate: http://www.jstor.org/stable/4177974
Preserved source candidate: https://forallx.openlogicproject.org/forallxyyc.pdf
Preserved source candidate: https://www.gradegrinder.net/Products/lpl-index.html

The frozen Wikipedia revision is discovery provenance. The retained source set was reviewed for identity, formal or operational relation, and scope. The encyclopedia's structural synthesis is bounded to those claims; a thin authority surface is recorded as a nonblocking source-strengthening repair rather than concealed.