| paper | d4-journals-mss-2006-0031 |
| authors | — |
| venue | ? |
| filed under | unclassified |
| judged by | gpt-6-luna / xhigh (triple__luna__xhigh__c6r1) |
| judge confidence | high |
| authors would recognise it | no |
Theorem 1, Theorem 2, and Corollary 1 characterize existence and maximality through structural continuity conditions; none gives a construction or complexity claim. The proposed majority-mass problem adds an aggregation rule and is explicitly not anchored in the paper, so it cannot supply the missing computational result.
fails bit a — no named computational result to mirror
No results are covered: Theorem 1, Theorem 2, and Corollaries 1–2 are existence characterizations, while the majority-ranking proposal is not a result of the paper.
This paper has no named computational result of the kind the programme requires as an anchor. Theorem 1, proved here, says that under Non-emptiness, \(k\)-Finitariness, and the \(k\)-weak Chernoff condition, \(C(X)\) is nonempty if and only if \(C\) satisfies NB\(k\)TC. Theorem 2, also proved here, gives the analogous equivalence under Non-emptiness, Finitariness, and the weak Chernoff condition, using NBTC. Corollary 1 states the acyclic-relation characterization of maximal-element existence via TALC; the paper deduces it from its theorem, while crediting the original result to Rodríguez-Palmero and García-Lapresta. These are existence characterizations, not claims about computational complexity.
The most plausible population-based lead would be a new problem adjacent to the paper’s binary maximality section. Take a finite set of candidates \(A\), and a list of ranking types \(T\) with rational masses \(\mu_t\) summing to \(1\). Define \(aP_\mu b\) when more than half the mass ranks \(a\) above \(b\). Ask for an alternative \(a\) such that no \(b\) satisfies \(bP_\mu a\), or report that none exists. Here a type is a complete ranking, mass is population share, and the scenario is a large electorate with many repeated ballots and relatively small support.
That is a sensible continuous-population maximality question, and its finite input representation makes it easy to hand to an algorithm designer. But it is not an anchor from this paper: the majority aggregation model is added, and in the finite-candidate version pairwise masses can simply be computed and the resulting graph scanned. The paper’s Corollary 1 concerns acyclic relations on compact spaces and characterizes maximality through transfer continuity; it does not analyze this population input or give a complexity result for it. Restricting the candidate problem to acyclic majority relations would make the connection closer, but would also make existence immediate.
So the positive case is limited: the paper’s subject of maximal elements can be instantiated over a high-multiplicity electorate, and the authors would recognize the maximality concept. The weakness is decisive for the requested assessment: this mirror does not preserve the paper’s transfer-continuity characterization as a computational problem. Under the stated anchor rule, there is no per-anchor continuous problem to propose.
The strongest case against a mirror is that the paper supplies no computational result to mirror. Theorems 1 and 2 characterize when an abstract choice correspondence has a nonempty choice on \(X\); Corollary 1 recovers an earlier characterization for acyclic relations. None studies an encoded computational problem, an algorithm, or complexity. The paper also gives no finite input model for the choice correspondence or the topology. Transfer continuity is a condition on neighborhoods in the space of alternatives.
That leaves a basic mismatch with population continuization. Treating \(X\) as a continuum makes the alternatives continuous, which is outside the programme’s scope. Adding people instead requires a new social object. If everyone has the same complete choice type, the population mass does not affect \(C(X)\), and the theorem is simply applied once. If people have different types, their distribution alone does not define a society-wide choice correspondence; one must add an aggregation rule.
The majority-ranking proposal is a coherent continuous-population question, and maximality is a concept the paper studies. Its stronger version—distributing mass over voter types, forming a pairwise-majority relation, and asking whether that relation has a maximal alternative—still adds the central modeling step. The paper neither defines this aggregation nor characterizes the resulting relation. One could instead aggregate non-binary choice functions, but that too requires choosing a new rule. These may be worthwhile projects on their own; they do not preserve a computational question or result from this paper. Whether the resulting problem is easy is not a reason against it.
So the negative case is strong at the anchor level: no paper result anchors a continuous computational mirror, and a genuine population model requires importing an aggregation problem the paper does not study. It is not a proof that no related population question could ever be worthwhile. The majority model is a plausible neighboring project; the case against calling it this paper’s mirror rests on that missing connection.
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.