Here is a modelling situation that considers the fact that the players had to play and win. There are three steps in the given history, so we model by a tree with three steps. The solution uses the "symmetries" of the modelling space. (Given by the action of some permutation group.)
I will denote the (total) set of the players by $T\{\ 1,2,3,4,5,6,7,8,9\ \}$, and my $1$ is the winner $P_4$, my $2$ is the player $P_2$ from the OP.
- At the first step we are taking a random partition of the $9$ players in $3$ ordered groups, there are
$$
\binom 9{3\ 3\ 3}
=\frac{9!}{3!\; 3!\; 3!}
=1680
$$
chances for this. Let $(S_1,S_2,S_3)$ be this partition, $S_1,S_2,S_3$ being sets with three elements and $T=S_1\sqcup S_2\sqcup S_3$.
- At the second step we are picking a random element (the winner) from each of these sets, $w_1\in S_1$, $w_2\in S_2$, $w_3\in S_3$, getting the set $S=\{w_1,w_2,w_3\}$.
- At the final step we pick a winner $w\in S$, i.e. $w$ is among $w_1,w_2,w_3$.
So the modelling probability space $\Omega$ is the space of all data $\omega$ of the shape
$$
\omega = (\ (S_1,S_2,S_3)\ ,\ S=(w_1,w_2,w_3)\ ,\ w\ )
$$
with the above properties.
(So $\Omega$ has $\binom 9{3\ 3\ 3}\cdot 3^3\cdot 3$ elements.)
Each element is equally probable.
We restrict to the subspace $\Omega_1$ where $w=1$ is the winner.
So far we have covered only the modelling part, things have been fixed in a precise way. Now we let some group of permutations act on the space $\Omega_1$. Instead of taking the whole group of permutations fixing the winner $1$ let us consider the small group with eight elements of cyclic permuations of $2,3,4,5,6,7,8,9$, taken in this order.
Then for each $\omega\in\Omega_1$, in the "orbit" of all states obtained from $\omega$ by applying one by one these eight permutations...
- there are exactly two where $2$ belongs to the initial group ($S_1$ or $S_2$ or $S_3$,) where the non-permuted $1$ lives in, and occupies one of the three places,
- there are exactly two where $2$ belongs to the final group $S$ where the non-permuted $1$ lives in, and occupies one of the three places,
- and exactly four where $2$ belongs to either the initial group or the final group of the winner $w=1$, since the initial group of the winner and $S$ have only $1$ in common.
The OP is unclear about the needed probability, so let us make clear statements. The conditional probability, conditioned by $\Omega_1$ (i.e. $w=1$ is the winner)...
- that $1,2$ are in the same initial group is $\frac 28=\frac 14$,
- that $1,2$ are in the same final group is $\frac 28=\frac 14$,
- that $1,2$ are in the same either initial or final group is $\frac 48=\frac 12$.