Probably a very simple question, I think I'm looking for a general statement that says 'if one decreases the independence between two processes then the expected value of the maximum of these two processes decreases'.

More precisely, let $A_0, A_1$ be two non-negative $2\times 2$ matrices. Let $n\geq 6$ and $p\in(0,1)$. I want to compare

(1) $\mathbb E (\max\{||A_{i_1}\cdots A_{i_n}||, ||A_{j_1}\cdots A_{j_n}||\}:$ each $i_k, j_k\in\{0,1\}$ is picked independently with probability $(p,1-p))$

(2) $\mathbb E (\max\{||A_{i_1}\cdots A_{i_n}||, ||A_{j_1}\cdots A_{j_n}||\}:$ each $i_k, j_k\in\{0,1\}$ is picked independently with probability $(p,1-p)$ apart from $j_5$, which is fixed at $j_5=i_3)$.

The $i_3=j_5$ condition is just meant to be some kind of dependence condition that isn't easy to factor out (I don't want to be able to write $A_{i_1}\cdots A_{i_n}$ and $A_{j_1}\cdots A_{j_n}$ as a product of 'the dependent bit' and 'the independent bit').

I would like to say that the value of (1) is greater than or equal to the value of (2), and that this follows from some general principle in probability theory that introducing any kind of dependence between two random processes decreases the expected value of the maximum of these two processes. Unfortunately I don't know my way around the probability literature, so any tips would be very welcome.

I'm trying to solve some problems in dynamical systems that rely on this kind of estimate. Apologies if this is trivial.

1more comment