nLab
rank

Rank

Idea

The term ‘rank’ is used in many contexts to number levels within a hierarchy.

Rank of a module

Let A be a ring and N a module over A. If A is a field, then N is a vector space and we speak of the dimension of N; in the general case, we may speak of the rank.

A collection of elements (w i) iI of N is called a basis of N (over A) if for every xN there is a unique collection (a i) iI of elements of A such that a i=0 for all but finitely many iI and x= iIa iw i.

If N has a basis it is called free (over A). For many examples of A (the invariant basis number rings), the cardinality #I only depends on N and not on the choice of basis. It is called the rank of N over A, notation: rank A(M). In any case, N is called the free module of rank #I. If N is a finitely generated free module then the rank is finite.

All of the following are invariant basis rings (source: Wikipedia):

Besides the trivial ring (over which any module is free with any set as basis), an example of a ring without invariant basis number is the ring of 0-dimensional square matrices (over any ring) in which each column has only finitely many nonzero entries (which allows multiplication to be defined). As a module over itself, this ring is free on any inhabited finite set, as may be shown by using the equation 0=n 0 (applied to the columns).

Rank of a sheaf of modules

Let (X,𝒪) be a locally ringed space and a 𝒪-module. Then its rank at a point xX is the vector space dimension of the fiber (x) x 𝒪 xk(x) over the residue field k(x).

If is of finite type, then the rank at x can equivalently be defined as the minimal number of elements needed to generate the stalk x as a 𝒪 x-module (by Nakayama's lemma). In this case, the rank is a upper semicontinuous? function X.

In the internal language of the sheaf topos Sh(X), the rank of can internally quite simply be defined as the minimal number of elements needed to generate (taken as an element of the suitably completed natural numbers, i.e. the poset of inhabited upper sets). Under the correspondence of internal inhabited upper sets in Sh(X) and upper semicontinuous functions X (details at one-sided real number), this definition coincides with the usual one if is of finite type; see this MathOverflow question.

Hereditary rank of a pure set

Every pure set within the von Neumann hierarchy appears first at some level given by an ordinal number; this number is its hereditary rank.

We may define this rank explicitly (and recursively) as follows:

rankS= xS(rankx) +,rank S = \bigcup_{x \in S} (rank x)^+ ,

where is the supremum operation on ordinals (literally the union for von Neumann ordinals) and () + is the successor operation (which is aa{a} for von Neumann ordinals).

Revised on February 8, 2013 19:44:59 by Ingo Blechschmidt (137.250.162.16)