Expression (mathematics)

In mathematics, an expression or mathematical expression is a finite combination of symbols that is well-formed according to rules that depend on the context. Mathematical symbols can designate numbers (constants), variables, operations, functions, brackets, punctuation, and grouping to help determine order of operations and other aspects of logical syntax.

Many authors distinguish an expression from a formula, the former denoting a mathematical object, and the latter denoting a statement about mathematical objects. For example, $8x-5$ is an expression, while $8x-5\geq 5x-8$ is a formula. However, in modern mathematics, and in particular in computer algebra, formulas are viewed as expressions that can be evaluated to true or false, depending on the values that are given to the variables occurring in the expressions. For example $8x-5\geq 5x-8$ takes the value false if x is given a value less than –1, and the value true otherwise.

Examples

The use of expressions ranges from the simple:

$3+8$

$8x-5$   (linear polynomial)

$7{{x}^{2}}+4x-10$   (quadratic polynomial)

${\frac {x-1}{{{x}^{2}}+12}}$   (rational fraction)

to the complex:

$f(a)+\sum _{k=1}^{n}\left.{\frac {1}{k!}}{\frac {d^{k}}{dt^{k}}}\right|_{t=0}f(u(t))+\int _{0}^{1}{\frac {(1-t)^{n}}{n!}}{\frac {d^{n+1}}{dt^{n+1}}}f(u(t))\,dt.$

Variables and evaluation

Many mathematical expressions include variables. Any variable can be classified as being either a free variable or a bound variable.

For a given combination of values for the free variables, an expression may be evaluated, although for some combinations of values of the free variables, the value of the expression may be undefined. Thus an expression represents a function whose inputs are the values assigned to the free variables and whose output is the resulting value of the expression.

For example, if the expression $x/y$ is evaluated with x = 10, y = 5, it evaluates to 2; this is denoted

$\left.{\frac {x}{y}}\right|_{x=10,\,y=5}=2.$

The evaluation is undefined for y = 0.

Two expressions are said to be equivalent if, for each combination of values for the free variables, they have the same output, i.e., they represent the same function.

For example, in the expression

$\sum _{n=1}^{3}(2nx),$

the variable n is bound, and the variable x is free. This expression is equivalent to the simpler expression 12 x. The value for x = 3 is 36, which can be denoted

$\sum _{n=1}^{3}(2nx){\Biggr |}_{x=3}=36.$

Syntax versus semantics

Syntax

Main article: Syntax (logic)

An expression is a syntactic construct. It must be well-formed. It can be described somewhat informally as follows: the allowed operators must have the correct number of inputs in the correct places, the characters that make up these inputs must be valid, have a clear order of operations, etc. Strings of symbols that violate the rules of syntax are not well-formed and are not valid mathematical expressions.

For example, in the usual notation of arithmetic, the expression 1 + 2 × 3 is well-formed, but the following expression is not:

$\times 4)x+,/y$.

Somewhat more formally, one can describe a well-formed expression in mathematics as follows:

The alphabet consists of:

• Constants / Definites: Symbols representing fixed objects in the domain of discourse, such as numbers (1, 2.5, 1/7, ...), sets ($\varnothing ,\{1,2,3\}$, ...), truth values (T or F), etc.

• Variables: A countably infinite amount of variables used for representing mathematical objects in the domain. (Usually letters like x, or y)

• Operations: Symbols representing operations that can be performed on elements over the domain, like addition (+), multiplication (×), or set operations like union (∪), or intersection (∩). (Functions can be understood as unary operations)

• Brackets ( )

With this alphabet, the recursive rules for forming well-formed expression (WFE) are as follows:

• Any constant or variable as defined are the atomic expressions (the simplest WFE's). For instance, the expressions "$2$" or "$x$" are syntactically correct expressions.

• Let $F$ be a metavariable for some n-ary operation over the domain, and let $\phi _{1},\phi _{2},...\phi _{n}$ be metavariables for any WFE's.

Then $F(\phi _{1},\phi _{2},...\phi _{n})$ is also a WFE.

For instance, if the domain of discorse is the real numbers, $F$ can denote the binary operation +, then $\phi _{1}+\phi _{2}$ is a WFE. Or $F$ can be the unary operation $\surd$, then ${\sqrt {\phi _{1}}}$ is as well.

A well-formed expression can be thought as a syntax tree. The leaf nodes are always atomic expressions. Operations $+$ and $\cup$ have exactly two child nodes, while operations ${\sqrt {x}}$, $ln(x)$ and ${\frac {d}{dx}}$ have exactly one. There are countably infinitely many WFE's, however, each WFE has a finite number of nodes.

Semantics

Main articles: Semantics and Formal semantics (logic)

Semantics is the study of meaning. Formal semantics is about attaching meaning to expressions.

In algebra, an expression may be used to designate a value, which might depend on values assigned to variables occurring in the expression. The determination of this value depends on the semantics attached to the symbols of the expression. The choice of semantics depends on the context of the expression. The same syntactic expression 1 + 2 × 3 can have different values (mathematically 7, but also 9), depending on the order of operations implied by the context (See also Operations § Calculators).

The semantic rules may declare that certain expressions do not designate any value (for instance when they involve division by 0); such expressions are said to have an undefined value, but they are well-formed expressions nonetheless. In general the meaning of expressions is not limited to designating values; for instance, an expression might designate a condition, or an equation that is to be solved, or it can be viewed as an object in its own right that can be manipulated according to certain rules. Certain expressions that designate a value simultaneously express a condition that is assumed to hold, for instance those involving the operator $\oplus$ to designate an internal direct sum.

Formal languages and lambda calculus

Main articles: Formal language and Lambda calculus

Formal languages allow formalizing the concept of well-formed expressions.

In the 1930s, a new type of expressions, called lambda expressions, were introduced by Alonzo Church and Stephen Kleene for formalizing functions and their evaluation. They form the basis for lambda calculus, a formal system used in mathematical logic and the theory of programming languages.

The equivalence of two lambda expressions is undecidable. This is also the case for the expressions representing real numbers, which are built from the integers by using the arithmetical operations, the logarithm and the exponential (Richardson's theorem).

See also

• Algebraic closure
• Algebraic expression
• Analytic expression
• Closed-form expression
• Combinator
• Computer algebra expression
• Defined and undefined
• Equation
• Expression (programming)
• Formal grammar
• Formula
• Functional programming
• Logical expression
• Term (logic)
• Well-defined expression
• Number sentence

References

• Redden, John (2011). "Elementary Algebra". Flat World Knowledge. Archived from the original on 2014-11-15. Retrieved 2012-03-18.