Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Number of independent dimensionless combinations is n−rank⁡Dn-\operatorname{rank}Dn−rankD

Proved
VaryingConstants.finrank_dimensionlessExponents

by Lucas · Oct 2, 2026 · Mathlib 0df444a (Lean v4.33.1)

dimensional-analysisfundamental-constantslinear-algebramathematical-physics

Let D∈Rn×dD\in\mathbb R^{n\times d}D∈Rn×d be the dimension matrix of nnn constants with respect to ddd base units. The space of dimensionless exponent vectors

ZD={a∈Rn: ∑i=1naiDij=0  for all j}\mathcal Z_D=\Big\{a\in\mathbb R^n:\ \sum_{i=1}^n a_iD_{ij}=0\ \text{ for all } j\Big\}ZD​={a∈Rn: i=1∑n​ai​Dij​=0  for all j}

has dimension

dim⁡RZD  =  n−rank⁡D.\dim_{\mathbb R}\mathcal Z_D \;=\; n-\operatorname{rank}D .dimR​ZD​=n−rankD.

This is the dimension count of the Buckingham π\piπ theorem: from nnn constants whose dimensions span an rrr-dimensional space one can form exactly n−rn-rn−r independent dimensionless combinations (for c,G,ℏc,G,\hbarc,G,ℏ plus further constants in mechanical units, r=3r=3r=3).

Preamble
import Mathlib
import Definitions.Def_VaryingConstants_units
Formal statement
namespace VaryingConstants

theorem finrank_dimensionlessExponents {n d : ℕ} (D : Matrix (Fin n) (Fin d) ℝ) :
    Module.finrank ℝ (dimensionlessExponents D) = n - D.rank := by sorry

end VaryingConstants
Source
J.-P. Uzan, "Varying Constants, Gravitation and Cosmology", Living Rev. Relativity 14 (2011) 2, http://www.livingreviews.org/lrr-2011-2, §2.1.1, pp. 15–17 ("Natural units", "Fundamental parameters"): with three independent constants as units, all other constants become dimensionless; standard dimension count of the Buckingham π theorem (E. Buckingham, Phys. Rev. 4 (1914) 345, https://doi.org/10.1103/PhysRev.4.345).
Read-back

What the Lean code literally says, in plain math · Aristotle (Harmonic)

Non-blind read-back. This read-back was written by the same agent that drafted the Lean statement, at the explicit request of the proposal owner. It is not an independent, blind audit and must not be treated as independent testimony; the reviewer should compare the Lean code against the source directly.

For all natural numbers n,dn,dn,d and every real n×dn\times dn×d matrix DDD: the real vector space of all a∈Rna\in\mathbb R^na∈Rn with ∑iaiDij=0\sum_i a_iD_{ij}=0∑i​ai​Dij​=0 for every jjj has (finite) dimension equal to n−rank⁡(D)n-\operatorname{rank}(D)n−rank(D), where rank⁡\operatorname{rank}rank is the rank of DDD over R\mathbb RR and the subtraction is natural-number subtraction (it never truncates here since rank⁡D≤n\operatorname{rank}D\le nrankD≤n, but the statement itself uses truncated subtraction).

Human review
  • Endorsed by Shuze Chen · Oct 2, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Lucas · Oct 2, 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