Incidence Algebras and Möbius Inversion — Examples
About this page
How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
✓ 3 results · all verified · 0 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs. The 3 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.
1 · Prerequisites
Abstract Algebra
Combinatorics
Number Theory
Real Analysis
2 · Logical flowchart
3 · Items
Example
The full Möbius table of the Boolean lattice 2^[3]
Example
The Möbius table of a four-element chain
Example
The Möbius function on the divisor poset of 12 and its agreement with μ(1),μ(2),μ(3),μ(4),μ(6),μ(12)
Example
The endpoint Möbius value of the four-element diamond is 1
Example
Möbius inversion of ∑_d∣ nφ(d)=n gives φ(n)=∑_d∣ nμ(d)(n/d)
Counterexample
A poset with a bottom, a top and countably many incomparable middle elements has an infinite interval, so convolution of constant-one functions is not defined
Counterexample
On a two-element chain, an incidence function with a zero diagonal value is not convolution-invertible
Counterexample
A four-element chain and a four-element diamond have equal-size endpoint intervals but Möbius values 0 and 1
Sources
- R. Stanley, Enumerative Combinatorics, Volume 1, §§3.6–3.8
- R. Stanley, Enumerative Combinatorics, Volume 1, §§3.8.4–3.8.5
- P. J. Cameron, Notes on Number Theory, Theorem 7.11
- Stanford Pairing-Based Cryptography notes, Möbius inversion
- F. Gotti, Incidence Algebras, MIT 18.211 notes
- Y. Guan and Y. Zhang, Additive Biderivations of Incidence Algebras, §2.1