Commutative property

In mathematics, a binary operation is commutative if changing the order of the operands does not change the result. It is a fundamental property of many binary operations, and many mathematical proofs depend on it. Most familiar as the name of the property that says something like "3 + 4 = 4 + 3" or "2 × 5 = 5 × 2", the property can also be used in more advanced settings. The name is needed because there are operations, such as division and subtraction, that do not have it (for example, "3 − 5 ≠ 5 − 3"); such operations are not commutative, and so are referred to as noncommutative operations. The idea that simple operations, such as the multiplication and addition of numbers, are commutative was for many years implicitly assumed. Thus, this property was not named until the 19th century, when mathematics started to become formalized. A similar property exists

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Related publications (18)

Related publications

Related people

Related units

Related concepts (129)

Related concepts

Related courses (33)

Related courses

Related lectures (63)

Related lectures

Unique decomposition of homogeneous languages and application to isothetic regions

Nicolas René Jean Ninin

A language is said to be homogeneous when all its words have the same length. Homogeneous languages thus form a monoid under concatenation. It becomes freely commutative under the simultaneous actions of every permutation group G(n) on the collection of homogeneous languages of length n is an element of N. One recovers the isothetic regions from (Haucourt 2017, to appear (online since October 2017)) by considering the alphabet of connected subsets of the space vertical bar G vertical bar, viz the geometric realization of a finite graph G. Factoring the geometric model of a conservative program amounts to parallelize it, and there exists an efficient factoring algorithm for isothetic regions. Yet, from the theoretical point of view, one wishes to go beyond the class of conservative programs, which implies relaxing the finiteness hypothesis on the graph G. Provided that the collections of n-dimensional isothetic regions over G (denoted by R-n vertical bar G vertical bar) are co -unital distributive lattices, the prime decomposition of isothetic regions is given by an algorithm which is, unfortunately, very inefficient. Nevertheless, if the collections R-n vertical bar G vertical bar satisfy the stronger property of being Boolean algebras, then the efficient factoring algorithm is available again. We relate the algebraic properties of the collections R-n vertical bar G vertical bar to the geometric properties of the space I GI. On the way, the algebraic structure R-n vertical bar G vertical bar is proven to be the universal tensor product, in the category of semilattices with zero, of n copies of the algebraic structure R-1 vertical bar G vertical bar.

2019

Hopf algebras and Hopf-Galois extensions in infinity-categories

Aras Ergus

In this thesis, we study interactions between algebraic and coalgebraic structures in infinity-categories (more precisely, in the quasicategorical model of (infinity, 1)-categories). We define a notion of a Hopf algebra H in an E-2-monoidal infinity-category and lift some results about ordinary Hopf algebras, such as the fundamental theorem of Hopf modules, to this setting. We also study Hopf-Galois extensions in this context. Given a candidate Hopf-Galois extension, i.e., a map f : A -> B of H-comodule algebras where H coacts on A trivially, we construct a structured version of the comparison map B (x)_A B -> H (x) B that allows us to compare the category of descent data for f with a category of "B-modules equipped with a semilinear coaction of H". We provide further insights into the case of commutative (i.e., E-infinity) comodule algebras over a commutative Hopf algebra, for instance a description of the aforementioned category of modules equipped with a semilinear coaction as the limit of a "categorified cobar construction". Moreover, we provide a simple description of comodules over a space in slice categories of the infinity-category of spaces, which enables us to realize multiplicative Thom objects as comodule algebras and thus incorporate them into the aforementioned framework.

EPFL2022

Patching And Weak Approximation In Isometry Groups

Eva Bayer Fluckiger

Let R be a semilocal principal ideal domain. Two algebraic objects over R in which scalar extension makes sense (e.g. quadratic spaces) are said to be of the same genus if they become isomorphic after extending scalars to all completions of R and its fraction field. We prove that the number of isomorphism classes in the genus of unimodular quadratic spaces over ( not necessarily commutative) R-orders is always a finite power of 2, and under further assumptions, e.g., that the order is hereditary, this number is 1. The same result is also shown for related objects, e.g., systems of sesquilinear forms. A key ingredient in the proof is a weak approximation theorem for groups of isometries, which is valid over any (topological) base field, and even over semilocal base rings.

Amer Mathematical Soc2017

Associative property

In mathematics, the associative property is a property of some binary operations, which means that rearranging the parentheses in an expression will not change the result. In propositional logic, as

Vector space

In mathematics and physics, a vector space (also called a linear space) is a set whose elements, often called vectors, may be added together and multiplied ("scaled") by numbers called scalars. Scal

Ring (mathematics)

In mathematics, rings are algebraic structures that generalize fields: multiplication need not be commutative and multiplicative inverses need not exist. In other words, a ring is a set equipped wit

MATH-334: Representation theory

Study the basics of representation theory of groups and associative algebras.

EE-110: Logic systems (for MT)

Ce cours couvre les fondements des systèmes numériques. Sur la base d'algèbre Booléenne et de circuitscombinatoires et séquentiels incluant les machines d'états finis, les methodes d'analyse et de synthèse de systèmelogiques sont étudiées et appliquée

MATH-110(a): Advanced linear algebra I

L'objectif du cours est d'introduire les notions de base de l'algèbre linéaire et de démontrer rigoureusement les résultats principaux de ce sujet.