id stringlengths 14 14 | text stringlengths 9 3.55k | source stringlengths 1 250 |
|---|---|---|
c_v3wl4u3fzp9z | In mathematics, projective differential geometry is the study of differential geometry, from the point of view of properties of mathematical objects such as functions, diffeomorphisms, and submanifolds, that are invariant under transformations of the projective group. This is a mixture of the approaches from Riemannian... | Projective differential geometry |
c_iww5gmu0bjxc | Élie Cartan formulated the idea of a general projective connection, as part of his method of moving frames; abstractly speaking, this is the level of generality at which the Erlangen program can be reconciled with differential geometry, while it also develops the oldest part of the theory (for the projective line), nam... | Projective differential geometry |
c_0mflixihjpql | In mathematics, projective geometry is the study of geometric properties that are invariant with respect to projective transformations. This means that, compared to elementary Euclidean geometry, projective geometry has a different setting, projective space, and a selective set of basic geometric concepts. The basic in... | Axioms of projective geometry |
c_82j00xd2y6z1 | The first issue for geometers is what kind of geometry is adequate for a novel situation. It is not possible to refer to angles in projective geometry as it is in Euclidean geometry, because angle is an example of a concept not invariant with respect to projective transformations, as is seen in perspective drawing. One... | Axioms of projective geometry |
c_kffowllaza94 | Another difference from elementary geometry is the way in which parallel lines can be said to meet in a point at infinity, once the concept is translated into projective geometry's terms. Again this notion has an intuitive basis, such as railway tracks meeting at the horizon in a perspective drawing. | Axioms of projective geometry |
c_zg5aj5yg4m1i | See projective plane for the basics of projective geometry in two dimensions. While the ideas were available earlier, projective geometry was mainly a development of the 19th century. This included the theory of complex projective space, the coordinates used (homogeneous coordinates) being complex numbers. | Axioms of projective geometry |
c_fmz4bbp96njp | Several major types of more abstract mathematics (including invariant theory, the Italian school of algebraic geometry, and Felix Klein's Erlangen programme resulting in the study of the classical groups) were motivated by projective geometry. It was also a subject with many practitioners for its own sake, as synthetic... | Axioms of projective geometry |
c_fszpnfqmyhjk | In mathematics, projectivization is a procedure which associates with a non-zero vector space V a projective space P ( V ) {\displaystyle {\mathbb {P} }(V)} , whose elements are one-dimensional subspaces of V. More generally, any subset S of V closed under scalar multiplication defines a subset of P ( V ) {\displaystyl... | Projectivization |
c_o2wprc7ozray | In mathematics, properties that hold for "typical" examples are called generic properties. For instance, a generic property of a class of functions is one that is true of "almost all" of those functions, as in the statements, "A generic polynomial does not have a root at zero," or "A generic square matrix is invertible... | Generic property |
c_bpqnzx34w00j | There are many different notions of "generic" (what is meant by "almost all") in mathematics, with corresponding dual notions of "almost none" (negligible set); the two main classes are: In measure theory, a generic property is one that holds almost everywhere, with the dual concept being null set, meaning "with probab... | Generic property |
c_8xotc4wsn4ag | In mathematics, pseudoanalytic functions are functions introduced by Lipman Bers (1950, 1951, 1953, 1956) that generalize analytic functions and satisfy a weakened form of the Cauchy–Riemann equations. | Pseudoanalytic function |
c_8gtxgnoi3ar8 | In mathematics, quadratic Jordan algebras are a generalization of Jordan algebras introduced by Kevin McCrimmon (1966). The fundamental identities of the quadratic representation of a linear Jordan algebra are used as axioms to define a quadratic Jordan algebra over a field of arbitrary characteristic. There is a unifo... | Quadratic Jordan algebra |
c_e4mlbkviaffm | In mathematics, quadratic variation is used in the analysis of stochastic processes such as Brownian motion and other martingales. Quadratic variation is just one kind of variation of a process. | Quadratic variation |
c_tsz6si1sypoa | In mathematics, quadrature is a historical term for the process of determining area. This term is still used in the context of differential equations, where "solving an equation by quadrature" or "reduction to quadrature" means expressing its solution in terms of integrals. Quadrature problems served as one of the main... | Quadrature (mathematics) |
c_8nd2vsjmccc8 | In mathematics, quantales are certain partially ordered algebraic structures that generalize locales (point free topologies) as well as various multiplicative lattices of ideals from ring theory and functional analysis (C*-algebras, von Neumann algebras). Quantales are sometimes referred to as complete residuated semig... | Quantale |
c_xhxisl5kitka | In mathematics, quasi-bialgebras are a generalization of bialgebras: they were first defined by the Ukrainian mathematician Vladimir Drinfeld in 1990. A quasi-bialgebra differs from a bialgebra by having coassociativity replaced by an invertible element Φ {\displaystyle \Phi } which controls the non-coassociativity. On... | Quasi-bialgebra |
c_njyqxny9ep8m | In mathematics, quaternionic analysis is the study of functions with quaternions as the domain and/or range. Such functions can be called functions of a quaternion variable just as functions of a real variable or a complex variable are called. As with complex and real analysis, it is possible to study the concepts of a... | Quaternionic analysis |
c_vir6sbh1oljt | In mathematics, quaternionic projective space is an extension of the ideas of real projective space and complex projective space, to the case where coordinates lie in the ring of quaternions H . {\displaystyle \mathbb {H} .} Quaternionic projective space of dimension n is usually denoted by H P n {\displaystyle \mathbb... | Quaternionic projective line |
c_bpkry9zwzpxi | In mathematics, quaternions are a non-commutative number system that extends the complex numbers. Quaternions and their applications to rotations were first described in print by Olinde Rodrigues in all but name in 1840, but independently discovered by Irish mathematician Sir William Rowan Hamilton in 1843 and applied ... | History of quaternions |
c_takish5qw0o7 | In mathematics, racks and quandles are sets with binary operations satisfying axioms analogous to the Reidemeister moves used to manipulate knot diagrams. While mainly used to obtain invariants of knots, they can be viewed as algebraic constructions in their own right. In particular, the definition of a quandle axiomat... | Racks and quandles |
c_0le3z77hsmbz | In mathematics, random graph is the general term to refer to probability distributions over graphs. Random graphs may be described simply by a probability distribution, or by a random process which generates them. The theory of random graphs lies at the intersection between graph theory and probability theory. | Random graphs |
c_eam3q93d787b | From a mathematical perspective, random graphs are used to answer questions about the properties of typical graphs. Its practical applications are found in all areas in which complex networks need to be modeled – many random graph models are thus known, mirroring the diverse types of complex networks encountered in dif... | Random graphs |
c_7ewpqtjy5kzx | In mathematics, random groups are certain groups obtained by a probabilistic construction. They were introduced by Misha Gromov to answer questions such as "What does a typical group look like?" It so happens that, once a precise definition is given, random groups satisfy some properties with very high probability, whe... | Random group |
c_q097thzphyik | In mathematics, rational reconstruction is a method that allows one to recover a rational number from its value modulo a sufficiently large integer. | Rational reconstruction (mathematics) |
c_ysl2ed0wf4bv | In mathematics, real algebraic geometry is the sub-branch of algebraic geometry studying real algebraic sets, i.e. real-number solutions to algebraic equations with real-number coefficients, and mappings between them (in particular real polynomial mappings). Semialgebraic geometry is the study of semialgebraic sets, i.... | Real algebraic variety |
c_runqejwo8lem | In mathematics, real projective space, denoted R P n {\displaystyle \mathbb {RP} ^{n}} or P n ( R ) , {\displaystyle \mathbb {P} _{n}(\mathbb {R} ),} is the topological space of lines passing through the origin 0 in the real space R n + 1 . {\displaystyle \mathbb {R} ^{n+1}.} It is a compact, smooth manifold of dimensi... | Real projective space |
c_1ts5k9fn0aha | In mathematics, real trees (also called R {\displaystyle \mathbb {R} } -trees) are a class of metric spaces generalising simplicial trees. They arise naturally in many mathematical contexts, in particular geometric group theory and probability theory. They are also the simplest examples of Gromov hyperbolic spaces. | Real tree |
c_zbktszb6srh0 | In mathematics, reduced homology is a minor modification made to homology theory in algebraic topology, motivated by the intuition that all of the homology groups of a single point should be equal to zero. This modification allows more concise statements to be made (as in Alexander duality) and eliminates many exceptio... | Reduced homology |
c_1cahk58xeqyh | In mathematics, reduction refers to the rewriting of an expression into a simpler form. For example, the process of rewriting a fraction into one with the smallest whole-number denominator possible (while keeping the numerator a whole number) is called "reducing a fraction". Rewriting a radical (or "root") expression w... | Reduction (mathematics) |
c_furnswh74nja | In mathematics, reductionism can be interpreted as the philosophy that all mathematics can (or ought to) be based on a common foundation, which for modern mathematics is usually axiomatic set theory. Ernst Zermelo was one of the major advocates of such an opinion; he also developed much of axiomatic set theory. It has ... | Scientific reductionism |
c_blmkx4xrgyed | Yet Gödel proved that, for any consistent recursively enumerable axiomatic system powerful enough to describe the arithmetic of the natural numbers, there are (model-theoretically) true propositions about the natural numbers that cannot be proved from the axioms. Such propositions are known as formally undecidable prop... | Scientific reductionism |
c_pvwiaz95kqj3 | In mathematics, reflection symmetry, line symmetry, mirror symmetry, or mirror-image symmetry is symmetry with respect to a reflection. That is, a figure which does not change upon undergoing a reflection has reflectional symmetry. In 2D there is a line/axis of symmetry, in 3D a plane of symmetry. An object or figure w... | Reflection symmetry |
c_8huzsj5ahzrg | In mathematics, restricted root systems, sometimes called relative root systems, are the root systems associated with a symmetric space. The associated finite reflection group is called the restricted Weyl group. The restricted root system of a symmetric space and its dual can be identified. For symmetric spaces of non... | Relative root system |
c_p3c1g0h19iaz | In mathematics, restriction of scalars (also known as "Weil restriction") is a functor which, for any finite extension of fields L/k and any algebraic variety X over L, produces another variety ResL/kX, defined over k. It is useful for reducing questions about varieties over large fields to questions about more complic... | Weil descent |
c_aetro40wgnwy | In mathematics, rigid cohomology is a p-adic cohomology theory introduced by Berthelot (1986). It extends crystalline cohomology to schemes that need not be proper or smooth, and extends Monsky–Washnitzer cohomology to non-affine varieties. For a scheme X of finite type over a perfect field k, there are rigid cohomolog... | Rigid cohomology |
c_zx0s266wvav8 | In mathematics, rigidity of K-theory encompasses results relating algebraic K-theory of different rings. | Suslin rigidity |
c_bh23vljuk4cj | In mathematics, rings are algebraic structures that generalize fields: multiplication need not be commutative and multiplicative inverses need not exist. In other words, a ring is a set equipped with two binary operations satisfying properties analogous to those of addition and multiplication of integers. Ring elements... | Unital ring |
c_tz7srmi5fptp | (Some authors use the term "rng" with a missing "i" to refer to the more general structure that omits this last requirement; see § Notes on the definition.) Whether a ring is commutative (that is, whether the order in which two elements are multiplied might change the result) has profound implications on its behavior. ... | Unital ring |
c_x2lbn506wmlh | Its development has been greatly influenced by problems and ideas of algebraic number theory and algebraic geometry. The simplest commutative rings are those that admit division by non-zero elements; such rings are called fields. Examples of commutative rings include the set of integers with their standard addition and... | Unital ring |
c_096knjvh68um | Examples of noncommutative rings include the ring of n × n real square matrices with n ≥ 2, group rings in representation theory, operator algebras in functional analysis, rings of differential operators, and cohomology rings in topology. The conceptualization of rings spanned the 1870s to the 1920s, with key contribut... | Unital ring |
c_c9te70nnwr0i | In mathematics, scalar multiplication is one of the basic operations defining a vector space in linear algebra (or more generally, a module in abstract algebra). In common geometrical contexts, scalar multiplication of a real Euclidean vector by a positive real number multiplies the magnitude of the vector—without chan... | Scalar multiplication |
c_x0ivdu1hn63y | In mathematics, scattering theory deals with a more abstract formulation of the same set of concepts. For example, if a differential equation is known to have some simple, localized solutions, and the solutions are a function of a single parameter, that parameter can take the conceptual role of time. One then asks what... | Scattering process |
c_seiy8f6agd5y | Solutions to differential equations are often posed on manifolds. Frequently, the means to the solution requires the study of the spectrum of an operator on the manifold. | Scattering process |
c_ultci6aon47g | As a result, the solutions often have a spectrum that can be identified with a Hilbert space, and scattering is described by a certain map, the S matrix, on Hilbert spaces. Spaces with a discrete spectrum correspond to bound states in quantum mechanics, while a continuous spectrum is associated with scattering states. ... | Scattering process |
c_qogeqnxfdrm3 | In mathematics, secondary calculus is a proposed expansion of classical differential calculus on manifolds, to the "space" of solutions of a (nonlinear) partial differential equation. It is a sophisticated theory at the level of jet spaces and employing algebraic methods. | Secondary calculus |
c_8itt6ww9wgud | In mathematics, self-affinity is a feature of a fractal whose pieces are scaled by different amounts in the x- and y-directions. This means that to appreciate the self similarity of these fractal objects, they have to be rescaled using an anisotropic affine transformation. | Self similarity |
c_8xya2hcrnfd3 | In mathematics, semi-infinite objects are objects which are infinite or unbounded in some but not all possible ways. | Semi-infinite |
c_xx7qy5w8fgft | In mathematics, semi-simplicity is a widespread concept in disciplines such as linear algebra, abstract algebra, representation theory, category theory, and algebraic geometry. A semi-simple object is one that can be decomposed into a sum of simple objects, and simple objects are those that do not contain non-trivial p... | Semi-simple category |
c_uk6ki6ff49vw | Now Maschke's theorem says that any finite-dimensional representation of a finite group is a direct sum of simple representations (provided the characteristic of the base field does not divide the order of the group). So in the case of finite groups with this condition, every finite-dimensional representation is semi-s... | Semi-simple category |
c_sr7ffv9bqsvt | For example, Weyl's theorem on complete reducibility says a finite-dimensional representation of a semisimple compact Lie group is semisimple. A square matrix (in other words a linear operator T: V → V {\displaystyle T:V\to V} with V finite dimensional vector space) is said to be simple if its only invariant subspaces ... | Semi-simple category |
c_mh3x1wsk4aet | In mathematics, separation of variables (also known as the Fourier method) is any of several methods for solving ordinary and partial differential equations, in which algebra allows one to rewrite an equation so that each of two variables occurs on a different side of the equation. | Separation of variables |
c_vbdnh99saidw | In mathematics, series acceleration is one of a collection of sequence transformations for improving the rate of convergence of a series. Techniques for series acceleration are often applied in numerical analysis, where they are used to improve the speed of numerical integration. Series acceleration techniques may also... | Series acceleration |
c_l735bh59zm61 | In mathematics, set A is a subset of a set B if all elements of A are also elements of B; B is then a superset of A. It is possible for A and B to be equal; if they are unequal, then A is a proper subset of B. The relationship of one set being a subset of another is called inclusion (or sometimes containment). A is a s... | Subset inclusion |
c_aon91yr4njkt | In mathematics, set inversion is the problem of characterizing the preimage X of a set Y by a function f, i.e., X = f −1(Y ) = {x ∈ Rn | f(x) ∈ Y }. It can also be viewed as the problem of describing the solution set of the quantified constraint "Y(f (x))", where Y( y) is a constraint, e.g. an inequality, describing th... | Set inversion |
c_gvmmxyyr22uz | In mathematics, set-theoretic topology is a subject that combines set theory and general topology. It focuses on topological questions that are independent of Zermelo–Fraenkel set theory (ZFC). | Set-theoretic topology |
c_3zu0z4et07vz | In mathematics, sheaf cohomology is the application of homological algebra to analyze the global sections of a sheaf on a topological space. Broadly speaking, sheaf cohomology describes the obstructions to solving a geometric problem globally when it can be solved locally. The central work for the study of sheaf cohomo... | Sheaf cohomology |
c_1cy3465k2kiq | From 1940 to 1945, Leray and other prisoners organized a "université en captivité" in the camp. Leray's definitions were simplified and clarified in the 1950s. | Sheaf cohomology |
c_968e6v0onc55 | It became clear that sheaf cohomology was not only a new approach to cohomology in algebraic topology, but also a powerful method in complex analytic geometry and algebraic geometry. These subjects often involve constructing global functions with specified local properties, and sheaf cohomology is ideally suited to suc... | Sheaf cohomology |
c_7gpdj61t77r3 | In mathematics, sieved Jacobi polynomials are a family of sieved orthogonal polynomials, introduced by Askey (1984). Their recurrence relations are a modified (or "sieved") version of the recurrence relations for Jacobi polynomials. | Sieved Jacobi polynomials |
c_en0k2left5e0 | In mathematics, sieved Pollaczek polynomials are a family of sieved orthogonal polynomials, introduced by Ismail (1985). Their recurrence relations are a modified (or "sieved") version of the recurrence relations for Pollaczek polynomials. | Sieved Pollaczek polynomials |
c_g9rvjdidfdvj | In mathematics, sieved orthogonal polynomials are orthogonal polynomials whose recurrence relations are formed by sieving the recurrence relations of another family; in other words, some of the recurrence relations are replaced by simpler ones. The first examples were the sieved ultraspherical polynomials introduced by... | Sieved orthogonal polynomials |
c_gd9labdj6vqf | In mathematics, signal processing and control theory, a pole–zero plot is a graphical representation of a rational transfer function in the complex plane which helps to convey certain properties of the system such as: Stability Causal system / anticausal system Region of convergence (ROC) Minimum phase / non minimum ph... | Pole–zero plot |
c_92620rstgkbl | In mathematics, signed frequency (negative and positive frequency) expands upon the concept of frequency, from just an absolute value representing how often some repeating event occurs, to also have a positive or negative sign representing one of two opposing orientations for occurrences of those events. The following ... | Negative frequency |
c_t6or88d4q2ay | In mathematics, signed measure is a generalization of the concept of (positive) measure by allowing the set function to take negative values, i.e., to aqcuire sign. | Signed measure |
c_hqh1obe7za8e | In mathematics, simple homotopy theory is a homotopy theory (a branch of algebraic topology) that concerns with the simple-homotopy type of a space. It was originated by Whitehead in his 1950 paper "Simple homotopy type". | Simple homotopy theory |
c_4jefy3v37fs1 | In mathematics, sine and cosine are trigonometric functions of an angle. The sine and cosine of an acute angle are defined in the context of a right triangle: for the specified angle, its sine is the ratio of the length of the side that is opposite that angle to the length of the longest side of the triangle (the hypot... | Sine and cosine |
c_jz60jinycss6 | More modern definitions express the sine and cosine as infinite series, or as the solutions of certain differential equations, allowing their extension to arbitrary positive and negative values and even to complex numbers. The sine and cosine functions are commonly used to model periodic phenomena such as sound and lig... | Sine and cosine |
c_f1ty05jdkrfb | In mathematics, singular integral operators of convolution type are the singular integral operators that arise on Rn and Tn through convolution by distributions; equivalently they are the singular integral operators that commute with translations. The classical examples in harmonic analysis are the harmonic conjugation... | Singular integral operators of convolution type |
c_gj8i2v49w544 | Continuity on Lp spaces was first established by Marcel Riesz. The classical techniques include the use of Poisson integrals, interpolation theory and the Hardy–Littlewood maximal function. For more general operators, fundamental new techniques, introduced by Alberto Calderón and Antoni Zygmund in 1952, were developed ... | Singular integral operators of convolution type |
c_mzn2k2z74qmf | In mathematics, singular integral operators on closed curves arise in problems in analysis, in particular complex analysis and harmonic analysis. The two main singular integral operators, the Hilbert transform and the Cauchy transform, can be defined for any smooth Jordan curve in the complex plane and are related by a... | Singular integral operators on closed curves |
c_tottsvluji5i | The range of the Cauchy transform is the Hardy space of the bounded region enclosed by the Jordan curve. The theory for the original curve can be deduced from that of the unit circle, where, because of rotational symmetry, both operators are classical singular integral operators of convolution type. The Hilbert transfo... | Singular integral operators on closed curves |
c_isha8k5agl8f | In mathematics, singular integrals are central to harmonic analysis and are intimately connected with the study of partial differential equations. Broadly speaking a singular integral is an integral operator T ( f ) ( x ) = ∫ K ( x , y ) f ( y ) d y , {\displaystyle T(f)(x)=\int K(x,y)f(y)\,dy,} whose kernel function K... | Singular integral operator |
c_c2t90ym3rhss | In mathematics, singularity theory studies spaces that are almost manifolds, but not quite. A string can serve as an example of a one-dimensional manifold, if one neglects its thickness. A singularity can be made by balling it up, dropping it on the floor, and flattening it. In some places the flat string will cross it... | Singularity theory |
c_b30rahw0bakg | The points on the floor where it does this are one kind of singularity, the double point: one bit of the floor corresponds to more than one bit of string. Perhaps the string will also touch itself without crossing, like an underlined "U". This is another kind of singularity. | Singularity theory |
c_dqb4h55iuhoy | Unlike the double point, it is not stable, in the sense that a small push will lift the bottom of the "U" away from the "underline". Vladimir Arnold defines the main goal of singularity theory as describing how objects depend on parameters, particularly in cases where the properties undergo sudden change under a small ... | Singularity theory |
c_v55is9ho1b8m | In mathematics, size theory studies the properties of topological spaces endowed with R k {\displaystyle \mathbb {R} ^{k}} -valued functions, with respect to the change of these functions. More formally, the subject of size theory is the study of the natural pseudodistance between size pairs. A survey of size theory ca... | Size theory |
c_qxnxj3vx7g4d | In mathematics, smooth functions (also called infinitely differentiable functions) and analytic functions are two very important types of functions. One can easily prove that any analytic function of a real argument is smooth. The converse is not true, as demonstrated with the counterexample below. One of the most impo... | Non-analytic smooth function |
c_4a3c78avmemw | The existence of smooth but non-analytic functions represents one of the main differences between differential geometry and analytic geometry. In terms of sheaf theory, this difference can be stated as follows: the sheaf of differentiable functions on a differentiable manifold is fine, in contrast with the analytic cas... | Non-analytic smooth function |
c_197mgwy2ghk9 | In mathematics, sociable numbers are numbers whose aliquot sums form a periodic sequence. They are generalizations of the concepts of perfect numbers and amicable numbers. The first two sociable sequences, or sociable chains, were discovered and named by the Belgian mathematician Paul Poulet in 1918. In a sociable sequ... | Sociable number |
c_kamebqlv3bcx | For the sequence to be sociable, the sequence must be cyclic and return to its starting point. The period of the sequence, or order of the set of sociable numbers, is the number of numbers in this cycle. If the period of the sequence is 1, the number is a sociable number of order 1, or a perfect number—for example, the... | Sociable number |
c_u0jbvczm0kql | In mathematics, solid partitions are natural generalizations of partitions and plane partitions defined by Percy Alexander MacMahon. A solid partition of n {\displaystyle n} is a three-dimensional array of non-negative integers n i , j , k {\displaystyle n_{i,j,k}} (with indices i , j , k ≥ 1 {\displaystyle i,j,k\geq 1... | Solid partition |
c_a39mnmrfudu8 | Let p 3 ( n ) {\displaystyle p_{3}(n)} denote the number of solid partitions of n {\displaystyle n} . As the definition of solid partitions involves three-dimensional arrays of numbers, they are also called three-dimensional partitions in notation where plane partitions are two-dimensional partitions and partitions are... | Solid partition |
c_x0q5l4prns32 | In mathematics, some boundary value problems can be solved using the methods of stochastic analysis. Perhaps the most celebrated example is Shizuo Kakutani's 1944 solution of the Dirichlet problem for the Laplace operator using Brownian motion. However, it turns out that for a large class of semi-elliptic second-order ... | Stochastic processes and boundary value problems |
c_a2oq2vmk8vi5 | In mathematics, some functions or groups of functions are important enough to deserve their own names. This is a listing of articles which explain some of these functions in more detail. There is a large theory of special functions which developed out of statistics and mathematical physics. A modern, abstract point of ... | List of mathematical functions |
c_6rqszrxdexj5 | In mathematics, spaces of non-positive curvature occur in many contexts and form a generalization of hyperbolic geometry. In the category of Riemannian manifolds, one can consider the sectional curvature of the manifold and require that this curvature be everywhere less than or equal to zero. The notion of curvature ex... | Non-positive curvature |
c_bpel6ngixuxm | That is d h ∘ d v + d v ∘ d h = 0. {\displaystyle d_{h}\circ d_{v}+d_{v}\circ d_{h}=0.} This eases the definition of Total Complexes. By setting f p , q = ( − 1 ) p d p , q v: C p , q → C p , q − 1 {\displaystyle f_{p,q}=(-1)^{p}d_{p,q}^{v}\colon C_{p,q}\to C_{p,q-1}} , we can switch between having commutativity and an... | Double complex |
c_8o81zojzsj5n | In mathematics, specifically Riemannian geometry, Synge's theorem is a classical result relating the curvature of a Riemannian manifold to its topology. It is named for John Lighton Synge, who proved it in 1936. | Synge theorem |
c_eog4rp2ciqxm | In mathematics, specifically abstract algebra, a linearly ordered or totally ordered group is a group G equipped with a total order "≤" that is translation-invariant. This may have different meanings. We say that (G, ≤) is a: left-ordered group if ≤ is left-invariant, that is a ≤ b implies ca ≤ cb for all a, b, c in G,... | Totally ordered abelian group |
c_vvp4ngfyiw1e | In mathematics, specifically abstract algebra, a square class of a field F {\displaystyle F} is an element of the square class group, the quotient group F × / F × 2 {\displaystyle F^{\times }/F^{\times 2}} of the multiplicative group of nonzero elements in the field modulo the square elements of the field. Each square ... | Square class |
c_jr7f4c6kjafo | The reason is that if V {\displaystyle V} is an F {\displaystyle F} -vector space and q: V → F {\displaystyle q:V\to F} is a quadratic form and v {\displaystyle v} is an element of V {\displaystyle V} such that q ( v ) = a ∈ F × {\displaystyle q(v)=a\in F^{\times }} , then for all u ∈ F × {\displaystyle u\in F^{\times ... | Square class |
c_0or096n3mi2p | In mathematics, specifically abstract algebra, an Artinian module is a module that satisfies the descending chain condition on its poset of submodules. They are for modules what Artinian rings are for rings, and a ring is Artinian if and only if it is an Artinian module over itself (with left or right multiplication). ... | Artinian module |
c_gu8wz49rf96w | Like Noetherian modules, Artinian modules enjoy the following heredity property: If M is an Artinian R-module, then so is any submodule and any quotient of M.The converse also holds: If M is any R-module and N any Artinian submodule such that M/N is Artinian, then M is Artinian.As a consequence, any finitely-generated ... | Artinian module |
c_9xef3fc6p222 | In mathematics, specifically abstract algebra, an Artinian ring (sometimes Artin ring) is a ring that satisfies the descending chain condition on (one-sided) ideals; that is, there is no infinite descending sequence of ideals. Artinian rings are named after Emil Artin, who first discovered that the descending chain con... | Artinian ring |
c_5ckc7j3oj8ff | For commutative rings the left and right definitions coincide, but in general they are distinct from each other. The Wedderburn–Artin theorem characterizes every simple Artinian ring as a ring of matrices over a division ring. | Artinian ring |
c_nmcb3emtsc24 | This implies that a simple ring is left Artinian if and only if it is right Artinian. The same definition and terminology can be applied to modules, with ideals replaced by submodules. Although the descending chain condition appears dual to the ascending chain condition, in rings it is in fact the stronger condition. | Artinian ring |
c_1d4uyvsw6i4z | Specifically, a consequence of the Akizuki–Hopkins–Levitzki theorem is that a left (resp. right) Artinian ring is automatically a left (resp. right) Noetherian ring. This is not true for general modules; that is, an Artinian module need not be a Noetherian module. | Artinian ring |
c_hdzfiygnd7t5 | In mathematics, specifically abstract algebra, an integral domain is a nonzero commutative ring in which the product of any two nonzero elements is nonzero. Integral domains are generalizations of the ring of integers and provide a natural setting for studying divisibility. In an integral domain, every nonzero element ... | Associate (ring theory) |
c_b00skyqevvrz | "Integral domain" is defined almost universally as above, but there is some variation. This article follows the convention that rings have a multiplicative identity, generally denoted 1, but some authors do not follow this, by not requiring integral domains to have a multiplicative identity. Noncommutative integral dom... | Associate (ring theory) |
c_d3stxx56zgs0 | In mathematics, specifically abstract algebra, if ( G , + ) {\displaystyle (G,+)} is an (abelian) group with identity element e {\displaystyle e} then ν: G → R {\displaystyle \nu \colon G\to \mathbb {R} } is said to be a norm on ( G , + ) {\displaystyle (G,+)} if: Positive definiteness: ν ( g ) > 0 for all g ≠ e and ν ... | Norm (abelian group) |
c_x47am8z1dohw | In mathematics, specifically abstract algebra, the isomorphism theorems (also known as Noether's isomorphism theorems) are theorems that describe the relationship between quotients, homomorphisms, and subobjects. Versions of the theorems exist for groups, rings, vector spaces, modules, Lie algebras, and various other a... | First ring isomorphism theorem |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.