If I understand correctly, $\chi(H^\partial)$ is the least number of colours which suffice to colour the edges of $H$ so that each vertex is incident with edges of at least two different colours. And it seems to me that $H$ is isomorphic to $(H^\partial)^\partial$ provided that, for any vertices $x,y\in V(H)$, there is an edge $e\in E(H)$ such that $|e\cap\{x,y\}|=1$. I believe the answer is affirmative for all $\kappa,\lambda\ge2$. Each of the example hypergraphs is either an ordinary graph, or the dual of a graph, or the disjoint union of a graph and the dual of a graph.
If $\kappa\ge4$ and $\lambda=2$, let $H=K_\kappa$ (the complete graph of order $\kappa$).
If $\kappa=2$ and $\lambda\ge4$, let $H=K_\lambda^\partial$.
If $\kappa\ge4$ and $\lambda\ge4$, let $H=K_\kappa\cup K_\lambda^\partial$ (disjoint union).
If $\kappa=2$ and $\lambda=2$, let $H=C_4$.
If $\kappa=3$ and $\lambda=3$, let $H=K_3$.
If $\kappa=3$ and $\lambda=2$, let $H=K_4-e$.
If $\kappa=2$ and $\lambda=3$, let $H=(K_4-e)^\partial$.
If $\kappa\ge4$ and $\lambda=3$, let $H=K_\kappa\cup K_3$.
If $\kappa=3$ and $\lambda\ge4$, let $H=K_3\cup K_\lambda^\partial$.
(Working in ZFC.)
$\omega_2$ is not Fraissean. In fact, it is not Fraissean with respect to $\Sigma$, where $\Sigma$ is the signature with a single binary relation $<$.
To see this we use a variant of the argument you linked in the question. Suppose otherwise, and let $\Sigma'$ and $\eta$ witness this. Let $\gamma$ be a large enough ordinal and let $\pi:M\to V_\eta$ be elementary, with $M$ transitive and $M^{\omega_1}\subseteq M$ and $\mathrm{crit}(\pi)=\kappa$ exists. Let $\mathfrak{A}=(\kappa,{{\in}\upharpoonright\kappa})$ and $\mathfrak{B}=(\pi(\kappa),{{\in}\upharpoonright\pi(\kappa)})$.
Since $M^{\omega_1}\subseteq M$, $M$ is correct about $\mathcal{L}_{\omega_2,\omega}$-truth, and also by elementarity of $\pi$, therefore $\mathfrak{A}\equiv_{\mathcal{L}_{\omega_2,\omega}}\mathfrak{B}$. So let $\mathfrak{M}$ witness the choice of $\Sigma',\eta$ with respect to $\mathfrak{A},\mathfrak{B}$.
Let $G$ be $V$-generic for $\mathbb{P}=\mathrm{Coll}(\omega_1,\theta)$ where $\theta=\max(\pi(\kappa),\mathrm{card}(\mathfrak{M}))$ (collapsing $\theta$ to size $\aleph_1$ with countable conditions). Then $V[G]\models$"There are structures $\mathfrak{A}',\mathfrak{B}',\mathfrak{M}'$, each having universe $\omega_1$, such that $\mathfrak{A}',\mathfrak{B}'$ are in signature $\Sigma$, and $\mathfrak{M}'$ in signature $\Sigma'$, and $A^{\mathfrak{M}}\upharpoonright\Sigma\approx\mathfrak{A}'$ and $B^{\mathfrak{M}}\upharpoonright\Sigma\approx\mathfrak{B}'$, as witnessed by isomorphisms $\sigma,\tau$, and $\mathfrak{M}'\models\eta$ and there is a sentence $\varphi$ of $\mathcal{L}_{\omega_2^{V[G]},\omega}$, coded by a set $X\subseteq\omega_1$, such that $\mathfrak{A}'\models\varphi$ but $\mathfrak{B}'\models\neg\varphi$" (consider the natural sentence specifying the ordertype of $\kappa$). Fix names $\dot{\mathfrak{A}}',\dot{\mathfrak{B}}',\dot{\mathfrak{M}}',\dot{\sigma},\dot{\tau},\dot{X}$ for such objects (we may assume the empty condition forces the above things to hold for these names). So these are all basically names for subsets of $\omega_1$.
Now working in $V$, given an $\aleph_1$-sized family $\mathscr{F}$ of dense subsets $D\subseteq\mathbb{P}$, we can build an $\mathscr{F}$-generic filter $G$, because $\mathbb{P}$ is countably closed. We claim that by picking $\mathscr{F}$ appropriately, and $G$ be $\mathscr{F}$-generic, then letting $\mathfrak{A}'$, etc, be the interpretations $\dot{\mathfrak{A}}'_G$, and $\varphi$ the sentence in $\mathcal{L}_{\omega_2,\omega}$ the sentence coded by $X'$, then the sentence of the previous paragraph which held in the generic extension, holds in $V$ about these objects, which contradicts our assumptions.
To arrange $\mathscr{F}$: First, it is straightforward to arrange $\aleph_1$-many dense sets which arrange that $\dot{\sigma}_G$ and $\dot{\tau}_G$ will truly be isomorphisms; the main thing is to arrange the that the domain and codomain are the right sets. To arrange that $\mathfrak{M}'\models\eta$, consider not just $\eta$, but the set $S$ of all subformulas thereof.
Now here that all formulas in $S$ have only finitely many distinct free variables (if $\psi$ has infinitely many distinct free variables, proceed by induction on the rank of formulas which have it as a subformula, to see that none of them are sentences).
Since $\eta$ is in $\mathcal{H}_{\omega_2}$, we can fix a surjection $\pi:\omega_1\to S^+$, where $S^+$ is the set of pairs $(\psi,\vec{\alpha})$, where $\psi\in S$ and $\vec{\alpha}$ is an assignment of the (finitely many) free variables of $\psi$ to ordinals ${<\omega_1}$.
Now the basic point is that if $(\psi,\vec{\alpha})\in S^+$ and $\psi$ is a disjunction $\bigvee_{\gamma<\omega_1}\psi_\gamma$, and $p\in\mathbb{P}$ forces $\dot{\mathfrak{M}}'\models\psi(\vec{\alpha})$, then for each $q\leq p$ we can
pick some $\gamma<\omega_1$ and $r\leq p$ such that $r$ forces that $\dot{\mathfrak{M}}'\models\psi_\gamma(\vec{\alpha})$. Thus, we can include a dense set $D_{\psi,\vec{\alpha}}$ consisting of those conditions $p$ such that either $p$ forces that $\dot{\mathfrak{M}}'\models\neg\psi(\vec{\alpha})$ or there is $\gamma<\omega_1$ such that $p$ forces that $\dot{\mathfrak{M}}'\models\psi_\gamma(\vec{\alpha})$. Similarly, if $\psi$ is of form $\exists x\varrho$, then we can include the dense set of conditions $p$ either forcing that $\dot{\mathfrak{M}}'\models\neg\psi(\vec{\alpha})$, or such that there is $\alpha<\omega_1$ such that $p$ forces $\dot{\mathfrak{M}}'\models\varrho(\alpha,\vec{\alpha})$. And naturally, for each $(\psi,\vec{\alpha})\in S^+$, we include the dense set of $p$ deciding whether $\dot{\mathfrak{M}}'\models\psi(\vec{\alpha})$. There are also natural dense sets forcing the atomic formulas the correspond to the structure of $\dot{\mathfrak{M}}'$.
For $X'$ and $\varphi'$ it is similar, but we no longer have
$\varphi$ fixed in advance. But we can fix a name $\dot{S}_{\dot{\varphi}}^+$ for the set of all pairs $(\psi,\vec{\alpha})$ such that $\psi$ is a subformula of $\varphi$ (note in an actual forcing extension, we could have $\psi\notin V$), and $\vec{\alpha}$ an assignment of the free variables of $\psi$ to elements ${\in\omega_1}$. Fix a name for a surjection $\dot{f}:\omega_1\to \dot{S}^+_{\dot{\varphi}}$. Write $\dot{\psi}_\gamma$ for the name for the first component of $\dot{f}(\gamma)$, and $\vec{\alpha}_\gamma$ for the name for the second. Then for each $\gamma<\omega_1$, we can use the dense set deciding what sort of formula $\dot{\psi}_\gamma$ is (in particular, whether it is a disjunction, and whether it is existential), and the dense set of all conditions $p$ such that (i) there is $\vec{\alpha}$ such that $p$ forces "$\dot{\vec{\alpha}}_\gamma=\vec{\alpha}$", (ii) for some $\beta<\omega_1$, either
- $p$ forces that $\dot{\psi}_\gamma$ is not a disjunction, or
- $p$ forces that $\dot{\mathfrak{A}}'\models\neg{\dot{\psi}}_\gamma(\vec{\alpha})$, or
- $p$ forces "$\dot{\psi}_\gamma$ is a disjunction,
$\dot{\psi}_\beta$ is one of the disjuncts of $\dot{\psi}_\gamma$, $\dot{\vec{\alpha}}_\beta=\vec{\alpha}$ and $\dot{\mathfrak{A}}'\models\dot{\psi}_\beta(\vec{\alpha})$",
and (iii) there are $\alpha,\beta<\omega_1$ such that either
- $p$ forces that $\dot{\psi}_\gamma$ is not existential, or
- $p$ forces that $\dot{\mathfrak{A}}'\models\neg\dot{\psi}_\gamma$, or
- $p$ forces "letting $\varrho=\dot{\psi}_\beta$, then $\dot{\psi}_\gamma$ is the formula $\exists x\ \varrho$, and
$\vec{\alpha}_\beta=\vec{\alpha}\frown(\alpha)$,
and $\dot{\mathfrak{A}}'\models\varrho(\vec{\alpha},\alpha)$".
Also include dense sets deciding whether $\dot{\mathfrak{A}}'\models\dot{\psi}_\gamma(\dot{\vec{\alpha}}_\gamma)$ holds, for each $\gamma$.
Likewise for $\dot{\mathfrak{B}}'$.
Also for each pair of ordinals $\alpha,\beta<\omega_1$, include the dense set of conditions $p$ such that either
- $p$ forces that $\dot{\psi}_\alpha$ is not a
disjunction/conjunction, or
- $p$ forces that $\dot{\psi}_\alpha$ is a disjunction/conjunction,
and $\dot{\psi}_\beta$ is one of the disjuncts/conjuncts, or
- $p$ forces that $\dot{\psi}_\alpha$ is a disjunction/conjunction,
and $\dot{\psi}_\beta$ is not one of the disjuncts/conjuncts.
Also for each $\alpha<\omega_1$, the dense set of conditions deciding the number (finitely many) of free variables of $\dot{\psi}_\alpha$,
and arranging that $\dot{f}_G$ truly enumerates all of the relevant pairs $(\psi,\vec{\alpha})$.
(I think this is now about enough dense sets.)
Now let $G$ be $\mathscr{F}$-generic. Let $X'=\dot{X}'_G$, etc. It is straightforward to see that $\mathfrak{M}'\models\eta$ and $\mathfrak{A}'\approx A^{\mathfrak{M}'}\upharpoonright\Sigma$ (as witnessed by $\sigma'$) and likewise for $\mathfrak{B}'$. So by our assumptions, $\mathfrak{A}'\equiv_{\mathcal{L}_{\omega_2,\omega}}\mathfrak{B}'$. But $X'$ does really code a sentence $\varphi'$ of $\mathcal{L}_{\omega_2,\omega}$, because the ordertype along which it is built is wellfounded, because by the $\sigma$-closure of $\mathbb{P}$, otherwise we can find a condition $p$ which forces something to be an illfounded ordinal. And $\dot{S}^+{\dot{\varphi}}_G$ is the set of pairs $(\psi,\vec{\alpha})$ such that $\psi$ is a subformula of $\varphi'$, and $\vec{\alpha}$ an assignment of its free variables, and this set is enumerated by $\dot{f}_G$. And note that the names for the satisfaction relations amongst these formulas evaluate to the correct satisfaction relation. Thus, $\mathfrak{A}'\models\varphi'$ but $\mathfrak{B}'\models\neg\varphi'$, a contradiction.
Best Answer
The answer is no, the statement that for every set $X$ we have $$X\not\to(\omega)^\omega_2$$ does not imply the axiom of choice.
This was shown by Kleinberg and Seiferas in 1973, see
For $\kappa$ a (well-ordered) infinite cardinal, $\kappa$-well-ordered choice, $\mathsf{AC}_\kappa$, is the statement that every $\kappa$-sequence of nonempty sets admits a choice function.
The axiom of well-ordered choice $\mathsf{WOC}$ is the statement that $\mathsf{AC}_\kappa$ holds for all infinite well-ordered $\kappa$.
This statement is strictly weaker than the axiom of choice: it does not imply that $\mathbb R$ is well-orderable, and even if we add this assumption, the result is still weaker than choice. See for instance theorem 5.1 in
However, as shown in the paper by Kleinberg and Seiferas, $\mathsf{WOC}$ plus the existence of a well-ordering of $[\omega]^\omega$ rules out all infinite exponent partition relations. It is still open (as far as I know) whether $\mathsf{WOC}$ suffices for this result. What Kleinberg and Seiferas show is that, under $\mathsf{WOC}$, either all infinite exponent partition relations fail, or else $\omega\to(\omega)^\omega_2$. (And the latter fails if $[\omega]^\omega$ is well-orderable.)