Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

A tested support-novel admissible chain obeys a cardinality bound

Proved
APFB05.family_charge_le_capacity

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

apfapf-referencesib-v58-2026-11

Given the guarded MarginalFloor predicate and a chain beginning empty, with each inserted task tested and support-novel and every stage feasible and within the same capacity, proves card(S n) × epsilon g ≤ C g. Original whole-resource, calibration, maintained support, sufficient/use and tested parameters remain explicit.

Preamble
import Theorems.Thm_APFB05_novel_chain_bound_stagewise
import Theorems.Thm_APFB02_relation_ranges_at_resolution
import Theorems.Thm_APFB02_reread_clause_stands_with_told_apart
import Mathlib.Data.Finset.Card
import Mathlib.Tactic.FieldSimp

set_option autoImplicit false

open APFPaper1.Source APFPaper5.K1 APFPaper5.K3
Formal statement
theorem APFB05.family_charge_le_capacity
    {Context : Type*} {D P R Record : Context → Type*} [∀ g, DecidableEq (D g)]
    (wholeResource : (g : Context) → P g → R g)
    (calibration : (g : Context) → R g → NNReal)
    (maintained : (g : Context) → P g → Set (Record g))
    (sufficient : (g : Context) → P g → Set (Record g) → D g → Prop)
    (usesToRealize : (g : Context) → P g → D g → Set (Record g) → Prop)
    (tested : (g : Context) → D g → Prop) (C epsilon : Context → ℝ)
    (hB05 : APFB05.MarginalFloor wholeResource calibration maintained sufficient usesToRealize
      tested C epsilon)
    (g : Context) (n : ℕ) (S : ℕ → Finset (D g)) (d : ℕ → D g) (h0 : S 0 = ∅)
    (hstep : ∀ i < n, S (i + 1) = insert (d i) (S i))
    (htested : ∀ i < n, tested g (d i))
    (hnovel : ∀ i < n, supportNovel (wholeResource g) (calibration g) (maintained g)
      (sufficient g) (usesToRealize g) (S i) (d i))
    (hadm : ∀ i ≤ n, familyAdmissible (wholeResource g) (calibration g) (maintained g)
      (sufficient g) (usesToRealize g) (C g) (S i)) :
    ((S n).card : ℝ) * epsilon g ≤ C g := by sorry
Source
[{'path': 'source/Theorems/Thm_APFB05_fineness_floor_at_one_interface.lean', 'sha256': 'ad0553fde6d3145bea5ddb27bfb3924bf622e3f509382437ebd01dd8361693ff', 'line': 56, 'declaration': 'APFB05.family_charge_le_capacity'}, {'path': 'Papers/Paper 05 - Quantum Structure - Hilbert Space and Born Rule/Paper_5_Quantum_Structure_Hilbert_Born_Supplement_v7.33.tex', 'locator': '2966-3077;3559-3564;3670-3674', 'role': 'Scope boundaries: original readout obligations and finite-resolution versus continuum.'}, {'path': 'APF Reference Docs/APF Reconstruction Spine/FOUNDATION_INPUTS.json', 'revision': '2026-11-14.1', 'role': 'B02 amended finite side realization; B03/B04/B05 unchanged; not certification of supplied source instantiation.'}, {'path': 'Papers/Paper 01 - The Enforceability of Distinction/Paper_1_Enforceability_of_Distinction_Supplement_v9.28.tex', 'locator': '2601-2682;2741-2760', 'role': 'Shared support, near-optimal support novelty and guarded marginal-floor scope.'}]
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