HOME

TheInfoList



OR:

In mathematics, codimension is a basic geometric idea that applies to subspaces in vector spaces, to submanifolds in manifolds, and suitable
subset 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 o ...
s of
algebraic varieties Algebraic varieties are the central objects of study in algebraic geometry, a sub-field of mathematics. Classically, an algebraic variety is defined as the set of solutions of a system of polynomial equations over the real or complex number ...
. For affine and
projective algebraic varieties In algebraic geometry, a projective variety over an algebraically closed field ''k'' is a subset of some projective ''n''-space \mathbb^n over ''k'' that is the zero-locus of some finite family of homogeneous polynomials of ''n'' + 1 variables w ...
, the codimension equals the
height Height is measure of vertical distance, either vertical extent (how "tall" something or someone is) or vertical position (how "high" a point is). For example, "The height of that building is 50 m" or "The height of an airplane in-flight is ab ...
of the defining ideal. For this reason, the height of an ideal is often called its codimension. The dual concept is relative dimension.


Definition

Codimension is a ''relative'' concept: it is only defined for one object ''inside'' another. There is no “codimension of a vector space (in isolation)”, only the codimension of a vector ''sub''space. If ''W'' is a linear subspace of a finite-dimensional vector space ''V'', then the codimension of ''W'' in ''V'' is the difference between the dimensions: :\operatorname(W) = \dim(V) - \dim(W). It is the complement of the dimension of ''W,'' in that, with the dimension of ''W,'' it adds up to the dimension of the ambient space ''V:'' :\dim(W) + \operatorname(W) = \dim(V). Similarly, if ''N'' is a submanifold or subvariety in ''M'', then the codimension of ''N'' in ''M'' is :\operatorname(N) = \dim(M) - \dim(N). Just as the dimension of a submanifold is the dimension of the tangent bundle (the number of dimensions that you can move ''on'' the submanifold), the codimension is the dimension of the
normal bundle In differential geometry, a field of mathematics, a normal bundle is a particular kind of vector bundle, complementary to the tangent bundle, and coming from an embedding (or immersion). Definition Riemannian manifold Let (M,g) be a Riemann ...
(the number of dimensions you can move ''off'' the submanifold). More generally, if ''W'' is a linear subspace of a (possibly infinite dimensional) vector space ''V'' then the codimension of ''W'' in ''V'' is the dimension (possibly infinite) of the
quotient space Quotient space may refer to a quotient set when the sets under consideration are considered as spaces. In particular: *Quotient space (topology), in case of topological spaces * Quotient space (linear algebra), in case of vector spaces *Quotient ...
''V''/''W'', which is more abstractly known as the cokernel of the inclusion. For finite-dimensional vector spaces, this agrees with the previous definition :\operatorname(W) = \dim(V/W) = \dim \operatorname ( W \to V ) = \dim(V) - \dim(W), and is dual to the relative dimension as the dimension of the kernel. Finite-codimensional subspaces of infinite-dimensional spaces are often useful in the study of topological vector spaces.


Additivity of codimension and dimension counting

The fundamental property of codimension lies in its relation to intersection: if ''W''1 has codimension ''k''1, and ''W''2 has codimension ''k''2, then if ''U'' is their intersection with codimension ''j'' we have :max (''k''1, ''k''2) ≤ ''j'' ≤ ''k''1 + ''k''2. In fact ''j'' may take any
integer An integer is the number zero (), a positive natural number (, , , etc.) or a negative integer with a minus sign ( −1, −2, −3, etc.). The negative numbers are the additive inverses of the corresponding positive numbers. In the language ...
value in this range. This statement is more perspicuous than the translation in terms of dimensions, because the RHS is just the sum of the codimensions. In words :''codimensions (at most) add''. :If the subspaces or submanifolds intersect transversally (which occurs generically), codimensions add exactly. This statement is called dimension counting, particularly in
intersection theory In mathematics, intersection theory is one of the main branches of algebraic geometry, where it gives information about the intersection of two subvarieties of a given variety. The theory for varieties is older, with roots in Bézout's theorem o ...
.


Dual interpretation

In terms of the
dual space In mathematics, any vector space ''V'' has a corresponding dual vector space (or just dual space for short) consisting of all linear forms on ''V'', together with the vector space structure of pointwise addition and scalar multiplication by con ...
, it is quite evident why dimensions add. The subspaces can be defined by the vanishing of a certain number of
linear functional In mathematics, a linear form (also known as a linear functional, a one-form, or a covector) is a linear map from a vector space to its field of scalars (often, the real numbers or the complex numbers). If is a vector space over a field , th ...
s, which if we take to be
linearly independent In the theory of vector spaces, a set of vectors is said to be if there is a nontrivial linear combination of the vectors that equals the zero vector. If no such linear combination exists, then the vectors are said to be . These concepts ...
, their number is the codimension. Therefore, we see that ''U'' is defined by taking the union of the sets of linear functionals defining the ''W''i. That union may introduce some degree of linear dependence: the possible values of ''j'' express that dependence, with the RHS sum being the case where there is no dependence. This definition of codimension in terms of the number of functions needed to cut out a subspace extends to situations in which both the ambient space and subspace are infinite dimensional. In other language, which is basic for any kind of
intersection theory In mathematics, intersection theory is one of the main branches of algebraic geometry, where it gives information about the intersection of two subvarieties of a given variety. The theory for varieties is older, with roots in Bézout's theorem o ...
, we are taking the union of a certain number of
constraint Constraint may refer to: * Constraint (computer-aided design), a demarcation of geometrical characteristics between two or more entities or solid modeling bodies * Constraint (mathematics), a condition of an optimization problem that the solution ...
s. We have two phenomena to look out for: # the two sets of constraints may not be independent; # the two sets of constraints may not be compatible. The first of these is often expressed as the principle of counting constraints: if we have a number ''N'' of
parameter A parameter (), generally, is any characteristic that can help in defining or classifying a particular system (meaning an event, project, object, situation, etc.). That is, a parameter is an element of a system that is useful, or critical, when ...
s to adjust (i.e. we have ''N''
degrees of freedom Degrees of freedom (often abbreviated df or DOF) refers to the number of independent variables or parameters of a thermodynamic system. In various scientific fields, the word "freedom" is used to describe the limits to which physical movement or ...
), and a constraint means we have to 'consume' a parameter to satisfy it, then the codimension of the solution set is ''at most'' the number of constraints. We do not expect to be able to find a solution if the predicted codimension, i.e. the number of ''independent'' constraints, exceeds ''N'' (in the linear algebra case, there is always a ''trivial'', null vector solution, which is therefore discounted). The second is a matter of geometry, on the model of parallel lines; it is something that can be discussed for
linear problem Linear programming (LP), also called linear optimization, is a method to achieve the best outcome (such as maximum profit or lowest cost) in a mathematical model whose requirements are represented by linear relationships. Linear programming i ...
s by methods of linear algebra, and for non-linear problems in projective space, over the
complex number In mathematics, a complex number is an element of a number system that extends the real numbers with a specific element denoted , called the imaginary unit and satisfying the equation i^= -1; every complex number can be expressed in the for ...
field.


In geometric topology

Codimension also has some clear meaning in geometric topology: on a manifold, codimension 1 is the dimension of topological disconnection by a submanifold, while codimension 2 is the dimension of ramification and knot theory. In fact, the theory of high-dimensional manifolds, which starts in dimension 5 and above, can alternatively be said to start in codimension 3, because higher codimensions avoid the phenomenon of knots. Since surgery theory requires working up to the middle dimension, once one is in dimension 5, the middle dimension has codimension greater than 2, and hence one avoids knots. This quip is not vacuous: the study of embeddings in codimension 2 is knot theory, and difficult, while the study of embeddings in codimension 3 or more is amenable to the tools of high-dimensional geometric topology, and hence considerably easier.


See also

* Glossary of differential geometry and topology


References

*{{Springer, id=C/c022870, title=Codimension Algebraic geometry Geometric topology Linear algebra Dimension