Expression (mathematics)

From Wikipedia, the free encyclopedia
  (Redirected from Mathematical expression)
Jump to: navigation, search

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, symbols of grouping, and other syntactic symbols.

Examples[edit]

The use of expressions ranges from the simple:

0+0
8x-5   (linear polynomial)
7{{x}^{2}}+4x-10   (quadratic polynomial)
\frac{x-1}{{{x}^{2}}+12}   (rational expression)

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.

Different forms of mathematical expressions[edit]

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.

Syntax vs. Semantics[edit]

Syntax: well-formed expressions[edit]

Main article: Syntax

Being an expression is a syntactic concept.

An expression must be well-formed; i.e., the operators must have the correct number of inputs, in the correct places. 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 expression * 2 + is not. Similarly,

\times4)x+,/y

would not be considered a mathematical expression but only a meaningless jumble.[1]

Semantics: meaningful expressions[edit]

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 \oplus to designate an internal direct sum.

Formal languages and lambda calculus[edit]

Formal languages are concerned by how expressions are constructed. They form a key element of formal systems.

Expressions and their evaluation were formalized by Alonzo Church and Stephen Kleene[2] in the 1930s in their lambda calculus. The lambda calculus has been a major influence in the development of modern mathematics and computer programming languages.[3]

One of the more interesting results of the lambda calculus is that the equivalence of two expressions in the lambda calculus is in some cases undecidable. This is also true of any expression in any system that has power equivalent to the lambda calculus.

Variables[edit]

Many mathematical expressions include letters called 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 value assigned the free variables and whose output is the resulting value of the expression.[4]

For example, the expression

 x/y

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:

The expression

\sum_{n=1}^{3} (2nx)

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.

See also[edit]

Notes[edit]

References[edit]