|
Maximal Element
In mathematics, especially in order theory, a maximal element of a subset S of some preordered set is an element of S that is not smaller than any other element in S. A minimal element of a subset S of some preordered set is defined dually as an element of S that is not greater than any other element in S. The notions of maximal and minimal elements are weaker than those of greatest element and least element which are also known, respectively, as maximum and minimum. The maximum of a subset S of a preordered set is an element of S which is greater than or equal to any other element of S, and the minimum of S is again defined dually. In the particular case of a partially ordered set, while there can be at most one maximum and at most one minimum there may be multiple maximal or minimal elements. Specializing further to totally ordered sets, the notions of maximal element and maximum coincide, and the notions of minimal element and minimum coincide. As an example, in the collecti ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Lattice Of The Divisibility Of 60 Narrow 1,2,3,4
Lattice may refer to: Arts and design * Latticework, an ornamental criss-crossed framework, an arrangement of crossing laths or other thin strips of material * Lattice (music), an organized grid model of pitch ratios * Lattice (pastry), an ornamental pattern of crossing strips of pastry Companies * Lattice Engines, a technology company specializing in business applications for marketing and sales * Lattice Group, a former British gas transmission business * Lattice Semiconductor, a US-based integrated circuit manufacturer Science, technology, and mathematics Mathematics * Lattice (group), a repeating arrangement of points ** Lattice (discrete subgroup), a discrete subgroup of a topological group whose quotient carries an invariant finite Borel measure ** Lattice (module), a module over a ring that is embedded in a vector space over a field ** Lattice graph, a graph that can be drawn within a repeating arrangement of points ** Lattice-based cryptography, encryption ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Tychonoff's Theorem
In mathematics, Tychonoff's theorem states that the product of any collection of compact topological spaces is compact with respect to the product topology. The theorem is named after Andrey Nikolayevich Tikhonov (whose surname sometimes is transcribed ''Tychonoff''), who proved it first in 1930 for powers of the closed unit interval and in 1935 stated the full theorem along with the remark that its proof was the same as for the special case. The earliest known published proof is contained in a 1935 article by Tychonoff, . Tychonoff's theorem is often considered as perhaps the single most important result in general topology (along with Urysohn's lemma). The theorem is also valid for topological spaces based on fuzzy sets. Topological definitions The theorem depends crucially upon the precise definitions of compactness and of the product topology; in fact, Tychonoff's 1935 paper defines the product topology for the first time. Conversely, part of its importance is to gi ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Antisymmetry
In linguistics, antisymmetry, is a theory of syntax described in Richard S. Kayne's 1994 book ''The Antisymmetry of Syntax''. Building upon X-bar theory, it proposes a universal, fundamental word order for phrases (Branching (linguistics), branching) across languages: specifier-head-complement. This means a phrase typically starts with an introductory element (Specifier (linguistics), specifier), followed by the core (Head (linguistics), head, often a verb or noun), and then additional information (Complement (linguistics), complement). The theory argues that any sentence structure that deviates from this order results from rearrangements (Syntactic movement, syntactic movements) of this underlying structure. For instance, a sentence like "Eat the cake quickly" might be analyzed as a rearrangement of a more basic specifier-head-complement structure "Quickly eat the cake". While Kayne proposes specifier-head-complement as the base order, some linguists have suggested alternative bas ... [...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 duality (order theory), 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 switching the side of the relation that s is on 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 also 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 ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Irreflexive Kernel
In mathematics, a binary relation R on a set X is reflexive if it relates every element of X to itself. An example of a reflexive relation is the relation " is equal to" on the set of real numbers, since every real number is equal to itself. A reflexive relation is said to have the reflexive property or is said to possess reflexivity. Along with symmetry and transitivity, reflexivity is one of three properties defining equivalence relations. Etymology The word ''reflexive'' is originally derived from the Medieval Latin ''reflexivus'' ('recoiling' reflex.html" ;"title="f. ''reflex">f. ''reflex'' or 'directed upon itself') (c. 1250 AD) from the classical Latin ''reflexus-'' ('turn away', 'reflection') + ''-īvus'' (suffix). The word entered Early Modern English in the 1580s. The sense of the word meaning 'directed upon itself', as now used in mathematics, surviving mostly by its use in philosophy and grammar (cf. ''Reflexive verb'' and ''Reflexive pronoun''). The first exp ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Singleton (mathematics)
In mathematics, a singleton (also known as a unit set or one-point set) is a set with exactly one element. For example, the set \ is a singleton whose single element is 0. Properties Within the framework of Zermelo–Fraenkel set theory, the axiom of regularity guarantees that no set is an element of itself. This implies that a singleton is necessarily distinct from the element it contains, thus 1 and \ are not the same thing, and the empty set is distinct from the set containing only the empty set. A set such as \ is a singleton as it contains a single element (which itself is a set, but not a singleton). A set is a singleton if and only if its cardinality is . In von Neumann's set-theoretic construction of the natural numbers, the number 1 is ''defined'' as the singleton \. In axiomatic set theory, the existence of singletons is a consequence of the axiom of pairing: for any set ''A'', the axiom applied to ''A'' and ''A'' asserts the existence of \, which is the same ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Power Set
In mathematics, the power set (or powerset) of a set is the set of all subsets of , including the empty set and itself. In axiomatic set theory (as developed, for example, in the ZFC axioms), the existence of the power set of any set is postulated by the axiom of power set. The powerset of is variously denoted as , , , \mathbb(S), or . Any subset of is called a ''family of sets'' over . Example If is the set , then all the subsets of are * (also denoted \varnothing or \empty, the empty set or the null set) * * * * * * * and hence the power set of is . Properties If is a finite set with the cardinality (i.e., the number of all elements in the set is ), then the number of all the subsets of is . This fact as well as the reason of the notation denoting the power set are demonstrated in the below. : An indicator function or a characteristic function of a subset of a set with the cardinality is a function from to the two-element set , denoted as , ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Fence (mathematics)
In mathematics, a fence, also called a zigzag poset, is a partially ordered set (poset) in which the order relations form a path with alternating orientations: :acehbdfi \cdots A fence may be finite, or it may be formed by an infinite alternating sequence extending in both directions. The incidence posets of path graphs form examples of fences. A linear extension of a fence is called an alternating permutation; André's problem of counting the number of different linear extensions has been studied since the 19th century. The solutions to this counting problem, the so-called Euler zigzag numbers or up/down numbers, are: :1, 1, 2, 4, 10, 32, 122, 544, 2770, 15872, 101042. :. The number of antichains in a fence is a Fibonacci number; the distributive lattice with this many elements, generated from a fence via Birkhoff's representation theorem, has as its graph the Fibonacci cube. A partially ordered set is series-parallel if and only if it does not have four elements forming ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Square Root Of 2
The square root of 2 (approximately 1.4142) is the positive real number that, when multiplied by itself or squared, equals the number 2. It may be written as \sqrt or 2^. It is an algebraic number, and therefore not a transcendental number. Technically, it should be called the ''principal'' square root of 2, to distinguish it from the negative number with the same property. Geometrically, the square root of 2 is the length of a diagonal across a Unit square, square with sides of one unit of length; this follows from the Pythagorean theorem. It was probably the first number known to be irrational number, irrational. The fraction (≈ 1.4142857) is sometimes used as a good Diophantine approximation, rational approximation with a reasonably small denominator. Sequence in the On-Line Encyclopedia of Integer Sequences consists of the digits in the decimal expansion of the square root of 2, here truncated to 60 decimal places: : History The Babylonian clay tablet YBC 7289 (–1 ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Rational Numbers
In mathematics, a rational number is a number that can be expressed as the quotient or fraction (mathematics), fraction of two integers, a numerator and a non-zero denominator . For example, is a rational number, as is every integer (for example, The set (mathematics), set of all rational numbers is often referred to as "the rationals", and is closure (mathematics), closed under addition, subtraction, multiplication, and division (mathematics), division by a nonzero rational number. It is a field (mathematics), field under these operations and therefore also called the field of rationals or the field of rational numbers. It is usually denoted by boldface , or blackboard bold A rational number is a real number. The real numbers that are rational are those whose decimal expansion either terminates after a finite number of numerical digit, digits (example: ), or eventually begins to repeating decimal, repeat the same finite sequence of digits over and over (example: ). This st ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Real Numbers
In mathematics, a real number is a number that can be used to measurement, measure a continuous variable, continuous one-dimensional quantity such as a time, duration or temperature. Here, ''continuous'' means that pairs of values can have arbitrarily small differences. Every real number can be almost uniquely represented by an infinite decimal expansion. The real numbers are fundamental in calculus (and in many other branches of mathematics), in particular by their role in the classical definitions of limit (mathematics), limits, continuous function, continuity and derivatives. The set of real numbers, sometimes called "the reals", is traditionally mathematical notation, denoted by a bold , often using blackboard bold, . The adjective ''real'', used in the 17th century by René Descartes, distinguishes real numbers from imaginary numbers such as the square roots of . The real numbers include the rational numbers, such as the integer and the fraction (mathematics), fraction . ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Zigzag Poset
In mathematics, a fence, also called a zigzag poset, is a partially ordered set (poset) in which the order relations form a path with alternating orientations: :acehbdfi \cdots A fence may be finite, or it may be formed by an infinite alternating sequence extending in both directions. The incidence posets of path graphs form examples of fences. A linear extension of a fence is called an alternating permutation; André's problem of counting the number of different linear extensions has been studied since the 19th century. The solutions to this counting problem, the so-called Euler zigzag numbers or up/down numbers, are: :1, 1, 2, 4, 10, 32, 122, 544, 2770, 15872, 101042. :. The number of antichains in a fence is a Fibonacci number; the distributive lattice with this many elements, generated from a fence via Birkhoff's representation theorem :''This is about lattice theory. For other similarly named results, see Birkhoff's theorem (other).'' In mathematics, Birkh ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
