the claim is that $k[[x,y,z]]$ can inject into $k[[u,v]]$ via :"Take a map from $k[[x,y,z]]$ to $k[[u,v]]$ that sends $x$ to $u$, $y$ to $uv$ and $z$ to $uf(v)$ for some $f\in k[[v]]$ and think about what the kernel is. It isn't hard to see that only for countably many choices of ff can it possibly be zero."
@Semiclassical actually it's easy, in the end you just have to show (by your method) that the trace of $(AB^{-1}A+A)^{-1}$ is positive. which is easy since $AB^{-1}A$ is positive definite since it is symmetric
For positive definite matrices $A$ and $B$, it is a fact that det$(A+B)\ge \text{det}(A)+\text{det}(B)$. Does anyone know if it is possible to have the reverse inequality, if one introduces coefficients (perhaps involving the dimensionality) in front of $\det(B)$ or $\det(A)$?
If one takes an outer product of two vectors, we can think of it as creating a set of all the products of an entry from the first vector times an entry of the second vector (with 1 redundant entry per product). Is there something which generalizes this to all triple products of two vectors?
Ok, Razieh. I will upvote your answer because I think you are probably right. I have to read it carefully but I trust you. However, if you want it to be generally understood you should use the standard notation. It's an interesting theorem, but I'm not sure I get the proof
@Aksakal This does not address the point, which is that even if that is true this analysis needs to account for the likely fact that even controlling for treatment-by-IT female preferences may be different from male preferences, on average.