|This article needs additional citations for verification. (January 2012) (Learn how and when to remove this template message)|
||This article includes a list of references, related reading or external links, but its sources remain unclear because it lacks inline citations. (October 2014) (Learn how and when to remove this template message)|
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, punctuation, grouping, and other aspects of logical syntax.
The use of expressions ranges from the simple:
to the complex:
Mathematical expressions include arithmetic expressions, polynomials, algebraic expressions, closed-form expressions, and analytical expressions. The table below highlights some similarities and differences between these different types.
|Arithmetic expressions||Polynomial expressions||Algebraic expressions||Closed-form expressions||Analytic expressions||Mathematical expressions|
|Elementary arithmetic operation||Yes||Yes||Yes||Yes||Yes||Yes|
|Inverse trigonometric function||No||No||No||Yes||Yes||Yes|
|Inverse hyperbolic function||No||No||No||Yes||Yes||Yes|
|Formal power series||No||No||No||No||No||Yes|
Syntax versus semantics
Being an expression is a syntactic concept.
An expression must be well-formed: the operators must have the correct number of inputs in the correct places, the characters that make up these inputs must be valid, 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 2 + 3 is well-formed, but the following expression is not:
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. These 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 to designate an internal direct sum.
Formal languages 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).
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 value assigned the free variables and whose output is the resulting value of the expression.
For example, the expression
evaluated for x = 10, y = 5, will give 2; but it is undefined for y = 0.
The evaluation of an expression is dependent on the definition of the mathematical operators and on the system of values that is its context.
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. Example:
has free variable x, bound variable n, constants 1, 2, and 3, two occurrences of an implicit multiplication operator, and a summation operator. The expression is equivalent to the simpler expression 12x. The value for x = 3 is 36.
- Redden, John. Elementary Algebra. Flat World Knowledge, 2011.