Incidence algebra

Short description: Associative algebra used in combinatorics

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. Subalgebras called reduced incidence algebras give a natural construction of various types of generating functions used in combinatorics and number theory.

## Contents

* 1 Definition
* 1.1 Related concepts
* 1.1.1 Upper-triangular matrices
* 2 Special elements
* 3 Examples
* 4 Euler characteristic
* 5 Reduced incidence algebras
* 5.1 Natural numbers and ordinary generating functions
* 5.2 Subset poset and exponential generating functions
* 5.3 Divisor poset and Dirichlet series
* 6 See also
* 7 Literature
* 8 Further reading

## Definition

A locally finite poset is one in which every closed interval

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

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)=∑a≤x≤bf(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.

#### Upper-triangular matrices

Consider the case of a partial order ≤ over any n-element set S. We enumerate S as s1, …, sn, and in such a way that the enumeration is compatible with the order ≤ on S, that is, si ≤ sj implies i ≤ j, which is always possible.

Then, functions f as above, from intervals to scalars, can be thought of as matrices Aij, where Aij = f(si, sj) whenever i ≤ j, and Aij = 0 otherwise. Since we arranged S in a way consistent with the usual order on the indices of the matrices, they will appear as upper-triangular matrices with a prescribed zero-pattern determined by the incomparable elements in S under ≤.

The incidence algebra of ≤ is then isomorphic to the algebra of upper-triangular matrices with this prescribed zero-pattern and arbitrary (including possibly zero) scalar entries everywhere else, with the operations being ordinary matrix addition, scaling and multiplication.[1]

## Special elements

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

δ(a,b)={1if a=b,0if a≠b.

The zeta function of an incidence algebra is the constant function ζ(a, b) = 1 for every nonempty 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:

μ(x,y)={1if x=y−∑z:x≤z<yμ(x,z)for x<y0otherwise .

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

The square of the zeta function gives the number of elements in an interval: ζ2(x,y)=∑z∈[x,y]ζ(x,z)ζ(z,y)=∑z∈[x,y]1=#[x,y].

## Examples

Positive integers ordered by divisibility
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.
Finite subsets of some set E, ordered by inclusion
The Möbius function is μ(S,T)=(−1)|T∖S|
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: 2E={0,1}E.
Natural numbers with their usual order
The Möbius function is μ(x,y)={1if y=x,−1if y=x+1,0if y>x+1, and Möbius inversion is called the (backwards) difference operator.
Geometrically, this corresponds to the discrete number line.
The convolution of functions in the incidence algebra corresponds to multiplication of formal power series: see the discussion of reduced incidence algebras below. The Möbius function corresponds to the sequence (1, −1, 0, 0, 0, ... ) of coefficients of the formal power series 1 − t, and the zeta function corresponds to the sequence of coefficients (1, 1, 1, 1, ...) of the formal power series (1−t)−1=1+t+t2+t3+⋯, which is inverse. The delta function in this incidence algebra similarly corresponds to the formal power series 1.
Finite sub-multisets of some multiset E, ordered by inclusion
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 μ(S,T)={0if T∖S is a proper multiset (has repeated elements)(−1)|T∖S|if T∖S is a set (has no repeated elements).
This generalizes the positive integers ordered by divisibility by a positive integer corresponding to its multiset of prime factors 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}.
Subgroups of a finite p-group G, ordered by inclusion
The Möbius function is μG(H1,H2)=(−1)kp(k2) if H1 is a normal subgroup of H2 and H2/H1≅(ℤ/pℤ)k and it is 0 otherwise. This is a theorem of Weisner (1935).
Partitions of a set
Partially order the set of all partitions of a finite set by saying σ ≤ τ if σ is a finer partition than τ. In particular, let τ have t blocks which respectively split into s1, ..., st finer blocks of σ, which has a total of s = s1 \+ ⋅⋅⋅ \+ st blocks. Then the Möbius function is: μ(σ,τ)=(−1)s−t(s1−1)!…(st−1)!

## 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}. This can be shown using Philip Hall's theorem, relating the value of μ(0,1) to the number of chains of length i.

## Reduced incidence algebras

The reduced incidence algebra consists of functions which assign the same value to any two intervals which are equivalent in an appropriate sense, usually meaning isomorphic as posets. 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. Thus the Möbius function is also in the reduced incidence algebra.

Reduced incidence algebras were introduced by Doubillet, Rota, and Stanley to give a natural construction of various rings of generating functions.[2]

### Natural numbers and ordinary generating functions

For the poset (ℕ,≤), the reduced incidence algebra consists of functions f(a,b) invariant under translation, f(a+k,b+k)=f(a,b) for all k≥0, so as to have the same value on isomorphic intervals [a+k, b+k] and [a, b]. Let t denote the function with t(a, a+1) = 1 and t(a, b) = 0 otherwise, a kind of invariant delta function on isomorphism classes of intervals. Its powers in the incidence algebra are the other invariant delta functions t n(a, a+n) = 1 and t n(x, y) = 0 otherwise. These form a basis for the reduced incidence algebra, and we may write any invariant function as f=∑n≥0f(0,n)tn. This notation makes clear the isomorphism between the reduced incidence algebra and the ring of formal power series Rt over the scalars R, also known as the ring of ordinary generating functions. We may write the zeta function as ζ=1+t+t2+⋯=11−t, the reciprocal of the Möbius function μ=1−t.

### Subset poset and exponential generating functions

For the Boolean poset of finite subsets S⊂{1,2,3,…} ordered by inclusion S⊂T, the reduced incidence algebra consists of invariant functions f(S,T), defined to have the same value on isomorphic intervals [S,T] and [S′,T′] with |T \ S| = |T′ \ S′|. Again, let t denote the invariant delta function with t(S,T) = 1 for |T \ S| = 1 and t(S,T) = 0 otherwise. Its powers are: tn(S,T)=∑t(T0,T1)t(T1,T2)…t(Tn−1,Tn)={n!if|T∖S|=n0otherwise, where the sum is over all chains S=T0⊂T1⊂⋯⊂Tn=T, and the only non-zero terms occur for saturated chains with |Ti∖Ti−1|=1; since these correspond to permutations of n, we get the unique non-zero value n!. Thus, the invariant delta functions are the divided powers tnn!, and we may write any invariant function as f=∑n≥0f(∅,[n])tnn!, where [n] = {1, . . . , n}. This gives a natural isomorphism between the reduced incidence algebra and the ring of exponential generating functions. The zeta function is ζ=∑n≥0tnn!=exp⁡(t), with Möbius function: μ=1ζ=exp⁡(−t)=∑n≥0(−1)ntnn!. Indeed, this computation with formal power series proves that μ(S,T)=(−1)|T∖S|. Many combinatorial counting sequences involving subsets or labeled objects can be interpreted in terms of the reduced incidence algebra, and computed using exponential generating functions.

### Divisor poset and Dirichlet series

Consider the poset D of positive integers ordered by divisibility, denoted by a|b. The reduced incidence algebra consists of functions f(a,b) that are invariant under multiplication: f(ka,kb)=f(a,b) for all k≥1. (This multiplicative equivalence of intervals is a much stronger relation than poset isomorphism; e.g., for primes p, the two-element intervals [1,p] are all inequivalent.) For an invariant function, f(a,b) depends only on b/a, so a natural basis consists of invariant delta functions δn defined by δn(a,b)=1 if b/a = n and 0 otherwise; then any invariant function can be written f=∑n≥0f(1,n)δn.

The product of two invariant delta functions is:

(δnδm)(a,b)=∑a|c|bδn(a,c)δm(c,b)=δnm(a,b),

since the only non-zero term comes from c = na and b = mc = nma. Thus, we get an isomorphism from the reduced incidence algebra to the ring of formal Dirichlet series by sending δn to n−s, so that f corresponds to ∑n≥1f(1,n)ns.

The incidence algebra zeta function ζD(a,b) = 1 corresponds to the classical Riemann zeta function ζ(s)=∑n≥11ns, having reciprocal 1ζ(s)=∑n≥1μ(n)ns, where μ(n)=μD(1,n) is the classical Möbius function of number theory. Many other arithmetic functions arise naturally within the reduced incidence algebra, and equivalently in terms of Dirichlet series. For example, the divisor function σ0(n) is the square of the zeta function, σ0(n)=ζ2(1,n), a special case of the above result that ζ2(x,y) gives the number of elements in the interval [x,y]; equivalents, ζ(s)2=∑n≥1σ0(n)ns.

The product structure of the divisor poset facilitates the computation of its Möbius function. Unique factorization into primes implies D is isomorphic to an infinite Cartesian product ℕ×ℕ×…, with the order given by coordinatewise comparison: n=p1e1p2e2…, where pk is the kth prime, corresponds to its sequence of exponents (e1,e2,…). Now the Möbius function of D is the product of the Möbius functions for the factor posets, computed above, giving the classical formula:

μ(n)=μD(1,n)=∏k≥1μℕ(0,ek)={(−1)dfor n squarefree with d prime factors0otherwise.

The product structure also explains the classical Euler product for the zeta function. The zeta function of D corresponds to a Cartesian product of zeta functions of the factors, computed above as 11−t, so that ζD≅∏k≥111−t, where the right side is a Cartesian product. Applying the isomorphism which sends t in the kth factor to pk−s, we obtain the usual Euler product.

## See also

* Graph algebra
* Incidence coalgebra
* Path algebra

## 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:

* Rota, Gian-Carlo (1964), "On the Foundations of Combinatorial Theory I: Theory of Möbius Functions", Zeitschrift für Wahrscheinlichkeitstheorie und Verwandte Gebiete 2 (4): 340-368, doi:10.1007/BF00531932
* N. Jacobson, Basic Algebra. I, W. H. Freeman and Co., 1974. See section 8.6 for a treatment of Mobius functions on posets

1. ↑ Kolegov, N. A.; Markova, O. V. (August 2019). "Systems of Generators of Matrix Incidence Algebras over Finite Fields" (in en). Journal of Mathematical Sciences 240 (6): 783–798. doi:10.1007/s10958-019-04396-6. ISSN 1072-3374. http://link.springer.com/10.1007/s10958-019-04396-6.
2. ↑ Peter Doubilet, Gian-Carlo Rota and Richard Stanley: On the Foundations of Combinatorics (VI): The Idea of Generating Function, Berkeley Symposium on Math. Statist. and Prob., Proc. Sixth Berkeley Symposium on Math. Statist. and Prob., Vol. 2 (Univ. of Calif. Press, 1972), 267-318, available online in open access

## Further reading

* Spiegel, Eugene; O'Donnell, Christopher J. (1997), Incidence algebras, Pure and Applied Mathematics, 206, Marcel Dekker, ISBN 0-8247-0036-8, https://archive.org/details/incidencealgebra0000spie

0.00

(0 votes)

Original source: https://en.wikipedia.org/wiki/Incidence algebra. Read more

|

Retrieved from "https://handwiki.org/wiki/index.php?title=Incidence_algebra&oldid=4228933"