Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Lecture

Möbius inversion: posets

Description

This lecture covers the Möbius inversion for posets, defining partially ordered sets, reflexivity, transitivity, and antisymmetricity. It explains the incidence algebra, convolution, delta function, and left/right inverses. The Möbius function, zeta function, and proof of Möbius inversion are also discussed.

Official source

Ontological neighbourhood

Mathematics

Mathematical logic: Set theory

Related concepts (32)

Partially ordered set

In mathematics, especially order theory, a partial order on a set is an arrangement such that, for certain pairs of elements, one precedes the other. The word partial is used to indicate that not every pair of elements needs to be comparable; that is, there may be pairs for which neither element precedes the other. Partial orders thus generalize total orders, in which every pair is comparable. Formally, a partial order is a homogeneous binary relation that is reflexive, transitive and antisymmetric.

Möbius inversion formula

In mathematics, the classic Möbius inversion formula is a relation between pairs of arithmetic functions, each defined from the other by sums over divisors. It was introduced into number theory in 1832 by August Ferdinand Möbius. A large generalization of this formula applies to summation over an arbitrary locally finite partially ordered set, with Möbius' classical formula applying to the set of the natural numbers ordered by divisibility: see incidence algebra.

Total order

In mathematics, a total order or linear order is a partial order in which any two elements are comparable. That is, a total order is a binary relation on some set , which satisfies the following for all and in : (reflexive). If and then (transitive). If and then (antisymmetric). or (strongly connected, formerly called total). Reflexivity (1.) already follows from connectedness (4.), but is required explicitly by many authors nevertheless, to indicate the kinship to partial orders.

Partially ordered group

In abstract algebra, a partially ordered group is a group (G, +) equipped with a partial order "≤" that is translation-invariant; in other words, "≤" has the property that, for all a, b, and g in G, if a ≤ b then a + g ≤ b + g and g + a ≤ g + b. An element x of G is called positive if 0 ≤ x. The set of elements 0 ≤ x is often denoted with G+, and is called the positive cone of G. By translation invariance, we have a ≤ b if and only if 0 ≤ -a + b.

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. Subalgebras called reduced incidence algebras give a natural construction of various types of generating functions used in combinatorics and number theory. A locally finite poset is one in which every closed interval [a, b] = {x : a ≤ x ≤ b} is finite.

Related lectures (29)

Relations and Sequences

Covers relations, sequences, and posets, emphasizing properties like anti-symmetry and transitivity, and introduces arithmetic and geometric progressions.

Partial Ordering: Relations, Sequences, Summation

Introduces partial orderings, lattices, and lexicographic orderings on Cartesian products.

Partial Ordering: Relations, Sequences, Summation

Explores partial orderings, divisibility relations, lattices, lexicographic ordering, comparability, and total orderings.

Equivalence Relations and Partial Orderings

Introduces equivalence relations, partitions, partial orderings, and total ordering concepts with examples and definitions.

Möbius inversion formula

Covers the Möbius inversion formula and its proof, including the change of variables in summation.

Related concepts (32)

Partially ordered set

Möbius inversion formula

Total order

Partially ordered group

Incidence algebra