Conjecture on products of tilted stochastic matrices
Conjecture on products of tilted stochastic matrices
Let be a stochastic reversible matrix with stationary distribution , and let be strictly positive vectors. For each , define the -tilted matrix
Product conjecture. The product of the -tilted matrices
is reversible and has a stationary distribution that can be readily calculated using the vectors and .
The proposition established in the source proves the corresponding assertion for a product of two tilted matrices, including an explicit stationary distribution and positivity of the eigenvalues. The generalization to tilted matrices is conjectured but no formula or proof is supplied here.
Progress summary
The conjectured extension from two factors to any number has no verified proof or disproof in the retrieved literature.
The conjecture asserts that a product of arbitrarily many tilted versions of one reversible stochastic matrix remains reversible and has a computable stationary distribution. The source states this as Conjecture 1, without proving it or giving the general formula.
Known results
- One tilted matrix is reversible when is reversible.
- For two factors and , the product is reversible with stationary distribution .
- The two-factor product is similar to a positive-semidefinite matrix, hence has real positive eigenvalues.
- Arbitrary products satisfy a spectral estimate, but this does not imply reversibility.
Current status (as of August 2026): The one- and two-factor cases are established, while the conjecture for general products remains open with no verified proof, counterexample, or supplied stationary-distribution formula.
Sources
Sources & referencesView supporting material
Primary source
Assaf Hallak and Gal Dalal, “On the Products of Stochastic and Diagonal Matrices”, arXiv:2304.11634 (2023).
Solutions 1
Sign in to submit a solution.
A sharp counterexample to reversibility of products of tilted stochastic matrices
Problem: MathDB #358167, Conjecture 1 in Assaf Hallak and Gal Dalal, On the Products of Stochastic and Diagonal Matrices, arXiv:2304.11634, April 2023.
Conclusion: The conjecture is false for every product length at least three, even when the underlying stochastic matrix is symmetric, strictly positive, positive definite, and only three-dimensional. Both the number of factors and the dimension are minimal.
1. Source definitions and the established two-factor case
For a strictly positive vector and a row-stochastic matrix , write
where denotes the diagonal matrix with diagonal . Every row of sums to one.
A row-stochastic matrix with strictly positive stationary distribution is reversible when
The source proves in Proposition 3 that is reversible whenever is reversible. Its Proposition 5 further proves that
is reversible for any two strictly positive tilt vectors . Conjecture 1 asserts that reversibility persists for products of arbitrarily many such factors. We disprove precisely this proposed extension; neither of the established one-factor or two-factor results is contradicted.
2. A strictly positive three-state counterexample
Take
Every entry of is strictly positive, its rows sum to one, and . It is therefore reversible with respect to
In fact, its eigenvalues are , so it is also positive definite. The normalizing vectors are
Thus the two tilted matrices are
Apply Conjecture 1 to the three strictly positive tilt vectors . Their product is
If a strictly positive stochastic matrix is reversible, multiplying the three detailed-balance equations around a directed three-cycle gives Kolmogorov's necessary cycle identity
But the product in (5) satisfies
Therefore is not reversible. Its unique stationary distribution does exist and is
but detailed balance fails explicitly:
The obstruction is nonreversibility, not nonexistence or nonuniqueness of a stationary distribution.
3. Failure at every product length greater than two
The same fixed strictly positive matrices give counterexamples of every length. For , put
Set . An exact diagonalization of is
Define
Substitution of
into the cycle expression gives
where
For , direct substitution gives
exactly as required by the source's two-factor theorem.
Suppose now that , so . Then
Dividing (12) by and discarding its positive summands gives the uniform lower bound
Hence the cycle imbalance in (11) is strictly positive for every . The conjecture fails at every product length beyond the established two-factor threshold.
4. Sharpness in matrix dimension and extension to every larger dimension
Every strictly positive two-state stochastic matrix has the form
and is reversible with stationary distribution
Thus no counterexample exists in dimension one or two. By Propositions 3 and 5 of the source, no counterexample exists with one or two tilted factors in any dimension. The three-dimensional, three-factor example (3)–(7) is therefore minimal in both parameters.
For completeness, counterexamples also exist in every dimension and at every length . When , start with
At , the first three states of the product
have exactly the strictly positive cycle imbalance in (11). Now perturb to
where is the all-ones matrix. This matrix is symmetric, strictly positive, and stochastic. Every tilted entry and every cycle imbalance is continuous at , because all normalizing coordinates are strictly positive there. Therefore, for all sufficiently small positive rational , the same three-state cycle remains unbalanced.
Consequently, within the class of strictly positive reversible stochastic matrices, the universal reversibility assertion holds precisely when either the matrix dimension is at most two or the number of tilted factors is at most two. It fails for every pair of parameters
This resolves the conjecture negatively while preserving, and sharply delimiting, the source's established one-factor and two-factor results.