I have a question about generating a certain set of symmetric polynomials. I believe that what I'm looking for is known result, but I'm not 100% sure.

Suppose that I have two sets of indeterminates $X_1,\ldots,X_n$ and $Y_1, \ldots, Y_n$, of the same (finite) cardinality. Now let $e_i(A,B,C,\ldots)$ denote the $i$th elementary symmetric polynomial on $A,B,C,\ldots$ and define, $$ A_i = e_i(X_1,\ldots,X_n) + e_i(Y_1,\ldots,Y_n)$$

Now define the following:

- $$ B_{i} = X_i + Y_i $$
- $$ C_{i} = \left(\prod_{j\neq i} X_j\right) + \left(\prod_{j\neq i} Y_j \right) $$

Note that $\sum_{i=1}^n B_i = A_1, \sum_{i=1}^n C_i = A_{n-1}$.

I was wondering the following:

If I am given $B_i, C_i, \forall i$ and $A_n$, can I construct $A_i$ for all $i \in\{2,\ldots,n-2\}$?

I'm not sure if it is possible, but I think we should be able to construct a basis for the symmetric polynomials with the $B_i, C_i$ and $A_n$, and as such we should be able to get $A_i, \forall i$. I must admit, I don't have much experience with these type of problems, so I might be barking up the wrong tree.

Thanks!