Fresh variable

In formal reasoning, in particular in mathematical logic, computer algebra, and automated theorem proving, a fresh variable is a variable that did not occur in the context considered so far. The concept is often used without explanation.

Fresh variables may be used to replace other variables, to eliminate variable shadowing or capture. For instance, in alpha-conversion, the processing of terms in the lambda calculus into equivalent terms with renamed variables, replacing variables with fresh variables can be helpful as a way to avoid accidentally capturing variables that should be free. Another use for fresh variables involves the development of loop invariants in formal program verification, where it is sometimes useful to replace constants by newly introduced fresh variables.

Example

For example, in term rewriting, before applying a rule [math]\displaystyle{ l \to r }[/math] to a given term [math]\displaystyle{ t }[/math], each variable in [math]\displaystyle{ l \to r }[/math] should be replaced by a fresh one to avoid clashes with variables occurring in [math]\displaystyle{ t }[/math]. Given the rule

[math]\displaystyle{ append(cons(x,y),z) \to cons(x,append(y,z)) }[/math]

and the term

[math]\displaystyle{ append(cons(x,cons(y,nil)),cons(3,nil)) }[/math],

attempting to find a matching substitution of the rule's left-hand side, [math]\displaystyle{ append(cons(x,y),z) }[/math], within [math]\displaystyle{ append(cons(x,cons(y,nil)),cons(3,nil)) }[/math] will fail, since [math]\displaystyle{ y }[/math] cannot match [math]\displaystyle{ cons(y,nil) }[/math]. However, if the rule is replaced by a fresh copy

[math]\displaystyle{ append(cons(v_1,v_2),v_3) \to cons(v_1,append(v_2,v_3)) }[/math]

before, matching will succeed with the answer substitution [math]\displaystyle{ \{ v_2 \mapsto x, \; v_2 \mapsto cons(y,nil), \; v_3 \mapsto cons(3,nil) \} }[/math].