Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Faithful Comparison Square — coordinate chain dependencies

Definition
LPCA_Solutions_LPCA_FaithfulComparisonSquare_SixOne20261024_Defs

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

commutative-algebralocal-cohomologylocalized-persistent-commutative-algebralpca-coordinate-chain-20261024stanley-reisner

This bundle supplies the selected constructions and proved compatibility results for faithful comparison square used in the coordinate Čech chain comparison. Each construction retains the rings, categories, grading indices and hypotheses in its formal declaration.

Differential compatibility can be checked in faithful field views with all four comparison squares retained explicitly.

Definition code
import Mathlib.CategoryTheory.Functor.FullyFaithful

set_option autoImplicit false

namespace LPCA

open CategoryTheory

universe u v u' v'

/-- Differential compatibility can be checked in faithful field views with
all four comparison squares retained explicitly. -/
theorem faithfulComparisonSquare {C : Type u} [Category.{v} C]
    {D : Type u'} [Category.{v'} D] (F : C ⥤ D) [F.Faithful]
    {M₀ M₁ N₀ N₁ : C} {P₀ P₁ Q₀ Q₁ : D}
    (α₀ : F.obj M₀ ≅ P₀) (α₁ : F.obj M₁ ≅ P₁)
    (β₀ : F.obj N₀ ≅ Q₀) (β₁ : F.obj N₁ ≅ Q₁)
    (e₀ : M₀ ⟶ N₀) (e₁ : M₁ ⟶ N₁) (E₀ : P₀ ⟶ Q₀) (E₁ : P₁ ⟶ Q₁)
    (d : M₀ ⟶ M₁) (D' : N₀ ⟶ N₁) (dP : P₀ ⟶ P₁) (dQ : Q₀ ⟶ Q₁)
    (he₀ : F.map e₀ ≫ β₀.hom = α₀.hom ≫ E₀)
    (he₁ : F.map e₁ ≫ β₁.hom = α₁.hom ≫ E₁)
    (hs : F.map d ≫ α₁.hom = α₀.hom ≫ dP)
    (ht : F.map D' ≫ β₁.hom = β₀.hom ≫ dQ)
    (hE : E₀ ≫ dQ = dP ≫ E₁) : e₀ ≫ D' = d ≫ e₁ := by
  apply F.map_injective
  apply (cancel_mono β₁.hom).mp
  simp only [Functor.map_comp, Category.assoc]
  calc
    _ = F.map e₀ ≫ β₀.hom ≫ dQ := by rw [ht]
    _ = (F.map e₀ ≫ β₀.hom) ≫ dQ := by simp only [Category.assoc]
    _ = (α₀.hom ≫ E₀) ≫ dQ := by rw [he₀]
    _ = α₀.hom ≫ E₀ ≫ dQ := by simp only [Category.assoc]
    _ = α₀.hom ≫ dP ≫ E₁ := by rw [hE]
    _ = (α₀.hom ≫ dP) ≫ E₁ := by simp only [Category.assoc]
    _ = (F.map d ≫ α₁.hom) ≫ E₁ := by rw [← hs]
    _ = F.map d ≫ α₁.hom ≫ E₁ := by simp only [Category.assoc]
    _ = _ := by rw [← he₁]

end LPCA
Source
https://arxiv.org/abs/2609.02858v1, Section 6, Theorem 6.1 and its formalization dependencies. Certified Lean source: Solutions/LPCA_FaithfulComparisonSquare.lean, selected declarations in lines 11–37; source SHA-256 3bdc4ca2c7d477820e2a222eefb9c1134b04fdf15e9f3fd8527190ccf60373a2; exact-source certificate Sapelo2 job 49296539.

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