Expression (mathematics)

Short description: Formula that represents a mathematical object

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.^{[citation needed]} For example, [math]\displaystyle{ 8x-5 }[/math] is an expression, while [math]\displaystyle{ 8x-5 \geq 5x-8 }[/math] 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 [math]\displaystyle{ 8x-5 \geq 5x-8 }[/math] 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:

[math]\displaystyle{ 3+8 }[/math]

[math]\displaystyle{ 8x-5 }[/math] (linear polynomial)

[math]\displaystyle{ 7{{x}^{2}}+4x-10 }[/math] (quadratic polynomial)

[math]\displaystyle{ \frac{x-1}{{{x}^{2}}+12} }[/math] (rational fraction)

to the complex:

[math]\displaystyle{ 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. }[/math]

Syntax versus semantics

Syntax

Main page: Philosophy:Syntax (logic)

An expression is a syntactic construct. It must be well-formed: 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:

[math]\displaystyle{ \times4)x+,/y }[/math].

Semantics

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 [math]\displaystyle{ \oplus }[/math] to designate an internal direct sum.

Formal languages and lambda calculus

Main pages: 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).

Variables

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.^{[citation needed]}

For example, the expression

[math]\displaystyle{ x/y }[/math]

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

[math]\displaystyle{ \sum_{n=1}^{3} (2nx) }[/math]

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.

References

"Elementary Algebra". Flat World Knowledge. 2011. http://catalog.flatworldknowledge.com/bookhub/reader/128?e=fwk-redden-ch02.

0.00

(0 votes)

Original source: https://en.wikipedia.org/wiki/Expression (mathematics). Read more

v t e Mathematical logic
General	Formal language Formation rule Formal proof Formal semantics Well-formed formula Set Element Class Classical logic Axiom Rule of inference Relation Theorem Logical consequence Type theory Symbol Syntax Theory
Systems	Formal system Deductive system Axiomatic system Hilbert style systems Natural deduction Sequent calculus
Traditional logic	Proposition Inference Argument Validity Cogency Syllogism Square of opposition Venn diagram
Propositional calculus and Boolean logic	Boolean functions Propositional calculus Propositional formula Logical connectives Truth tables Many-valued logic
Predicate logic	First-order Quantifiers Predicate Second-order Monadic predicate calculus
Naive set theory	Set Empty set Element Enumeration Extensionality Finite set Infinite set Subset Power set Countable set Uncountable set Recursive set Domain Codomain Image Map Function Relation Ordered pair
Set theory	Foundations of mathematics Zermelo–Fraenkel set theory Axiom of choice General set theory Kripke–Platek set theory Von Neumann–Bernays–Gödel set theory Morse–Kelley set theory Tarski–Grothendieck set theory
Model theory	Model Interpretation Non-standard model Finite model theory Truth value Validity
Proof theory	Formal proof Deductive system Formal system Theorem Logical consequence Rule of inference Syntax
Computability theory	Recursion Recursive set Recursively enumerable set Decision problem Church–Turing thesis Computable function Primitive recursive function