Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

W-her implies C3 for whole-word Cont

Proved
APFPaper1.Continuation.prefix_closed_of_subwordHeredity

by FiniteUniverse · Nov 15, 2026 · Mathlib 0df444a (Lean v4.33.1)

apfapf-referencesib-v58-2026-11

Assume SubwordHeredity for Cont with admissible subwords defined by existential Cont membership. Any prefix of a continuation from x remains a continuation from x; the bill is independent of the raw input. The admissible subword class is fixed to existential Cont membership, not arbitrary Amb. Execution of a prefix comes from the original input; its state-independent bill comes from W-her. W-her remains a structural hypothesis, not a foundation consequence. No converse is claimed.

Preamble
import Definitions.Def_APFPaper1_ContextualEquivalence

set_option autoImplicit false
namespace APFPaper1.Continuation
end APFPaper1.Continuation
open APFPaper1.Continuation
universe uC uF uX uR
variable {Context : Type uC} {Frag : Context → Context → Type uF} {Raw : Context → Type uX}
  {R : Context → Type uR}
Formal statement
theorem APFPaper1.Continuation.prefix_closed_of_subwordHeredity
    (step : (g h : Context) → Frag g h → Raw g → Raw h → Prop)
    (resource : (g : Context) → WordFrom Frag g → R g)
    (calibration : (g : Context) → R g → NNReal) (C : Context → NNReal)
    (hher : SubwordHeredity (Cont step resource calibration C)
      (fun g h M => ∃ x : Raw g, Cont step resource calibration C g x ⟨h, M⟩))
    (g : Context) (x : Raw g) (v w : WordFrom Frag g) (hpre : IsPrefix v w)
    (hw : Cont step resource calibration C g x w) :
    Cont step resource calibration C g x v := by sorry
Source
C:\Users\brook\My Drive\__APF Library\Artifacts_2026-11-14_session\astra\sib_v58_publication\source\Theorems\Thm_APFPaper1_Cont_subword_gives_prefix.lean:30
Human review
  • Endorsed by Shuze Chen · Nov 18, 2026

    Confirmed by the moderator at approval.

  • Endorsed by FiniteUniverse · Nov 18, 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