Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Coefficient matrices for localized Čech basis terms

Definition
LPCA_Solutions_LPCA_VertexSplitting_Defs

by kaiyue · Oct 21, 2026 · Mathlib 0df444a (Lean v4.33.1)

commutative-algebralocal-cohomologylocalized-persistent-commutative-algebralpca-attachment-20261021stanley-reisner

This bundle supplies coefficient matrices for localized Čech basis terms. The bundle contains the selected declarations used by this attachment checkpoint, with the hypotheses of their Lean statements retained. Its role as a dependency does not assert a stronger comparison, scalar compatibility or persistence theorem than those declarations state.

The included constructions and necessary compatibility results are:

  • Matrix presentation only. The genuine Cech-complex comparison remains separate.
Definition code
import Mathlib.Algebra.Homology.LocalCohomology
import Mathlib.Data.Finset.Powerset
import Mathlib.Data.Real.Basic
import Mathlib.LinearAlgebra.Pi
import Mathlib.RingTheory.Ideal.Quotient.Operations
import Mathlib.RingTheory.Localization.Away.Basic
import Mathlib.RingTheory.MvPolynomial.Basic
import Mathlib.Tactic
import Definitions.Def_LPCA

set_option autoImplicit false

namespace LPCA

universe u

variable {V : Type u} [DecidableEq V] [Fintype V]



















noncomputable instance cechBasisFintype
    (K : Complex V) (T : Finset V) (a : V → ℤ) (p : ℕ) :
    Fintype (CechBasis K T a p) := by
  classical
  unfold CechBasis
  infer_instance

/-- Matrix presentation only. The genuine Cech-complex comparison remains separate. -/
noncomputable def basisDifferential
    (k : Type u) [Field k] (coefficient : Finset V → Finset V → k)
    (K : Complex V) (T : Finset V) (a : V → ℤ) (p : ℕ) :
    (CechBasis K T a p → k) →ₗ[k] (CechBasis K T a (p + 1) → k) where
  toFun x G := ∑ F, coefficient F.1 G.1 * x F
  map_add' x y := by
    ext G
    simp [mul_add, Finset.sum_add_distrib]
  map_smul' c x := by
    ext G
    simp [Finset.mul_sum, mul_left_comm, mul_assoc]





end LPCA
Source
https://arxiv.org/abs/2609.02858v1, formalization dependencies for Sections 2–4. Certified Lean source: Solutions/LPCA_VertexSplitting.lean, selected declarations in lines 117–135; source SHA-256 3b0b6e9f06753fd93695c51b68d332f9d2e7586ec2c66c22e04c20881dac6d15; source certificate Sapelo2 job 49172236.

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me