Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Private distinctions make the shared-count form faithful

Proved
APFPaper5.K1.sharedTable_satisfies_K1

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

apfapf-referencesib-v15-2026-11

Supply finitely many finite families of a finite distinction type. Assume hprivate: each listed family contains a distinction that occurs in no other listed family. The shared-count table then defines a real-bilinear coefficient form whose diagonal is nonnegative and vanishes only at zero, with identity role exchange. This is a model-level realization of the displayed bilinearity and faithful-diagonal predicates. It does not construct a physical completed score or establish the remaining meaning and correspondence requirements of physical K1.

Preamble
import Definitions.Def_APFPaper5_K1_SharedCount
import Theorems.Thm_APFPaper5_K1_atomTable_symm
import Theorems.Thm_APFPaper5_K1_atomTable_form
import Theorems.Thm_APFPaper5_K1_atomTable_nonneg
import Theorems.Thm_APFPaper5_K1_record_book_table_satisfies_K1

set_option autoImplicit false
namespace APFPaper5.K1
end APFPaper5.K1
open APFPaper5.K1
universe u v
variable {ι : Type u} [Fintype ι] {D : Type v} [Fintype D] [DecidableEq D]
Formal statement
theorem APFPaper5.K1.sharedTable_satisfies_K1 [DecidableEq ι] (fam : ι → Finset D)
    (hprivate : ∀ i, ∃ d : D, ∀ j, decide (d ∈ fam j) = decide (j = i)) :
    IsBilinear (VP := ι → ℝ) (VE := ι → ℝ) (tableForm (sharedTable fam)) ∧
      FaithfulNonnegDiagonal (tableForm (sharedTable fam)) (LinearEquiv.refl ℝ (ι → ℝ)) := by sorry
Source
Sib v15 frozen source: Theorems/Thm_APFPaper5_K1_shared_count.lean:33; Artifacts_2026-11-12_session/claude/EthanBrooke-01WrrBvu/RULING_two_adoptions_2026-11-12.md, 1; Papers/Paper 01 - The Enforceability of Distinction/Paper_1_Enforceability_of_Distinction_Supplement_v9.28.tex, 3721-3749
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