Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2610.30138

On the formal definition of average function for interval data

Sergio F. Alonso·Susana Montes·Susana Diaz-Vazquez
View original source ↗Read source document ↗Export metadata ↓

Abstract

This paper addresses the formal definition of average functions for interval data, extending classical aggregation theory beyond precise numerical values to the more general setting of real-valued intervals. Recognizing that interval data nat- urally arise in contexts involving imprecision or uncertainty, we examine how established notions of averages and aggregation functions can be generalized when the underlying domain is no longer restricted to the unit interval, but instead encompasses the entire real line. We analyze the impact of different admissible orders on intervals, particularly focusing on the lattice order and several total orders, and provide rigorous definitions of idempotency and mono- tonicity in this context. Furthermore, we adapt and study classical families of aggregation operators such as power means, minimum, maximum, and median to the interval setting, characterizing when these operators satisfy the properties required of average functions for intervals. Our results highlight that the choice of order plays a crucial role in the behavior and suitability of these operators. This work lays a foundation for the systematic aggregation of interval-valued information, with potential applications in statistics, decision making, and fields where data imprecision is inherent.

Explore related subjects

math.GM

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Sergio F. Alonso, Susana Montes, Susana Diaz-Vazquez. 2026-07-29. On the formal definition of average function for interval data. https://arxiv.org/abs/2610.30138

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Collatz/Bařina a$n$+b conjecture proofs by 16/64: Cayley a$n$+b tree not Cantor-Gödel-Conway-Wolfram undecidable

Lothar Collatz considered biperiodic iterations, and conjectured that picturing $n\mathrm{\to3}n\mathrm{+1}$ iterations for odd numbers and $n\mathrm{\to}n/2$ for even numbers, and proving that all natural numbers have a root path to the `trivial' cyclic root $(c=4)\to2\to1\to c\to\dots$, would connect elementary graph theory and number theory. John H. Conway replied that a$n$+b conjectures, except 1$n$+1, are undecidable due to a-periodic even $a\,\nmid\;$n$=a$n$_\text{odd}$+b successors. Biperiodic a$n$+b conjectures give disproofs of undecidability by Cantor diagonals, Gödel numbers, Conway unpredictability, and Wolfram irreducibility. The Cayley tree of Collatz-Conway $a\,\nmid\;$n$=a$n$_\text{odd}$+b numbers paired with Cantor binary tree numbers $y_{\ge0}$ is the $E=V=F=\mathbb{N}_0$ tree $T_{\ge 0}$ with its cyclic root $c=1a+1$ paired with $0$ and arrows ($E$dges) to wondrously ordered same-colour arrowhead nodes $a\,\nmid\;$n$=a$n$_\text{odd}$+b ($V$ertices) with same-numbered upwardly open sites above (sur$F$aces), paired with well-ordered root paths $y$, projecting to the Cartesian $y$-axis well-ordered sites $n$, paired with wondrously ordered root paths $y$. Tree $T_{\ge0}$ transforms into the integer Cartesian upper half graph $C_H$, providing a Hamiltonian tour from and back to the root $c$ at its origin $(0,0)$. The infinite Turing-Leibniz tape $T_L$ of proven $an_{odd}+b$ conjectures shows Turing-computable roots $c_{η\ge1}=2^{2^{η-1}+1}$ and $c$-expressible lowest trunk nodes $c^2$, 'cotree density' Hamiltonian tour proofs, and 'root-trunk' proofs $c^2<\frac{c}{2}(c-1)^2$. The $c$-roots generate also proven Mersenne prime $a=c-1$ conjectures: Collatz$_{\eta1}$ 3$n$+1 ($16<18$) and Bařina$_{\eta2}$ $7n\pm1$ ($64<196$).

math.GM↗
arXiv2026

Formalization of Langlands's Second Main Lemma for Local Epsilon Factors

We describe the Lean 4 formalization of Langlands's Second Main Lemma for local epsilon factors over nonarchimedean local fields, in mixed and equal characteristic. The lemma compares the induction expressions attached to compatible characters of the intermediate fields of a bicyclic extension of prime-square degree. We explain the mathematical constructions and comparisons that constitute the proof, and identify their Lean declarations.

math.GM↗
arXiv2026

A Local Proof of Langlands's First Main Lemma for Local Epsilon Factors over Nonarchimedean Local Fields

We give a complete local proof of Langlands's First Main Lemma for local epsilonfactors over nonarchimedean local fields. The proof builds on Dwork's p-adic calculations and Langlands's formulation of the local method. The present paper reformulates these calculations in a common normalization and extends the argument to equal characteristic. A more systematic treatment of stationary parameters and conductor cases is intended to make the calculations easier to follow. The author has also completed a local proof of Langlands's Second Main Lemma. Together with the present result and Langlands's remaining reductions, this gives a complete proof of the local construction of local epsilon factors envisioned by Langlands.

math.GM↗