{"id":"b2788c7a-0b87-4d1a-9e1d-2012ba21e36e","arxiv_id":"2411.16563","paper_version":2,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":7.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":0,"one_line_summary":"Uniformly semi-rational groups are characterized, and the fields Q(G) plus the rationality and semi-rationality invariants of finite nilpotent groups are completely classified.","lead":"The paper introduces uniformly semi-rational groups, finite groups where the powers of each element are conjugate to the element or to one fixed power. It fully classifies the fields generated by character values of nilpotent groups and the possible rationality and semi-rationality invariants.","discovery_kind":"extension","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Theorem 4.8 rests on six 2-group semi-rationality computations that are asserted without derivation; an error or omission there would invalidate Theorem B(3).","rationale":"Read in good faith, the main line from Theorem A to Theorem B is coherent. The derivations of Theorem 4.3, Corollary 4.4, Proposition 4.6, and the reduction via Proposition 3.15 check out as far as I can see. The weakest load-bearing point is the six 2-group computations in the final paragraph of Section 4.2: the paper supplies no data to verify them, and the sufficiency direction of Theorem 4.8 for 2-groups relies entirely on them. This matches the reader's primary concern. I do not share the reader's secondary concern about Proposition 4.7, because G USR implies G character quadratic by Corollary 3.12, and the first-type induced character from (χ,χ0,...) is irreducible for nontrivial χ, so χ∈Irr(X) has Q(χ) of degree at most 2 before χ1 and χ2 are chosen. However, I noticed a different defect in Proposition 4.7: the displayed evaluation of the induced character is not the standard induced value. Since Proposition 4.7 is not used in the proof of Theorem 4.8, this does not alter the verdict on the central claim. The conditional status is appropriate: the six small-group computations should be supplied or independently reproduced before the classification is accepted unconditionally.","tokens_in":97,"tokens_out":30588,"duration_ms":362927,"concrete_test":"Run GAP for i=1..6: G:=SmallGroup(n,m) for the six listed IDs; compute all conjugacy classes; for each g and each r in U_8 check whether U_8 = R_g ∪ rR_g, where R_g={s∈U_8 : g∼g^s}, and intersect over g to obtain S_G. Verify that the six computed sets equal the six printed values. Separately, using U_{2^k}=⟨-1⟩×⟨5⟩ for k≥3, enumerate all subgroups V with U_{2^k}^2=⟨5^2⟩⊆V and list the nontrivial cosets; confirm they are exactly −⟨5⟩, −⟨−5⟩, 5⟨5^2,−1⟩, −⟨5^2⟩, −5⟨5^2⟩, and 5⟨5^2⟩. If these match, the missing support is supplied and Theorem B(3) is sound.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The central classification Theorem B(3) is implemented in Theorem 4.8. For the 2-primary case with S≠U_{2^k}, the sufficiency direction rests on six semidirect products H1,...,H6 listed at the end of §4.2. The text says only that 'a straightforward calculation shows' their semi-rationalities are SH1=-⟨5⟩, SH2=-⟨-5⟩, SH3=5⟨-1⟩, SH4={-1}, SH5={-5}, SH6={5}, and then asserts that the lifted sets are all admissible cosets of U_{2^k} other than U_{2^k}. No GAP log, character table, or derivation is provided, and only the SmallGroup IDs [16,6], [16,8], [16,7], [32,13], [32,14], [128,1956] identify the groups. Because the 'if and only if' requires every admissible coset to be realized, an error in any one of these values, or a missing admissible coset, directly breaks the classification. This is a finite and checkable computation, so it is the right thing to demand before accepting Theorem B(3) unconditionally. Separately, Proposition 4.7 contains a genuine displayed evaluation error: for the first-type induced character χ=(χ1χ2χ0^{p-2})^G, the standard induced-character formula gives χ(x2,1,...,1)=Σ_{i=0}^{p-1}χ_{i+1}(x2), not χ1(x2). This proposition is not cited in the proof of Theorem 4.8, so it is not load-bearing for the main classification, but it should be corrected.","agreement_with_reader":"partial"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper introduces two invariants for finite groups, the rationality R_G and the semi-rationality S_G, and defines uniformly semi-rational (USR) groups as groups that are r-semi-rational for some unit r modulo the exponent. The main results are Theorem A, a characterization of USR groups in terms of quadratic conjugatedness and a \"stillness\" condition with respect to a subfield K such that Q_n/K is cyclic, and Theorem B, which classifies for finite nilpotent groups of exponent n: (1) the fields Q(G) as exactly the subextensions of Q_n/Q_{n'} (Theorem 4.3), (2) the rationality subgroups as exactly the subgroups of {r ≡ 1 mod n'} (Corollary 4.4), and (3) the semi-rationality subsets as exactly the admissible cosets of U_n with primes only in {2,3} and the stated congruence condition when 3 divides n (Theorem 4.8). The proofs use character theory, the Witt-Berman theorem, wreath product character descriptions, and direct product decompositions.","tokens_in":15134,"tokens_out":2373,"duration_ms":23331,"significance":"If the classification is correct, this is a substantial contribution: it gives a complete, explicit determination of the possible character fields, rationality subgroups, and semi-rationality cosets for all finite nilpotent groups, thereby sharpening the landscape of rational-type groups. The conceptual framework of stillness and admissible cosets is elegant and likely to be useful beyond this paper. The proof of Theorem 4.3 is constructive and parameter-free, using explicit wreath products to realize each allowed field. However, the 2-group case of Theorem 4.8 depends on six finite-group computations that are asserted without derivation or supporting log, and at least one displayed character evaluation in Proposition 4.7 is incorrect; these issues need to be addressed before the classification can be accepted unconditionally.","major_comments":[{"comment":"The sufficiency direction for the 2-primary case with S ≠ U_{2^k} rests entirely on the six groups H_1,...,H_6 and the asserted values S_{H_i} = -⟨5⟩, -⟨-5⟩, 5⟨-1⟩, {-1}, {-5}, {5}. The text says only that a straightforward calculation shows this and then states that the lifted sets are all admissible cosets of U_{2^k} other than U_{2^k}. No derivation, character table, or GAP verification is provided. Because the 'if and only if' in Theorem B(3) requires every admissible coset to be realized, an error in any of these six values, or a missed admissible coset, would invalidate the classification. This is a finite and checkable computation, so I request that the authors supply either a detailed derivation or a reproducible computational script (e.g., GAP code with the SmallGroup identifications) that verifies both the S_{H_i} values and the exhaustiveness of the resulting cosets.","section":"§4.2, Theorem 4.8"},{"comment":"The proof of Proposition 4.7 contains a displayed evaluation error. For the first-type induced character χ = (χ_1 χ_2 χ_0^{p-2})^G, the formula in Theorem 4.1 gives χ(x_2,1,...,1) = Σ_{i=0}^{p-1} χ_{i+1}(x_2), where indices are read modulo p and χ_0 is the trivial character, not simply χ_1(x_2). The displayed equalities χ(x_2,1,...,1)=χ_1(x_2) and χ(1,x_1,1,...,1)=χ_2(x_1) are therefore not justified. While Proposition 4.7 is not cited in the proof of Theorem 4.8 and so is not load-bearing for the main classification, it is a stated result and the error must be corrected, with the argument adjusted to show that the relevant character field still has degree at least 4.","section":"§4.2, Proposition 4.7"}],"minor_comments":[{"comment":"The table reports percentages for groups of order less than 512 and for a random sample of 100,000 groups of order 512, but the text does not state the random sampling method or whether the sample is reproducible; a brief note on the sampling procedure would improve the presentation.","section":"§1, Table 1"},{"comment":"The definition of admissible coset is introduced before its motivation; it would be helpful to state explicitly that admissible cosets are exactly the possible semi-rationalities of USR groups, which only becomes clear later in Proposition 3.2 and Theorem 4.8.","section":"§2, Definition 2.3"},{"comment":"In the proof of Proposition 3.6, the notation Gal(Q_G/Q(χ)) is used for the Galois group of the extension Q_G/Q(χ); since Q(χ) is not necessarily a subfield of Q_G, this notation should be clarified for readers.","section":"§3.2, Proposition 3.6"},{"comment":"In the proof of Theorem 4.3, the case analysis for the subfields of Q_{2^k} is terse; a short table listing the intermediate fields F_{k,1} and F_{k,2} and their Galois groups would make the argument easier to follow.","section":"§4.1, Theorem 4.3"}],"recommendation":"major_revision","confidential_remarks":"The paper is clearly within scope and the main theoretical framework is sound. The principal obstacle is the unverified computational premise in Theorem 4.8; this is fixable by adding a derivation or a GAP script. The Proposition 4.7 error is local but should not remain. I do not see any cause to question the novelty or the citation practices."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Short version: the paper does something real. It defines two new invariants, rationality and semi-rationality, and proves a complete classification for nilpotent groups: the fields Q(G) are exactly the subextensions of Q_n over Q_{n'}, the rationality subgroups are exactly the subgroups of {r ≡ 1 mod n'}, and the semi-rationality sets are exactly the admissible cosets with the stated 2-3 condition. Theorem B is a genuine theorem, not a repackaging. The constructions with wreath products are clean, and the overall proof structure—Theorem A via stillness, then reduction to p-groups—is sensible.\n\nI could not verify the six semi-rationality computations at the end of §4.2. The text says 'a straightforward calculation shows' and gives SmallGroup IDs, but no derivation or GAP log. This is a finite check and almost certainly correct, but for an 'if and only if' classification a referee should ask for the log or a short derivation. Not fatal, but needed.\n\nThe stress-test note caught a real error: in Proposition 4.7, the evaluation χ(x2,1,...,1) = χ1(x2) is wrong. For the first-type induced character (χ1χ2χ0^{p-2})^G, the value at (x2,1,...,1) is the sum over the p conjugates, so χ1(x2)+χ2(x2)+(p-2). The subsequent degree-4 claim may still be salvageable, but the displayed computation as written is incorrect. Since Prop 4.7 is not used in the proof of Theorem 4.8, this does not undermine the main classification, but it should be fixed.\n\nThere is also a smaller omission in the same proposition: the proof implicitly assumes all character fields of X are quadratic before choosing two distinct quadratic fields. That is an unstated step, not a contradiction.\n\nNet: this paper deserves a serious referee. The main theorem is solid, the new notions are useful, and the soft spots are addressable. I would send it out, ask for a GAP log for the six groups, and request a corrected proof of Proposition 4.7.","headline":"A real classification theorem for nilpotent groups with two addressable soft spots: unverified 2-group computations and a wrong evaluation in Prop 4.7.","tokens_in":15674,"tokens_out":4519,"would_cite":true,"duration_ms":40453,"reading_group":"yes","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["20C15","20D15","20D20"],"pacs":[],"model":"deepseek-v4-flash","headline":"Two new invariants completely describe character fields of finite nilpotent groups.","keywords":["finite groups","irreducible characters","rational groups","uniformly semi-rational groups","nilpotent groups","quadratic fields","group invariants","character fields"],"falsifier":"Recompute the semi-rationality of each of the six groups $H_1,\\dots,H_6$ defined in Section 4.2 from its character table by intersecting the sets $S_g$ over representatives $g$; if any group's set differs from the value assigned in Section 4.2, or if those six values together with $U_{2^k}$ do not match all admissible cosets of $U_{2^k}$, the 2-primary case of Theorem B fails. The check is finite: each group has finitely many conjugacy classes and finitely many units modulo its exponent.","tokens_in":14602,"feed_emoji":"","tokens_out":10193,"duration_ms":92710,"temperature":0.7,"pith_summary":"This paper introduces two invariants attached to any finite group: its rationality, the set of exponents $r$ for which every element is conjugate to its $r$-th power, and its semi-rationality, the set of $r$ for which every element is conjugate either to itself or to its $r$-th power. These invariants measure how close a group is to being rational and how uniformly its irreducible characters take values in quadratic extensions of the rationals. The main result is a complete description of both invariants for finite nilpotent groups: a nilpotent group of exponent $n$ can realize exactly the subfields of the $n$-th cyclotomic field that contain the largest squarefree divisor $n'$ of $n$, and its rationality and semi-rationality are exactly the corresponding subgroups and admissible cosets described in Theorem B. Along the way the paper characterizes uniformly semi-rational groups as the quadratic-conjugated groups that are 'still' over a suitable field, a condition expressed purely through intersections of character fields with that field. A reader should care because these invariants compactly organize a classical subject and settle, for nilpotent groups, what fields can arise from character values.","feed_headline":"All character fields of nilpotent groups classified","feed_subtitle":"Two new invariants—rationality and semi-rationality—fix exactly which quadratic fields can appear.","key_machinery":"The engine of the paper is the pair of invariants defined on the unit group $U_n$ of $\\mathbb{Z}/n\\mathbb{Z}$, where $n = \\exp(G)$. The rationality $R_G = \\bigcap_g \\{r : g \\sim g^r\\}$ is a subgroup and satisfies the Galois identity $R_G = \\sigma^{-1}(\\mathrm{Gal}(\\mathbb{Q}_n/\\mathbb{Q}(G)))$, so it encodes exactly $\\mathbb{Q}(G)$ as its fixed field. The semi-rationality $S_G = \\bigcap_g \\{r : \\text{every generator of } \\langle g \\rangle \\text{ is conjugate to } g \\text{ or } g^r\\}$ is, whenever nonempty, an admissible coset of $U_n$ modulo $R_G$, meaning a coset $S \\neq R$ satisfying $U_n^2 \\subseteq R$; this coset structure is what makes the classification finite. The structural notion that carries the proof is $K$-stillness: a group is $K$-still when tensoring a homogeneous rational representation with $K$ keeps it homogeneous, which Proposition 3.6 equates with $\\mathbb{Q}(\\chi) \\cap K = \\mathbb{Q}$ for every irreducible character and with the coincidence of $\\mathbb{Q}$- and $K$-conjugacy classes. Finally, the construction side uses wreath products $X \\wr C_p$, whose character theory is explicit, to build groups realizing prescribed intermediate fields, and six explicitly listed $2$-groups to realize all admissible cosets in the $2$-primary case.","core_discovery":"The paper's central claim is that for finite nilpotent groups the pair (rationality, semi-rationality) is both completely determined and completely flexible. Writing $n$ for the exponent and $n'$ for its largest squarefree divisor, Theorem B states that the field $\\mathbb{Q}(G)$ generated by all character values is exactly any intermediate field $\\mathbb{Q}_{n'} \\subseteq K \\subseteq \\mathbb{Q}_n$; the rationality $R_G$ is exactly any subgroup of $\\{r \\in U_n : r \\equiv 1 \\bmod n'\\}$; and the semi-rationality $S_G$ is exactly any admissible coset of $U_n$ subject to the prime restrictions $\\pi(n) \\subseteq \\{2,3\\}$, with $S = \\{x \\in U_n : x \\equiv -1 \\bmod 3\\}$ when $3$ divides $n$. Equivalently, once the exponent is fixed, the only obstruction to realizing a given field, rationality, or semi-rationality is this elementary number-theoretic condition. The characterization behind the theorem is Theorem A: a group is uniformly semi-rational if and only if it is quadratic conjugated and there is a subfield $K$ of $\\mathbb{Q}_n$ over which $\\mathbb{Q}_n$ is cyclic and for which every irreducible character field $\\mathbb{Q}(\\chi)$ meets $K$ only in $\\mathbb{Q}$.","pith_inferences":["The same invariant pair could be computed for any finite group from its character table, since Theorem A reduces $r$-semi-rationality to checking quadratic conjugation and $K_r$-stillness; a systematic computation over small-group libraries would show how far the nilpotent classification is from the general case.","If a similar classification is sought for solvable groups, the six $2$-group building blocks appearing here suggest that the admissible-coset language may survive, but the prime restriction $\\pi \\subseteq \\{2,3\\}$ will likely fail, since solvable groups with quadratic-valued characters are not so restricted; the paper leaves this open.","Because inverse semi-rational groups coincide with cut groups, Theorem A gives a representation-theoretic route to testing triviality of central units in integral group rings through $K_{-1}$-stillness, potentially simplifying the known characterizations of cut groups."],"forward_implications":["For a nilpotent uniformly semi-rational group of exponent $n$, no prime other than 2 or 3 can divide $n$; if 3 divides $n$, then $S_G$ must be exactly the set of units congruent to $-1$ modulo 3.","Every uniformly semi-rational group is character quadratic: each irreducible character takes values in a quadratic extension of $\\mathbb{Q}$.","The rationality $R_G$ determines the character field by $\\mathbb{Q}(G) = \\mathbb{Q}_n^{R_G}$, so computing $R_G$ is equivalent to computing $\\mathbb{Q}(G)$.","A direct product $G \\times H$ is uniformly semi-rational exactly when one factor is rational and the other is uniformly semi-rational, or both are quadratic with the same character field; in the quadratic case the product is quadratic.","For nilpotent groups, every subfield between $\\mathbb{Q}_{n'}$ and $\\mathbb{Q}_n$ occurs as $\\mathbb{Q}(G)$, and the extremal cases are realized by iterated wreath products of cyclic groups and by dihedral-type groups."],"supporting_citations":[{"why":"Supplies the definition of semi-rational groups and the lemma linking semi-rational elements to the index $[U_G : R_g] \\leq 2$, which underlies the admissible-coset structure of $S_G$.","marker":"[CD10]"},{"why":"Introduces quadratic rational (character quadratic) groups and the lemma used in the basic characterizations of semi-rational elements.","marker":"[Ten12]"},{"why":"Gives the explicit description of the irreducible characters of $X \\wr C_p$, the tool used to compute $\\mathbb{Q}(G)$ for wreath products in Theorems 4.3 and 4.8.","marker":"[Rev04]"},{"why":"Provides the Witt–Berman theorem equating the number of $K$-conjugacy classes with the number of irreducible $KG$-modules, which carries the equivalence in Proposition 3.6.","marker":"[CR06]"},{"why":"Supplies the theorem on the center of the simple component $\\mathbb{Q}(\\chi)$, used in the $K$-still equivalence and in the structure of quadratic groups.","marker":"[JR16]"}],"fun_headline_variants":["Rationality and semi-rationality fully pinned for nilpotent groups","All nilpotent character fields: one number-theoretic cutoff","Exponent determines all admissible character fields","Two invariants measure quadratic character field reach","Prime restriction on 2,3 blocks nilpotent character fields"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The proof that every admissible coset occurs for 2-groups relies on the unverified computational claim that six explicitly listed groups of orders 16, 32, and 128 have exactly the stated semi-rationality values, and that those six values together with the full unit group exhaust the admissible cosets for every order $2^k$ with $k \\geq 3$; if any of these semi-rationality computations is wrong, the classification is incomplete.","fun_headline_variants_meta":{"raw":{"variants":["Rationality and semi-rationality fully pinned for nilpotent groups","All nilpotent character fields: one number-theoretic cutoff","Exponent determines all admissible character fields","Two invariants measure quadratic character field reach","Prime restriction on 2,3 blocks nilpotent character fields"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000595,"raw_usage":{"total_tokens":2776,"prompt_tokens":926,"completion_tokens":1850,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":542,"completion_tokens_details":{"reasoning_tokens":1770}},"tokens_in":542,"tokens_out":1850,"duration_ms":13079,"temperature":1.0,"reasoning_tokens":1770,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-12T12:59:17.515463+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Recompute the semi-rationality of each of the six groups $H_1,\\dots,H_6$ defined in Section 4.2 from its character table by intersecting the sets $S_g$ over representatives $g$; if any group's set differs from the value assigned in Section 4.2, or if those six values together with $U_{2^k}$ do not match all admissible cosets of $U_{2^k}$, the 2-primary case of Theorem B fails. The check is finite: each group has finitely many conjugacy classes and finitely many units modulo its exponent.","supporting_citations":[],"review_version":1}