pith. sign in

arxiv: 2506.04692 · v3 · submitted 2025-06-05 · 🧮 math.LO

Weak, strong and mixed extensions of relations to spaces of ultrafilters

Leonardo Raffaello Maximilian Gasparro , Lorenzo Luperi Baglini This is my paper

Pith reviewed 2026-05-19 11:39 UTC · model grok-4.3

classification 🧮 math.LO
keywords ultrafiltersrelationsnonstandard methodsextensionscongruencesweak extensionsstrong extensionsmixed extensions
0
0 comments X

The pith

Nonstandard methods characterize extensions of arbitrary relations to ultrafilter spaces.

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

The paper shows that nonstandard methods previously developed for congruences can be used to characterize the weak, strong, and mixed extensions of arbitrary relations to spaces of ultrafilters, including how these extensions relate to one another. A sympathetic reader would care because this removes the earlier limitation to congruences and offers a uniform approach for studying relations in ultrafilter contexts. If the claim holds, researchers gain a direct way to describe extension properties without inventing new tools for each type of relation.

Core claim

The nonstandard methods used to characterize properties of weak, strong and mixed extensions of congruences to ultrafilters can be applied in the same way to characterize the extensions of arbitrary relations and their interplay.

What carries the argument

Nonstandard methods that characterize weak, strong and mixed extensions of relations to ultrafilter spaces, generalized from the congruence case.

If this is right

  • Arbitrary relations admit well-defined weak, strong and mixed extensions to spaces of ultrafilters.
  • The interplay among these three kinds of extensions follows the same structural patterns observed for congruences.
  • No extra restrictions on the relation are needed for the nonstandard characterization to apply.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The same nonstandard approach might extend to other set-theoretic objects such as filters or ideals that interact with ultrafilters.
  • A concrete test would be to pick a specific non-congruence relation, compute its extensions directly, and check whether the nonstandard formulas recover them.
  • Results could link to existing work on ultrafilters in combinatorial number theory or model theory where general relations appear.

Load-bearing premise

The nonstandard methods developed for congruences generalize directly to arbitrary relations without requiring additional restrictions or modifications.

What would settle it

An explicit relation whose weak, strong or mixed extension to the ultrafilter space fails to match the description given by the nonstandard methods.

read the original abstract

The use of nonstandard methods to characterize properties of weak, strong and mixed extensions of congruences to ultrafilters has been the main topic of several recent papers. We show that similar methods can be used to characterize the extensions of arbitrary realtions and their interplay.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

1 major / 2 minor

Summary. The manuscript extends nonstandard methods previously developed for congruences to characterize the weak, strong, and mixed extensions of arbitrary binary relations to spaces of ultrafilters, along with the interplay among these extensions.

Significance. If the generalization holds without additional restrictions, the work would broaden the scope of nonstandard techniques from equivalence relations to general binary relations, providing a unified approach to ultrafilter extensions in logic and set theory. This builds directly on recent congruence-focused papers and could enable applications to non-symmetric or non-transitive structures.

major comments (1)
  1. [Main results / Theorem on mixed extensions] The central claim that similar nonstandard methods suffice for arbitrary relations (rather than congruences) is load-bearing, yet the construction of the ultrafilter-based extension in the main results section appears to reuse steps that may implicitly rely on reflexivity or transitivity when defining limits or equivalence classes; this requires explicit verification or counterexamples for general R to support the generalization.
minor comments (2)
  1. [Abstract] Typo in the abstract: 'realtions' should read 'relations'.
  2. [Introduction] The introduction would benefit from a concrete example of a non-congruence relation to illustrate the claimed extension.

Simulated Author's Rebuttal

1 responses · 0 unresolved

We thank the referee for the careful reading and the constructive comment on the generalization to arbitrary relations. We address the point directly below.

read point-by-point responses

  1. Referee: [Main results / Theorem on mixed extensions] The central claim that similar nonstandard methods suffice for arbitrary relations (rather than congruences) is load-bearing, yet the construction of the ultrafilter-based extension in the main results section appears to reuse steps that may implicitly rely on reflexivity or transitivity when defining limits or equivalence classes; this requires explicit verification or counterexamples for general R to support the generalization.

    Authors: We thank the referee for raising this important clarification. The constructions and proofs in Sections 3 and 4 are formulated for an arbitrary binary relation R on a set X, without any appeal to reflexivity or transitivity. The weak, strong, and mixed extensions are defined via the nonstandard monad of the ultrafilter, and the characterizations (including the main theorem on mixed extensions) proceed by direct transfer of the relation membership condition; no equivalence-class or limit properties that would require reflexivity/transitivity are invoked. To make this explicit, we will add a short remark after Definition 3.1 and a brief verification paragraph in the proof of Theorem 4.3 confirming that the steps hold verbatim for general R. We will also include a short example (a non-reflexive, non-transitive relation on a three-element set) showing that the resulting ultrafilter extensions differ from the congruence case, thereby supporting the claimed generality. revision: yes

Circularity Check

0 steps flagged

Generalization of nonstandard methods from congruences to arbitrary relations framed as extension of prior independent work

full rationale

The abstract positions the work as applying similar nonstandard methods from several recent papers on congruences to characterize extensions of arbitrary relations. No load-bearing derivation step reduces by construction to a fitted parameter, self-definition, or unverified self-citation chain within the provided text. The central claim of direct generalization is presented without equations that equate new results to prior inputs by renaming or fitting. Self-citations to congruence papers are noted but treated as background rather than the sole justification for the arbitrary-relation case, keeping the overall circularity low.

Axiom & Free-Parameter Ledger

0 free parameters · 0 axioms · 0 invented entities

No free parameters, axioms, or invented entities are identifiable from the abstract; the work appears to rely on background nonstandard analysis and ultrafilter theory from prior literature.

pith-pipeline@v0.9.0 · 5561 in / 939 out tokens · 38337 ms · 2026-05-19T11:39:28.522427+00:00 · methodology

discussion (0)

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

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

What do these tags mean?
matches
The paper's claim is directly supported by a theorem in the formal canon.
supports
The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends
The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses
The paper appears to rely on the theorem as machinery.
contradicts
The paper's claim conflicts with a theorem or certificate in the canon.
unclear
Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.

Reference graph

Works this paper leans on

12 extracted references · 12 canonical work pages · 3 internal anchors

  1. [1]

    Hypernatural numbers as ultrafilters.Nonstandard anal- ysis for the working mathematician, pages 443–474, 2015

    Mauro Di Nasso. Hypernatural numbers as ultrafilters.Nonstandard anal- ysis for the working mathematician, pages 443–474, 2015

    work page 2015

  2. [2]

    Self-divisible ultrafilters and congruences in

    Mauro Di Nasso, Lorenzo Luperi Baglini, Rosario Mennuni, Moreno Pier- obon, and Mariaclara Ragosta. Self-divisible ultrafilters and congruences in. The Journal of Symbolic Logic, pages 1–18, 2023

    work page 2023

  3. [3]

    Hyperintegers and Nonstandard Techniques in Combinatorics of Numbers

    Lorenzo Luperi Baglini. Hyperintegers and nonstandard techniques in com- binatorics of numbers.arXiv preprint arXiv:1212.2049, 2012. 19

    work page internal anchor Pith review Pith/arXiv arXiv 2049

  4. [4]

    Nonstandard characterisations of tensor products and monads in the theory of ultrafilters

    Lorenzo Luperi Baglini. Nonstandard characterisations of tensor products and monads in the theory of ultrafilters. Mathematical Logic Quarterly, 65(3):347–369, 2019

    work page 2019

  5. [5]

    On ultrafilter extensions of first- order models and ultrafilter interpretations

    Nikolai L Poliakov and Denis I Saveliev. On ultrafilter extensions of first- order models and ultrafilter interpretations. Archive for Mathematical Logic, 60(5):625–681, 2021

    work page 2021

  6. [6]

    Skies, constellations and monads

    Christian W Puritz. Skies, constellations and monads. InStudies in Logic and the Foundations of Mathematics, volume 69, pages 215–243. Elsevier, 1972

    work page 1972

  7. [7]

    Divisibility in the stone-čech compactification.Reports on Mathematical Logic, (50):53–66, 2015

    Boris Šobot. Divisibility in the stone-čech compactification.Reports on Mathematical Logic, (50):53–66, 2015

    work page 2015

  8. [8]

    Divisibility orders in $\beta N$

    Boris Šobot. Divisibility orders inβN. arXiv preprint arXiv:1511.01731, 2015

    work page internal anchor Pith review Pith/arXiv arXiv 2015

  9. [9]

    Boris Šobot.˜︁| -divisibility of ultrafilters.arXiv preprint arXiv:1703.05999, 2017

    work page internal anchor Pith review Pith/arXiv arXiv 2017

  10. [10]

    Divisibility inβN and ∗N

    Boris Šobot. Divisibility inβN and ∗N. Reports on Mathematical Logic, (54):65–82, 2019

    work page 2019

  11. [11]

    More number theory inβN

    Boris Šobot. More number theory inβN. arXiv preprint arXiv:1910.01094, 2019

    work page arXiv 1910

  12. [12]

    Congruence of ultrafilters.The Journal of Symbolic Logic, 86(2):746–761, 2021

    Boris Šobot. Congruence of ultrafilters.The Journal of Symbolic Logic, 86(2):746–761, 2021. 20

    work page 2021