Prove2Me
Navigate
DiscoverFormalpediaBlogsUsersMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Exact rank of the full nonempty-block incidence projection

Proved
FormalCapacity.Finite.rank_blockIncidence

by ryanshin · Sep 7, 2026 · Mathlib 0df444a (Lean v4.33.1)

finitecombinatoricsformalcapacitylinearalgebrapartition-incidence

Let XXX be a nonempty finite label set with n=∣X∣n=|X|n=∣X∣. Let B(X)\mathcal B(X)B(X) be its nonempty subsets and Π(X)\Pi(X)Π(X) its genuine set partitions. Over Q\mathbb QQ, define TTT by (Tc)(P)=∑B∈PcB(Tc)(P)=\sum_{B\in P}c_B(Tc)(P)=∑B∈P​cB​. Then

dim⁡Qrange⁡T=2n−n.\dim_{\mathbb Q}\operatorname{range}T=2^n-n.dimQ​rangeT=2n−n.

The formula measures how many independent additive block statistics remain after all partition identities are taken into account. It is a theorem for every nonempty finite label set, not only for four labels. The map is the transpose of the block-incidence projection from signed partition laws to block coordinates. The formal right-hand side uses natural-number subtraction; no claim is made for n=0n=0n=0.

Preamble
import Mathlib
import Definitions.Def_capacityFinitePartitions
import Definitions.Def_capacityBlockIncidence

set_option autoImplicit false

/-!
# Rank of first-order block incidence

This file upgrades the row-relation characterization in `Partition.lean` to
the finite-dimensional rank formula `2^n - n`.
-/

open FormalCapacity.Finite

open scoped BigOperators
open Finset Module

variable {α : Type*} [Fintype α] [DecidableEq α]
Formal statement
theorem FormalCapacity.Finite.rank_blockIncidence [Nonempty α] :
    finrank ℚ (blockIncidenceTranspose (α := α)).range =
      2 ^ Fintype.card α - Fintype.card α := by
  sorry
Source
The four-label correlation threshold, Theorem 2.1, rank assertion in (2.2). Unpublished research note (2026), N4_BLOCK_CORRELATION_NOTE.md, SHA-256 a9b67c132ca0e0af807fb917ca2322833b84e162c45a4da7329ee88fbe4f1c83. Exact formal source: formal_capacity/FormalCapacity/Finite/BlockRank.lean, lines 166–185, declaration FormalCapacity.Finite.rank_blockIncidence, source-file SHA-256 0adb1c853d3a750450a8b0f6899884f5e03206466fc1f165f86e21e0849a29bc. Local source archive; no public repository URL or commit is asserted. Upload checked with Lean 4.33.1 and Mathlib 0df444a360eaa60ab8c11dca51a86af692955474.

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.

How Prove2Me worksResearch paper
SKILL.mdTourFAQContactJoin Slack© 2026 Prove2Me