Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

The six functors satisfy the formalism (Theorem 1.2.4)

Disproved
RSF.six_functor_formalism

by Lucas · Oct 23, 2026 · Mathlib 0df444a (Lean v4.33.1)

base-changeprojection-formulasix-functor-formalism

Theorem 1.2.4 of the thesis: the assignment of the sheaf categories to the spaces, together with the six functors - tensor, internal hom, pullback, pushforward, lower shriek, upper shriek - satisfies the compatibilities of a six-functor formalism: (i) functoriality - the pullback of a composite is the composite of the pullbacks in reverse order, the pushforward of a composite is the composite of the pushforwards, and the two shriek functors are functorial on the bdcs maps; (ii) the special cases - upper shriek agrees with pullback along etale maps, lower shriek with pushforward along proper maps; (iii) the projection formula f_!(N tensor f^*M) = f_!N tensor M for bdcs f; and (iv) proper base change along cartesian squares with bdcs vertical maps. The isomorphisms of the paper are encoded as equalities of the bundled operations.

Formalization Note The world is abstract interface data; constructing it for the solid almost module categories of the thesis and establishing the compatibilities is the proposed work.

Preamble
import Mathlib
import Definitions.Def_RSF_cat
import Definitions.Def_RSF_geo
Formal statement
namespace RSF

/-!  Theorem 1.2.4 of the thesis: the assignment of the sheaf categories to
the spaces, together with the six functors, satisfies the compatibilities of
a 6-functor formalism: functoriality of the pullback and pushforward and,
for bdcs maps, of the two shriek functors; the special cases - upper shriek
agrees with pullback along etale maps, lower shriek with pushforward along
proper maps; the projection formula for bdcs maps; and proper base change
along cartesian squares with bdcs vertical maps. The isomorphisms of the
paper are encoded as equalities of the bundled operations.  -/

theorem six_functor_formalism : ∀ w : SixFunctorWorld,
    (∀ (X Y Z : w.Space) (f : w.Map X Y) (g : w.Map Y Z) (M : w.C Z),
      w.pull X Z (w.compMap X Y Z f g) M = w.pull X Y f (w.pull Y Z g M)) ∧
    (∀ (X Y Z : w.Space) (f : w.Map X Y) (g : w.Map Y Z) (M : w.C X),
      w.push X Z (w.compMap X Y Z f g) M = w.push Y Z g (w.push X Y f M)) ∧
    (∀ (X Y Z : w.Space) (f : w.Map X Y) (g : w.Map Y Z)
        (hf : w.IsBdcs X Y f) (hg : w.IsBdcs Y Z g) (M : w.C X),
      w.lshriek X Z (w.compMap X Y Z f g) M = w.lshriek Y Z g (w.lshriek X Y f M)) ∧
    (∀ (X Y Z : w.Space) (f : w.Map X Y) (g : w.Map Y Z)
        (hf : w.IsBdcs X Y f) (hg : w.IsBdcs Y Z g) (M : w.C Z),
      w.ushriek X Z (w.compMap X Y Z f g) M = w.ushriek X Y f (w.ushriek Y Z g M)) ∧
    (∀ (X Y : w.Space) (f : w.Map X Y) (hf : w.IsEtale X Y f) (M : w.C Y),
      w.ushriek X Y f M = w.pull X Y f M) ∧
    (∀ (X Y : w.Space) (f : w.Map X Y) (hf : w.IsProper X Y f) (M : w.C X),
      w.lshriek X Y f M = w.push X Y f M) ∧
    (∀ (X Y : w.Space) (f : w.Map X Y) (hf : w.IsBdcs X Y f) (N : w.C X) (M : w.C Y),
      w.lshriek X Y f (w.tensor X N (w.pull X Y f M))
        = w.tensor Y (w.lshriek X Y f N) M) ∧
    (∀ (s : CartSquare w) (hf : w.IsBdcs s.Y s.X s.f) (N : w.C s.Y),
      w.pull s.X' s.X s.g (w.lshriek s.Y s.X s.f N)
        = w.lshriek s.Y' s.X' s.f' (w.pull s.Y' s.Y s.g' N)) := by
  sorry

end RSF
Source
L. Mann, A p-Adic 6-Functor Formalism in Rigid-Analytic Geometry, arXiv:2206.02022 (2022), Theorem 1.2.4 (proved as Corollary 3.6.15).
Read-back

What the Lean code literally says, in plain math · glm-5-latest-short

Restate: for every six-functor world, eight properties hold: the pullback of a composite of maps applied to an object of the target category equals the pullback of the first map applied to the pullback of the second; the analogous identity holds for pushforwards; for composable maps both labeled bdcs, the analogous identities hold for the lower shriek and for the upper shriek; along a map labeled etale, the upper shriek of every object equals its pullback; along a map labeled proper, the lower shriek of every object equals its pushforward; for a bdcs map f and objects N of the source and M of the target, the lower shriek of the tensor of N with the pullback of M equals the tensor of the lower shriek of N with M; and for every cartesian square whose vertical map f is bdcs and every object N of its top-right space, the pullback of the horizontal map g applied to the lower shriek of f at N equals the lower shriek of the base-changed vertical map applied to the pullback of the top horizontal map at N. No other hypotheses appear.

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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me