|
Pregeometry (model Theory)
Pregeometry, and in full combinatorial pregeometry, are essentially synonyms for "matroid". They were introduced by Gian-Carlo Rota with the intention of providing a less "ineffably cacophonous" alternative term. Also, the term combinatorial geometry, sometimes abbreviated to geometry, was intended to replace "simple matroid". These terms are now infrequently used in the study of matroids. It turns out that many fundamental concepts of linear algebra – closure, independence, subspace, basis, dimension – are available in the general framework of pregeometries. In the branch of mathematical logic called model theory, infinite finitary matroids, there called "pregeometries" (and "geometries" if they are simple matroids), are used in the discussion of independence phenomena. The study of how pregeometries, geometries, and abstract closure operators influence the structure of first-order logic, first-order models is called Stable theory#Geometric stability theory, geometric stab ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Matroid
In combinatorics, a matroid is a structure that abstracts and generalizes the notion of linear independence in vector spaces. There are many equivalent ways to define a matroid Axiomatic system, axiomatically, the most significant being in terms of: independent sets; bases or circuits; rank functions; closure operators; and closed sets or ''flats''. In the language of partially ordered sets, a finite simple matroid is equivalent to a geometric lattice. Matroid theory borrows extensively from the terms used in both linear algebra and graph theory, largely because it is the abstraction of various notions of central importance in these fields. Matroids have found applications in geometry, topology, combinatorial optimization, network theory, and coding theory. Definition There are many Cryptomorphism, equivalent ways to define a (finite) matroid. Independent sets In terms of independence, a finite matroid M is a pair (E, \mathcal), where E is a finite set (called the ''gro ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Projective Space
In mathematics, the concept of a projective space originated from the visual effect of perspective, where parallel lines seem to meet ''at infinity''. A projective space may thus be viewed as the extension of a Euclidean space, or, more generally, an affine space with points at infinity, in such a way that there is one point at infinity of each direction of parallel lines. This definition of a projective space has the disadvantage of not being isotropic, having two different sorts of points, which must be considered separately in proofs. Therefore, other definitions are generally preferred. There are two classes of definitions. In synthetic geometry, ''point'' and ''line'' are primitive entities that are related by the incidence relation "a point is on a line" or "a line passes through a point", which is subject to the axioms of projective geometry. For some such set of axioms, the projective spaces that are defined have been shown to be equivalent to those resulting from the f ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Matroid Theory
In combinatorics, a matroid is a structure that abstracts and generalizes the notion of linear independence in vector spaces. There are many equivalent ways to define a matroid Axiomatic system, axiomatically, the most significant being in terms of: independent sets; bases or circuits; rank functions; closure operators; and closed sets or ''flats''. In the language of partially ordered sets, a finite simple matroid is equivalent to a geometric lattice. Matroid theory borrows extensively from the terms used in both linear algebra and graph theory, largely because it is the abstraction of various notions of central importance in these fields. Matroids have found applications in geometry, topology, combinatorial optimization, network theory, and coding theory. Definition There are many Cryptomorphism, equivalent ways to define a (finite) matroid. Independent sets In terms of independence, a finite matroid M is a pair (E, \mathcal), where E is a finite set (called the ''gro ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Morley's Categoricity Theorem
In mathematical logic, a theory is categorical if it has exactly one model ( up to isomorphism). Such a theory can be viewed as ''defining'' its model, uniquely characterizing the model's structure. In first-order logic, only theories with a finite model can be categorical. Higher-order logic contains categorical theories with an infinite model. For example, the second-order Peano axioms are categorical, having a unique model whose domain is the set of natural numbers \mathbb. In model theory, the notion of a categorical theory is refined with respect to cardinality. A theory is -categorical (or categorical in ) if it has exactly one model of cardinality up to isomorphism. Morley's categoricity theorem is a theorem of stating that if a first-order theory in a countable language is categorical in some uncountable cardinality, then it is categorical in all uncountable cardinalities. extended Morley's theorem to uncountable languages: if the language has cardinality and ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Strongly Minimal Theory
In model theory—a branch of mathematical logic—a minimal structure is an infinite one-sorted structure such that every subset of its domain that is definable with parameters is either finite or cofinite. A strongly minimal theory is a complete theory all models of which are minimal. A strongly minimal structure is a structure whose theory is strongly minimal. Thus a structure is minimal only if the parametrically definable subsets of its domain cannot be avoided, because they are already parametrically definable in the pure language of equality. Strong minimality was one of the early notions in the new field of classification theory and stability theory that was opened up by Morley's theorem on totally categorical structures. The nontrivial standard examples of strongly minimal theories are the one-sorted theories of infinite-dimensional vector spaces, and the theories ACF''p'' of algebraically closed fields of characteristic ''p''. As the example ACF''p'' shows, ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Structure (mathematical Logic)
In universal algebra and in model theory, a structure consists of a set along with a collection of finitary operations and relations that are defined on it. Universal algebra studies structures that generalize the algebraic structures such as groups, rings, fields and vector spaces. The term universal algebra is used for structures of first-order theories with no relation symbols. Model theory has a different scope that encompasses more arbitrary first-order theories, including foundational structures such as models of set theory. From the model-theoretic point of view, structures are the objects used to define the semantics of first-order logic, cf. also Tarski's theory of truth or Tarskian semantics. For a given theory in model theory, a structure is called a model if it satisfies the defining axioms of that theory, although it is sometimes disambiguated as a '' semantic model'' when one discusses the notion in the more general setting of mathematical models. Log ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Prime Field
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. 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 theory of fields proves that angle trisection and squaring the circle cannot be done with a compass and straightedge. Galois theory, devoted to understanding the symmetries of field extensions, provides an elegant proof of th ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Algebraically Closed Field
In mathematics, a field is algebraically closed if every non-constant polynomial in (the univariate polynomial ring with coefficients in ) has a root in . In other words, a field is algebraically closed if the fundamental theorem of algebra holds for it. Every field K is contained in an algebraically closed field C, and the roots in C of the polynomials with coefficients in K form an algebraically closed field called an algebraic closure of K. Given two algebraic closures of K there are isomorphisms between them that fix the elements of K. Algebraically closed fields appear in the following chain of class inclusions: Examples As an example, the field of real numbers is not algebraically closed, because the polynomial equation x^2+1=0 has no solution in real numbers, even though all its coefficients (1 and 0) are real. The same argument proves that no subfield of the real field is algebraically closed; in particular, the field of rational numbers is not algebraically cl ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Transcendence Degree
In mathematics, a transcendental extension L/K is a field extension such that there exists an element in the field L that is transcendental over the field K; that is, an element that is not a root of any univariate polynomial with coefficients in K. In other words, a transcendental extension is a field extension that is not algebraic. For example, \mathbb and \mathbb are both transcendental extensions of \mathbb. A transcendence basis of a field extension L/K (or a transcendence basis of L over K) is a maximal algebraically independent subset of L over K. Transcendence bases share many properties with bases of vector spaces. In particular, all transcendence bases of a field extension have the same cardinality, called the transcendence degree of the extension. Thus, a field extension is a transcendental extension if and only if its transcendence degree is nonzero. Transcendental extensions are widely used in algebraic geometry. For example, the dimension of an algebraic varie ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Algebraically Independent
In abstract algebra, a subset S of a field L is algebraically independent over a subfield K if the elements of S do not satisfy any non- trivial polynomial equation with coefficients in K. In particular, a one element set \ is algebraically independent over K if and only if \alpha is transcendental over K. In general, all the elements of an algebraically independent set S over K are by necessity transcendental over K, and over all of the field extensions over K generated by the remaining elements of S. Example The real numbers \sqrt and 2\pi+1 are transcendental numbers: they are not the roots of any nontrivial polynomial whose coefficients are rational numbers. Thus, the sets \ and \ are both algebraically independent over the rational numbers. However, the set \ is ''not'' algebraically independent over the rational numbers \mathbb, because the nontrivial polynomial :P(x,y)=2x^2-y+1 is zero when x=\sqrt and y=2\pi+1. Algebraic independence of known constants Although a ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Field Extension
In mathematics, particularly in algebra, a field extension is a pair of fields K \subseteq L, such that the operations of ''K'' are those of ''L'' restricted to ''K''. In this case, ''L'' is an extension field of ''K'' and ''K'' is a subfield of ''L''. For example, under the usual notions of addition and multiplication, the complex numbers are an extension field of the real numbers; the real numbers are a subfield of the complex numbers. Field extensions are fundamental in algebraic number theory, and in the study of polynomial roots through Galois theory, and are widely used in algebraic geometry. Subfield A subfield K of a field L is a subset K\subseteq L that is a field with respect to the field operations inherited from L. Equivalently, a subfield is a subset that contains the multiplicative identity 1, and is closed under the operations of addition, subtraction, multiplication, and taking the inverse of a nonzero element of K. As , the latter definition implies K and L ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Affine Hull
In mathematics, the affine hull or affine span of a set ''S'' in Euclidean space R''n'' is the smallest affine set containing ''S'', or equivalently, the intersection of all affine sets containing ''S''. Here, an ''affine set'' may be defined as the translation of a vector subspace. The affine hull of ''S'' is what \operatorname S would be if the origin was moved to ''S''. The affine hull aff(''S'') of ''S'' is the set of all affine combinations of elements of ''S'', that is, :\operatorname (S)=\left\. Examples *The affine hull of the empty set is the empty set. *The affine hull of a singleton (a set made of one single element) is the singleton itself. *The affine hull of a set of two different points is the line through them. *The affine hull of a set of three points not on one line is the plane going through them. *The affine hull of a set of four points not in a plane in R''3'' is the entire space R''3''. Properties For any subsets S, T \subseteq X * \operatorname(\o ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
