Predecessor counts under insertion below a vertex
DefinitionLPCA_Proofs_BassLyubeznik_SignedCore_nu_insert_of_lt_Defscommutative-algebralocal-cohomologylocalized-persistent-commutative-algebralpca-attachment-20261021stanley-reisner
This bundle supplies predecessor counts under insertion below a vertex. 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.
Definition code
import Mathlib
import Definitions.Def_LPCA_Proofs_BassLyubeznik_SignedCore_Common_Defs
import Definitions.Def_LPCA_Proofs_BassLyubeznik_SignedCore_eps_insert_Defs
import Definitions.Def_LPCA_Proofs_BassLyubeznik_SignedCore_eps_mul_self_Defs
import Definitions.Def_LPCA_Proofs_BassLyubeznik_SignedCore_inc_eq_zero_Defs
import Definitions.Def_LPCA_Proofs_BassLyubeznik_SignedCore_inc_insert_Defs
import Definitions.Def_LPCA_Proofs_BassLyubeznik_SignedCore_nu_erase_self_Defs
import Definitions.Def_LPCA_Proofs_BassLyubeznik_SignedCore_nu_insert_of_gt_Defs
namespace Proofs.BassLyubeznik.SignedCore
open Finset
variable {V : Type*} [LinearOrder V] {k : Type*} [Field k]
-- SWARM:HELPERS-BEGIN
-- SWARM:HELPERS-END
-- SWARM:STATEMENT-BEGIN
theorem nu_insert_of_lt {J : Finset V} {a b : V} (ha : a ∉ J) (hab : a < b) :
nu (insert a J) b = nu J b + 1
-- SWARM:STATEMENT-END
:= by
have h : a ∉ J.filter (· < b) := fun h => ha (Finset.mem_filter.mp h).1
rw [nu, nu, Finset.filter_insert, if_pos hab, Finset.card_insert_of_notMem h]
-- SWARM:PROOF-END
end Proofs.BassLyubeznik.SignedCore
Source