| paper | d4-journals-mss-2024-0019 |
| authors | — |
| venue | ? |
| filed under | unclassified |
| judged by | gpt-6-luna / xhigh (triple__luna__xhigh__c6r1) |
| judge confidence | high |
| authors would recognise it | unclear |
Theorem 30 and Corollary 31 classify neutrality-group realizability, while Proposition 45 connects anonymity with Boolean-function representability; none asserts an algorithm, complexity bound, or hardness result. The proposed distributional question is precise, but the uniform society is fixed by every alternative relabeling while no strict ranking is, so it cannot realize a nontrivial neutrality group. Bit (a) therefore fails.
fails bit a — no named computational result to mirror
The proposed question follows the neutrality-group realizability theme of Theorem 30 and Corollary 31; it does not cover the anonymity and symmetry results or the Boolean-representability results, and it supplies no computational anchor.
The strongest possible lead is Theorem 30, proved in this paper: for every voting pair \((h,n)\), every subgroup \(\{\mathrm{id}\}\times W\), with \(W\le S_n\), is the neutrality group of some social preference function. Thus every voting pair is fully neutral (Corollary 31, also proved here). This is a useful structural existence result. Its statement makes no running-time or hardness claim, though, so it is not a qualifying computational anchor under the requested standard. Proposition 45’s link to Boolean-function representability is another nearby result, but it also does not classify a computational problem’s complexity.
The most charitable continuous mirror I can formulate is Continuous Neutrality Realizability. Let the voter types be rankings \(T=S_n\). A society is a distribution \(\mu\) over \(T\), with \(\mu_r\) the fraction holding ranking \(r\). Assume many voters share each type—for example, a large population with support size \(\tau\le n!\). A deterministic social preference function is then \(F:\Delta(T)\to S_n\). For \(\psi\in S_n\), let \((\psi\cdot\mu)_r=\mu_{\psi^{-1}r}\), and define \(N(F)=\{\psi\in S_n:\ F(\psi\cdot\mu)=\psi F(\mu)\text{ for every }\mu\}\). Given \(n\) and \(W\le S_n\), ask whether there exists such an \(F\) with \(N(F)=W\); a solution is the function \(F\). This mirrors Theorem 30’s realizability question, but it has no optimization objective because the paper’s problem is one of existence.
On the full simplex this mirror collapses. The uniform distribution is fixed by every alternative permutation. Since left multiplication moves every ranking, no ranking is fixed by any nonidentity \(\psi\). Therefore a deterministic \(F\) on all of \(\Delta(T)\) cannot satisfy the neutrality condition for any nonidentity \(\psi\): its exact neutrality group must be trivial. The continuous realizability question is consequently easy for a fixed-point reason, while Theorem 30 realizes every \(W\) on finite profiles. Restricting the domain to avoid symmetric distributions would change the question the authors studied.
That is also the weakness of the positive case: the plausible population regime—many people distributed over a relatively small set of rankings—turns anonymity into invariance under relabeling people, while the paper’s central question concerns which such invariance groups an aggregation function can have across its whole domain. Its results are structural and representability results, not computational questions about acting on a continuous society. I would offer the mirror above as a boundary observation, not as a continuous computational problem anchored by this paper.
The paper gives no named computational result to mirror. Theorem 30 classifies which neutrality groups can occur; Proposition 45 and Corollary 53 relate anonymity groups to Boolean-function representability. None analyzes the running time or complexity of an algorithm on a society. One could encode \((h,n,U)\) and ask a group-recognition question, but that input is a proposed symmetry group, not a population distribution. Such a question would need a new computational formulation before it could anchor a ChoCo mirror.
Theorem 30 is still the proponent’s strongest candidate, and its proposed continuous version exposes a deeper mismatch. A continuous society \(\mu\) forgets the ordering and names of voters in a profile. At the uniform distribution over rankings, every alternative permutation fixes \(\mu\). But no nonidentity alternative permutation fixes a strict ranking. So an equivariant deterministic function \(F:\Delta(S_n)\to S_n\) cannot have any nontrivial neutrality group. The issue is not merely that the resulting answer is simple: passing from labeled profiles to distributions creates a fixed society that was absent from the paper’s profile action, and thereby erases the variation Theorem 30 classifies.
The obvious repairs change the object again. Keeping individual labels in a continuum makes them invisible to changes on sets of measure zero; encoding labels as types removes the repeated-agent structure that makes this a high-multiplicity model. Restricting the domain to exclude symmetric societies changes the global realizability question, while allowing sets or lotteries as outputs changes the social preference function. And an algorithmic version would need a representation for an arbitrary function on an uncountable domain, which the paper supplies no reason to prefer.
Proposition 45 has the same problem. It is a representability result, not a complexity result. For two alternatives, a society distribution reduces to a single fraction in \([0,1]\). Permuting voter names leaves that fraction unchanged, so this input cannot retain the paper’s distinctions among subgroups of \(S_h\). Continuing the voter coordinates themselves would preserve those distinctions, but would continuize the profile representation rather than the population.
That is a strong case against this paper as a computational continuization target. The universal claim that no scenario could produce worthwhile work is harder to defend: a support-restricted or set-valued continuous aggregation problem might be mathematically interesting. I cannot show that no such new problem deserves attention. It would, however, need its own motivation and computational formulation; the results in this paper do not supply them.
The adversarial triple: the proponent anchors on up to three named results; the opponent sees that case and must defeat every anchor; the judge decides which case convinced it. These are the pipeline’s own outputs, generated by tools/triple_run.py — no human edited them. The paper’s own text is not reproduced here beyond the quoted statement above.