{
  "id": "enwiki-001378041446",
  "slug": "expression-mathematics",
  "title": "Expression (mathematics)",
  "qid": "",
  "lead": "7x − 5 = 2, the sides of the equation are expressions. In mathematics, an expression is an arrangement of symbols following the context-dependent, syntactic conventions of mathematical notation. Symbols can denote numbers, variables, operations, and functions. Other symbols include punctuation marks and brackets, used for grouping where there is not a well-defined order of operations. Expressions are commonly distinguished from formulas: expressions usually denote mathematical objects, whereas formulas are statements about mathematical objects, such as an equality. This is analogous to natural language, where a noun phrase refers to an object, and a whole sentence refers to a fact. For example, 8x-5 and 3 are both expressions, while the inequality 8x-5 \\geq 3 is a formula. However, formulas are often considered as expressions that can be evaluated to the Boolean values true or false. To evaluate an expression means to find a numerical value equivalent to the expression. Expressions can be evaluated or simplified by replacing operations that appear in them with their result. For example, the expression 8\\times 2-5 simplifies to 16-5 , and evaluates to 11. An expression is often used to define a function, by taking the variables to be arguments, or inputs, of the function, and assigning the output to be the evaluation of the resulting expression.…",
  "body": "7x − 5 = 2, the sides of the equation are expressions.]] In mathematics, an expression is an arrangement of symbols following the context-dependent, syntactic conventions of mathematical notation. Symbols can denote numbers, variables, operations, and functions. Other symbols include punctuation marks and brackets, used for grouping where there is not a well-defined order of operations. Expressions are commonly distinguished from formulas: expressions usually denote mathematical objects, whereas formulas are statements about mathematical objects, such as an equality. This is analogous to natural language, where a noun phrase refers to an object, and a whole sentence refers to a fact. For example, 8x-5 and 3 are both expressions, while the inequality 8x-5 \\geq 3 is a formula. However, formulas are often considered as expressions that can be evaluated to the Boolean values true or false. To evaluate an expression means to find a numerical value equivalent to the expression. Expressions can be evaluated or simplified by replacing operations that appear in them with their result. For example, the expression 8\\times 2-5 simplifies to 16-5 , and evaluates to 11. An expression is often used to define a function, by taking the variables to be arguments, or inputs, of the function, and assigning the output to be the evaluation of the resulting expression. For example, x\\mapsto x^2+1 and f(x) = x^2 + 1 define the function that associates to each number its square plus one. An expression with no variables would define a constant function. Usually, two expressions are considered equal or equivalent if they define the same function; such an equality is called a \"semantic equality\", that is, both expressions \"mean the same thing.\" ==Elementary mathematics== 4\\cdot3^2 + 8 , (replace x with 3) 4 \\cdot 9 + 8 (evaluate the square) 36 + 8 (evaluate the multiplication) 44 (evaluate the addition) A term is a constant or the product of a constant and one or more variables. Some examples include 7, \\; 5x, \\; 13x^2y, \\; 4b The constant of the product is called the coefficient. Terms that are either constants or have the same variables raised to the same powers are called like terms. If there are like terms in an expression, one can simplify the expression by combining the like terms. One adds the coefficients and keeps the same variable. 4x + 7x +2x = 13x 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 an operation over constants and free variables and whose output is the resulting value of the expression. For a non-formalized language, that is, in most mathematical texts outside of mathematical logic, for an individual expression it is not always possible to identify which variables are free and bound. For example, in \\sum_{i , depending on the context, the variable i can be free and k bound, or vice-versa, but they cannot both be free. Determining which value is assumed to be free depends on context and semantics. An expression is often used to define a function, or denote compositions of functions, by taking the variables to be arguments, or inputs, of the function, and assigning the output to be the evaluation of the resulting expression. For example, x\\mapsto x^2+1 and f(x) = x^2 + 1 define the function that associates to each number its square plus one. An expression with no variables would define a constant function. In this way, 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. The equivalence between two expressions is called an identity and is sometimes denoted with \\equiv. For example, in the expression \\sum_{n=1}^{3} (2nx), the variable is bound, and the variable is free. This expression is equivalent to the simpler expression ; that is \\sum_{n=1}^{3} (2nx)\\equiv 12x. The value for is 36, which can be denoted \\sum_{n=1}^{3} (2nx)\\Big|_{x=3}= 36. ==Well-defined expressions== The language of mathematics exhibits a kind of grammar (called formal grammar) about how expressions may be written. There are two considerations for well-definedness of mathematical expressions, syntax and semantics. Syntax is concerned with the rules used for constructing, or transforming the symbols of an expression without regard to any interpretation or meaning given to them. Expressions that are syntactically correct are called well-formed. Semantics is concerned with the meaning of these well-formed expressions. Expressions that are semantically correct are called well-defined. \\times4)x+,/y is not. However, being well-formed is not enough to be considered well-defined. For example in arithmetic, the expression \\frac{1}{0} is well-formed, but it is not well-defined (see Division by zero). Such expressions are called undefined. ===Well-defined=== Semantics is the study of meaning. Formal semantics is about attaching meaning to expressions. An expression that defines a unique value or meaning is said to be well-defined. Otherwise, the expression is said to be ill defined or ambiguous. 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. 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). For real numbers, the product a \\times b \\times c is unambiguous because (a \\times b)\\times c = a \\times (b \\times c) ; hence the notation is said to be well defined. This property, also known as associativity of multiplication, guarantees the result does not depend on the sequence of multiplications; therefore, a specification of the sequence can be omitted. The subtraction operation is non-associative; despite that, there is a convention that a-b-c is shorthand for (a-b)-c , thus it is considered \"well-defined\". On the other hand, Division is non-associative, and in the case of a/b/c , parenthesization conventions are not well established; therefore, this expression is often considered ill-defined. Unlike with functions, notational ambiguities can be overcome by means of additional definitions (e.g., rules of precedence, associativity of the operator). For example, in the programming language C, the operator - for subtraction is left-to-right-associative, which means that a-b-c is defined as (a-b)-c , and the operator = for assignment is right-to-left-associative, which means that a=b=c is defined as a=(b=c) . In the programming language APL there is only one rule: from right to left – but parentheses first. 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} , \\text{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. Except for numbers and variables, every mathematical expression may be viewed as the symbol of an operator followed by a sequence of operands. In computer algebra software, the expressions are usually represented in this way. This representation is very flexible, and many things that seem not to be mathematical expressions at first glance, may be represented and manipulated as such. For example, an equation is an expression with \"=\" as an operator, a matrix may be represented as an expression with \"matrix\" as an operator and its rows as operands. See: Computer algebra expression For evaluating the univariate polynomial a_nx^n+a_{n-1}x^{n-1}+\\cdots +a_0, the most naive method would use n multiplications to compute a_nx^n , use n-1 multiplications to compute a_{n-1} x^{n-1} and so on for a total of \\frac{n(n+1)}{2} multiplications and n additions. Using better methods, such as Horner's rule, this can be reduced to n multiplications and n additions. If some preprocessing is allowed, even more savings are possible ==Types of expressions== ===Algebraic expression=== An algebraic expression is an expression built up from algebraic constants, variables, and the algebraic operations (addition, subtraction, multiplication, division and exponentiation by a rational number). For example, is an algebraic expression. Since taking the square root is the same as raising to the power , the following is also an algebraic expression: \\sqrt{\\frac{1-x^2}{1+x^2}} See also: Algebraic equation and Algebraic closure ===Polynomial expression=== A polynomial is an expression built with scalars (numbers of elements of some field), variables, and the operators of addition, multiplication, and exponentiation to nonnegative integer powers; for example 3(x+1)^2 - xy. Using associativity, commutativity and distributivity, every polynomial expression is equivalent to a polynomial, that is an expression that is a linear combination of products of integer powers of the indeterminates. For example the above polynomial expression is equivalent (denote the same polynomial as 3x^2-xy+6x+3. Many author do not distinguish polynomials and polynomial expressions. In this case the expression of a polynomial expression as a linear combination is called the canonical form, normal form, or expanded form of the polynomial. ===Formal expression=== A formal expression is a kind of string of symbols, created by the same production rules as standard expressions, however, they are used without regard to the meaning of the expression. In this way, two formal expressions are considered equal only if they are syntactically equal, that is, if they are the exact same expression. For instance, the formal expressions \"2\" and \"1+1\" are not equal. ===Lambda calculus=== Formal languages allow formalizing the concept of well-formed expressions. In the 1930s, a new type of expression, the lambda expression, was introduced by Alonzo Church and Stephen Kleene for formalizing functions and their evaluation. The lambda operators (lambda abstraction and function application) form the basis for lambda calculus, a formal system used in mathematical logic and programming language theory. The equivalence of two lambda expressions is undecidable (but see unification (computer science)). 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). x^3 - 2x^2 + 10x -1, Would be written in Diophantus's syncopated notation as: \\Kappa^{\\upsilon} \\overline{\\alpha} \\; \\zeta \\overline{\\iota} \\;\\, \\pitchfork \\;\\, \\Delta^{\\upsilon} \\overline{\\beta} \\; \\Mu \\overline{\\alpha} \\,\\; In the 7th century, Brahmagupta used different colours to represent the unknowns in algebraic equations in the Brāhmasphuṭasiddhānta. Greek and other ancient mathematical advances, were often trapped in cycles of bursts of creativity, followed by long periods of stagnation, but this began to change as knowledge spread in the early modern period. ==See also== Analytic expression Closed-form expression Formal calculation Functional programming Infinite expression Number sentence Rewriting Signature (logic) ==Notes== ==References==",
  "categories": [
    "101634858",
    "107141658",
    "20353103",
    "20476467",
    "22901163",
    "23118434",
    "23603337",
    "44446176",
    "54769530"
  ],
  "license": "CC BY-SA 4.0",
  "source_uri": "https://en.wikipedia.org/w/index.php?oldid=1378041446",
  "content_hash": "",
  "created_at": null,
  "updated_at": 1790951471.0,
  "claims": [],
  "contradictions": [],
  "confidence": 0.6,
  "csl": {
    "id": "enwiki-001378041446",
    "type": "webpage",
    "title": "Expression (mathematics)",
    "author": [
      {
        "family": "Anticloud FZ LLE",
        "literal": "Anticloud FZ LLE"
      }
    ],
    "container-title": "encyclopegia.org",
    "publisher": "Anticloud FZ LLE",
    "publisher-place": "Dubai, United Arab Emirates",
    "URL": "https://encyclopegia.org/a/expression-mathematics",
    "issued": {
      "date-parts": [
        [
          2026,
          11,
          16
        ]
      ]
    },
    "accessed": {
      "date-parts": [
        [
          2026,
          11,
          16
        ]
      ]
    },
    "license": "CC BY-SA 4.0",
    "DOI": "eo1:enwiki-001378041446",
    "isBasedOn": "https://en.wikipedia.org/w/index.php?oldid=1378041446",
    "note": "Immutable snapshot enwiki-001378041446"
  }
}