pith. machine review for the scientific record. sign in
recognition review

2605.10402v1

visibility
public
This ticket is an immutable review record. Revised manuscripts should be submitted as a fresh peer review; if the fresh ticket passes journal gates, publish from that ticket.
confidence high · verification V0
uploaded manuscript ticket 07177e3dd60546e3 Ask Research about this review

referee's decision

The manuscript resolves Kourovka Notebook Problem 21.10 by proving that every finite group admits a finite just-finite presentation. The central argument establishes the stronger Theorem 2 for finitely presented groups with Serre's Property (FA) and then specializes to finite groups via the observation that all finite groups satisfy (FA). The construction augments an irredundant presentation with one new generator per relation and replaces each original relation with a pair of relations whose removal produces either a nontrivial amalgamated free product or a group surjecting onto the integers, both of which violate (FA). The proof is short, self-contained, and relies only on classical facts: Serre's characterization of (FA), Neumann's lemma on elements satisfying the given conjugation relations, and the structure of the resulting semidirect products. No gaps or counterexamples to the argument have been identified. The title and abstract contain typographic errors that must be corrected prior to publication. With those fixes the paper meets the standard for acceptance.

required revisions

  1. R1: Correct the typographic error in the title by removing extraneous spaces to read 'EVERY FINITE GROUP ADMITS A JUST FINITE PRESENTATION'.
  2. R2: Standardize hyphenation of 'just-finite' versus 'just finite' throughout the abstract and body for consistency.

top-line referee reports

Referee A: accept / high. Referee B: accept / high. Full consensus on acceptance; both identify only typographic issues in the title and abstract.

what this review changes for the paper

A plain-language summary of every load-bearing claim the referees checked. The detailed audit trail with claim IDs and machine evidence types is collapsed below the report.

0 publication blockers
1 needs clarification
6 already supported
0 noted, out of scope
  • clarify before publication Example

    The dihedral group of order 8 admits an explicit just-finite presentation obtained by the construction.

    The example verifies that the new relations are irredundant.

claim inventory

A scan of the paper's claims and how this review validated them. Lean appears only when there is a real theorem match.

IDClaimSectionImportanceStatusLean matchAuthor action
C6 The dihedral group of order 8 admits an explicit just-finite presentation obtained by the construction. Example clarify before publication verified none The example verifies that the new relations are irredundant.
C1 Every finite group admits a finite just-finite presentation. Theorem 1 no action needed verified none Follows immediately from Theorem 2 and the fact that finite groups have Property (FA) by Serre's theorem.
C2 Every finitely presented group with Property (FA) admits a finite just-(FA) presentation. Theorem 2 no action needed verified none Proved by the augmentation construction using Neumann's lemma.
C3 Augmenting an irredundant presentation with one new generator b_r per relation and replacing each r by the pair r^{-1} b_r r = b_r^2 and b_r^{-1} r b_r = r^2 still defines the original group G. Proof of Theorem 2 no action needed verified none Direct application of B. H. Neumann's lemma on the given conjugation relations.
C4 Removing either new relation from the augmented presentation produces a group that lacks Property (FA). Proof of Theorem 2 no action needed verified none The resulting group is either a nontrivial amalgamated free product or admits a surjection onto Z.
C5 The construction yields just-(T) presentations for groups with Kazhdan's Property (T). Section on Property (T) no action needed verified none Immediate corollary since (T) implies (FA) by Watatani's theorem.
C7 The construction preserves the deficiency of the original presentation for non-cyclic groups. Theorem 6 no action needed verified none Additional statement that strengthens the result.

references for core claims

References the reviewers found for the paper's core claims. Relations may be support, contrast, prior art, or duplication risk.

No strong reference was found in the Pith corpus for these core claims. New paid reports will populate this section when the retrieved literature supports it.

verification grade

V0 Prose only; no formal artifacts supplied.

technical assessment

The paper begins with an irredundant finite presentation of a group G possessing Property (FA). For each relation r it introduces a fresh generator b_r and replaces r by the two relations r^{-1} b_r r = b_r^2 and b_r^{-1} r b_r = r^2. Neumann's lemma guarantees that these two relations together force b_r = 1 and r = 1, so the new presentation still defines G. Removing either new relation yields a group that is either a nontrivial amalgamated free product (hence lacks (FA)) or admits a homomorphism onto Z (hence lacks (FA)). The argument handles cyclic groups by a direct construction and extends immediately to groups with Property (T) because (T) implies (FA). An explicit presentation is supplied for the dihedral group of order 8 to illustrate irredundancy. Notation is standard; the only minor issue is inconsistent hyphenation of 'just-finite' versus 'just finite'. The proof strategy is direct and does not invoke advanced machinery beyond the cited classical results.
Technical audit trail per-claim ledger, formal-canon audit, and cited theorems

Formal-foundations audit

Where each claim sits in the chain: proved inside this paper, inherited from prior formal results, or still standing on a modeling assumption.

Formal-canon T-codes glossary
T-1
Logic-of-distinction: a single act of distinction must hold its identity for the next act to be meaningful.
T0
Ledger existence: any setting that can compare positive ratios admits a single shared cost ledger.
T1
Reciprocal symmetry: comparing a to b costs the same as comparing b to a.
T2
Composition Law: how independent comparisons compose.
T3
Calibration: fix the second derivative of the cost at the identity ratio to one.
T4
Continuity / smoothness of the cost function on positive ratios.
T5
Cost uniqueness: under T-1..T4 the cost is forced to J(x) = ½(x + 1/x) − 1 (Aczel / d’Alembert).
T6
φ forced: self-similar gauge of J picks out the golden ratio as the unique fixed point.
T7
Eight-tick recognition cycle: the discrete period is 2³ = 8.
T8
Spatial dimension D = 3 forced from the eight-tick cycle plus S¹ cohomology.
Technical narrative
The paper lies entirely outside the formal canon. None of the supplied canon modules (IndisputableMonolith.NumberTheory.FinitePhaseCompleteness, IndisputableMonolith.RecogGeom.FiniteResolution, IndisputableMonolith.Foundation.LogicAsFunctionalEquation.FiniteLogicalComparison, IndisputableMonolith.Cost.FunctionalEquation, or IndisputableMonolith.Physics.StandardModelGroupStructure) address group presentations, Serre's Property (FA), or just-finite presentations. The result is a classical theorem in geometric group theory with no bearing on the canon forcing chain from T-1 through T8, the uniqueness of J, dimension forcing, or any RS-derived constants. No THEOREM, HYPOTHESIS, or CONDITIONAL THEOREM from the canon is invoked or contradicted. The manuscript should be evaluated solely on its merits within geometric group theory.

verification and reproducibility

The manuscript contains a complete, self-contained mathematical proof with no Lean files, code, data, or computational artifacts. Verification consists of reading the argument, which uses only standard facts and supplies an explicit example. No formalization or reproducibility artifacts are present or required.

novelty and positioning

The paper supplies the first proof that every finite group admits a just-finite presentation, resolving an open question posed by Barnea. The construction is uniform, preserves deficiency for non-cyclic groups, and immediately yields a just-(T) corollary. It has no overlap with the formal canon and represents an independent contribution in geometric group theory rather than a restatement or extension of any RS result.

paper summary

The paper resolves Kourovka Notebook Problem 21.10 by proving that every finite group admits a finite just-finite presentation. It establishes the stronger Theorem 2: every finitely presented group with Serre's Property (FA) admits a finite just-(FA) presentation. The proof augments an irredundant presentation with new generators and relations whose removal destroys Property (FA). An explicit example for the dihedral group of order 8 is included, and consequences for groups with Property (T) are noted.

significance

The result settles a named open problem from the Kourovka Notebook with a short, constructive proof. It supplies explicit just-finite presentations for any finite group and preserves deficiency in the non-cyclic case. The argument is self-contained and may have further applications in geometric group theory.

claim ledger

Per-claim record produced by the referees. Each card isolates one load-bearing claim and tags the machine-readable status and evidence type. Use the simpler summary above for author actions.

C6 Example
verified

The dihedral group of order 8 admits an explicit just-finite presentation obtained by the construction.

type
empirical prediction
evidence
manuscript proof

referee note

The example verifies that the new relations are irredundant.

C1 Theorem 1
verified

Every finite group admits a finite just-finite presentation.

type
theorem
evidence
manuscript proof

referee note

Follows immediately from Theorem 2 and the fact that finite groups have Property (FA) by Serre's theorem.

C2 Theorem 2
verified

Every finitely presented group with Property (FA) admits a finite just-(FA) presentation.

type
theorem
evidence
manuscript proof

referee note

Proved by the augmentation construction using Neumann's lemma.

C3 Proof of Theorem 2
verified

Augmenting an irredundant presentation with one new generator b_r per relation and replacing each r by the pair r^{-1} b_r r = b_r^2 and b_r^{-1} r b_r = r^2 still defines the original group G.

type
theorem
evidence
manuscript proof

referee note

Direct application of B. H. Neumann's lemma on the given conjugation relations.

C4 Proof of Theorem 2
verified

Removing either new relation from the augmented presentation produces a group that lacks Property (FA).

type
theorem
evidence
manuscript proof

referee note

The resulting group is either a nontrivial amalgamated free product or admits a surjection onto Z.

C5 Section on Property (T)
verified

The construction yields just-(T) presentations for groups with Kazhdan's Property (T).

type
theorem
evidence
manuscript proof

referee note

Immediate corollary since (T) implies (FA) by Watatani's theorem.

C7 Theorem 6
verified

The construction preserves the deficiency of the original presentation for non-cyclic groups.

type
theorem
evidence
manuscript proof

referee note

Additional statement that strengthens the result.

strengths

  • Resolves a named open Kourovka Notebook problem with a short, self-contained proof.
  • The construction is uniform and preserves deficiency for non-cyclic groups.
  • Explicit verification for the dihedral group of order 8 supplies a concrete example.
  • The extension to Property (T) follows immediately from the known implication (T) implies (FA).
  • The AI-assisted methodology is disclosed transparently without affecting the mathematical content.

optional revisions

  • Add one sentence in the proof of Theorem 2 reminding the reader that quotients of cyclic groups are cyclic to make the non-cyclic case immediate.

scorecard

Legacy ticket fallback. New paid reports use a six-axis scorecard; this ticket predates that schema.

accept with metadata fixesconfidence highverification V0

Publication readiness is governed by the referee recommendation, required revisions, and the blockers summarized above.

where the referees disagreed

  • Minor differences in emphasis on proof terseness and AI disclosure.

    Referee A: Notes that the argument that H_r cannot be cyclic is terse and suggests a reminder sentence; highlights transparent AI disclosure as a strength.

    Referee B: Finds the proof self-contained with no need for extra sentences; treats AI disclosure as appropriate but not requiring comment.

    synthesizer: The differences are stylistic only; both referees agree the proof is correct and recommend acceptance. The suggested sentence is optional.

how each referee voted

Referee A: accept / high. Referee B: accept / high. Full consensus on acceptance; both identify only typographic issues in the title and abstract.

recognition modules supplied to referees

show full model reports

grok-4.3 · high

{
  "canon_match_strength": "none",
  "cited_canon_theorems": [],
  "confidence": "high",
  "issue_inventory": [],
  "load_bearing_issues": [],
  "major_comments": [],
  "minor_comments": [
    {
      "comment": "The title and abstract contain typographic artifacts (spaces inside \u0027PRESENT A TION\u0027, inconsistent hyphenation of \u0027just finite\u0027 versus \u0027just-finite\u0027). These do not affect readability but should be cleaned before publication.",
      "section": "Abstract"
    },
    {
      "comment": "The argument that H_r cannot be cyclic when G is non-cyclic is correct but terse. A single sentence reminding the reader that any quotient of a cyclic group is cyclic would make the contradiction immediate.",
      "section": "Proof of Theorem 2, Case 1"
    }
  ],
  "optional_revisions": [],
  "paper_summary": "The paper resolves Kourovka Notebook Problem 21.10 by proving that every finite group admits a finite just-finite presentation. It establishes the stronger Theorem 2: every finitely presented group with Serre\u0027s Property (FA) admits a finite just-(FA) presentation. The proof begins with an irredundant finite presentation of such a group G, augments the generating set with one new generator b_r per relation r, and replaces each original relation r with the pair of relations r^{-1} b_r r = b_r^2 and b_r^{-1} r b_r = r^2. Neumann\u0027s lemma ensures these force b_r = 1 and r = 1, so the new presentation still defines G. Removing either new relation produces either a non-trivial amalgamated free product (hence no Property (FA)) or a group surjecting onto Z (hence no Property (FA)). Special cases for cyclic groups and extensions to Property (T) are handled directly.",
  "recommendation": "accept",
  "required_revisions": [],
  "significance": "The result settles a 2026 Kourovka Notebook question posed by Barnea. It supplies an explicit, uniform construction that preserves deficiency for non-cyclic groups and yields concrete just-finite presentations. The argument relies only on classical tools (Serre\u0027s theorem, Neumann\u0027s lemma, Baumslag-Solitar groups) and produces falsifiable, checkable presentations for any concrete finite group.",
  "strengths": [
    "Resolves an open Kourovka Notebook problem with a short, self-contained proof.",
    "The construction is uniform and preserves the deficiency of the original presentation.",
    "Explicit verification for the dihedral group of order 8 supplies a concrete example.",
    "The extension to Property (T) follows immediately from the known implication (T) implies (FA).",
    "The AI-assisted methodology is disclosed transparently without affecting the mathematical content."
  ]
}

grok-4.3 · xhigh

{
  "canon_match_strength": "none",
  "cited_canon_theorems": [],
  "confidence": "high",
  "issue_inventory": [],
  "load_bearing_issues": [],
  "major_comments": [],
  "minor_comments": [
    {
      "comment": "The title contains extraneous spaces (\u0027PRESENT A TION\u0027); correct to \u0027PRESENTATION\u0027 for the published version.",
      "section": "Title and abstract"
    },
    {
      "comment": "The detailed account of AI co-mathematician assistance is transparent and appropriate; no changes required.",
      "section": "Methodology"
    }
  ],
  "optional_revisions": [],
  "paper_summary": "The paper resolves Kourovka Notebook Problem 21.10 by proving that every finite group admits a finite just finite presentation. It establishes the stronger Theorem 2: every finitely presented group with Serre\u0027s Property (FA) admits a finite just-(FA) presentation. The construction starts from an irredundant finite presentation and replaces each relation r with two new relations involving a fresh generator b_r, using B.H. Neumann\u0027s lemma on elements satisfying u^{-1}vu = v^2 and v^{-1}uv = u^2. Removing either new relation produces either a non-trivial amalgamated free product (violating FA) or a surjection onto Z (also violating FA). Special cases handle cyclic groups and non-cyclic groups separately. Consequences for groups with Property (T) follow immediately. The paper includes an explicit example for the dihedral group of order 8 and notes AI-assisted methodology.",
  "recommendation": "accept",
  "required_revisions": [],
  "significance": "This settles an open question on the existence of just finite presentations for finite groups. The result is constructive and applies uniformly to all finitely presented groups with Property (FA), including all finite groups. It also yields just-(T) presentations for groups with Kazhdan\u0027s Property (T). The proof technique, based on controlled replacement of relations while preserving the group but destroying fixed-point properties on trees, may have further applications in geometric group theory.",
  "strengths": [
    "Resolves a named open problem (Kourovka 21.10) with a uniform constructive proof.",
    "The just-(FA) strengthening is natural and immediately yields the just-(T) corollary via Watatani\u0027s theorem.",
    "Proof is self-contained, uses only standard facts (Serre\u0027s characterization of FA, Neumann\u0027s lemma, and the structure of the relevant semidirect products).",
    "Explicit example for D_8 illustrates the construction and verifies irredundancy.",
    "Deficiency preservation (Theorem 6) is a useful additional statement."
  ]
}

Want another paper reviewed? submit one. The Pith formal canon lives at github.com/jonwashburn/shape-of-logic.