Philip Hall's theorem.
ProvedPosetFlow.chainAltSum_eq_neg_muaether-catalogalgebra
Philip Hall's theorem. The alternating sum over the chains from x to y
of a finite poset is the negative of the Möbius function of the incidence algebra.
Combinatorially, - μ x y is the reduced Euler characteristic of the order complex
of the open interval (x, y).
theorem PosetFlow.chainAltSum_eq_neg_mu(x y : P) : chainAltSum x y = -mu ℤ x y := by sorry
Formalization Note Transplanted verbatim from the Aether Catalog source Algebra/PosetFlow/HallMobius.lean; the statement is byte-identical to the source declaration, elaborated with autoImplicit disabled in the platform environment.
Preamble
-- Thm stub generated from Algebra/PosetFlow/HallMobius.lean
import Mathlib
import Definitions.Def_Algebra_PosetFlow_ChainPoset
import Definitions.Def_Algebra_PosetFlow_HallMobius
/-!
# Philip Hall's theorem: chains of a poset compute its Möbius function
The chain replacement of a poset flow replaces the (one point) spaces of execution
paths of a poset flow by the nerves of the refinement posets of chains. The Euler
characteristics of those nerves are governed by the classical theorem of Philip
Hall, which identifies the alternating sum over chains from `x` to `y` with the
Möbius function of the incidence algebra.
This file proves Hall's theorem in the form
`∑ C ∈ chainFinsets x y, (-1) ^ |C| = - μ x y`,
where `chainFinsets x y` is the finite set of carriers of chains from `x` to `y`
(the objects of the refinement poset `PosetFlow.ChainFrom x y` of
`Algebra.PosetFlow.ChainPoset`), and `μ` is `IncidenceAlgebra.mu`.
## Main results
* `PosetFlow.chainAltSum_recursion` : deleting the top element `y` of a chain
identifies chains from `x` to `y` with pairs `(z, C)` where `z ∈ Ico x y` and `C`
is a chain from `x` to `z`. This is the combinatorial induction step.
* `PosetFlow.chainAltSum_eq_neg_mu` : **Philip Hall's theorem**.
* `PosetFlow.mu_eq_zero_of_not_le` : the Möbius function vanishes off the order,
a corollary of the chain description.
-/
open PosetFlow
open Finset IncidenceAlgebra
variable {P : Type*} [PartialOrder P] [Fintype P] [DecidableEq P] [DecidableLE P]
variable [LocallyFiniteOrder P]Formal statement
theorem PosetFlow.chainAltSum_eq_neg_mu(x y : P) : chainAltSum x y = -mu ℤ x y := by sorry
Source