|
Specialization Preorder
In the branch of mathematics known as topology, the specialization (or canonical) preorder is a natural preorder on the set of the points of a topological space. For most spaces that are considered in practice, namely for all those that satisfy the T0 separation axiom, this preorder is even a partial order (called the specialization order). On the other hand, for T1 spaces the order becomes trivial and is of little interest. The specialization order is often considered in applications in computer science, where T0 spaces occur in denotational semantics. The specialization order is also important for identifying suitable topologies on partially ordered sets, as is done in order theory. Definition and motivation Consider any topological space ''X''. The specialization preorder ≤ on ''X'' relates two points of ''X'' when one lies in the closure of the other. However, various authors disagree on which 'direction' the order should go. What is agreed is that if :''x'' is contain ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Mathematics
Mathematics is a field of study that discovers and organizes methods, Mathematical theory, theories and theorems that are developed and Mathematical proof, proved for the needs of empirical sciences and mathematics itself. There are many areas of mathematics, which include number theory (the study of numbers), algebra (the study of formulas and related structures), geometry (the study of shapes and spaces that contain them), Mathematical analysis, analysis (the study of continuous changes), and set theory (presently used as a foundation for all mathematics). Mathematics involves the description and manipulation of mathematical object, abstract objects that consist of either abstraction (mathematics), abstractions from nature orin modern mathematicspurely abstract entities that are stipulated to have certain properties, called axioms. Mathematics uses pure reason to proof (mathematics), prove properties of objects, a ''proof'' consisting of a succession of applications of in ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Prime Spectrum
In commutative algebra, the prime spectrum (or simply the spectrum) of a commutative ring R is the set of all prime ideals of R, and is usually denoted by \operatorname; in algebraic geometry it is simultaneously a topological space equipped with a sheaf of rings. Zariski topology For any ideal I of R, define V_I to be the set of prime ideals containing I. We can put a topology on \operatorname(R) by defining the collection of closed sets to be :\big\. This topology is called the Zariski topology. A basis for the Zariski topology can be constructed as follows: For f\in R, define D_f to be the set of prime ideals of R not containing f. Then each D_f is an open subset of \operatorname(R), and \big\ is a basis for the Zariski topology. \operatorname(R) is a compact space, but almost never Hausdorff: In fact, the maximal ideals in R are precisely the closed points in this topology. By the same reasoning, \operatorname(R) is not, in general, a T1 space. However, \operatorna ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Alexandrov-discrete Space
In general topology, an Alexandrov topology is a topology in which the intersection of an ''arbitrary'' family of open sets is open (while the definition of a topology only requires this for a ''finite'' family). Equivalently, an Alexandrov topology is one whose open sets are the upper sets for some preorder on the space. Spaces with an Alexandrov topology are also known as Alexandrov-discrete spaces or finitely generated spaces. The latter name stems from the fact that their topology is uniquely determined by the family of all finite subspaces. This makes them a generalization of finite topological spaces. Alexandrov-discrete spaces are named after the Russian topologist Pavel Alexandrov. They should not be confused with Alexandrov spaces from Riemannian geometry introduced by the Russian mathematician Aleksandr Danilovich Aleksandrov. Characterizations of Alexandrov topologies Alexandrov topologies have numerous characterizations. In a topological space X, the following co ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Lower Set
In mathematics, an upper set (also called an upward closed set, an upset, or an isotone set in ''X'') of a partially ordered set (X, \leq) is a subset S \subseteq X with the following property: if ''s'' is in ''S'' and if ''x'' in ''X'' is larger than ''s'' (that is, if s < x), then ''x'' is in ''S''. In other words, this means that any ''x'' element of ''X'' that is to some element of ''S'' is necessarily also an element of ''S''. The term lower set (also called a downward closed set, down set, decreasing set, initial segment, or semi-ideal) is defined similarly as being a subset ''S'' of ''X'' with the property that any element ''x'' of ''X'' that is to some element of ''S'' is necessarily also an element of ''S''. Definition Let be a preordered set. An in (also called an , an , or an set) is a subset that is "closed under going up", in the ...[...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Domain Theory
Domain theory is a branch of mathematics that studies special kinds of partially ordered sets (posets) commonly called domains. Consequently, domain theory can be considered as a branch of order theory. The field has major applications in computer science, where it is used to specify denotational semantics, especially for functional programming languages. Domain theory formalizes the intuitive ideas of approximation and convergence in a very general way and is closely related to topology. Motivation and intuition The primary motivation for the study of domains, which was initiated by Dana Scott in the late 1960s, was the search for a denotational semantics of the lambda calculus. In this formalism, one considers "functions" specified by certain terms in the language. In a purely syntactic way, one can go from simple functions to functions that take other functions as their input arguments. Using again just the syntactic transformations available in this formalism, one can obtai ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Valuation Theory
In algebra (in particular in algebraic geometry or algebraic number theory), a valuation is a function on a field that provides a measure of the size or multiplicity of elements of the field. It generalizes to commutative algebra the notion of size inherent in consideration of the degree of a pole or multiplicity of a zero in complex analysis, the degree of divisibility of a number by a prime number in number theory, and the geometrical concept of contact between two algebraic or analytic varieties in algebraic geometry. A field with a valuation on it is called a valued field. Definition One starts with the following objects: *a field and its multiplicative group ''K''×, *an abelian totally ordered group . The ordering and group law on are extended to the set by the rules * for all ∈ , * for all ∈ . Then a valuation of is any map : that satisfies the following properties for all ''a'', ''b'' in ''K'': * if and only if , *, *, with equality if ''v''(' ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Generic Point
In algebraic geometry, a generic point ''P'' of an algebraic variety ''X'' is a point in a ''general position'', at which all generic property, generic properties are true, a generic property being a property which is true for Almost everywhere, almost every point. In classical algebraic geometry, a generic point of an affine algebraic variety, affine or projective algebraic variety of dimension ''d'' is a point such that the field generated by its coordinates has transcendence degree ''d'' over the field generated by the coefficients of the equations of the variety. In scheme theory, the spectrum of a ring, spectrum of an integral domain has a unique generic point, which is the zero ideal. As the closure of this point for the Zariski topology is the whole spectrum, the definition has been extended to general topology, where a generic point of a topological space ''X'' is a point whose closure is ''X''. Definition and motivation A generic point of the topological space ''X'' i ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Species
A species () is often defined as the largest group of organisms in which any two individuals of the appropriate sexes or mating types can produce fertile offspring, typically by sexual reproduction. It is the basic unit of Taxonomy (biology), classification and a taxonomic rank of an organism, as well as a unit of biodiversity. Other ways of defining species include their karyotype, DNA sequence, morphology (biology), morphology, behaviour, or ecological niche. In addition, palaeontologists use the concept of the chronospecies since fossil reproduction cannot be examined. The most recent rigorous estimate for the total number of species of eukaryotes is between 8 and 8.7 million. About 14% of these had been described by 2011. All species (except viruses) are given a binomial nomenclature, two-part name, a "binomen". The first part of a binomen is the name of a genus to which the species belongs. The second part is called the specific name (zoology), specific name or the specific ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Genus
Genus (; : genera ) is a taxonomic rank above species and below family (taxonomy), family as used in the biological classification of extant taxon, living and fossil organisms as well as Virus classification#ICTV classification, viruses. In binomial nomenclature, the genus name forms the first part of the binomial species name for each species within the genus. :E.g. ''Panthera leo'' (lion) and ''Panthera onca'' (jaguar) are two species within the genus ''Panthera''. ''Panthera'' is a genus within the family Felidae. The composition of a genus is determined by taxonomy (biology), taxonomists. The standards for genus classification are not strictly codified, so different authorities often produce different classifications for genera. There are some general practices used, however, including the idea that a newly defined genus should fulfill these three criteria to be descriptively useful: # monophyly – all descendants of an ancestral taxon are grouped together (i.e. Phylogeneti ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Consistent
In deductive logic, a consistent theory is one that does not lead to a logical contradiction. A theory T is consistent if there is no formula \varphi such that both \varphi and its negation \lnot\varphi are elements of the set of consequences of T. Let A be a set of closed sentences (informally "axioms") and \langle A\rangle the set of closed sentences provable from A under some (specified, possibly implicitly) formal deductive system. The set of axioms A is consistent when there is no formula \varphi such that \varphi \in \langle A \rangle and \lnot \varphi \in \langle A \rangle. A ''trivial'' theory (i.e., one which proves every sentence in the language of the theory) is clearly inconsistent. Conversely, in an explosive formal system (e.g., classical or intuitionistic propositional or first-order logics) every inconsistent theory is trivial. Consistency of a theory is a syntactic notion, whose semantic counterpart is satisfiability. A theory is satisfiable if it has a mod ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Open Set
In mathematics, an open set is a generalization of an Interval (mathematics)#Definitions_and_terminology, open interval in the real line. In a metric space (a Set (mathematics), set with a metric (mathematics), distance defined between every two points), an open set is a set that, with every point in it, contains all points of the metric space that are sufficiently near to (that is, all points whose distance to is less than some value depending on ). More generally, an open set is a member of a given Set (mathematics), collection of Subset, subsets of a given set, a collection that has the property of containing every union (set theory), union of its members, every finite intersection (set theory), intersection of its members, the empty set, and the whole set itself. A set in which such a collection is given is called a topological space, and the collection is called a topology (structure), topology. These conditions are very loose, and allow enormous flexibility in the choice ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
