Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

No-new-joint channel costs give a scaled shared-count table

Proved
APFPaper5.K1.sharedCost_channel_eq_sharedTable

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

apfapf-referencesib-v15-2026-11

Supply a finite channel type, a channel assignment Ch to finite families, a list of indexed families F(a), and a real scale ε. Assume hJ: Ch(F(a)∪F(b))=Ch(F(a))∪Ch(F(b)) for every indexed pair. For cost(X)=ε|Ch(X)|, sharedCost(F(a),F(b)) equals ε times the sharedTable of their channel sets. No positivity of ε is required for the identity. The hypothesis rules out new joint channels for the listed pairs; it is not derived for arbitrary physical joins.

Preamble
import Definitions.Def_APFPaper1_FamilyCost
import Definitions.Def_APFPaper5_K1_SharedCost
import Theorems.Thm_APFPaper5_K1_sharedTable_eq_card
import Theorems.Thm_APFPaper5_K1_sharedCost_self
import Theorems.Thm_APFPaper5_K1_sharedCost_le_right
import Theorems.Thm_APFPaper5_K1_sharedCost_le_left
import Theorems.Thm_APFPaper5_K1_sharedCost_nonneg_iff
import Theorems.Thm_APFPaper5_K1_sharedCost_channel_ledger
import Theorems.Thm_APFPaper5_K1_sharedCost_channel_no_joint
import Theorems.Thm_APFPaper5_K1_cost_is_count_times_floor
import Mathlib.Data.Finset.Union
import Mathlib.Algebra.Order.Archimedean.Real.Basic
import Mathlib.Tactic.Linarith

set_option autoImplicit false
open APFPaper1.Source
namespace APFPaper5.K1
end APFPaper5.K1
open APFPaper5.K1
universe u v w
variable {ι : Type u} {Rec : Type v} [DecidableEq Rec]
Formal statement
theorem APFPaper5.K1.sharedCost_channel_eq_sharedTable {D : Type u} [DecidableEq D] {Ch : Type v} [Fintype Ch]
    [DecidableEq Ch] {κ : Type w} (chan : Finset D → Finset Ch) (eps : ℝ) (fams : κ → Finset D)
    (hJ : ∀ a b, chan (fams a ∪ fams b) = chan (fams a) ∪ chan (fams b)) (a b : κ) :
    sharedCost (fun X => eps * ((chan X).card : ℝ)) (fams a) (fams b) =
      eps * sharedTable (fun k => chan (fams k)) a b := by sorry
Source
Sib v15 frozen source: Theorems/Thm_APFPaper5_K1_shared_cost_counting.lean:77; Papers/Paper 01 - The Enforceability of Distinction/Paper_1_Enforceability_of_Distinction_Supplement_v9.28.tex, 1772-1792;2502-2530; Artifacts_2026-11-12_session/claude/EthanBrooke-01WrrBvu/RULING_two_adoptions_2026-11-12.md, 1
Human review
  • Endorsed by Shuze Chen · Nov 16, 2026

    Confirmed by the moderator at approval.

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