Model vocabulary — Protocol-dependent sufficiency obstructs countedness
DefinitionAPFB06_twins_world_Vocabularyapfapf-referencepullbacks-v46-2026-11
Data, predicates and immediate constructor helpers for this reviewed model. Its substantive results are published as separate proved theorem nodes.
A supplied four-process, two-record world satisfies its encoded EightHold and full occupant predicates but fails SufficiencyCarries. A tested, admissible, support-novel pair lacks an own paid record and its supplied party-score diagonal is not faithful. The result distinguishes these formal predicates, not the author's physical foundation.
Supplied data and hypotheses
- Every parameter and hypothesis in the exact source declaration remains exposed; no author input is adopted.
Limits
This is conditional reference mathematics. The supplied model and its hypotheses are not adopted Foundation inputs, and this node does not establish K1, K3 or K4 closure.
Definition code
import Definitions.Def_APFPaper5_K1_counted_from_the_occupant_statement_Vocabulary
import Theorems.Thm_APFPaper5_K1_own_record_of_support_novel
import Theorems.Thm_APFPaper5_K1_hasOwnPaidRecord_of_occupant_statement
import Theorems.Thm_APFPaper5_K1_counted_of_occupant_statement
import Theorems.Thm_APFPaper5_K1_K1_of_occupant_statement
import Definitions.Def_APFB06_worlds_against_the_occupant_statement_Vocabulary
import Theorems.Thm_APFPaper1_Source_not_holdingNothingFree_of_bill_pos
import Theorems.Thm_APFPaper1_Source_not_holdingNothingFree_of_keeps
import Theorems.Thm_APFPaper1_Source_not_inFull_of_not_free
import Theorems.Thm_APFB06_ReadingsWorld_meets_in_full
import Theorems.Thm_APFB06_MovingWorld_holdingNothingFree
import Theorems.Thm_APFB06_MovingWorld_fcost_empty
import Theorems.Thm_APFB06_MovingWorld_every_family_occupied
import Theorems.Thm_APFB06_MovingWorld_occupant_holds_with_parts_at_unit
import Theorems.Thm_APFB06_MovingWorld_meets_in_full
import Theorems.Thm_APFB06_SharedWorld_holdingNothingFree
import Theorems.Thm_APFB06_SharedWorld_fcost_empty
import Theorems.Thm_APFB06_SharedWorld_every_family_occupied
import Theorems.Thm_APFB06_SharedWorld_occupant_holds_with_parts_at_unit
import Theorems.Thm_APFB06_SharedWorld_meets_in_full
import Theorems.Thm_APFB06_ResidueNullWorld_meets_in_full
import Theorems.Thm_APFB06_BridgeWorld_not_holdingNothingFree
import Theorems.Thm_APFB06_BridgeWorld_fails_in_full
import Theorems.Thm_APFB06_RelationWorldR2_not_holdingNothingFree
import Theorems.Thm_APFB06_ResidueWorldR2_Unequal_not_holdingNothingFree
import Theorems.Thm_APFB06_BusWorld_not_holdingNothingFree
import Theorems.Thm_APFB06_OverheadWorld_not_holdingNothingFree
import Theorems.Thm_APFB06_DiscountWorld_not_holdingNothingFree
import Theorems.Thm_APFPaper1_LoadWorld_not_holdingNothingFree
import Theorems.Thm_APFPaper5_Worlds_not_holdingNothingFree
import Theorems.Thm_APFB06_WorldsAudit_three_signs_among_worlds_meeting_the_statement
import Definitions.Def_APFPaper5_K1_counted_pair_under_the_occupant_statement_Vocabulary
import Theorems.Thm_APFB06_ResidueNullWorld_ra_not_needed
import Theorems.Thm_APFB06_ResidueNullWorld_rb_not_needed
import Theorems.Thm_APFB06_ResidueNullWorld_rj_not_needed_allA
import Theorems.Thm_APFB06_ResidueNullWorld_rj_not_needed_allB
import Theorems.Thm_APFB06_ResidueNullWorld_novel_A_over_allB
import Theorems.Thm_APFB06_ResidueNullWorld_novel_B_over_allA
import Theorems.Thm_APFB06_ResidueNullWorld_pair_counted_first_typed
import Theorems.Thm_APFB06_ResidueNullWorld_pair_has_own_paid_record
import Theorems.Thm_APFB06_ResidueNullWorld_pair_is_counted
import Theorems.Thm_APFB06_ResidueNullWorld_pair_is_counted_at_unit
import Theorems.Thm_APFB06_ResidueNullWorld_rj_is_joint_of_pair
import Theorems.Thm_APFB06_ResidueNullWorld_both_party_to_rj
import Theorems.Thm_APFB06_ResidueNullWorld_pair_meets_K1_at_unit
import Theorems.Thm_APFB06_ResidueNullWorld_world_meets_statement_and_counted_pair_meets_K1
import Definitions.Def_APFPaper5_K1_table_kernel_and_support_Vocabulary
import Theorems.Thm_APFPaper5_K1_atomTable_form_eq_zero_iff
import Theorems.Thm_APFPaper5_K1_atomTable_faithful_iff
import Theorems.Thm_APFPaper5_K1_atomTable_row_eq_of_same_marks
import Theorems.Thm_APFPaper5_K1_atomTable_merge_of_same_marks
import Theorems.Thm_APFPaper5_K1_atomTable_eq_zero_of_disjoint
import Theorems.Thm_APFPaper5_K1_card_mul_le_sum_of_private
import Mathlib.Tactic.NormNum
import Mathlib.Tactic.Linarith
set_option autoImplicit false
open APFPaper1.Source APFPaper5.K1
namespace APFB06.TwinsWorld
inductive St
| a | b | c | e
deriving DecidableEq
/-- The processes: do nothing, the protocol for dA, the protocol for dB, the protocol for both. -/
inductive Pr
| p0 | pa | pb | pab
deriving DecidableEq
/-- The records: one that each single protocol keeps, and one that only the pair's protocol adds. -/
inductive Rc
| r | j
deriving DecidableEq
instance instFintypeRc : Fintype Rc :=
⟨{Rc.r, Rc.j}, fun x => by cases x <;> simp⟩
/-- The continuation relation. Every state admits doing nothing. Beyond that: state a admits every
process, state b the pair's process, state c nothing more, state e the process for dA. -/
def cont : St → Pr → Prop
| .a, _ => True
| .b, q => q = Pr.pab ∨ q = Pr.p0
| .c, q => q = Pr.p0
| .e, q => q = Pr.pa ∨ q = Pr.p0
theorem cont_inj (x y : St) (h : cont x = cont y) : x = y := by
have hab : cont St.a ≠ cont St.b := fun h => by
have h' : Pr.pa = Pr.pab ∨ Pr.pa = Pr.p0 := Eq.mp (congrFun h Pr.pa) trivial
rcases h' with h' | h' <;> cases h'
have hac : cont St.a ≠ cont St.c := fun h => by
have h' : Pr.pa = Pr.p0 := Eq.mp (congrFun h Pr.pa) trivial
cases h'
have hbc : cont St.b ≠ cont St.c := fun h => by
have h' : Pr.pab = Pr.p0 :=
Eq.mp (congrFun h Pr.pab) (show Pr.pab = Pr.pab ∨ Pr.pab = Pr.p0 from Or.inl rfl)
cases h'
have hae : cont St.a ≠ cont St.e := fun h => by
have h' : Pr.pab = Pr.pa ∨ Pr.pab = Pr.p0 := Eq.mp (congrFun h Pr.pab) trivial
rcases h' with h' | h' <;> cases h'
have hbe : cont St.b ≠ cont St.e := fun h => by
have h' : Pr.pab = Pr.pa ∨ Pr.pab = Pr.p0 :=
Eq.mp (congrFun h Pr.pab) (show Pr.pab = Pr.pab ∨ Pr.pab = Pr.p0 from Or.inl rfl)
rcases h' with h' | h' <;> cases h'
have hce : cont St.c ≠ cont St.e := fun h => by
have h' : Pr.pa = Pr.p0 :=
Eq.mpr (congrFun h Pr.pa) (show Pr.pa = Pr.pa ∨ Pr.pa = Pr.p0 from Or.inl rfl)
cases h'
cases x <;> cases y
· rfl
· exact absurd h hab
· exact absurd h hac
· exact absurd h hae
· exact absurd h.symm hab
· rfl
· exact absurd h hbc
· exact absurd h hbe
· exact absurd h.symm hac
· exact absurd h.symm hbc
· rfl
· exact absurd h hce
· exact absurd h.symm hae
· exact absurd h.symm hbe
· exact absurd h.symm hce
· rfl
abbrev K : (g : Unit) → St → Pr → Prop := fun _ => cont
/-- True at a and e. -/
def dA : St → Bool
| .a => true
| .e => true
| _ => false
/-- True at a and b. -/
def dB : St → Bool
| .a => true
| .b => true
| _ => false
abbrev Delta : (g : Unit) → (St → Bool) → Prop := fun _ d => d = dA ∨ d = dB
noncomputable instance instDecEqDomain (g : Unit) : DecidableEq {d : St → Bool // Delta g d} :=
Classical.decEq _
abbrev Dist : Type := {d : St → Bool // Delta () d}
theorem hresp (g : Unit) (d : {d : St → Bool // Delta g d}) (x y : St) (h : K g x = K g y) :
d.val x = d.val y := by
rw [cont_inj x y h]
def dAd : Dist := ⟨dA, Or.inl rfl⟩
def dBd : Dist := ⟨dB, Or.inr rfl⟩
/-- The protocols: all four processes. -/
def protocols : (g : Unit) → Set Pr := fun _ => Set.univ
def pZ : {p : Pr // p ∈ protocols ()} := ⟨Pr.p0, Set.mem_univ _⟩
def pA : {p : Pr // p ∈ protocols ()} := ⟨Pr.pa, Set.mem_univ _⟩
def pB : {p : Pr // p ∈ protocols ()} := ⟨Pr.pb, Set.mem_univ _⟩
def pAB : {p : Pr // p ∈ protocols ()} := ⟨Pr.pab, Set.mem_univ _⟩
/-- What each protocol keeps. The protocol for dA and the protocol for dB keep the same one record. -/
def keeps : Pr → Rc → Prop
| .p0, _ => False
| .pa, x => x = Rc.r
| .pb, x => x = Rc.r
| .pab, _ => True
/-- Which distinctions a process realizes, read off the distinction's value at b: false for dA, true for
dB. -/
def realizes : Pr → Bool → Prop
| .p0, _ => False
| .pa, v => v = false
| .pb, v => v = true
| .pab, _ => True
def maint (g : Unit) (p : {p : Pr // p ∈ protocols g}) : Set Rc := {x | keeps p.val x}
/-- In a protocol, a set of records is sufficient for a distinction when the protocol realizes that
distinction and the set holds every record the protocol keeps. It depends on the protocol. -/
def suff (g : Unit) (p : {p : Pr // p ∈ protocols g}) (s : Set Rc)
(d : {d : St → Bool // Delta g d}) : Prop := realizes p.val (d.val St.b) ∧ maint g p ⊆ s
def uses (g : Unit) (p : {p : Pr // p ∈ protocols g}) (d : {d : St → Bool // Delta g d})
(s : Set Rc) : Prop := realizes p.val (d.val St.b) ∧ maint g p ⊆ s
def wholeRes (g : Unit) (p : {p : Pr // p ∈ protocols g}) : Pr := p.val
def calibration (_ : Unit) : Pr → NNReal
| .p0 => 0
| .pa => 1
| .pb => 1
| .pab => 2
def C : Unit → NNReal := fun _ => 2
abbrev ServesFam (p : {p : Pr // p ∈ protocols ()}) (S : Finset Dist) : Prop :=
∀ d ∈ S, ∃ sigma : Set Rc, sigma ⊆ maint () p ∧ suff () p sigma d ∧ uses () p d sigma
noncomputable abbrev cost (S : Finset Dist) : ℝ :=
familyCost (wholeRes ()) (calibration ()) (maint ()) (suff ()) (uses ()) S
abbrev billSet (S : Finset Dist) : Set ℝ :=
{c : ℝ | ∃ p : {p : Pr // p ∈ protocols ()},
ServesFam p S ∧ ((calibration () (wholeRes () p) : NNReal) : ℝ) = c}
/-! ### Bills -/
/-! ### Family costs -/
/-! ### Holding nothing costs nothing -/
/-! ### The eight declared forms -/
/-- The held family: both distinctions. -/
noncomputable def heldD : Finset Dist := {dAd, dBd}
/-- The occupant's alignment: it sits at a and carries dA and dB. -/
noncomputable def alignP : APFB06.OriginalAlignment (K ())
(APFB06.physicalDomain (K ()) (Delta ()) (hresp ())) where
carrier := APFB01.physicalClass (K ()) St.a
carried := heldD.map (APFB06.taskEquiv (K ()) (Delta ()) (hresp ())).symm.toEmbedding
active := by
intro t ht
obtain ⟨d, hd, rfl⟩ := Finset.mem_map.mp ht
rcases Finset.mem_insert.mp hd with rfl | hd'
· rfl
· rw [Finset.mem_singleton.mp hd']
rfl
def actualJointP : Set (Sigma fun g =>
APFB06.OriginalAlignment (K g) (APFB06.physicalDomain (K g) (Delta g) (hresp g))) :=
{⟨(), alignP⟩}
/-- The eight declared forms on the supplied data. -/
def EightHold : Prop :=
APF_B01_DeclaredInput (K ())
(fun (f : APFB01.PhysicalState (K ()) → Prop) (x : St) => f (APFB01.physicalClass (K ()) x))
(fun (f : APFB01.PhysicalState (K ()) → Prop) (x : St) => f (APFB01.physicalClass (K ()) x))
(fun (f : APFB01.PhysicalState (K ()) → Prop) (x : St) => f (APFB01.physicalClass (K ()) x))
(fun (f : APFB01.PhysicalState (K ()) → Prop) (x : St) => f (APFB01.physicalClass (K ()) x)) ∧
APFB02.B02SourceMeaning (Context := Unit) (X := fun _ => St) (Q := fun _ => Pr)
(P := fun g => {p : Pr // p ∈ protocols g}) (Record := fun _ => Rc)
K Delta maint suff uses ∧
APFB03.B03TaskCost (Context := Unit) (D := fun g => {d : St → Bool // Delta g d})
(P := fun g => {p : Pr // p ∈ protocols g}) (R := fun _ => Pr) (Record := fun _ => Rc)
wholeRes calibration maint suff uses ∧
APFB04.B04FiniteCapacity (Context := Unit) (fun g => ((C g : NNReal) : ℝ)) ∧
APFB05.MarginalFloor (Context := Unit) (D := fun g => {d : St → Bool // Delta g d})
(P := fun g => {p : Pr // p ∈ protocols g}) (R := fun _ => Pr) (Record := fun _ => Rc)
wholeRes calibration maint suff uses (fun _ _ => True) (fun g => ((C g : NNReal) : ℝ))
(fun _ => (1 : ℝ)) ∧
APFB06.AmendedB06_20260914 K
(fun g => APFB06.physicalDomain (K g) (Delta g) (hresp g)) protocols
(fun g => APFB06.extensionalJoint (maint g)
(fun p s t => suff g p s (APFB06.taskEquiv (K g) (Delta g) (hresp g) t))
(fun p t s => uses g p (APFB06.taskEquiv (K g) (Delta g) (hresp g) t) s))
wholeRes calibration C actualJointP ∧
APFB07a.A2Selection (Interface := Unit)
(Configuration := fun _ => APFB01.PhysicalState (K ()))
(fun _ s => s = APFB01.physicalClass (K ()) St.a) (fun _ _ => (1 : ℝ))
(fun _ => APFB01.physicalClass (K ()) St.a) ∧
APFB07b.BWUniqueMinimum (Interface := Unit)
(Configuration := fun _ => APFB01.PhysicalState (K ()))
(fun _ s => s = APFB01.physicalClass (K ()) St.a) (fun _ _ => (1 : ℝ))
/-! ### B02 in the proposed r2 form -/
/-- The state holding a given side of dA and a given side of dB. -/
def stateOf : Bool → Bool → St
| true, true => St.a
| false, true => St.b
| false, false => St.c
| true, false => St.e
/-! ### What families need -/
/-! ### The occupant -/
/-! ### Costs -/
/-! ### The pair -/
/-- The pair as an indexed family: dA at `false`, dB at `true`. -/
def pairD : Bool → Dist
| false => dAd
| true => dBd
/-! ### Each member is support-novel over the other -/
/-! ### Neither member has a record of its own -/
/-! ### K1's faithful diagonal fails for the pair -/
/-! ### Sufficiency does not carry here -/
end APFB06.TwinsWorld
/-! ## The residue world with a do-nothing protocol: where the derivation applies -/
namespace APFB06.ResidueNullWorld
end APFB06.ResidueNullWorld
Source
Theorems.Thm_APFB06_twins_world; Pullbacks v46, SHA-256 502a022edf2e51440714bea0666edc4546d57fd267dafe519146828f66cfb1a2. Theorems.Thm_APFB06_twins_world; pullbacks v46; SHA-256 502a022edf2e51440714bea0666edc4546d57fd267dafe519146828f66cfb1a2