|
Upper-semilattice
In mathematics, a join-semilattice (or upper semilattice) is a partially ordered set that has a join (a least upper bound) for any nonempty finite subset. Dually, a meet-semilattice (or lower semilattice) is a partially ordered set which has a meet (or greatest lower bound) for any nonempty finite subset. Every join-semilattice is a meet-semilattice in the inverse order and vice versa. Semilattices can also be defined algebraically: join and meet are associative, commutative, idempotent binary operations, and any such operation induces a partial order (and the respective inverse order) such that the result of the operation for any two elements is the least upper bound (or greatest lower bound) of the elements with respect to this partial order. A lattice is a partially ordered set that is both a meet- and join-semilattice with respect to the same partial order. Algebraically, a lattice is a set with two associative, commutative idempotent binary operations linked by corr ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
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] |
Absorption Law
In algebra, the absorption law or absorption identity is an identity linking a pair of binary operations. Two binary operations, ¤ and ⁂, are said to be connected by the absorption law if: :''a'' ¤ (''a'' ⁂ ''b'') = ''a'' ⁂ (''a'' ¤ ''b'') = ''a''. A set equipped with two commutative and associative binary operations \scriptstyle \lor ("join") and \scriptstyle \land ("meet") that are connected by the absorption law is called a lattice; in this case, both operations are necessarily idempotent. Examples of lattices include Heyting algebras and Boolean algebras,See Boolean algebra (structure)#Axiomatics for a proof of the absorption laws from the distributivity, identity, and boundary laws. in particular sets of sets with ''union'' and ''intersection'' operators, and ordered sets with ''min'' and ''max'' operations. In classical logic, and in particular Boolean algebra, the operations OR and AND, which are also denoted by \scriptstyle \lor and \scriptstyle \land, sat ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Identity (mathematics)
In mathematics, an identity is an equality relating one mathematical expression ''A'' to another mathematical expression ''B'', such that ''A'' and ''B'' (which might contain some variables) produce the same value for all values of the variables within a certain range of validity. In other words, ''A'' = ''B'' is an identity if ''A'' and ''B'' define the same functions, and an identity is an equality between functions that are differently defined. For example, (a+b)^2 = a^2 + 2ab + b^2 and \cos^2\theta + \sin^2\theta =1 are identities. Identities are sometimes indicated by the triple bar symbol instead of , the equals sign. Common identities Algebraic identities Certain identities, such as a+0=a and a+(-a)=0, form the basis of algebra, while other identities, such as (a+b)^2 = a^2 + 2ab +b^2 and a^2 - b^2 = (a+b)(a-b), can be useful in simplifying algebraic expressions and expanding them. Trigonometric identities Geometrically, trigonometric ide ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Algebraic Structure
In mathematics, an algebraic structure 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 also other mathematical structures and functions between structures of the same type (homomor ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Category Theory
Category theory is a general theory of mathematical structures and their relations that was introduced by Samuel Eilenberg and Saunders Mac Lane in the middle of the 20th century in their foundational work on algebraic topology. Nowadays, category theory is used in almost all areas of mathematics, and in some areas of computer science. In particular, many constructions of new mathematical objects from previous ones, that appear similarly in several contexts are conveniently expressed and unified in terms of categories. Examples include quotient spaces, direct products, completion, and duality. A category is formed by two sorts of objects: the objects of the category, and the morphisms, which relate two objects called the ''source'' and the ''target'' of the morphism. One often says that a morphism is an ''arrow'' that ''maps'' its source to its target. Morphisms can be ''composed'' if the target of the first morphism equals the source of the second one, and morphism compos ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Galois Connection
In mathematics, especially in order theory, a Galois connection is a particular correspondence (typically) between two partially ordered sets (posets). Galois connections find applications in various mathematical theories. They generalize the fundamental theorem of Galois theory about the correspondence between subgroups and subfields, discovered by the French mathematician Évariste Galois. A Galois connection can also be defined on preordered sets or classes; this article presents the common case of posets. The literature contains two closely related notions of "Galois connection". In this article, we will refer to them as (monotone) Galois connections and antitone Galois connections. A Galois connection is rather weak compared to an order isomorphism between the involved posets, but every Galois connection gives rise to an isomorphism of certain sub-posets, as will be explained below. The term Galois correspondence is sometimes used to mean a bijective ''Galois connection''; ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Completeness (order Theory)
In the mathematical area of order theory, completeness properties assert the existence of certain infima or suprema of a given partially ordered set (poset). The most familiar example is the completeness of the real numbers. A special use of the term refers to complete partial orders or complete lattices. However, many other interesting notions of completeness exist. The motivation for considering completeness properties derives from the great importance of suprema (least upper bounds, joins, "\vee") and infima (greatest lower bounds, meets, "\wedge") to the theory of partial orders. Finding a supremum means to single out one distinguished least element from the set of upper bounds. On the one hand, these special elements often embody certain concrete properties that are interesting for the given application (such as being the least common multiple of a set of numbers or the union of a collection of sets). On the other hand, the knowledge that certain types of subsets are guaran ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Greatest 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] |
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] |
Mathematical Induction
Mathematical induction is a method for proving that a statement ''P''(''n'') is true for every natural number ''n'', that is, that the infinitely many cases ''P''(0), ''P''(1), ''P''(2), ''P''(3), ... all hold. Informal metaphors help to explain this technique, such as falling dominoes or climbing a ladder: A proof by induction consists of two cases. The first, the base case, proves the statement for ''n'' = 0 without assuming any knowledge of other cases. The second case, the induction step, proves that ''if'' the statement holds for any given case ''n'' = ''k'', ''then'' it must also hold for the next case ''n'' = ''k'' + 1. These two steps establish that the statement holds for every natural number ''n''. The base case does not necessarily begin with ''n'' = 0, but often with ''n'' = 1, and possibly with any fixed natural number ''n'' = ''N'', establishing the truth of the statement for all natu ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Join (mathematics)
In mathematics, specifically order theory, the join of a subset S of a partially ordered set P is the supremum (least upper bound) of S, denoted \bigvee S, and similarly, the meet of S is the infimum (greatest lower bound), denoted \bigwedge S. In general, the join and meet of a subset of a partially ordered set need not exist. Join and meet are dual to one another with respect to order inversion. A partially ordered set in which all pairs have a join is a join-semilattice. Dually, a partially ordered set in which all pairs have a meet is a meet-semilattice. A partially ordered set that is both a join-semilattice and a meet-semilattice is a lattice. A lattice in which every subset, not just every pair, possesses a meet and a join is a complete lattice. It is also possible to define a partial lattice, in which not all pairs have a meet or join but the operations (when defined) satisfy certain axioms. The join/meet of a subset of a totally ordered set is simply the maximal/mi ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Supremum
In mathematics, the infimum (abbreviated inf; plural infima) of a subset S of a partially ordered set P is a greatest element in P that is less than or equal to each element of S, if such an element exists. Consequently, the term ''greatest lower bound'' (abbreviated as ) is also commonly used. The supremum (abbreviated sup; plural suprema) of a subset S of a partially ordered set P is the least element in P that is greater than or equal to each element of S, if such an element exists. Consequently, the supremum is also referred to as the ''least upper bound'' (or ). The infimum is in a precise sense dual to the concept of a supremum. Infima and suprema of real numbers are common special cases that are important in analysis, and especially in Lebesgue integration. However, the general definitions remain valid in the more abstract setting of order theory where arbitrary partially ordered sets are considered. The concepts of infimum and supremum are close to minimum and max ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
