Setting: We look at a discrete memoryless channel which takes an input probability distribution acting over symbols in $\mathcal{X}$ to an output probability distribution over symbols in $\mathcal{Y}$.
To simplify notation, let the input symbols be labelled as $[1,2, ..., N]$ where $N = |\mathcal{X}|$ and the output symbols be labelled as $[1,2, ..., M]$ where $M = |\mathcal{Y}|$. The input probability vector of size $1\times N$ is denoted by $p$ and the output probability vector of size $1\times M$ is denoted by $q$. The stochastic matrix $Q$ of size $N\times M$ is the channel matrix i.e. $q = Qp$. The capacity of this channel is given by
$$C = \max_{p}\sum_{i=1}^N\sum_{j=1}^M p_iQ_{ij}\log\frac{Q_{ij}}{q_j}$$
Let the distribution that achieves $C$ be $p^*$.
Conjecture: If $p^*$ does not use the entire input alphabet in $X$ i.e. $p^*_i = 0$ for some component $i$, then it is guaranteed that there exists another distribution $\tilde{p}^* \neq p^*$ which also achieves the capacity of the channel.
Can anyone help prove this or show a counterexample?