{
  "id": "enwiki-001378321732",
  "slug": "algebraic-structure",
  "title": "Algebraic structure",
  "qid": "",
  "lead": "In mathematics, an algebraic structure or algebraic system consists of a nonempty set A (called the underlying set, carrier set or domain), a collection of operations on A (typically binary operations such as addition and multiplication), and a finite set of identities (known as axioms) that these operations must satisfy. An algebraic structure may be based on other algebraic structures with operations and axioms involving several structures. For instance, a vector space involves a second structure called a field, and an operation called scalar multiplication between elements of the field (called scalars), and elements of the vector space (called vectors). Abstract algebra is the name that is commonly given to the study of algebraic structures. The general theory of algebraic structures has been formalized in universal algebra. Category theory is another formalization that includes other mathematical structures and functions between structures of the same type (homomorphisms). In universal algebra, an algebraic structure is called an algebra; this term may be ambiguous, since, in other contexts, an algebra is an algebraic structure that is a vector space over a field or a module over a commutative ring.…",
  "body": "In mathematics, an algebraic structure or algebraic system consists of a nonempty set A (called the underlying set, carrier set or domain), a collection of operations on A (typically binary operations such as addition and multiplication), and a finite set of identities (known as axioms) that these operations must satisfy. An algebraic structure may be based on other algebraic structures with operations and axioms involving several structures. For instance, a vector space involves a second structure called a field, and an operation called scalar multiplication between elements of the field (called scalars), and elements of the vector space (called vectors). Abstract algebra is the name that is commonly given to the study of algebraic structures. The general theory of algebraic structures has been formalized in universal algebra. Category theory is another formalization that includes other mathematical structures and functions between structures of the same type (homomorphisms). In universal algebra, an algebraic structure is called an algebra; this term may be ambiguous, since, in other contexts, an algebra is an algebraic structure that is a vector space over a field or a module over a commutative ring. The collection of all structures of a given type (same operations and same laws) is called a variety in universal algebra; this term is also used with a completely different meaning in algebraic geometry, as an abbreviation of algebraic variety. In category theory, the collection of all structures of a given type and homomorphisms between them form a concrete category. ===Equational axioms=== An axiom of an algebraic structure often has the form of an identity, that is, an equation such that the two sides of the equals sign are expressions that involve operations of the algebraic structure and variables. If the variables in the identity are replaced by arbitrary elements of the algebraic structure, the equality must remain true. Here are some common examples. Commutativity: An operation * is commutative if x*y=y*x for every and in the algebraic structure. Associativity: An operation * is associative if (x*y)*z=x*(y*z) for every , and in the algebraic structure. Left distributivity: An operation * is left-distributive with respect to another operation + if x*(y+z)=(x*y)+(x*z) for every , and in the algebraic structure (the second operation is denoted here as + , because the second operation is addition in many common examples). Right distributivity: An operation * is right-distributive with respect to another operation + if (y+z)*x=(y*x)+(z*x) for every , and in the algebraic structure. Distributivity: An operation * is distributive with respect to another operation + if it is both left-distributive and right-distributive. If the operation * is commutative, left and right distributivity are both equivalent to distributivity. ===Existential axioms=== Some common axioms contain an existential clause. In general, such a clause can be avoided by introducing further operations, and replacing the existential clause by an identity involving the new operation. More precisely, let us consider an axiom of the form \"for all there is such that where is a -tuple of variables. Choosing a specific value of for each value of defines a function \\varphi:X\\mapsto y, which can be viewed as an operation of arity , and the axiom becomes the identity f(X,\\varphi(X))=g(X,\\varphi(X)). The introduction of such auxiliary operation complicates slightly the statement of an axiom, but has some advantages. Given a specific algebraic structure, the proof that an existential axiom is satisfied consists generally of the definition of the auxiliary function, completed with straightforward verifications. Also, when computing in an algebraic structure, one generally uses explicitly the auxiliary operations. For example, in the case of numbers, the additive inverse is provided by the unary minus operation x\\mapsto -x. Also, in universal algebra, a variety is a class of algebraic structures that share the same operations, and the same axioms, with the condition that all axioms are identities. What precedes shows that existential axioms of the above form are accepted in the definition of a variety. Here are some of the most common existential axioms. Identity element A binary operation * has an identity element if there is an element such that x*e=x\\quad \\text{and} \\quad e*x=x for all in the structure. Here, the auxiliary operation is the operation of arity zero that has as its result. Inverse element Given a binary operation * that has an identity element , an element is invertible if it has an inverse element, that is, if there exists an element \\operatorname{inv}(x) such that \\operatorname{inv}(x)*x=e \\quad \\text{and} \\quad x*\\operatorname{inv}(x)=e. For example, a group is an algebraic structure with a binary operation that is associative, has an identity element, and for which all elements are invertible. \\forall x, \\quad x=0 \\quad\\text{or} \\quad x \\cdot\\operatorname{inv}(x)=1. The operation can be viewed either as a partial operation that is not defined for ; or as an ordinary function whose value at 0 is arbitrary and must not be used. Identities are equations formulated using only the operations the structure allows, and variables that are tacitly universally quantified over the relevant universe. Identities contain no connectives, existentially quantified variables, or relations of any kind other than the allowed operations. The study of varieties is an important part of universal algebra. An algebraic structure in a variety may be understood as the quotient algebra of term algebra (also called \"absolutely free algebra\") divided by the equivalence relations generated by a set of identities. So, a collection of functions with given signatures generate a free algebra, the term algebra T. Given a set of equational identities (the axioms), one may consider their symmetric, transitive closure E. The quotient algebra T/E is then the algebraic structure or variety. Thus, for example, groups have a signature containing two operators: the multiplication operator m, taking two arguments, and the inverse operator i, taking one argument, and the identity element e, a constant, which may be considered an operator that takes zero arguments. Given a (countable) set of variables x, y, z, etc. the term algebra is the collection of all possible terms involving m, i, e and the variables; so for example, m(i(x), m(x, m(y,e))) would be an element of the term algebra. One of the axioms defining a group is the identity m(x, i(x)) = e; another is m(x,e) = x. The axioms can be represented as trees. These equations induce equivalence classes on the free algebra; the quotient algebra then has the algebraic structure of a group. Some structures do not form varieties, because either: It is necessary that 0&nbsp;≠&nbsp;1, 0 being the additive identity element and 1 being a multiplicative identity element, but this is a nonidentity; Structures such as fields have some axioms that hold only for nonzero members of S. For an algebraic structure to be a variety, its operations must be defined for all members of S; there can be no partial operations. Structures whose axioms unavoidably include nonidentities are among the most important ones in mathematics, e.g., fields and division rings. Structures with nonidentities present challenges that varieties do not. For example, the direct product of two fields is not a field, because (1,0)\\cdot(0,1)=(0,0) , but fields do not have zero divisors.",
  "categories": [
    "20353103",
    "22945744",
    "23118434",
    "23603337",
    "24745114",
    "29176471",
    "61225789"
  ],
  "license": "CC BY-SA 4.0",
  "source_uri": "https://en.wikipedia.org/w/index.php?oldid=1378321732",
  "content_hash": "",
  "created_at": null,
  "updated_at": 1791064687.0,
  "claims": [],
  "contradictions": [],
  "confidence": 0.6,
  "csl": {
    "id": "enwiki-001378321732",
    "type": "webpage",
    "title": "Algebraic structure",
    "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/algebraic-structure",
    "issued": {
      "date-parts": [
        [
          2026,
          11,
          21
        ]
      ]
    },
    "accessed": {
      "date-parts": [
        [
          2026,
          11,
          21
        ]
      ]
    },
    "license": "CC BY-SA 4.0",
    "DOI": "eo1:enwiki-001378321732",
    "isBasedOn": "https://en.wikipedia.org/w/index.php?oldid=1378321732",
    "note": "Immutable snapshot enwiki-001378321732"
  }
}