Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 3.13 — the unique ≾-minimal solution of F ∗ ? ⊨ G exists and is min(F −∗ G)

Proved
BiAbduction.Footprint.theorem_3_13

by mikedeng1 · Oct 7, 2026 · Mathlib 0df444a (Lean v4.33.1)

abductionp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1separation-logic

Let F,GF, GF,G be arbitrary predicates (sets of stack–heap pairs, heaps finite). The abduction question F∗M⊨GF * M \models GF∗M⊨G has a best solution with respect to the betterness order ≾\precsim≾, namely

min⁡(F− ⁣ ⁣∗G):\min(F \mathbin{-\!\!*} G):min(F−∗G):

it is a solution, it satisfies min⁡(F− ⁣ ⁣∗G)≾M\min(F \mathbin{-\!\!*} G) \precsim Mmin(F−∗G)≾M for every solution MMM (every predicate MMM with F∗M⊨GF * M \models GF∗M⊨G), and it is the only solution with this property.

This is the semantic answer to abduction against which the paper measures its algorithms, and Theorem 4.11 uses it to identify the anti-frames computed by an ideal bi-abductive prover.

Preamble
import Mathlib
import Definitions.Def_BiAbduction_Footprint_Semantics
Formal statement
namespace BiAbduction.Footprint

/-- Theorem 3.13 (p. 24): the minimal solution of `F ∗ ? ⊨ G` w.r.t. `≾` always exists and is
`min(F −∗ G)`; it is the only `≾`-least solution. -/
theorem theorem_3_13 (F G : Pred) :
    IsLeastSolution F G (minSet (wand F G)) ∧
    ∀ M : Pred, IsLeastSolution F G M → M = minSet (wand F G) := by sorry

end BiAbduction.Footprint
Source
Calcagno, Distefano, O'Hearn, Yang, Compositional Shape Analysis by means of Bi-Abduction, J. ACM (2011), p. 24, Theorem 3.13 (proof p. 25)
Human review
  • Endorsed by Shuze Chen · Oct 7, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 7, 2026

    Confirmed by the mission captain (proposal self-audit).

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