Next Article in Journal
Wilf Classes for Level Sequences Avoiding Patterns of Length Three
Previous Article in Journal
Dynamic Credit Decision-Making with Continuous Risk Preference: A Unified Framework of Entropy-Regularized HJB and Soft Actor-Critic
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

A Baire Category Approach to Rounded Discrete Max Domains of Attraction

1
Department of Mathematics, Howard University, Washington, DC 20059, USA
2
Department of Statistics and Data Science, Yale University, 219 Prospect Street, New Haven, CT 06511, USA
*
Author to whom correspondence should be addressed.
Mathematics 2026, 14(11), 1982; https://doi.org/10.3390/math14111982
Submission received: 2 April 2026 / Revised: 14 May 2026 / Accepted: 20 May 2026 / Published: 4 June 2026
(This article belongs to the Section D1: Probability and Statistics)

Abstract

We study a topological problem in discrete extreme value theory. Let P ( N ) denote the space of probability laws on N , endowed with the total variation metric d TV . Fix a rounding map r, either the ceiling map or the nearest-integer map. We consider the rounded discrete max-domain-of-attraction class D r P ( N ) , consisting of all laws of the form law ( r ( Y ) ) , where the parent law of Y belongs to a classical max domain of attraction MDA ( G ξ ) for some generalized extreme value shape ξ . The main result of this note is that, for the ceiling and midpoint rounding schemes, each class D r is meager in P ( N ) , while remaining dense; this mirrors the continuous picture of Leonetti and Khorrami Chokami. The proof is based on the Baire category theorem: we construct a comeager subset of P ( N ) by forcing infinitely many incompatible dyadic tail ratios on disjoint far-out windows; such behavior cannot occur for any rounded law arising from a single classical max domain of attraction. We also record the corresponding Banach–Mazur game interpretation and explain why the argument applies to the rounded schemes (Types B and C) rather than to the sampled-density discretization (Type A).

1. Introduction

Classical univariate extreme value theory classifies continuous laws according to the possible nondegenerate limits of affine normalizations of maxima. If Y 1 , Y 2 , are i.i.d. with a common distribution function F, one asks whether there exist constants a n > 0 and b n R , such that
F n ( a n x + b n ) G ξ ( x )
at continuity points of a generalized extreme value (GEV) law G ξ . The three possible limit types are Fréchet ( ξ > 0 ), Gumbel ( ξ = 0 ), and Weibull ( ξ < 0 ). For a background on classical max domains of attraction, we refer to Anderson [1,2], de Haan and Ferreira [3], and Resnick [4].
For integer-valued data, the classical continuous convergence picture is often too rigid. Even when the tail is clearly “Fréchet-like” or “Gumbel-like,” lattice effects can prevent exact convergence to a continuous limit. One response is to pass from the continuous GEV family to discrete analogs obtained by rounding or binning a continuous GEV variable. Another is to define a rounded discrete max domain of attraction by embedding the discrete law into a rounded continuous parent already lying in a classical max domain of attraction.
Such integer-valued data arise in many natural settings: counts of insurance claims, exceedance counts in environmental monitoring, integer-rounded financial tick data, daily rainfall in millimeters, and the number of failures in network reliability studies. In all such cases the underlying physical or economic mechanism may be continuous, but the recorded values are intrinsically discrete. This can arise because of finite measurement precision, currency quantization, or counting itself. Discrete extreme value theory addresses these settings; foundational work goes back to Anderson [1,2]. Anderson’s analysis showed in particular that integer-rounded versions of geometric and Poisson-like laws inherit the tail asymptotics of their continuous parents, foreshadowing the survival-function identity formalized in Lemma 1 below. A natural modeling strategy is to view the observed discrete law as the image of a continuous parent under a rounding transform, and ask which properties of the continuous parent—in particular, its max domain of attraction—transfer to the discrete observation. The classes D B and D C defined below capture exactly this “rounded” structure.
The purpose of this note is topological. We work on the infinite-dimensional simplex P ( N ) , equipped with total variation distance, and ask how large the rounded class is from the point of view of the Baire category. The surprising answer is that the class is topologically small—it is meager. The continuous analog was established by Leonetti and Khorrami Chokami [5]: the max domain of attraction is dense yet of the first Baire category in the space of Borel probability measures on R k . The present note proves the discrete counterpart of the meagerness statement: each rounded class D r is meager in P ( N ) .
We also show that each rounded class D r is dense in P ( N ) (Proposition 2), so the rounded classes are dense yet meager; this mirrors the continuous picture of Leonetti and Khorrami Chokami [5].
The key point is that a law obtained by rounding a continuous parent in a single classical max domain of attraction has one eventual tail regime. In contrast, a generic law on N can be forced to exhibit infinitely many incompatible local tail patterns. By building a comeager set of such oscillatory laws, we exclude the rounded class.

2. The Ambient Space

Definition 1. 
Let
P ( N ) = P = ( p 1 , p 2 , ) : p k 0 , k 1 p k = 1 .
We equip P ( N ) with the total variation metric
d TV ( P , Q ) = 1 2 k 1 | p k q k | .
For P P ( N ) and X P , we write
P ¯ ( n ) : = P ( X > n ) , n N 0 .
The bar over P is a typographical device used solely to denote the survival function and does not refer to a transformed measure; the underlying measure is still P.
Since P ( N ) is a closed subset of 1 , it is a complete separable metric space and, hence, a Baire space.

3. Three Discrete GEV Constructions and Scope

We first set up notation for the continuous GEV family, then define the three discrete GEV constructions, and finally define the rounded embedding classes that are the main objects of the meagerness theorem. The reader should carefully distinguish the finite-parameter discrete GEV families from the larger embedding classes.

3.1. Continuous GEV Notation

Let f c ( · ; μ , σ , ξ ) and F c ( · ; μ , σ , ξ ) denote the continuous GEV density and cdf with location μ R , scale σ > 0 , and shape ξ R . Define the admissible support set
K ( ξ ) = { k N : 1 + ξ ( k μ ) / σ > 0 } .
For ξ 0 , one has K ( ξ ) = N ; for ξ < 0 , the set K ( ξ ) is finite.

3.2. The Three Parametric Families

Definition 2 
(Parametric discrete GEV families). The three parametric discrete GEV families are the following subsets of P ( N ) :
(a)
Type A (sampled-density renormalization):
p A ( k ; μ , σ , ξ ) = C ( μ , σ , ξ ) f c ( k ; μ , σ , ξ ) , k K ( ξ ) ,
where C ( μ , σ , ξ ) = j K ( ξ ) f c ( j ; μ , σ , ξ ) 1 .
(b)
Type B (ceiling discretization):
p B ( k ; μ , σ , ξ ) = F c ( k ; μ , σ , ξ ) F c ( k 1 ; μ , σ , ξ ) 1 F c ( 0 ; μ , σ , ξ ) , k K ( ξ ) ,
whenever 1 F c ( 0 ; μ , σ , ξ ) > 0 .
(c)
Type C (midpoint discretization):
p C ( k ; μ , σ , ξ ) = F c ( k + 1 2 ; μ , σ , ξ ) F c ( k 1 2 ; μ , σ , ξ ) 1 F c ( 1 2 ; μ , σ , ξ ) , k K ( ξ ) ,
whenever 1 F c ( 1 2 ; μ , σ , ξ ) > 0 .
We write A = { p A ( · ; μ , σ , ξ ) } , B = { p B ( · ; μ , σ , ξ ) } , and C = { p C ( · ; μ , σ , ξ ) } for the three parametric families, regarded as subsets of P ( N ) .
Types B and C arise from rounding a GEV random variable: if X GEV ( μ , σ , ξ ) , then Type B is the law of X conditional on X > 0 , while Type C is the law of ρ C ( X ) conditional on X > 1 2 .

3.3. The Rounded Embedding Classes

The meagerness theorem concerns not merely the parametric families above, but the much larger classes obtained by rounding any continuous parent law already lying in some classical max domain of attraction.
For y R , define the midpoint rounding map  ρ C : R Z by
ρ C ( y ) : = y + 1 2 ,
i.e., the unique integer n satisfying n 1 2 y < n + 1 2 . With this convention ties at half-integers y 1 2 + Z are broken upward: ρ C ( n + 1 2 ) = n + 1 . Since every parent Y considered in this paper is absolutely continuous, Pr ( Y 1 2 + Z ) = 0 and the tie-breaking convention is immaterial for all distributional statements that follow.
Definition 3 
(Rounded embedding classes). Define two transforms on continuous distribution functions:
T B ( F ) = law Y Y > 0 , T C ( F ) = law ρ C ( Y ) Y > 1 2 ,
whenever the conditioning events have positive probability and Y F . The corresponding rounded discrete max-domain-of-attraction classes are
D B = T B ( F ) : F MDA ( G ξ ) f o r s o m e ξ R , D C = T C ( F ) : F MDA ( G ξ ) f o r s o m e ξ R .
We also write D = D B D C .
Remark 1 
(Well-definedness of T r ). The transforms T B and T C produce elements of P ( N ) whenever the relevant conditioning event has positive probability.
For r = B : if F ¯ ( 0 ) > 0 , then Y Y > 0 takes values in N = { 1 , 2 , 3 , } , with
T B ( F ) ( { n } ) = F ( n ) F ( n 1 ) F ¯ ( 0 ) , n 1 .
Non-negativity follows from monotonicity of F. The values sum to 1:
n = 1 T B ( F ) ( { n } ) = 1 F ¯ ( 0 ) n = 1 F ( n ) F ( n 1 ) = 1 F ( 0 ) F ¯ ( 0 ) = 1 .
For r = C : if F ¯ ( 1 2 ) > 0 , then ρ C ( Y ) Y > 1 2 takes values in N , with
T C ( F ) ( { n } ) = F ( n + 1 2 ) F ( n 1 2 ) F ¯ ( 1 2 ) , n 1 .
Non-negativity and total mass 1 follow by the same telescoping argument:
n = 1 T C ( F ) ( { n } ) = 1 F ¯ ( 1 2 ) n = 1 F ( n + 1 2 ) F ( n 1 2 ) = F ¯ ( 1 2 ) F ¯ ( 1 2 ) = 1 .
The conditioning events { Y > 0 } and { Y > 1 2 } have positive probability for any continuous F MDA ( G ξ ) with unbounded right endpoint (Fréchet ξ > 0 , or Gumbel ξ = 0 with x F = ), and for finite-endpoint parents whose right endpoint exceeds 0 (resp. 1 2 ). When the conditioning event has zero probability, T r ( F ) is undefined and is excluded from D r .
Remark 2 
(Scope). The inclusions
B D B P ( N ) a n d C D C P ( N )
hold. The embedding classes D B and D C are much larger than the parametric families: they contain the rounded image of every continuous parent law in some classical max domain of attraction, not only the GEV distributions themselves.
Remark 3 
(The Type A family is not addressed). Sampled-density discretization (Type A) does not arise from a rounding transform, and the meagerness argument below does not extend to it. The reason is structural. For r { B , C } , the rounding construction produces the survival-function identity
P ¯ ( n ) = F ¯ ( c r ( n ) ) F ¯ ( c r ) , c B ( n ) = n , c C ( n ) = n + 1 2 ,
which expresses the discrete tail as a ratio of continuous tails. Regular and rapid variation of F ¯ then transfer directly to P ¯ via this ratio, giving the trichotomy of dyadic regimes used in Lemma 3. By contrast, Type A is defined by p A ( k ) = C f c ( k ) , so the discrete survival function is a Riemann-type sum of the continuous density rather than a ratio of continuous survival functions; there is no analogous clean transfer of regular variation, and the dyadic ratio R P ( N ) need not have a single eventual limit even when the parent density is regularly varying. Whether A is meager in P ( N ) remains open; see Section 10.

4. A Correction for the Type A Normalizing Constant

Proposition 1 
(Type A is well defined for all admissible parameters). Fix μ R , σ > 0 , and ξ R , and assume K ( ξ ) . Then,
0 < j K ( ξ ) f c ( j ; μ , σ , ξ ) < .
Consequently the Type A normalizing constant C ( μ , σ , ξ ) exists and is finite for every admissible ( μ , σ , ξ ) .
Proof. 
If ξ < 0 , then K ( ξ ) is finite, so the claim is immediate. If ξ = 0 , then the Gumbel density satisfies f c ( x ; μ , σ , 0 ) σ 1 exp ( ( x μ ) / σ ) , so j 1 f c ( j ; μ , σ , 0 ) converges by comparison with a geometric series. If ξ > 0 , then f c ( x ; μ , σ , ξ ) C μ , σ , ξ x 1 / ξ 1 as x , so the sampled series is comparable to a p-series with exponent 1 + 1 / ξ > 1 and therefore converges. □
Remark 4. 
The threshold ξ < 1 is the condition for the existence of the mean of a Fréchet-type law; it is not the condition for the Type A normalizing constant to be finite.

5. Tail Behavior: Regular and Rapid Variation

Fact 1 
(Regular variation; de Haan and Ferreira [3]). If F MDA ( G ξ ) with ξ > 0 , then F ¯ ( x ) : = 1 F ( x ) = x α L ( x ) for some α = 1 / ξ > 0 and a slowly varying function L. In particular, for every c > 0 ,
F ¯ ( c x ) F ¯ ( x ) c α ( x ) .
Fact 2 
(Rapid variation; Embrechts et al. [6]). If F MDA ( G 0 ) and F has an infinite right endpoint, then F ¯ is rapidly varying of index :
F ¯ ( c x ) F ¯ ( x ) 0 ( x ) f o r e v e r y c > 1 .
We briefly recall the proof of Fact 2. The standard characterization of MDA ( G 0 ) states that F MDA ( G 0 ) if and only if there exists a positive measurable auxiliary function a ( t ) , such that
lim t x F F ¯ t + x a ( t ) F ¯ ( t ) = e x for all x R ;
see de Haan and Ferreira [3] (Theorem 1.2.5). When x F = , the auxiliary function satisfies a ( t ) / t 0 as t [3] (Corollary 1.2.10). Fix c > 1 and write, for large t,
F ¯ ( c t ) F ¯ ( t ) = F ¯ t + x t a ( t ) F ¯ ( t ) , x t : = ( c 1 ) t a ( t ) .
Since a ( t ) / t 0 we have x t + . For any fixed x 0 > 0 ,
F ¯ ( c t ) F ¯ ( t ) F ¯ t + x 0 a ( t ) F ¯ ( t ) e x 0
for all sufficiently large t. Since x 0 is arbitrary, F ¯ ( c t ) / F ¯ ( t ) 0 .
Fact 3 
(Finite endpoint cases). If F MDA ( G ξ ) with ξ < 0 , then F has a finite right endpoint. If F MDA ( G 0 ) and F has a finite right endpoint, then the rounded law T r ( F ) has finite support for r { B , C } .
Together, Facts 1–3 yield a trichotomy for any rounded law P D r : the survival function is eventually regularly varying, eventually rapidly varying, or has finite support.
The following lemma transfers these continuous tail asymptotics to the rounded discrete survival function P ¯ . It is the technical backbone of the dyadic-ratio analysis in Section 6.
Lemma 1 
(Rounding preserves tail regimes). Let r { B , C } with c B = 0 and c C = 1 2 . Let F MDA ( G ξ ) be a continuous parent with F ¯ ( c r ) > 0 , and let P = T r ( F ) D r .
(Survival identity.) For every n N 0 ,
P ¯ ( n ) = F ¯ ( n + c r ) F ¯ ( c r ) .
(i) If ξ > 0 , then for every λ > 0 ,
F ¯ ( λ ( n + c r ) ) F ¯ ( n + c r ) λ α , n ,
where α = 1 / ξ , uniformly for λ in compact subsets of ( 0 , ) .
(ii) If ξ = 0 and F has infinite right endpoint, then for every λ > 1 ,
F ¯ ( λ ( n + c r ) ) F ¯ ( n + c r ) 0 , n .
(iii) If F has finite right endpoint, then P has finite support.
Proof. 
Survival identity. By the definition of T r , X is distributed as ρ r ( Y ) conditional on Y > c r , where Y F . Since ρ r ( Y ) > n if and only if Y > n + c r (with endpoint events of probability zero under continuity), and { Y > n + c r } { Y > c r } for n 0 ,
P ¯ ( n ) = P ( ρ r ( Y ) > n Y > c r ) = P ( Y > n + c r ) F ¯ ( c r ) = F ¯ ( n + c r ) F ¯ ( c r ) .
Case (i). By Fact 1, F ¯ is regularly varying with index α . Setting t n = n + c r , the result follows directly from Karamata’s uniform convergence theorem (de Haan and Ferreira [3]): F ¯ ( λ t ) / F ¯ ( t ) λ α uniformly for λ in any compact subset of ( 0 , ) .
Case (ii). By Fact 2, F ¯ ( μ t ) / F ¯ ( t ) 0 for every fixed μ > 1 . Setting t n = n + c r , F ¯ ( λ t n ) / F ¯ ( t n ) 0 for every λ > 1 as n .
Case (iii). If F has finite right endpoint x F , then F ¯ ( n + c r ) = 0 for all n + c r x F , hence P ¯ ( n ) = 0 for all sufficiently large n. □

6. The Dyadic Block Ratio

Definition 4. 
For P P ( N ) and N N , define
A P ( N ) = P ( N < X 2 N ) = P ¯ ( N ) P ¯ ( 2 N ) ,
B P ( N ) = P ( 2 N < X 4 N ) = P ¯ ( 2 N ) P ¯ ( 4 N ) .
Whenever A P ( N ) > 0 , define the dyadic block ratio
R P ( N ) = B P ( N ) A P ( N ) .
Lemma 2 
(Stability under far-tail surgery). If P , Q P ( N ) agree on { 1 , , 4 N } , then R P ( N ) = R Q ( N ) whenever these ratios are defined.
Proof. 
Both A P ( N ) and B P ( N ) depend only on masses at indices in { N + 1 , , 4 N } . □
Lemma 3 
(Single eventual ratio regime). Fix r { B , C } and let P D r .
(i)
If the parent lies in MDA ( G ξ ) with ξ > 0 , then R P ( N ) 2 α ( 0 , 1 ) for some α > 0 .
(ii)
If the parent lies in MDA ( G 0 ) with an infinite right endpoint, then R P ( N ) 0 .
(iii)
If the parent lies in MDA ( G ξ ) with ξ < 0 , or in MDA ( G 0 ) with a finite right endpoint, then P has finite support.
Proof. 
By Lemma 1, P ¯ inherits the tail regime of F ¯ , with P ¯ ( n ) = F ¯ ( n + c r ) / F ¯ ( c r ) . Substituting into the dyadic ratio,
R P ( N ) = P ¯ ( 2 N ) P ¯ ( 4 N ) P ¯ ( N ) P ¯ ( 2 N ) = F ¯ ( 2 N + c r ) F ¯ ( 4 N + c r ) F ¯ ( N + c r ) F ¯ ( 2 N + c r ) .
Case (i): ξ > 0 . By Lemma 1(i), for λ { 2 , 4 } ,
F ¯ ( λ ( N + c r ) ) F ¯ ( N + c r ) λ α .
Since ( 2 N + c r ) / ( N + c r ) 2 and ( 4 N + c r ) / ( N + c r ) 4 as N , regular variation of F ¯ with index α gives F ¯ ( 2 N + c r ) / F ¯ ( N + c r ) 2 α and F ¯ ( 4 N + c r ) / F ¯ ( N + c r ) 4 α = ( 2 α ) 2 . Dividing numerator and denominator by F ¯ ( N + c r ) ,
R P ( N ) 2 α 4 α 1 2 α = 2 α ( 1 2 α ) 1 2 α = 2 α .
Case (ii): ξ = 0 , infinite right endpoint. By Lemma 1(ii), each ratio in the preceding display tends to 0, so R P ( N ) 0 .
Case (iii): finite right endpoint. By Lemma 1(iii), P has finite support and R P ( N ) is eventually undefined. □

7. Open Dense Witness Sets

Fix two open intervals I , I + ( 0 , 1 ) with disjoint closures (we take I = ( 1 20 , 1 10 ) and I + = ( 1 4 , 1 3 ) for concreteness).
For each m N , define
U m = N m { P P ( N ) : A P ( N ) > 0 , R P ( N ) I } ,
U m + = N m { P P ( N ) : A P ( N ) > 0 , R P ( N ) I + } .
Lemma 4 
(Openness). For each m N , the sets U m and U m + are open in ( P ( N ) , d TV ) .
Proof. 
The maps P A P ( N ) and P B P ( N ) are continuous linear functionals on 1 . On the open set { P : A P ( N ) > 0 } , the ratio R P ( N ) is continuous, so { P : A P ( N ) > 0 , R P ( N ) I ± } is open. Taking the union over N m gives the result. □
Lemma 5 
(Density). For each m N , the sets U m and U m + are dense in ( P ( N ) , d TV ) .
Proof. 
We prove the claim for U m ; the proof for U m + is identical.
Fix P P ( N ) , ε > 0 , m N , and choose η ( 0 , ε / 4 ) . Since P ¯ ( N ) 0 , choose N m with
τ : = P ( N < X 4 N ) < η and P ( X N ) > η .
Fix c I and set a = ( τ + η ) / ( 1 + c ) , b = c ( τ + η ) / ( 1 + c ) , so b / a = c and a + b = τ + η . Since P ( X N ) > η , choose δ 1 , , δ N with 0 δ k p k and δ k = η . Define Q using
q k = p k δ k , 1 k N , a , k = N + 1 , b , k = 2 N + 1 , 0 , N < k 4 N , k { N + 1 , 2 N + 1 } , p k , k > 4 N .
Verification that Q P ( N ) . Non-negativity: for 1 k N , q k = p k δ k 0 by the choice 0 δ k p k . By construction, q N + 1 = a > 0 and q 2 N + 1 = b > 0 . The remaining indices in ( N , 4 N ] are assigned q k = 0 , and q k = p k 0 for k > 4 N .
Total mass:
k 1 q k = k = 1 N ( p k δ k ) + a + b + k > 4 N p k = k = 1 N p k η + ( τ + η ) + k > 4 N p k = k = 1 N p k + τ + k > 4 N p k = k = 1 N p k + k = N + 1 4 N p k + k > 4 N p k = k 1 p k = 1 ,
using k = 1 N δ k = η and τ = P ( N < X 4 N ) = k = N + 1 4 N p k .
Therefore Q P ( N ) . By construction A Q ( N ) = a > 0 and B Q ( N ) = b , so R Q ( N ) = b / a = c I , hence Q U m .
The total variation distance satisfies
2 d TV ( P , Q ) = k = 1 N δ k + k = N + 1 4 N | p k q k | η + ( τ + η + τ ) = 2 η + 2 τ < 4 η < ε .

8. The Meagerness Theorem

Recall from Definition 3 that T B is the rounded-law transform built from ceiling rounding (Type B) and T C from nearest-integer (midpoint) rounding (Type C); the classes D B and D C are the corresponding rounded discrete max-domain-of-attraction classes generated by these two schemes.
Theorem 1 
(Rounded discrete MDA classes are meager). The classes D B and D C are meager subsets of ( P ( N ) , d TV ) . Consequently, D = D B D C is meager as well.
Proof. 
Define
G = m = 1 U m U m + .
By Lemmas 4 and 5, each U m ± is open and dense. Since ( P ( N ) , d TV ) is a Baire space, G is comeager.
Let P G . For every m, there exist N m , M m m with R P ( N m ) I and R P ( M m ) I + . Since I ¯ I + ¯ = , the sequence { R P ( N ) } N admits no single eventual limit. Moreover, the membership P U m U m + for every m requires A P ( N ) > 0 at arbitrarily large scales N, so P cannot have finite support. By Lemma 3, no law in D B or D C exhibits this behavior: every element of D r either has R P ( N ) converging to a single limit (cases (i)–(ii)) or has finite support (case (iii)).
Therefore, G D B = and G D C = . Since G is comeager, its complement is meager, so D B , D C , and D are all meager. □
Corollary 1 
(Parametric families are meager). The parametric families B and C are meager subsets of P ( N ) .
Proof. 
By Remark 2, B D B and C D C . Apply Theorem 1. □
Proposition 2 
(Density via tail grafting). For r { B , C } , the rounded embedding class D r is dense in ( P ( N ) , d TV ) . Consequently D = D B D C is dense in ( P ( N ) , d TV ) .
Proof. 
Fix p P ( N ) and ε > 0 . We construct p D r such that d TV ( p , p ) < ε .
Choose N 2 large enough that
β : = p ( { n N } ) < ε .
For r { B , C } , let I n ( r ) denote the rounding bin corresponding to n N :
I n ( B ) = ( n 1 , n ] , I n ( C ) = [ n 1 2 , n + 1 2 ) .
Let
T ( r ) : = n N I n ( r ) ,
so T ( B ) = ( N 1 , ) and T ( C ) = [ N 1 2 , ) . Write y 0 for the left endpoint of T ( r ) , namely y 0 = N 1 for r = B and y 0 = N 1 2 for r = C . By the choice N 2 , we have y 0 > 0 .
Define a density g on R as follows. Fix α > 0 . For 1 n < N , set
g ( y ) = p ( { n } ) , y I n ( r ) .
On the tail half-line T ( r ) , set
g ( y ) = β α y 0 α y α 1 , y T ( r ) .
Set g ( y ) = 0 elsewhere.
Since each bin I n ( r ) has length one,
I n ( r ) g ( y ) d y = p ( { n } ) , 1 n < N .
A direct computation gives
T ( r ) β α y 0 α y α 1 d y = β ,
so
R g ( y ) d y = n = 1 N 1 p ( { n } ) + β = 1 .
Let Y have density g and let F Y denote its cdf. For y y 0 ,
F ¯ Y ( y ) = y g ( u ) d u = β y y 0 α .
Hence F ¯ Y is regularly varying at infinity with index α , so F Y MDA ( G ξ ) with ξ = 1 / α > 0 (Fact 1).
Since g is supported on ( 0 , ) when r = B and on [ 1 2 , ) when r = C , the conditioning event in the definition of T r has probability one. In particular, p : = law ( ρ r ( Y ) ) satisfies p = T r ( F Y ) , so p D r .
For 1 n < N ,
p ( { n } ) = I n ( r ) g ( y ) d y = p ( { n } ) ,
so p and p agree on { 1 , , N 1 } . Hence
2 d TV ( p , p ) = k 1 | p k p k | = k N | p k p k | k N p k + k N p k = 2 β ,
so d TV ( p , p ) β < ε . Since p and ε were arbitrary, D r is dense in ( P ( N ) , d TV ) . □

9. Banach–Mazur Game Interpretation

The proof of Theorem 1 admits a natural reading via the Banach–Mazur game [7,8,9]. Since G is comeager and disjoint from each rounded class, one may interpret the construction as follows: at stage m, Player II forces the play into the open dense set U m U m + beyond the current scale via the tail surgery of Lemma 5, without disturbing earlier witnesses (Lemma 2). Any limit point lies in G D c . This is a heuristic reformulation; the rigorous content is in Section 7 and Section 8.

10. Discussion and Open Directions

The presented theorem shows that rounded discrete MDA classes are topologically small in the sense of Baire category, even though they are dense in P ( N ) (Proposition 2). Density alone is therefore not the right notion of size in this setting: every neighborhood of a generic law contains rounded laws, yet the collection of all such rounded laws is itself nowhere dense in a suitable comeager sense. The Baire category distinguishes these classes from generic laws on N and mirrors the continuous picture of Leonetti and Khorrami Chokami [5], where the multivariate max-domain-of-attraction is shown to be dense yet of the first category.
  • Type A. The argument does not address the sampled-density family A . As explained in Remark 3, this family lacks the survival-function identity P ¯ ( n ) = F ¯ ( · ) / F ¯ ( · ) that drives the trichotomy lemma; consequently a generic Type A law could in principle exhibit oscillating dyadic ratios while still arising from a regularly varying parent density. A meagerness result for A would therefore require either a substitute for the trichotomy—perhaps via a careful study of the discrete normalizing sums j f c ( j ) and their dyadic differences—or a different witness construction altogether. We expect A to be meager but leave this as an open problem.
  • Parametric closures and boundaries. Characterizing the closures and topological boundaries of A , B , and C within P ( N ) would be of independent interest.
  • Alternative topologies. One may ask whether analogous meagerness phenomena persist under Wasserstein metrics restricted to moment classes.

Author Contributions

Formal Analysis, M.K., A.O. and D.S.; Data Curation, A.O. and D.S.; Writing—Original Draft Preparation, M.K. and D.S.; Writing—Review and Editing, A.O. All authors have read and agreed to the published version of the manuscript.

Funding

This research received no external funding.

Data Availability Statement

No new data were created or analyzed in this study. Data sharing is not applicable to this article.

Conflicts of Interest

The authors declare no conflicts of interest.

References

  1. Anderson, C.W. Extreme value theory for a class of discrete distributions with applications to some stochastic processes. J. Appl. Probab. 1970, 7, 99–113. [Google Scholar] [CrossRef]
  2. Anderson, C.W. Local limit theorems for the maxima of discrete random variables. Math. Proc. Camb. Philos. 1980, 88, 161–165. [Google Scholar] [CrossRef]
  3. de Haan, L.; Ferreira, A. Extreme Value Theory: An Introduction; Springer: New York, NY, USA, 2006. [Google Scholar]
  4. Resnick, S.I. Extreme Values, Regular Variation, and Point Processes; Springer: New York, NY, USA, 1987. [Google Scholar]
  5. Leonetti, P.; Khorrami Chokami, A. The maximum domain of attraction of multivariate extreme value distributions is small. Electron. Commun. Probab. 2022, 27, 1–8. [Google Scholar] [CrossRef]
  6. Embrechts, P.; Klüppelberg, C.; Mikosch, T. Modelling Extremal Events for Insurance and Finance; Springer: Berlin, Germany, 1997. [Google Scholar]
  7. Oxtoby, J.C. Measure and Category, 2nd ed.; Springer: New York, NY, USA, 1980. [Google Scholar]
  8. Telgársky, R. Topological games: On the 50th anniversary of the Banach–Mazur game. Rocky Mt. J. Math. 1987, 17, 227–276. [Google Scholar] [CrossRef]
  9. Revalski, J.P. The Banach–Mazur Game: History and Recent Developments; Seminar Notes; Institute of Mathematics and Informatics Bulgarian Academy of Sciences: Pointe-à-Pitre, France, 2004. [Google Scholar]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Kebe, M.; Oaks, A.; Sy, D. A Baire Category Approach to Rounded Discrete Max Domains of Attraction. Mathematics 2026, 14, 1982. https://doi.org/10.3390/math14111982

AMA Style

Kebe M, Oaks A, Sy D. A Baire Category Approach to Rounded Discrete Max Domains of Attraction. Mathematics. 2026; 14(11):1982. https://doi.org/10.3390/math14111982

Chicago/Turabian Style

Kebe, Malick, Ashley Oaks, and Demba Sy. 2026. "A Baire Category Approach to Rounded Discrete Max Domains of Attraction" Mathematics 14, no. 11: 1982. https://doi.org/10.3390/math14111982

APA Style

Kebe, M., Oaks, A., & Sy, D. (2026). A Baire Category Approach to Rounded Discrete Max Domains of Attraction. Mathematics, 14(11), 1982. https://doi.org/10.3390/math14111982

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop