| paper | d4-journals-geb-2001-0037 |
| authors | — |
| venue | ? |
| filed under | unclassified |
| judged by | gpt-6-luna / xhigh (triple__luna__xhigh__c6r1) |
| judge confidence | high |
| authors would recognise it | no |
Neither named theorem states a computational result, and the paper supplies no other named computational result to anchor a mirror. A population of decision makers would require a new collective aggregation question, which is not a continuous-population version of either theorem.
fails bit a — no named computational result to mirror
Theorem 1 and Theorem 2 are representation results; the paper contains no named computational results for a continuous-population mirror to cover.
I can’t make a defensible positive case under the anchor requirement. The paper has no named computational result: it states no algorithmic, complexity, or hardness theorem, and it does not compute with an encoding of an underlying problem.
The closest candidates are Theorem 1, proved in the paper, which characterizes when a preference relation on a finitely generated mixture set has a representation by a linear functional over a nonstandard model with qualitative utility comparison; and Theorem 2, also proved here, which extends that characterization to acts and represents subjective probabilities as standard numbers. These are representation theorems, not computational results, so I would not count them as anchors or invent prover questions for them.
The paper’s probabilities describe lotteries or states, and its nonstandard numbers describe utilities. Its central object is one decision maker’s preferences, not a population distribution over voter or agent types. A continuum of decision makers with a mass-weighted social objective could be constructed, but that would introduce an aggregation problem the paper does not study. The paper’s continuous-looking ingredients are therefore useful background, but they concern outcome and probability spaces, not continuization of the population.
There is no named computational anchor to defeat. The proponent correctly identifies Theorem 1 and Theorem 2 as the closest candidates, but both are representation theorems: they characterize individual preference relations that admit a particular utility representation. Neither states a complexity result or defines an algorithmic problem with an input and computational objective.
The paper’s probability measures describe lotteries and states, not a distribution of people. Its central object is one decision maker’s preference relation. A plausible rescue would put many decision makers into types, then ask for a collective preference or choice. But that requires choosing a social aggregator and studying its properties or computation—questions this paper does not pose. A finite-support population could make such a new project sensible; it would not turn either theorem into a population-continuization mirror.
So the negative case is strong for this programme’s target: there is no computational result here whose continuous-population version can be asked. Treating the paper’s lotteries or state probabilities as the continuum would continuize something other than the population. I cannot rule out a worthwhile research project about populations of Lehmann-style decision makers, but that would be an extension of the paper, not its continuous mirror.
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.