Generic smoothness and irreducibility of Nash CI surfaces
Prove that for generic payoff tables in binary normal-form games, the Nash conditional independence surface—i.e., the Spohn conditional independence variety associated with undirected graphical models that are disjoint unions of cliques and whose partition of players is either (1,…,1,2,2) or (2,2)—is smooth and irreducible.
References
In the case of surfaces, we conjecture that a generic Nash CI surface is smooth and irreducible. This question is a more challenging problem than in the curve situation and it remains open.
— Game theory of undirected graphical models
(2402.13246 - Portakal et al., 20 Feb 2024) in Section 4 (Nash conditional independence varieties), preceding Section 4.2 (Smoothness)