{"id":"4216d4d0-4f26-4260-9f80-f97d0ac370f5","arxiv_id":"1908.03911","paper_version":2,"verdict":"REJECT","confidence":"HIGH","novelty_score":3.0,"correctness_risk":"high","formal_verification":"none","parameter_count":0,"one_line_summary":"The stated decomposition theorem for set-valued mappings is false, as a two-element counterexample shows.","lead":"This paper claims that every set-valued map with bounded fibers can be decomposed into fewer than κ bijective selectors, with an application to coarse spaces. The central theorem is false: a two-element example satisfies every hypothesis yet admits no covering family of bijections.","discovery_kind":"extension","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Theorem 1 is false: the transposition construction is not selector-preserving; the simple two-element example F(a)={a,b}, F(b)={b} satisfies the hypotheses but violates the conclusion.","rationale":"The reader's REJECT verdict is correct. The load-bearing assumption in the proof of Theorem 1 is that the global transpositions act as selectors on every point of X. That assumption is not a consequence of the stated hypotheses, and it fails in the two-element example. The issue is not a gap in an otherwise valid theorem; it is a false theorem. The proof's graph-coloring step only ensures that F-sets within one color class are disjoint, but it does not prevent transpositions from moving points that belong to F-sets of other color classes, nor does it ensure that swapping y_alpha and y_alpha_j keeps y_alpha in F(y_alpha_j). Since the theorem's conclusion is directly contradicted by a simple finite example, no amount of repair short of adding a strong disjointness or heredity assumption can save the statement as written. Theorem 2, which invokes Theorem 1, is therefore not established; Theorem 3 has a separate construction and is not directly affected by this particular counterexample, though its dependence on the broader framework remains. The stress-test pass agrees with the reader's weakest_assumption and sees no reason to soften the verdict.","tokens_in":3370,"tokens_out":2920,"duration_ms":32703,"concrete_test":"Run the proof's construction on the two-element space X={a,b}, F(a)={a,b}, F(b)={b}, kappa=omega. The graph has one crossing pair, so F(a) and F(b) receive distinct colors. In the color class containing F(a), enumerate F(a)={y_0=a, y_1=b}; for j=1 the proof's transposition f_1 swaps a and b globally, giving f_1(b)=a which is not in F(b). Therefore f_1 is not a selector, and no family of bijective selectors can cover F(a)={a,b} while keeping f(b) in F(b). This settles the counterexample.","verdict_should_be":"REJECT","load_bearing_attack":"The central claim of Theorem 1 requires each constructed f_j to be a bijective selector, i.e. f_j(x) in F(x) for every x. The proof defines f_j as a global transposition of y_alpha and y_alpha_j for every F(y_alpha) in one color class of the intersection graph. This fails exactly when an element x = y_alpha_j that is swapped lies in F(y_alpha_j) but its image y_alpha is not in F(y_alpha_j). The hypotheses only bound |F(x)| and |F^{-1}(x)|; they never imply that y_alpha in F(y_alpha_j). Conversely, an element x belonging to an F-set in a different color class can still be the base point y_gamma of some transposition in that class, so it is not 'identical at all other elements'. Thus the constructed map can move x outside F(x). A concrete counterexample: X={a,b}, F(a)={a,b}, F(b)={b}. Then x in F(x), sup|F(x)|=2<omega, and sup|F^{-1}(x)|=2<omega, so all hypotheses of Theorem 1 hold with kappa=omega. But the only bijective selector is the identity, since any bijection sending b to a would violate f(b) in F(b). Hence {f(a): f is a bijective selector} = {a}, not {a,b}, so the conclusion of Theorem 1 fails. Because the proof of Theorem 2 explicitly applies Theorem 1 to the balls E[x], Theorem 2's conclusion is not established by this argument.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper claims a decomposition theorem for set-valued mappings: under the hypotheses that F(x) contains x, and that sup_x |F(x)| and sup_x |F^{-1}(x)| are both bounded below an infinite cardinal κ, there exists a family of bijective selectors of size < κ such that each F(x) equals the set of images of x under these selectors. The paper applies this theorem to construct G-space representations of balleans with ideals of size < κ, and also states a separate result for finitary cellular balleans. The central proof constructs selectors as transpositions on color classes of an intersection graph on the family of F(x), and the applications rely directly on this construction.","tokens_in":3794,"tokens_out":1736,"duration_ms":19451,"significance":"If the decomposition theorem were correct, it would provide a clean cardinality control on selector families and would strengthen prior results on balleans of bounded geometry, with potential applications to coarse geometry and G-space representations. The paper is short, self-contained, and the intended proof strategy is natural. However, the central claim is false: a two-element example satisfies all hypotheses but violates the conclusion. Since both the main theorem and the ballean application in Theorem 2 depend on this claim, the contribution as written cannot stand. The paper also includes a statement of Theorem 3 for finitary cellular balleans, but that proof is independent of the flawed theorem and may be salvageable, though it is not enough to rescue the paper's main claim.","major_comments":[{"comment":"The proof of Theorem 1 is invalid because the global transposition defined for each color class does not necessarily preserve the selector condition. The proof states that for each j < M, the function f_j acts as a transposition of y_α and y_{α_j} on each F(y_α) in a color class and identically at all other elements. But if an element x = y_{α_j} belongs to some F(y_β) in a different color class, then the transposition may map x to y_α, which need not lie in F(x). The hypotheses only bound cardinalities of F(x) and F^{-1}(x); they do not imply the required disjointness or the containment y_α ∈ F(y_{α_j}).","section":"Section 1, Theorem 1, Case κ = ω"},{"comment":"Theorem 1 is false as stated. Let X = {a,b} and define F(a) = {a,b}, F(b) = {b}. Then x ∈ F(x) for each x, sup_x |F(x)| = 2 < ω, and sup_x |F^{-1}(x)| = 2 < ω, so the hypotheses hold with κ = ω. The only bijective selector is the identity map, since any bijection must send b to a value in F(b) = {b}. Hence {f(a) : f is a bijective selector} = {a}, which is not equal to F(a) = {a,b}. Thus the conclusion of Theorem 1 fails.","section":"Section 1, Theorem 1, Case κ = ω"},{"comment":"Theorem 2 applies Theorem 1 to the ball mappings F_E(x) = E[x]. Since Theorem 1 is false, the proof of Theorem 2 is not established. Moreover, the same counterexample can be embedded as a ballean on a two-point set to show that the conclusion of Theorem 2, as stated with arbitrary κ, would require an independent argument rather than the present appeal to Theorem 1.","section":"Section 2, Theorem 2"},{"comment":"The case κ > ω proceeds by partitioning X into blocks P that are closed under F and F^{-1}, then invoking the case κ = ω on each block. This relies on the truth of the κ = ω case, which is false. Additionally, the proof asserts without demonstration that the case κ = ω can be applied within each block to obtain a family of bijective selectors of the whole mapping F, but the external construction from the flawed case does not supply such selectors.","section":"Section 1, Case κ > ω"}],"minor_comments":[{"comment":"The title contains a typographical artifact: 'SET-V ALUED' should be 'SET-VALUED'.","section":"Title and abstract"},{"comment":"The phrase 'bijective selectors of X' in the statement of Theorem 1 should be 'bijective selectors of F', since the selectors are functions into X but the object being selected is the mapping F.","section":"Section 1, proof of Theorem 1"},{"comment":"The notation F^{-1}F(y) is used without definition; it presumably means {x ∈ X : F(x) ∩ F(y) ≠ ∅}, but this should be stated explicitly.","section":"Section 1, proof of Theorem 1"},{"comment":"The enumeration 'F(y_α) = {y_{α_j} : j < M}' with repetitions is unclear, and the subsequent definition of f_j as 'a transposition of y_α and y_{α_j} at each F(y_α)' is ambiguous when the same pair recurs or when y_α = y_{α_j}. A precise definition of the map on all of X is needed.","section":"Section 1, proof of Theorem 1"},{"comment":"The reference '[2]' is attributed to 'Harary, Graph Theory' but the standard citation is 'Harary, Graph Theory, Addison-Wesley, 1969'; the listed 1994 edition is acceptable if that is the source used, but the author name is misspelled as 'A. Harary'.","section":"Section 1, proof of Theorem 1"}],"recommendation":"reject","confidential_remarks":"The counterexample in the reader's report is decisive and the manuscript's central theorem is uniformly false in both directions of complexity: the construction does not preserve selector membership, and a minimal two-element instance refutes the conclusion. The paper's main results and its ballean application collapse. The final theorem on finitary cellular balleans appears to be a separate statement with a different proof, but it is not sufficient to justify acceptance of this submission. The paper also has a misleading reference pattern in that Theorem 2 claims an improvement over [4] while depending on a false lemma; this is a substantive mathematical defect, not a presentation issue."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Punchline: the central theorem of this short note is false, and the counterexample is small enough to check on the back of an envelope. Take X = {a, b}, F(a) = {a, b}, F(b) = {b}. Then x ∈ F(x) for both x, and both sup_x |F(x)| and sup_x |F^{-1}(x)| equal 2 < ω, so the hypotheses of Theorem 1 hold at κ = ω. But every bijective selector must be the identity: b can only map to b, so a must map to a. The set {f(a) : f is a bijective selector} is {a}, not {a, b}. The conclusion fails.\n\nThe proof breaks at the transposition construction. For each j, the chosen map swaps y_α and y_αj on every F(y_α) in a color class. If y_α is not in F(y_αj), the swap moves y_αj outside its allowed target set. The hypotheses bound cardinalities but say nothing about overlap between the sets F(x), so nothing prevents exactly this situation. The idea of extending the κ = ω case from [4] to arbitrary infinite cardinals is natural, but the theorem as stated is not a valid extension.\n\nWhat the paper does well: it is concise, clearly motivated by ballean/G-space questions, and the proof strategy is transparent. The notation is workable, and the references to [3] and [4] look appropriate; I do not see circular reasoning or a citation-pattern problem.\n\nBecause Theorems 2 and 3 both invoke Theorem 1, they inherit the failure. I am not saying the applications are unrecoverable: a corrected theorem with an additional hypothesis, perhaps that the family {F(x)} forms a partition or that the overlaps are controlled, might restore some of the claims. But that is future work, not what the manuscript currently proves.\n\nRecommendation: I would not send the current version to a referee. I would communicate the counterexample to the author and invite a corrected statement if one exists. The paper is short, and a clean corrected version would be more useful than a refereeing cycle on a false theorem.","headline":"The main theorem is false; a two-element counterexample satisfies every hypothesis but violates the conclusion, so the applications in Section 2 cannot stand as written.","tokens_in":4212,"tokens_out":3004,"would_cite":false,"duration_ms":33545,"reading_group":"no","serious_thinker":"yes","would_accept_peer_review":false},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["03E05","54E05"],"pacs":[],"model":"deepseek-v4-flash","headline":"For any set-valued map with bounded fibres and bounded preimages, fewer than $\\kappa$ bijections reconstruct every fibre.","keywords":["set-valued mapping","selector","bijective selector","ballean","coarse space","G-space","group ideal","cardinal invariant"],"falsifier":"Enumerate all set-valued maps on a finite set, say $\\{1,2,3,4\\}$, that satisfy $x\\in F(x)$, and compute for each the least number of bijections needed to realize every fibre as $\\{f(x):f\\in\\mathcal{F}\\}$. If any instance satisfying the cardinal bounds requires more than $\\max_x |F(x)|$ bijections, the claimed bound is false; if none does, the finite case of the theorem is confirmed.","tokens_in":3211,"feed_emoji":"🔁","tokens_out":10853,"duration_ms":110428,"temperature":0.7,"pith_summary":"This paper proves a decomposition theorem for set-valued mappings. If $F:X\\to B_X$ satisfies $x\\in F(x)$ and both the sets $F(x)$ and the preimages $F^{-1}(x)$ have size below some infinite cardinal $\\kappa$, then all the values $F(x)$ can be produced pointwise by fewer than $\\kappa$ bijective selectors of $X$. The theorem matters because it turns a pure cardinal-size condition into concrete permutation structure: every fibre is the image of $x$ under a small family of global bijections. The paper then applies this to coarse geometry, showing that balleans, or coarse spaces, whose balls are uniformly smaller than $\\kappa$ admit $G$-space representations in which the defining group ideal also has all members smaller than $\\kappa$, and that finitary cellular balleans come from locally finite permutation groups.","feed_headline":"Bounded set-valued maps split into few bijections","feed_subtitle":"A theorem on selectors turns bounded fibres into a small permutation cover, with consequences for coarse spaces and G-spaces.","key_machinery":"The load-bearing object is the intersection graph $\\Gamma$ whose vertices are the values $F(x)$ and whose edges join intersecting values. The proof bounds the local degree of $\\Gamma$: if $m$ exceeds all $|F(x)|$ and all $|F^{-1}(x)|$, then no vertex meets more than $m^2-1$ other vertices, so the graph is $m^2$-colourable. Each colour class is a family of pairwise disjoint fibres, and on each class the proof defines a block of global transpositions by pairing the anchor point of each fibre with each listed element. Combining these blocks for all colour classes and all index positions $j<M$ yields the family $\\mathcal{F}$ whose pointwise images reproduce every fibre. In the uncountable case, the same block construction runs on small pieces obtained by closing points under iterated applications of $F$ and $F^{-1}$.","core_discovery":"The central claim is Theorem 1: for any set $X$ and any set-valued mapping $F:X\\to B_X$ with $x\\in F(x)$, $\\sup_x |F(x)|<\\kappa$, and $\\sup_x |F^{-1}(x)|<\\kappa$, there is a family $\\mathcal{F}$ of bijective selectors with $|\\mathcal{F}|<\\kappa$ such that $F(x)=\\{f(x):f\\in\\mathcal{F}\\}$ for every $x$. In the case $\\kappa=\\omega$, the proof forms the intersection graph of the family $\\{F(x)\\}$, colours it so that intersecting fibres receive different colours, and then defines, for each colour class and each $j$ below a common size bound, a bijection that transposes the anchor point of each fibre with its $j$-th element. The uncountable case is reduced to this construction by partitioning $X$ into pieces on which the map is small. Theorem 2 applies the decomposition to balleans: if every ball has size below $\\kappa$, the ballean is asymorphic to a ballean $(X,G,\\mathcal{I})$ generated by a group of permutations and a group ideal whose members all have size below $\\kappa$. Theorem 3 specialises this to finitary cellular balleans and locally finite permutation groups.","pith_inferences":["The swap construction reads $F$ as an undirected relation: for each transposition to stay inside $F(x)$, one needs $y\\in F(x)$ whenever $x\\in F(y)$. The two cardinal bounds alone do not force this, so a natural extension is to prove the decomposition under a mutual-membership or symmetry condition, or to exhibit an asymmetric $F$ that resists the construction.","The number of bijections needed to cover all fibres is bounded by the chromatic number of the intersection graph; comparing that number with the maximum fibre size could give a sharper invariant for set-valued maps.","For balleans, the theorem suggests a dictionary between cardinal bounds on balls and cardinal bounds on group ideals in $G$-space representations; a testable extension is whether the cellular hypothesis in Theorem 3 can be relaxed while keeping the permutation group locally finite."],"forward_implications":["Any set-valued map with $x\\in F(x)$ and all fibres and preimages of size below $\\kappa$ can be presented pointwise by fewer than $\\kappa$ permutations, not just by arbitrary selectors.","Every ballean whose balls are uniformly of size below $\\kappa$ is asymorphic to a $G$-space ballean in which the group ideal also has all members of size below $\\kappa$.","The $\\kappa=\\omega$ case recovers the earlier representation of finitary balleans by group ideals made of finite sets.","Finitary cellular balleans are, up to asymorphism, exactly the finitary balleans of locally finite permutation groups."],"supporting_citations":[{"why":"Supplies the graph-colouring fact that a graph with maximum local degree $k$ has chromatic number at most $k+1$, used to separate intersecting fibres into disjoint colour classes.","marker":"[2]"},{"why":"Proves that every ballean is asymorphic to a ballean of a $G$-space; Theorem 2 refines this by controlling the cardinality of the ideal.","marker":"[3]"},{"why":"Establishes the $\\kappa=\\omega$ case of the ballean representation, the base case that Theorem 2 generalises.","marker":"[4]"},{"why":"Cited for applications of the finitary case, providing the motivation for extending the representation to larger cardinals.","marker":"[1]"}],"fun_headline_variants":["Set-valued maps decompose into few bijections","Bounded set maps: a cover by few bijective selectors","Few bijections realize every bounded set-valued map","Small bijective covers for set-valued maps"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The proof's construction depends on treating each $F(x)$ as a private container: swapping two points inside $F(y)$ must not push any element outside its own $F$-set, and the stated cardinal bounds do not by themselves guarantee that container property.","fun_headline_variants_meta":{"raw":{"variants":["Set-valued maps decompose into few bijections","Bounded set maps: a cover by few bijective selectors","Few bijections realize every bounded set-valued map","Small bijective covers for set-valued maps"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000452,"raw_usage":{"total_tokens":2268,"prompt_tokens":934,"completion_tokens":1334,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":550,"completion_tokens_details":{"reasoning_tokens":1271}},"tokens_in":550,"tokens_out":1334,"duration_ms":10414,"temperature":1.0,"reasoning_tokens":1271,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-14T13:59:30.961695+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Enumerate all set-valued maps on a finite set, say $\\{1,2,3,4\\}$, that satisfy $x\\in F(x)$, and compute for each the least number of bijections needed to realize every fibre as $\\{f(x):f\\in\\mathcal{F}\\}$. If any instance satisfying the cardinal bounds requires more than $\\max_x |F(x)|$ bijections, the claimed bound is false; if none does, the finite case of the theorem is confirmed.","supporting_citations":[{"cited_title":"Harary, Graph Theory, Addison-Wesley, 1994","cited_arxiv_id":null,"evidence_quote":"Supplies the graph-colouring fact that a graph with maximum local degree $k$ has chromatic number at most $k+1$, used to separate intersecting fibres into disjoint colour classes."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Proves that every ballean is asymorphic to a ballean of a $G$-space; Theorem 2 refines this by controlling the cardinality of the ideal."},{"cited_title":"Protasov, Balleans of bounded geometry and G-space, Algebra Discrete Math","cited_arxiv_id":null,"evidence_quote":"Establishes the $\\kappa=\\omega$ case of the ballean representation, the base case that Theorem 2 generalises."},{"cited_title":"On the space of ends of infinitely generated groups","cited_arxiv_id":"1901.11073","evidence_quote":"Cited for applications of the finitary case, providing the motivation for extending the representation to larger cardinals."}],"review_version":1}