The fair-discrepancy propagation conjecture for fully balanced matrices
Let be a fully balanced matrix. For each row , let
be its average discrepancy. If, for a fixed , one has
for the relevant entries , then for all .
Fair-discrepancy propagation conjecture. If one fixed row has discrepancy less than , then every row has discrepancy less than .
The claim concerns propagation of a fair discrepancy from one row to all rows of a fully balanced matrix. The supplied text gives no resolution or additional context.
References
Primary source
Theophilus Agama and Gael Kibiti, “Balanced matrices”, arXiv:1810.07542 (2026).
Progress summary
A reader-submitted example appears to disprove the conjecture, but it has not been independently checked, so the general question remains open.
The statement is recorded as Conjecture 6.6 in Balanced matrices: fair discrepancy in one row of a fully balanced matrix should propagate to every row. No published proof or disproof was found.
Known results
- For positive fully balanced matrices of size , fair discrepancy along rows is equivalent to fair discrepancy along columns (Theorem 6.4).
- In the same setting, fair discrepancy in one row implies fair discrepancy in all rows (Proposition 6.5).
Community submission (unverified)
The August 22, 2026 submission argues that has equal row and column squared energies, while its first row has zero discrepancy and its second row violates the condition for ; scaling is claimed to extend this to every .
Current status (as of September 2026): The positive case is settled, while the general conjecture remains open and the submitted counterexample is unverified.
Sources
- arxiv.org
- arxiv.org
- quantamagazine.org
- quic.ulb.ac.be
- hal.science
- sciopen.com
- quantamagazine.org
- quantamagazine.org
- scientificamerican.com
- eventuallyalmosteverywhere.wordpress.com
- ar5iv.labs.arxiv.org
- arxiv.org
- arxiv.org
- arxiv.org
- mathstodon.xyz
- mathstodon.xyz
- mathstodon.xyz
- mathstodon.xyz
- quantamagazine.org
- community.openai.com
- quantamagazine.org
Solutions 1
CounterexampleThis solution needs a summarySee full solution
Counterexample to discrepancy propagation, even for strictly positive, exactly balanced matrices.
For a matrix , write
The conjecture asserts that, for a fully balanced matrix and a fixed , the inequalities
for one row imply the corresponding inequalities in every row. Consider the strictly positive integer matrix
Its row energies are
and its column energies are
Consequently, is simultaneously horizontally and vertically balanced with exact equality, which is stronger than the approximate balance required in the original definition. Set . The first row has mean
and therefore
However, the second row has mean
so its first entry satisfies
Thus the first row has fair discrepancy while the second does not, disproving the conjecture.
In fact, the obstruction persists for every prescribed tolerance: for any , choose and replace by . Every row and column then has squared energy ; the first-row deviations remain zero, whereas
If desired, taking also preserves the stronger entrywise condition . Hence neither exact energy balance nor strict positivity restores discrepancy propagation.
Source: T. Agama and G. Kibiti, Balanced matrices, arXiv:1810.07542v3, Definition 3.1, Conjecture 6.6, and Remark 6.7.