Pith. sign in

REVIEW 5 minor 17 references

If a structure's index set can be recovered from it by a uniform formula, then being standard of that form cannot appear after forcing.

Reviewed by Pith at T0; open to challenge. T0 means a machine referee read the full paper against a public rubric. the ladder, T0–T4 →

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

T0 review · grok-4.5

2026-07-14 18:31 UTC pith:ATJC6J6U

load-bearing objection Clean ZF answer to Schweber plus a usable reconstruction-implies-descent principle and explicit torsor separations; the catalogue is real work, not padding.

arxiv 2606.02898 v2 pith:ATJC6J6U submitted 2026-06-01 math.LO math.GR

Canonical reconstruction and forcing absoluteness of standard structures

Tomasz Kania This is my paper
classification math.LO math.GR MSC 03E4003E2503E4716S5020B3046B0446L05
keywords forcingdownward absolutenesssymmetric groupendomorphism ringell-1 spaceB(H)Axiom of ChoicePi-1-1 definability
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper isolates a single preservation principle for when "standardness" of algebraic and topological-algebraic objects is absolute between transitive models of set theory. If the index set of a standard form F(X) can be reconstructed from the abstract structure by a uniform definable construction, then the class of objects isomorphic to some F(X) is downward absolute: it cannot appear for the first time in a forcing extension or outer transitive model. The principle answers the motivating question that a group which is not a full symmetric group in a ZF ground model cannot become one after forcing, and the same reconstruction supplies a uniform Pi-1-1 definition of fullness. The same mechanism covers transformation monoids, powerset Boolean algebras, relation algebras, full clones, partition lattices, many ring products, atomic C*-algebras, endomorphism rings, B(H) and K(H), and ell-1 as a Banach lattice. Where reconstruction produces only a torsor of local pieces rather than a global index, the paper exhibits clean ZF failures (finite covers and finite-support c00) while still obtaining ZFC descent.

Core claim

Whenever the index of a standard structure F(X) can be recovered from F(X) by a uniform definable construction, the predicate "A is isomorphic to some F(X)" is downward absolute between any two transitive ZF-models one of which contains the other. In the motivating case this yields both ZF-descent for full symmetric groups and a uniform Pi-1-1 definition of fullness; the same reconstruction pattern applies to a long catalogue of algebraic and operator-algebraic standard forms, while finite covers and sign torsors separate ZF failure from ZFC descent.

What carries the argument

The Descent Lemma: if the standard construction satisfies old-part absoluteness F^M(Y)=F^N(Y) cap M and N sees an isomorphism from a ground-model structure A onto F^N(Y), then the same map is already an isomorphism onto F^M(Y) inside M. Canonical reconstruction of the index (or a proxy) supplies the required Y and the isomorphism.

Load-bearing premise

Every standard construction used in the positive theorems must recognise its old pieces correctly: the part of the standard object built from a ground-model index that already lives in the ground model is exactly the standard object computed inside the ground model.

What would settle it

A concrete transitive pair M subset N of ZF-models and a group G in M such that N sees G isomorphic to Sym(X) for some X while M sees G not isomorphic to any full symmetric group would refute the central descent claim for symmetric groups.

Watch this falsifier. Get emailed when new claim-graph text bears on it.

Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit.

Referee Report

0 major / 5 minor

Summary. The paper isolates a preservation principle: if a standard form F(X) admits a uniform definable reconstruction of its index X (or a proxy) from the abstract structure, then the class of structures isomorphic to some F(X) is downward absolute between transitive ZF-models. The Descent Lemma 2.3 formalizes this under old-part absoluteness F^M(Y)=F^N(Y)∩M. The main application (Theorem 3.3 / Corollary 3.4) answers Schweber’s question: no group that fails to be a full symmetric group in a ZF ground model can become one after forcing; the same reconstruction yields a uniform Π^{1}_{1} definition of fullness. Parallel ZF-descent is proved for transformation monoids, powerset Boolean algebras, relation algebras, full clones, partition lattices, products R^X of finitely generated centrally indecomposable rings, ℓ_∞(X) and c_0(X), endomorphism rings, B(H) and K(H), and ℓ_1 as a Banach lattice. Section 4 supplies clean ZFC-only descent examples (finite covers Y imes n, bare ℓ_1 and c_00) together with explicit ZF torsor obstructions, and records the corresponding relative failures of uniform Π^{1}_{1}-definability.

Significance. The note cleanly unifies a large catalogue of standardness predicates under a single elementary mechanism and settles a concrete question of Schweber already in ZF. The Π^{1}_{1} definition of fullness (Corollary 3.4) is a genuine strengthening of mere descent and is of independent interest for definability over transitive models. The torsor examples (finite covers, c_00 sign torsors) cleanly separate ZF-failure from ZFC-descent without completeness caveats, giving a useful template for future work. The catalogue is broad enough to be useful across algebra, operator algebras and Banach-space theory, while remaining technically elementary.

minor comments (5)
  1. Lemma 3.1: the verification that τ isolates transpositions is carefully written for infinite X, but a one-sentence pointer that the same formula works for |X|≥8 (as used in Corollary 3.4) would make the finite/infinite transition fully self-contained.
  2. Remark 2.4 (K(H) case): the finite-rank coding via Riesz is standard, yet a brief explicit note that the argument uses only the ZF-available finite-dimensional Riesz theorem would forestall residual choiceless worries.
  3. Table on p. 3: the entry for Hilbert-space isomorphism with ℓ_{2}(Γ) correctly flags the basis-existence issue; a cross-reference to Proposition 4.8 would help the reader locate the precise statement.
  4. Section 6, Question 6.1: the suggested syntactic criterion (single-sorted definable skeleton) is attractive; a short remark relating it to Rubin’s reconstruction theorems already cited would strengthen the open-problem paragraph.
  5. Typographical: “pastebee” in the acknowledgements is presumably a username; if it is a real person, a conventional name would be preferable.

Circularity Check

0 steps flagged

No circularity: descent follows from explicit first-order reconstruction plus the elementary Descent Lemma, all carried out inside the paper.

full rationale

The central claim (Theorem 1.1 / 3.3 and the ZF-catalogue) is obtained by (i) writing an absolute first-order formula that recovers a proxy for the index set X from the abstract structure F(X) and (ii) applying the Descent Lemma 2.3, whose only hypothesis is the elementary old-part equality F^M(Y)=F^N(Y)∩M verified case-by-case in Remark 2.4. Both steps are self-contained constructions performed in the present text; they do not fit parameters to data, invoke an author-only uniqueness theorem as an axiom, or rename a known empirical pattern. Background citations (Shelah, McKenzie, Rubin, Fuchs–Hamkins) supply historical context or contrast and are not load-bearing for the descent statements. The Π^{1}_{1} definition of fullness (Corollary 3.4) is likewise an explicit second-order sentence built from the same reconstruction. The torsor counter-examples of Section 4 are independent constructions that separate ZF from ZFC and do not feed back into the positive theorems. Consequently the derivation chain contains no circular step.

Axiom & Free-Parameter Ledger

0 free parameters · 4 axioms · 0 invented entities

Pure ZF/ZFC mathematics. No fitted parameters. Background axioms are standard set theory plus classical algebraic characterizations of the listed structures; the paper's contribution is the reconstruction maps and the descent applications, not new physical or ad-hoc entities.

axioms (4)
  • standard math ZF (and ZFC where stated) as the ambient theory of transitive models
    Framework of Sections 2–5; all descent and obstruction statements are relative to nested transitive models of ZF or ZFC.
  • domain assumption First-order isolation of transpositions in infinite Sym(X) via the involution-and-conjugate-product formula τ
    Lemma 3.1; load-bearing for Theorem 3.3 and Corollary 3.4. Proved in the paper, building on classical facts about products of transpositions.
  • domain assumption Old-part absoluteness F^M(Y)=F^N(Y)∩M for Sym, powersets, End, B(H), K(H), ℓ1, etc.
    Remark 2.4 and Convention 2.1 (named scalars); required by Descent Lemma 2.3 in every positive theorem.
  • domain assumption Existence of transitive ZF models with a family of pairs without choice function and outer models adding a selector (for obstruction corollaries)
    Standard symmetric-model fact, cited via Jech/Howard–Rubin; used only for relative non-Π¹₁ and ZF-failure statements in Section 5.

pith-pipeline@v1.1.0-grok45 · 23089 in / 2571 out tokens · 43934 ms · 2026-07-14T18:31:00.099906+00:00 · methodology

0 comments
Cite this review

Pith. "Pith review of Canonical reconstruction and forcing absoluteness of standard structures." pith.science (2026). https://pith.science/paper/ATJC6J6U

@misc{pith2026260602898,
  author       = {Pith},
  title        = {Pith review of: Canonical reconstruction and forcing absoluteness of standard structures},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/ATJC6J6U}},
  note         = {Machine review of arXiv:2606.02898}
}
Share X Bluesky LinkedIn Reddit HN
read the original abstract

We isolate a simple preservation principle governing when it is absolute, between transitive models of set theory, that a given algebraic or topological-algebraic structure has a standard form $F(X)$ indexed by a set $X$. The principle is: if the index $X$ (or a proxy for it) can be recovered from $F(X)$ by a uniform definable construction, then the class of structures isomorphic to some~$F(X)$ is downward absolute from forcing extensions. Answering a question raised by Noah Schweber, we deduce in particular that no group that fails to be a full symmetric group in the ground model can become one after forcing; the result holds already in ZF. The same mechanism applies to full transformation monoids, powerset Boolean algebras, full relation algebras, full clones, full partition lattices, products $R^X$ of finitely generated centrally indecomposable rings, the commutative $C^*$-algebras $\ell_\infty(X)$ and $c_0(X)$, full endomorphism rings, the operator algebras $\mathcal{B}(H)$ and $\mathcal{K}(H)$, and $\ell_1(X)$ as a real Banach lattice. In the motivating symmetric-group case, the same reconstruction gives more than descent: it yields a uniform $\Pi^1_1$ definition of fullness over transitive ZF-models. We then exhibit clean torsor obstructions, in the standard symmetric-model situation: finite covers $Y \times n$ already separate ZF-failure from ZFC-descent without any completeness caveat, and the finite-support normed space $c_{00}(I)$ provides the analogous Banach example. Bare-Banach-space isomorphism with $\ell_1(\Gamma)$ exhibits a genuine ZFC-descent. We conclude with the corresponding, relative, obstructions to $\Pi^1_1$-definability of standardness over transitive ZF-models.

Review history (2 revisions) →

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

17 extracted references

  1. [1]

    J. T. Baldwin, M. C. Laskowski, and S. Shelah,Forcing isomorphism, J. Symbolic Logic58(1993), no. 4, 1291–1301

    1993

  2. [2]

    J. D. Dixon and B. Mortimer,Permutation Groups, Graduate Texts in Mathematics, vol. 163, Springer, New York, 1996

    1996

  3. [3]

    R. J. Fleming and J. E. Jamison,Isometries on Banach Spaces: function spaces, Chapman & Hall/CRC Monographs and Surveys in Pure and Applied Mathematics, vol. 129, Chapman & Hall/CRC, Boca Raton, FL, 2003

    2003

  4. [4]

    Fuchs and J

    G. Fuchs and J. D. Hamkins,Changing the heights of automorphism towers by forcing with Souslin trees overL, J. Symbolic Logic73(2008), no. 2, 614–633

    2008

  5. [5]

    Hodges,Model Theory, Encyclopedia of Mathematics and its Applications, vol

    W. Hodges,Model Theory, Encyclopedia of Mathematics and its Applications, vol. 42, Cambridge Uni- versity Press, Cambridge, 1993

    1993

  6. [6]

    Howard and J

    P. Howard and J. E. Rubin,Consequences of the Axiom of Choice, Mathematical Surveys and Monographs, vol. 59, Amer. Math. Soc., Providence, RI, 1998

    1998

  7. [7]

    Jech,Set Theory, the third millennium edition, Springer Monographs in Mathematics, Springer, Berlin, 2003

    T. Jech,Set Theory, the third millennium edition, Springer Monographs in Mathematics, Springer, Berlin, 2003

    2003

  8. [8]

    Jech,The Axiom of Choice, Studies in Logic and the Foundations of Mathematics, vol

    T. Jech,The Axiom of Choice, Studies in Logic and the Foundations of Mathematics, vol. 75, North- Holland, Amsterdam, 1973

    1973

  9. [9]

    R. V. Kadison and J. R. Ringrose,Fundamentals of the Theory of Operator Algebras, Volume I: Elementary Theory, Graduate Studies in Mathematics, vol. 15, Amer. Math. Soc., Providence, RI, 1997

    1997

  10. [10]

    Kunen,Set Theory, Studies in Logic, vol

    K. Kunen,Set Theory, Studies in Logic, vol. 34, College Publications, London, 2011

    2011

  11. [11]

    Lindenstrauss and L

    J. Lindenstrauss and L. Tzafriri,Classical Banach Spaces I and II, Classics in Mathematics, Springer, Berlin, 1996

    1996

  12. [12]

    H. D. Macpherson and P. M. Neumann,Subgroups of infinite symmetric groups, J. London Math. Soc. (2)42(1990), no. 1, 64–84

    1990

  13. [13]

    McKenzie,On elementary types of symmetric groups, Algebra Universalis1(1971), 13–20

    R. McKenzie,On elementary types of symmetric groups, Algebra Universalis1(1971), 13–20

    1971

  14. [14]

    Rubin,The reconstruction of trees from their automorphism groups, Contemporary Mathematics, vol

    M. Rubin,The reconstruction of trees from their automorphism groups, Contemporary Mathematics, vol. 151, Amer. Math. Soc., Providence, RI, 1993

    1993

  15. [15]

    W. R. Scott,Group Theory, Dover Publications, New York, 1987

    1987

  16. [16]

    Shelah,First order theory of permutation groups, Israel J

    S. Shelah,First order theory of permutation groups, Israel J. Math.14(1973), 149–162; erratum, Israel J. Math.15(1973), 437–441

    1973

  17. [17]

    Szendrei,Clones in Universal Algebra, S´ eminaire de Math´ ematiques Sup´ erieures, vol

    ´A. Szendrei,Clones in Universal Algebra, S´ eminaire de Math´ ematiques Sup´ erieures, vol. 99, Presses de l’Universit´ e de Montr´ eal, Montreal, 1986. 22 T. KANIA (T. Kania)Mathematical Institute, Czech Academy of Sciences, ˇZitn´a 25, 115 67 Praha 1, Czech Republic and Institute of Mathematics and Computer Science, Jagiellonian University, Lojasiewicz...

    1986