Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Nonzero repeatable marks have unit diagonal pair numbers

Proved
APFPaper5.K1.pairTable_diag_one

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

apfapf-referencesib-v15-2026-11

Let pᵢ lie in a ring with real algebra structure. Assume hp0: each pᵢ is nonzero; hidem: each is repeatable, pᵢ²=pᵢ; and h: the both-order pair relations pᵢpⱼpᵢ=cᵢⱼpᵢ hold. Then cᵢᵢ=1 for every i. This declaration establishes only the diagonal normalization from the stated algebraic data. It does not supply nonzero repeatable physical marks, identify these numbers with costs or frequencies, or place off-diagonal entries in the unit interval.

Preamble
import Definitions.Def_APFPaper5_K1_PairNumbers
import Theorems.Thm_APFPaper5_K1_tableForm_symm
import Theorems.Thm_APFPaper5_K1_roleExchange_respects_null
import Theorems.Thm_APFPaper5_K1_interchangeable_posDef
import Theorems.Thm_APFPaper1_RecordBook_pair_number_symm
import Theorems.Thm_APFPaper1_RecordBook_pair_table_symm
import Theorems.Thm_APFPaper1_RecordBook_pair_number_self

set_option autoImplicit false
namespace APFPaper5.K1
end APFPaper5.K1
open APFPaper5.K1
universe u uA
variable {ι : Type u} [Fintype ι] {A : Type uA} [Ring A] [Algebra ℝ A]
Formal statement
omit [Fintype ι] in
theorem APFPaper5.K1.pairTable_diag_one (p : ι → A) (c : ι → ι → ℝ) (hp0 : ∀ i, p i ≠ 0)
    (hidem : ∀ i, p i * p i = p i) (h : PairNumbers p c) : ∀ i, c i i = 1 := by sorry
Source
Sib v15 frozen source: Theorems/Thm_APFPaper5_K1_pair_table_symm.lean:36; Artifacts_2026-11-12_session/claude/EthanBrooke-01WrrBvu/RULING_symmetry_retired_2026-11-12.md, ruling and not settled; Papers/Paper 05 - Quantum Structure - Hilbert Space and Born Rule/Paper_5_Quantum_Structure_Hilbert_Born_Supplement_v7.33.tex, 312-350;476-512
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