HOME
*





Zero Tensor
In mathematics, a zero element is one of several generalizations of the number zero to other algebraic structures. These alternate meanings may or may not reduce to the same thing, depending on the context. Additive identities An additive identity is the identity element in an additive group. It corresponds to the element 0 such that for all x in the group, . Some examples of additive identity include: * The zero vector under vector addition: the vector of length 0 and whose components are all 0. Often denoted as \mathbf or \vec. * The zero function or zero map defined by , under pointwise addition * The empty set under set union * An empty sum or empty coproduct * An initial object in a category (an empty coproduct, and so an identity under coproducts) Absorbing elements An absorbing element in a multiplicative semigroup or semiring generalises the property . Examples include: *The empty set, which is an absorbing element under Cartesian product of sets, since *The zero functi ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Mathematics
Mathematics is an area of knowledge that includes the topics of numbers, formulas and related structures, shapes and the spaces in which they are contained, and quantities and their changes. These topics are represented in modern mathematics with the major subdisciplines of number theory, algebra, geometry, and analysis, respectively. There is no general consensus among mathematicians about a common definition for their academic discipline. Most mathematical activity involves the discovery of properties of abstract objects and the use of pure reason to prove them. These objects consist of either abstractions from nature orin modern mathematicsentities that are stipulated to have certain properties, called axioms. A ''proof'' consists of a succession of applications of deductive rules to already established results. These results include previously proved theorems, axioms, andin case of abstraction from naturesome basic properties that are considered true starting points of ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Field (mathematics)
In mathematics, a field is a set on which addition, subtraction, multiplication, and division are defined and behave as the corresponding operations on rational and real numbers do. A field is thus a fundamental algebraic structure which is widely used in algebra, number theory, and many other areas of mathematics. The best known fields are the field of rational numbers, the field of real numbers and the field of complex numbers. Many other fields, such as fields of rational functions, algebraic function fields, algebraic number fields, and ''p''-adic fields are commonly used and studied in mathematics, particularly in number theory and algebraic geometry. Most cryptographic protocols rely on finite fields, i.e., fields with finitely many elements. The relation of two fields is expressed by the notion of a field extension. Galois theory, initiated by Évariste Galois in the 1830s, is devoted to understanding the symmetries of field extensions. Among other results, thi ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Addition
Addition (usually signified by the Plus and minus signs#Plus sign, plus symbol ) is one of the four basic Operation (mathematics), operations of arithmetic, the other three being subtraction, multiplication and Division (mathematics), division. The addition of two Natural number, whole numbers results in the total amount or ''summation, sum'' of those values combined. The example in the adjacent image shows a combination of three apples and two apples, making a total of five apples. This observation is equivalent to the Expression (mathematics), mathematical expression (that is, "3 ''plus'' 2 is Equality (mathematics), equal to 5"). Besides counting items, addition can also be defined and executed without referring to concrete objects, using abstractions called numbers instead, such as integers, real numbers and complex numbers. Addition belongs to arithmetic, a branch of mathematics. In algebra, another area of mathematics, addition can also be performed on abstract objects su ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Lattice (order)
A lattice is an abstract structure studied in the mathematical subdisciplines of order theory and abstract algebra. It consists of a partially ordered set in which every pair of elements has a unique supremum (also called a least upper bound or join) and a unique infimum (also called a greatest lower bound or meet). An example is given by the power set of a set, partially ordered by inclusion, for which the supremum is the union and the infimum is the intersection. Another example is given by the natural numbers, partially ordered by divisibility, for which the supremum is the least common multiple and the infimum is the greatest common divisor. Lattices can also be characterized as algebraic structures satisfying certain axiomatic identities. Since the two definitions are equivalent, lattice theory draws on both order theory and universal algebra. Semilattices include lattices, which in turn include Heyting and Boolean algebras. These ''lattice-like'' structures all admi ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Partially Ordered Set
In mathematics, especially order theory, a partially ordered set (also poset) formalizes and generalizes the intuitive concept of an ordering, sequencing, or arrangement of the elements of a Set (mathematics), set. A poset consists of a set together with a binary relation indicating that, for certain pairs of elements in the set, one of the elements precedes the other in the ordering. The relation itself is called a "partial order." The word ''partial'' in the names "partial order" and "partially ordered set" is used as an indication that not every pair of elements needs to be comparable. That is, there may be pairs of elements for which neither element precedes the other in the poset. Partial orders thus generalize total orders, in which every pair is comparable. Informal definition A partial order defines a notion of Comparability, comparison. Two elements ''x'' and ''y'' may stand in any of four mutually exclusive relationships to each other: either ''x''  ''y'', ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Least Element
In mathematics, especially in order theory, the greatest element of a subset S of a partially ordered set (poset) is an element of S that is greater than every other element of S. The term least element is defined dually, that is, it is an element of S that is smaller than every other element of S. Definitions Let (P, \leq) be a preordered set and let S \subseteq P. An element g \in P is said to be if g \in S and if it also satisfies: :s \leq g for all s \in S. By using \,\geq\, instead of \,\leq\, in the above definition, the definition of a least element of S is obtained. Explicitly, an element l \in P is said to be if l \in S and if it also satisfies: :l \leq s for all s \in S. If (P, \leq) is even a partially ordered set then S can have at most one greatest element and it can have at most one least element. Whenever a greatest element of S exists and is unique then this element is called greatest element of S. The terminology least element of S is defined simila ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Function Composition
In mathematics, function composition is an operation that takes two functions and , and produces a function such that . In this operation, the function is applied to the result of applying the function to . That is, the functions and are composed to yield a function that maps in domain to in codomain . Intuitively, if is a function of , and is a function of , then is a function of . The resulting ''composite'' function is denoted , defined by for all in . The notation is read as " of ", " after ", " circle ", " round ", " about ", " composed with ", " following ", " then ", or " on ", or "the composition of and ". Intuitively, composing functions is a chaining process in which the output of function feeds the input of function . The composition of functions is a special case of the composition of relations, sometimes also denoted by \circ. As a result, all properties of composition of relations are true of composition of functions, such as the ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Zero Morphism
In category theory, a branch of mathematics, a zero morphism is a special kind of morphism exhibiting properties like the morphisms to and from a zero object. Definitions Suppose C is a category, and ''f'' : ''X'' → ''Y'' is a morphism in C. The morphism ''f'' is called a constant morphism (or sometimes left zero morphism) if for any object ''W'' in C and any , ''fg'' = ''fh''. Dually, ''f'' is called a coconstant morphism (or sometimes right zero morphism) if for any object ''Z'' in C and any ''g'', ''h'' : ''Y'' → ''Z'', ''gf'' = ''hf''. A zero morphism is one that is both a constant morphism and a coconstant morphism. A category with zero morphisms is one where, for every two objects ''A'' and ''B'' in C, there is a fixed morphism 0''AB'' : ''A'' → ''B'', and this collection of morphisms is such that for all objects ''X'', ''Y'', ''Z'' in C and all morphisms ''f'' : ''Y'' → ''Z'', ''g'' : ''X'' → ''Y'', the following diagram commutes: The morphisms 0''XY'' necessaril ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Module (mathematics)
In mathematics, a module is a generalization of the notion of vector space in which the field of scalars is replaced by a ring. The concept of ''module'' generalizes also the notion of abelian group, since the abelian groups are exactly the modules over the ring of integers. Like a vector space, a module is an additive abelian group, and scalar multiplication is distributive over the operation of addition between elements of the ring or module and is compatible with the ring multiplication. Modules are very closely related to the representation theory of groups. They are also one of the central notions of commutative algebra and homological algebra, and are used widely in algebraic geometry and algebraic topology. Introduction and definition Motivation In a vector space, the set of scalars is a field and acts on the vectors by scalar multiplication, subject to certain axioms such as the distributive law. In a module, the scalars need only be a ring, so the module conc ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Category Of Groups
In mathematics, the category Grp (or Gp) has the class of all groups for objects and group homomorphisms for morphisms. As such, it is a concrete category. The study of this category is known as group theory. Relation to other categories There are two forgetful functors from Grp, M: Grp → Mon from groups to monoids and U: Grp → Set from groups to sets. M has two adjoints: one right, I: Mon→Grp, and one left, K: Mon→Grp. I: Mon→Grp is the functor sending every monoid to the submonoid of invertible elements and K: Mon→Grp the functor sending every monoid to the Grothendieck group of that monoid. The forgetful functor U: Grp → Set has a left adjoint given by the composite KF: Set→Mon→Grp, where F is the free functor; this functor assigns to every set ''S'' the free group on ''S.'' Categorical properties The monomorphisms in Grp are precisely the injective homomorphisms, the epimorphisms are precisely the surjective homomorphisms, and the isomorphisms are precise ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  




Trivial Group
In mathematics, a trivial group or zero group is a group consisting of a single element. All such groups are isomorphic, so one often speaks of the trivial group. The single element of the trivial group is the identity element and so it is usually denoted as such: 0, 1, or e depending on the context. If the group operation is denoted \, \cdot \, then it is defined by e \cdot e = e. The similarly defined is also a group since its only element is its own inverse, and is hence the same as the trivial group. The trivial group is distinct from the empty set, which has no elements, hence lacks an identity element, and so cannot be a group. Definitions Given any group G, the group consisting of only the identity element is a subgroup of G, and, being the trivial group, is called the of G. The term, when referred to "G has no nontrivial proper subgroups" refers to the only subgroups of G being the trivial group \ and the group G itself. Properties The trivial group is cyclic ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Product (category Theory)
In category theory, the product of two (or more) objects in a category is a notion designed to capture the essence behind constructions in other areas of mathematics such as the Cartesian product of sets, the direct product of groups or rings, and the product of topological spaces. Essentially, the product of a family of objects is the "most general" object which admits a morphism to each of the given objects. Definition Product of two objects Fix a category C. Let X_1 and X_2 be objects of C. A product of X_1 and X_2 is an object X, typically denoted X_1 \times X_2, equipped with a pair of morphisms \pi_1 : X \to X_1, \pi_2 : X \to X_2 satisfying the following universal property: * For every object Y and every pair of morphisms f_1 : Y \to X_1, f_2 : Y \to X_2, there exists a unique morphism f : Y \to X_1 \times X_2 such that the following diagram commutes: *: Whether a product exists may depend on C or on X_1 and X_2. If it does exist, it is unique up to canonical isomor ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]