Substitution (logic)

A substitution is a syntactic transformation on formal expressions. To apply a substitution to an expression means to consistently replace its variable, or placeholder, symbols with other expressions.

The resulting expression is called a substitution instance, or instance for short, of the original expression.

Propositional logic

Definition

Where ψ and φ represent formulas of propositional logic, ψ is a substitution instance of φ if and only if ψ may be obtained from φ by substituting formulas for propositional variables in φ, replacing each occurrence of the same variable by an occurrence of the same formula. For example:

(R → S) & (T → S)

is a substitution instance of:

P & Q

and

(A ↔ A) ↔ (A ↔ A)

is a substitution instance of:

(A ↔ A)

In some deduction systems for propositional logic, a new expression (a proposition) may be entered on a line of a derivation if it is a substitution instance of a previous line of the derivation (Hunter 1971, p. 118). This is how new lines are introduced in some axiomatic systems. In systems that use rules of transformation, a rule may include the use of a substitution instance for the purpose of introducing certain variables into a derivation.

Tautologies

A propositional formula is a tautology if it is true under every valuation (or interpretation) of its predicate symbols. If Φ is a tautology, and Θ is a substitution instance of Φ, then Θ is again a tautology. This fact implies the soundness of the deduction rule described in the previous section.

First-order logic

In first-order logic, a substitution is a total mapping σ: V → T from variables to terms; many, ^{[1] : 73  [2] : 445} but not all ^{[3] : 250} authors additionally require σ(x) = x for all but finitely many variables x. The notation { x₁ ↦ t₁, …, x_k ↦ t_k } ^{[note 1]} refers to a substitution mapping each variable x_i to the corresponding term t_i, for i=1,…,k, and every other variable to itself; the x_i must be pairwise distinct. Applying that substitution to a term t is written in postfix notation as t { x₁ ↦ t₁, ..., x_k ↦ t_k }; it means to (simultaneously) replace every occurrence of each x_i in t by t_i. ^{[note 2]} The result tσ of applying a substitution σ to a term t is called an instance of that term t. For example, applying the substitution { x ↦ z, z ↦ h(a,y) } to the term

f(	z	, a, g(	x	), y)	yields
f(	h(a,y)	, a, g(	z	), y)	.

The domaindom(σ) of a substitution σ is commonly defined as the set of variables actually replaced, i.e. dom(σ) = { x ∈ V | xσ ≠ x }. A substitution is called a ground substitution if it maps all variables of its domain to ground, i.e. variable-free, terms. The substitution instance tσ of a ground substitution is a ground term if all of t's variables are in σ's domain, i.e. if vars(t) ⊆ dom(σ). A substitution σ is called a linear substitution if tσ is a linear term for some (and hence every) linear term t containing precisely the variables of σ's domain, i.e. with vars(t) = dom(σ). A substitution σ is called a flat substitution if xσ is a variable for every variable x. A substitution σ is called a renaming substitution if it is a permutation on the set of all variables. Like every permutation, a renaming substitution σ always has an inverse substitution σ⁻¹, such that tσσ⁻¹ = t = tσ⁻¹σ for every term t. However, it is not possible to define an inverse for an arbitrary substitution.

For example, { x ↦ 2, y ↦ 3+4 } is a ground substitution, { x ↦ x₁, y ↦ y₂+4 } is non-ground and non-flat, but linear, { x ↦ y₂, y ↦ y₂+4 } is non-linear and non-flat, { x ↦ y₂, y ↦ y₂ } is flat, but non-linear, { x ↦ x₁, y ↦ y₂ } is both linear and flat, but not a renaming, since it maps both y and y₂ to y₂; each of these substitutions has the set {x,y} as its domain. An example for a renaming substitution is { x ↦ x₁, x₁ ↦ y, y ↦ y₂, y₂ ↦ x }, it has the inverse { x ↦ y₂, y₂ ↦ y, y ↦ x₁, x₁ ↦ x }. The flat substitution { x ↦ z, y ↦ z } cannot have an inverse, since e.g. (x+y) { x ↦ z, y ↦ z } = z+z, and the latter term cannot be transformed back to x+y, as the information about the origin a z stems from is lost. The ground substitution { x ↦ 2 } cannot have an inverse due to a similar loss of origin information e.g. in (x+2) { x ↦ 2 } = 2+2, even if replacing constants by variables was allowed by some fictitious kind of "generalized substitutions".

Two substitutions are considered equal if they map each variable to syntactically equal result terms, formally: σ = τ if xσ = xτ for each variable x ∈ V. The composition of two substitutions σ = { x₁ ↦ t₁, …, x_k ↦ t_k } and τ = { y₁ ↦ u₁, …, y_l ↦ u_l } is obtained by removing from the substitution { x₁ ↦ t₁τ, …, x_k ↦ t_kτ, y₁ ↦ u₁, …, y_l ↦ u_l } those pairs y_i ↦ u_i for which y_i ∈ { x₁, …, x_k }. The composition of σ and τ is denoted by στ. Composition is an associative operation, and is compatible with substitution application, i.e. (ρσ)τ = ρ(στ), and (tσ)τ = t(στ), respectively, for every substitutions ρ, σ, τ, and every term t. The identity substitution, which maps every variable to itself, is the neutral element of substitution composition. A substitution σ is called idempotent if σσ = σ, and hence tσσ = tσ for every term t. The substitution { x₁ ↦ t₁, …, x_k ↦ t_k } is idempotent if and only if none of the variables x_i occurs in any t_i. Substitution composition is not commutative, that is, στ may be different from τσ, even if σ and τ are idempotent. ^{[1] : 73–74  [2] : 445–446}

For example, { x ↦ 2, y ↦ 3+4 } is equal to { y ↦ 3+4, x ↦ 2 }, but different from { x ↦ 2, y ↦ 7 }. The substitution { x ↦ y+y } is idempotent, e.g. ((x+y) {x↦y+y}) {x↦y+y} = ((y+y)+y) {x↦y+y} = (y+y)+y, while the substitution { x ↦ x+y } is non-idempotent, e.g. ((x+y) {x↦x+y}) {x↦x+y} = ((x+y)+y) {x↦x+y} = ((x+y)+y)+y. An example for non-commuting substitutions is { x ↦ y } { y ↦ z } = { x ↦ z, y ↦ z }, but { y ↦ z} { x ↦ y} = { x ↦ y, y ↦ z }.

Algebra

Substitution is a basic operation in algebra, in particular in computer algebra. ^{[4] [5]}

A common case of substitution involves polynomials, where substitution of a numerical value (or another expression) for the indeterminate of a univariate polynomial amounts to evaluating the polynomial at that value. Indeed, this operation occurs so frequently that the notation for polynomials is often adapted to it; instead of designating a polynomial by a name like P, as one would do for other mathematical objects, one could define

${\displaystyle P(X)=X^{5}-3X^{2}+5X-17}$

so that substitution for X can be designated by replacement inside "P(X)", say

${\displaystyle P(2)=13}$

or

${\displaystyle P(X+1)=X^{5}+5X^{4}+10X^{3}+7X^{2}+4X-14.}$

Substitution can also be applied to other kinds of formal objects built from symbols, for instance elements of free groups. In order for substitution to be defined, one needs an algebraic structure with an appropriate universal property, that asserts the existence of unique homomorphisms that send indeterminates to specific values; the substitution then amounts to finding the image of an element under such a homomorphism.

Substitution is related to, but not identical to, function composition; it is closely related to β-reduction in lambda calculus. In contrast to these notions, however, the accent in algebra is on the preservation of algebraic structure by the substitution operation, the fact that substitution gives a homomorphism for the structure at hand (in the case of polynomials, the ring structure).^{[ citation needed ]}

See also

• Integration by substitution
• Lambda calculus § Substitution
• String interpolation
• Substitution property of Equality
• Trigonometric substitution
• Universal instantiation

Notes

1. Some authors use [ t₁/x₁, …, t_k/x_k ] to denote that substitution, e.g. M. Wirsing (1990). Jan van Leeuwen (ed.). Algebraic Specification. Handbook of Theoretical Computer Science. Vol. B. Elsevier. pp. 675–788., here: p. 682.
2. From a term algebra point of view, the set T of terms is the free term algebra over the set V of variables, hence for each substitution mapping σ: V → T there is a unique homomorphism σ: T → T that agrees with σ on V ⊆ T; the above-defined application of σ to a term t is then viewed as applying the function σ to the argument t.

Citations

1. David A. Duffy (1991). Principles of Automated Theorem Proving. Wiley.
2. Franz Baader, Wayne Snyder (2001). Alan Robinson and Andrei Voronkov (ed.). Unification Theory (PDF). Elsevier. pp. 439–526. Archived from the original (PDF) on 2015-06-08. Retrieved 2014-09-24.
3. N. Dershowitz; J.-P. Jouannaud (1990). "Rewrite Systems". In Jan van Leeuwen (ed.). Formal Models and Semantics. Handbook of Theoretical Computer Science. Vol. B. Elsevier. pp. 243–320.
4. Margret H. Hoft; Hartmut F.W. Hoft (6 November 2002). Computing with Mathematica. Elsevier. ISBN   978-0-08-048855-4.
5. Andre Heck (6 December 2012). Introduction to Maple . Springer Science & Business Media. ISBN   978-1-4684-0484-5. substitution.

References

• Crabbé, M. (2004). On the Notion of Substitution . Logic Journal of the IGPL, 12, 111–124.
• Curry, H. B. (1952) On the definition of substitution, replacement and allied notions in an abstract formal system . Revue philosophique de Louvain 50, 251–269.
• Hunter, G. (1971). Metalogic: An Introduction to the Metatheory of Standard First Order Logic. University of California Press. ISBN   0-520-01822-2
• Kleene, S. C. (1967). Mathematical Logic. Reprinted 2002, Dover. ISBN   0-486-42533-9

External links

• Substitution at the nLab