Incidence algebra

In order theory, a field of mathematics, an incidence algebra is an associative algebra, defined for every locally finite partially ordered set and commutative ring with unity.

Definition

A locally finite poset is one for which every closed interval

[a, b] = {x : a ≤ x ≤ b}

within it is finite.

The members of the incidence algebra are the functions f assigning to each nonempty interval [a, b] a scalar f(a, b), which is taken from the ring of scalars, a commutative ring with unity. On this underlying set one defines addition and scalar multiplication pointwise, and "multiplication" in the incidence algebra is a convolution defined by

(f*g)(a, b)=\sum_{a\leq x\leq b}f(a, x)g(x, b).

An incidence algebra is finite-dimensional if and only if the underlying poset is finite.

Related concepts

An incidence algebra is analogous to a group algebra; indeed, both the group algebra and the incidence algebra are special cases of a category algebra, defined analogously; groups and posets being special kinds of categories.

Special elements

The multiplicative identity element of the incidence algebra is the delta function, defined by

\delta(a, b) = \begin{cases} 1 & \text{if } a=b \\ 0 & \text{if } a<b. \end{cases}

The zeta function of an incidence algebra is the constant function ζ(a, b) = 1 for every interval [a, b]. Multiplying by ζ is analogous to integration.

One can show that ζ is invertible in the incidence algebra (with respect to the convolution defined above). (Generally, a member h of the incidence algebra is invertible if and only if h(x, x) is invertible for every x.) The multiplicative inverse of the zeta function is the Möbius function μ(a, b); every value of μ(a, b) is an integral multiple of 1 in the base ring.

The Möbius function can also be defined inductively by the following relation:

\mu(x,y) = \begin{cases} {}\qquad 1 & \textrm{if}\quad x = y\\[6pt] \displaystyle -\sum_{z\, :\, x\leq z <y} \mu(x,z) & \textrm{for} \quad x<y \\[6pt] {}\qquad 0 & \textrm{otherwise}. \end{cases}

Multiplying by μ is analogous to differentiation, and is called Möbius inversion.

Examples

The convolution associated to the incidence algebra for intervals [1, n] becomes the Dirichlet convolution, hence the Möbius function is μ(a, b) = μ(b/a), where the second "μ" is the classical Möbius function introduced into number theory in the 19th century.
The Möbius function is
\mu(S,T)=(-1)^{\left|T\setminus S\right|}
whenever S and T are finite subsets of E with S ⊆ T, and Möbius inversion is called the principle of inclusion-exclusion.
Geometrically, this is a hypercube: 2^E = \{0,1\}^E.
The Möbius function is
\mu(x,y)=\begin{cases} 1 & \text{if }y-x=0, \\ -1 & \text{if }y-x=1, \\ 0 & \text{if }y-x>1, \end{cases}
and Möbius inversion is called the (backwards) difference operator.
Geometrically, this corresponds to the discrete number line.
Recall that convolution of sequences corresponds to multiplication of formal power series.
The Möbius function corresponds to the sequence (1, −1, 0, 0, 0, ... ) of coefficients of the formal power series 1 − z, and the zeta function in this case corresponds to the sequence of coefficients (1, 1, 1, 1, ... ) of the formal power series (1 - z)^{-1} = 1 + z + z^2 + z^3 + \cdots, which is inverse. The delta function in this incidence algebra similarly corresponds to the formal power series 1.
The Möbius function is
\mu_G(H_1,H_2)=(-1)^{k}p^{\binom{k}{2}} if H_1 is a normal subgroup of H_2 and H_2/H_1 \cong ({\mathbf Z}/p{\mathbf Z})^k
and it is 0 otherwise. This is a theorem of Weisner (1935).
The above three examples can be unified and generalized by considering a multiset E, and finite sub-multisets S and T of E. The Möbius function is
\mu(S,T)=\begin{cases} 0 & \text{if } T\setminus S \text{ is a proper multiset (has repeated elements)}\\ (-1)^{\left|T\setminus S\right|} & \text{if } T\setminus S \text{ is a set (has no repeated elements)}.\end{cases}
This generalizes the positive integers ordered by divisibility by a positive integer corresponding to its multiset of prime divisors with multiplicity, e.g., 12 corresponds to the multiset \{2,2,3\}.
This generalizes the natural numbers with their usual order by a natural number corresponding to a multiset of one underlying element and cardinality equal to that number, e.g., 3 corresponds to the multiset \{1,1,1\}.
Partially order the set of all partitions of a finite set by saying σ ≤ τ if σ is a finer partition than τ. Then the Möbius function is
\mu(\sigma,\tau)=(-1)^{n-r}(2!)^{r_3}(3!)^{r_4}\cdots((n-1)!)^{r_n}
where n is the number of blocks in the finer partition σ, r is the number of blocks in the coarser partition τ, and ri is the number of blocks of τ that contain exactly i blocks of σ.

Euler characteristic

Further information: Euler characteristic

A poset is bounded if it has smallest and largest elements, which we call 0 and 1 respectively (not to be confused with the 0 and 1 of the ring of scalars). The Euler characteristic of a bounded finite poset is μ(0,1). The reason for this terminology is the following: If P has a 0 and 1, then μ(0,1) is the reduced Euler characteristic of the simplicial complex whose faces are chains in P\{0, 1}.

Reduced incidence algebras

Any member of an incidence algebra that assigns the same value to any two intervals that are isomorphic to each other as posets is a member of the reduced incidence algebra. This is a subalgebra of the incidence algebra, and it clearly contains the incidence algebra's identity element and zeta function. Any element of the reduced incidence algebra that is invertible in the larger incidence algebra has its inverse in the reduced incidence algebra. As a consequence, the Möbius function is always a member of the reduced incidence algebra. Reduced incidence algebras shed light on the theory of generating functions, as alluded to in the case of the natural numbers above.[1]

See also

Literature

Incidence algebras of locally finite posets were treated in a number of papers of Gian-Carlo Rota beginning in 1964, and by many later combinatorialists. Rota's 1964 paper was:

  1. ↑ Peter Doubilet, Gian-Carlo Rota and Richard Stanley: On the Foundations of Combinatorics (IV): The Idea of Generating Function, Berkeley Symp. on Math. Statist. and Prob. Proc. Sixth Berkeley Symp. on Math. Statist. and Prob., Vol. 2 (Univ. of Calif. Press, 1972), 267-318, available online in open access

Further reading

This article is issued from Wikipedia - version of the Wednesday, March 09, 2016. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.