Signed incidence and contraction coefficients
DefinitionLPCA_Proofs_BassLyubeznik_SignedCore_Common_Defscommutative-algebralocal-cohomologylocalized-persistent-commutative-algebralpca-attachment-20261021stanley-reisner
This bundle supplies signed incidence and contraction coefficients. The declarations concern finite subsets of linearly ordered vertex types, with field-valued signs where used. Cancellation and square-zero statements retain their convex-family hypotheses; the contraction identity requires family membership to be invariant under insertion of the chosen vertex. No contraction of an arbitrary subset family is asserted.
The included constructions and necessary compatibility results are:
ν_A(j): the number of elements ofAthat are smaller thanj.- Incidence coefficient of a signed subset complex, in the field
k:(-1)^{ν_J(j)}whenJ' = J ∪ {j}withj ∉ J, and0otherwise. - Coefficient of the signed vertex-erasure operator:
h(e_J) = (-1)^{ν_{J∖j}(j)} e_{J∖j}whenj ∈ J, else0.hc k j J J'is the coefficient ofe_{J'}inh(e_J). - The sign
ε_G(τ) = (-1)^{|{(g,u) ∈ G × τ : g < u}|}used in the signed-subset comparison. - A family of finsets is convex if it contains every set lying between two of its members.
Definition code
import Mathlib
namespace Proofs.BassLyubeznik.SignedCore
open Finset
variable {V : Type*} [LinearOrder V]
/-- `ν_A(j)`: the number of elements of `A` that are smaller than `j`. -/
def nu (A : Finset V) (j : V) : ℕ := (A.filter (· < j)).card
/-- Incidence coefficient of a signed subset complex, in the field `k`:
`(-1)^{ν_J(j)}` when `J' = J ∪ {j}` with `j ∉ J`, and `0` otherwise. -/
def inc (k : Type*) [Field k] (J J' : Finset V) : k :=
if J ⊆ J' ∧ J'.card = J.card + 1 then ∑ j ∈ J' \ J, (-1 : k) ^ nu J j else 0
/-- Coefficient of the contracting homotopy "divide by `x_j`": `h(e_J) = (-1)^{ν_{J∖j}(j)} e_{J∖j}`
when `j ∈ J`, else `0`. `hc k j J J'` is the coefficient of `e_{J'}` in `h(e_J)`. -/
def hc (k : Type*) [Field k] (j : V) (J J' : Finset V) : k :=
if j ∈ J ∧ J' = J.erase j then (-1 : k) ^ nu J' j else 0
/-- The sign `ε_G(τ) = (-1)^{|{(g,u) ∈ G × τ : g < u}|}` of Theorem 3.7(b). -/
def eps (k : Type*) [Field k] (G τ : Finset V) : k :=
(-1 : k) ^ ((G ×ˢ τ).filter (fun p => p.1 < p.2)).card
/-- A family of finsets is convex if it contains every set lying between two of its members. -/
def IsConvex (𝓕 : Finset V → Prop) : Prop :=
∀ ⦃J J' J'' : Finset V⦄, 𝓕 J → 𝓕 J'' → J ⊆ J' → J' ⊆ J'' → 𝓕 J'
end Proofs.BassLyubeznik.SignedCore
Source