pith. sign in

arxiv: 2605.09557 · v2 · pith:APXDMFCYnew · submitted 2026-05-10 · 🧮 math.CO

On ell-weakly cross t-intersecting families for sets and vector spaces

Shuhui Yu , Lijun Ji This is my paper

Pith reviewed 2026-05-25 06:13 UTC · model grok-4.3

classification 🧮 math.CO
keywords ℓ-weakly cross t-intersecting familiesvector spacessubspacesGaussian binomial coefficientsintersecting familiesextremal set theoryproduct bounds
0
0 comments X

The pith

Two ℓ-weakly cross t-intersecting families of subspaces satisfy |F|·|G| ≤ [n−t choose k−t] [n−t choose k'−t] when n meets an explicit lower bound.

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

The paper gives an alternative proof of the set version of the ℓ-weakly cross t-intersecting theorem together with an explicit lower bound on n. For vector spaces it proves that any two families of k- and k'-dimensional subspaces obeying the ℓ-weakly cross t-intersecting condition have product of cardinalities at most the product of two Gaussian binomials, provided the ambient dimension n is at least (2k−t+1)(t+1)+(k−t+1)k'+k+2ℓ−1. This extends the earlier result that held only for the ordinary cross t-intersecting case. A reader would care because the result supplies a uniform size bound under a relaxed intersection requirement that still forces the families to be large only when they concentrate around a common t-dimensional object.

Core claim

If F and G are ℓ-weakly cross t-intersecting families of k- and k'-dimensional subspaces of an n-dimensional vector space over F_q, then |F|·|G| ≤ [n−t choose k−t] [n−t choose k'−t] holds whenever n ≥ (2k−t+1)(t+1)+(k−t+1)k'+k+2ℓ−1.

What carries the argument

The ℓ-weakly cross t-intersecting condition, which requires that for every choice of ℓ distinct members from each family the sum of their pairwise intersection dimensions is at least ℓ²t − ℓ + 1.

If this is right

  • The bound recovers the known product upper bound for ordinary cross t-intersecting families when ℓ equals 1.
  • An explicit sufficient lower bound on n is supplied for the subspace result.
  • The analogous product bound for set families holds once n is large enough, with the paper supplying the explicit threshold.
  • The extremal families are expected to be the collections of all k-subspaces and all k'-subspaces containing a fixed t-dimensional subspace.

Where Pith is reading between the lines

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

  • The same style of argument might yield analogous bounds when the intersection condition is relaxed still further.
  • Small explicit computations for modest n and small ℓ could indicate whether the given lower bound on n is sharp.
  • The result supplies a template for studying product bounds on families obeying averaged rather than pointwise intersection requirements.

Load-bearing premise

The ambient dimension n must be at least (2k−t+1)(t+1)+(k−t+1)k'+k+2ℓ−1 for the product bound on subspace families to be proved.

What would settle it

A pair of ℓ-weakly cross t-intersecting families F and G of subspaces with n at or above the stated threshold whose product of sizes exceeds the product of the two Gaussian binomials.

read the original abstract

Let $[n]$ (resp. $V$) be an $n$-element set (resp. $n$-dimensional vector space over the finite field $\mathbb{F}_{q}$), and $\binom{[n]}{k}$ (resp. $\genfrac{[}{]}{0pt}{}{V}{k}$) denote the set of all $k$-subsets of $[n]$ (resp. $k$-dimensional subspaces of $V$). We say that $\mathcal{F}\subseteq\binom{[n]}{k}$ (resp. $\mathcal{F}\subseteq \genfrac{[}{]}{0pt}{}{V}{k}$) and $\mathcal{G}\subseteq \binom{[n]}{k'}$ (resp. $\mathcal{G}\subseteq \genfrac{[}{]}{0pt}{}{V}{k'}$) are $\ell$-weakly cross $t$-intersecting if $\sum_{1\leq i,j\leq \ell}|F_{i}\cap G_{j}|\geq \ell^{2}t-\ell+1$ (resp. $\sum_{1\leq i,j\leq \ell}\dim(F_{i}\cap G_{j})\geq \ell^{2}t-\ell+1$) for all distinct $F_{1},\ldots,F_{\ell}\in\mathcal{F}$ and $G_{1},\ldots,G_{\ell}\in\mathcal{G}$. In this paper, we provide an alternative proof of the set version of the $\ell$-weakly cross $t$-intersecting theorem and an explicit lower bound for $n$. Moreover, we prove that if $\mathcal{F}$ and $\mathcal{G}$ are $\ell$-weakly cross $t$-intersecting subspace families, then \[ |\mathcal{F}| \cdot |\mathcal{G}| \leq\genfrac{[}{]}{0pt}{}{n-t}{k-t}\genfrac{[}{]}{0pt}{}{n-t}{k'-t} \] holds, provided that $n\geq (2k-t+1)(t+1)+(k-t+1)k'+k+2\ell-1$. This extends the theorem of Cao, Lu, Lv and Wang [J. Combin. Theory Ser. A 193 (2023), 105688], who established the upper bound for the product of the sizes of cross $t$-intersecting subspace families.

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

0 major / 2 minor

Summary. The paper gives an alternative proof of the ℓ-weakly cross t-intersecting theorem for k-subsets and k'-subsets of an n-set, and proves that if F and G are ℓ-weakly cross t-intersecting families of k- and k'-dimensional subspaces of an n-dimensional space over F_q, then |F|·|G| ≤ [n-t choose k-t]_q [n-t choose k'-t]_q whenever n ≥ (2k-t+1)(t+1)+(k-t+1)k'+k+2ℓ-1. This extends the Cao-Lu-Lv-Wang theorem (ℓ=1 case) by supplying an explicit dimension threshold for the q-analogue.

Significance. The explicit n-threshold for the subspace result and the alternative combinatorial argument for the set case are useful additions to the literature on intersecting families and their q-analogues. The manuscript states the dimension hypothesis as necessary for the proof and presents the bound as a direct extension of prior work.

minor comments (2)
  1. [Abstract] Abstract, definition of ℓ-weakly cross t-intersecting: the summation condition is correctly stated, but a one-sentence remark noting that it reduces to ordinary cross t-intersecting when ℓ=1 would aid readability for readers unfamiliar with the generalization.
  2. [Introduction] The Gaussian binomial notation is introduced via genfrac; a brief parenthetical reminder of the standard q-binomial definition in the introduction would prevent any momentary ambiguity.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for the positive evaluation of the manuscript and the recommendation to accept.

Circularity Check

0 steps flagged

No significant circularity detected

full rationale

The paper supplies an alternative combinatorial proof for the set-version ℓ-weakly cross t-intersecting bound and derives the subspace product bound under an explicitly stated lower bound on n that is required for the counting argument to close. Both results rest on standard extremal-set counting and the prior Cao-Lu-Lv-Wang theorem; no parameter is fitted inside the paper and then relabeled as a prediction, no self-citation chain is load-bearing, and the derivation does not reduce to a definition or renaming of its own inputs.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

The paper relies on the standard axioms of finite vector spaces, the definition of Gaussian binomial coefficients, and the dimension formula for intersections; no new entities or fitted parameters are introduced in the abstract.

axioms (1)
  • standard math Standard properties of dimension and intersection in finite-dimensional vector spaces over F_q.
    Invoked to define the Gaussian binomials and the intersection-dimension sum in the definition of ℓ-weakly cross t-intersecting.

pith-pipeline@v0.9.0 · 5970 in / 1321 out tokens · 43967 ms · 2026-05-25T06:13:15.011985+00:00 · methodology

Review history (2 revisions) →

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

28 extracted references · 28 canonical work pages

  1. [1]

    J. Ai, M. Chen, S. Kim, and H. Lee, On a weaker notion of crosst-intersecting families. arXiv:2601.20516, 2026

    work page arXiv 2026

  2. [2]

    Blokhuis, A

    A. Blokhuis, A. E. Brouwer, A. Chowdhury, P. Frankl, T. Mussche, B. Patk´ os and T. Sz˝ onyi, A Hilton-Milner theorem for vector spaces,The Electronic Journal of Combinatorics, 17:#R71, 2010

    work page 2010

  3. [3]

    Borg, The maximum product of sizes of cross-t-intesecting families,Australasian Journal of Combinatorics, 60: 69-78, 2014

    P. Borg, The maximum product of sizes of cross-t-intesecting families,Australasian Journal of Combinatorics, 60: 69-78, 2014. 20

    work page 2014

  4. [4]

    Borg, The maximum product of weights of cross-intesecting families,Journal of the London Mathematical Society, 94(2): 993-1018, 2016

    P. Borg, The maximum product of weights of cross-intesecting families,Journal of the London Mathematical Society, 94(2): 993-1018, 2016

    work page 2016

  5. [5]

    M. Cao, B. Lv, K. Wang and S. Zhou, Non-trivialt-intersecting families for vector spaces,Siam Journal On Discrete Mathematics, 36:1823-1847, 2020

    work page 2020

  6. [6]

    M. Cao, M. Lu, B. Lv and K. Wang,r-crosst-intersecting families for vector spaces, Journal of Combinatorial Theory. Series A, 193:105688, 2023

    work page 2023

  7. [7]

    Y. Chen, A. Li, B. Wu and H. Zhang, On cross-2-intersecting families,Discrete Applied Mathematics, 382:259-271, 2026

    work page 2026

  8. [8]

    Erd˝ os, C

    P. Erd˝ os, C. Ko, and R. Rado, Intersection theorems for systems of finite sets.The Quarterly Journal of Mathematics. Oxford. Second Series, 12:313-320, 1961

    work page 1961

  9. [9]

    Frankl, G

    P. Frankl, G. O. H. Katona, and K. Nagy, Sharpening of the Erd˝ os–Ko–Rado theo- rem. submitted

    work page

  10. [10]

    Frankl, The Erd˝ os-Ko-Rado theorem is true forn=ckt, in: Combinatorics, Proc

    P. Frankl, The Erd˝ os-Ko-Rado theorem is true forn=ckt, in: Combinatorics, Proc. Fifth Hungarian Coll. Combinatorics, Keszthely, 1976, North-Holland, Amsterdam, 365–375, 1978

    work page 1976

  11. [11]

    Frankl and A

    P. Frankl and A. Kupavskii, Almost intersecting families,The Electronic Journal of Combinatorics, 28(2):#P2.7, 2021

    work page 2021

  12. [12]

    Frankl, S.J

    P. Frankl, S.J. Lee, M. Siggers and N. Tokushige, An Erd˝ os–Ko–Rado theorem for crosst-intersecting families,Journal of Combinatorial Theory. Series A, 128:207- 249, 2014

    work page 2014

  13. [13]

    Frankl and R

    P. Frankl and R. M. Wilson, The Erd˝ os–Ko–Rado theorem for vector spaces,Journal of Combinatorial Theory. Series A, 43:228-236, 1986

    work page 1986

  14. [14]

    Godsil and K

    C. Godsil and K. Meagher, Erd˝ os–Ko–Rado Theorems: Algebraic Approaches, Vol

    work page

  15. [15]

    Cambridge University Press, 2016

    work page 2016

  16. [16]

    W. N. Hsieh, Intersection theorems for systems of finite vector spaces,Discrete Mathematics, 12:1-16, 1975

    work page 1975

  17. [17]

    D. He, A. Li, B. Wu and H. Zhang, On nontrivial cross-t-intersecting families, Journal of Combinatorial Theory. Series A, 217:106095, 2026

    work page 2026

  18. [18]

    G. O. Katona and J. Wang, Nearly Erd˝ os–Ko–Rado theorems. arXiv:2601.06871, 2026

    work page arXiv 2026

  19. [19]

    Matsumoto and N

    M. Matsumoto and N. Tokushige, The exact bound in the Erd˝ os–Ko–Rado theorem for cross-intersecting families.Journal of Combinatorial Theory. Series A, 52:90-97, 1989

    work page 1989

  20. [20]

    Nagy, A new intersection condition in extremal set theory

    K. Nagy, A new intersection condition in extremal set theory. arXiv:2504.14389, 2025

    work page arXiv 2025

  21. [21]

    Pyber, A new generalization of the Erd˝ os–Ko–Rado theorem.Journal of Combi- natorial Theory

    L. Pyber, A new generalization of the Erd˝ os–Ko–Rado theorem.Journal of Combi- natorial Theory. Series A, 43(1):85-90, 1986. 21

    work page 1986

  22. [22]

    Suda and H

    S. Suda and H. Tanaka, A cross-intersection theorem for vector spaces based on semidefinite programming,Bulletin of the London Mathematical Society, 46:342- 348, 2014

    work page 2014

  23. [23]

    Tokushige, The eigenvalue method for crosst-intersecting families.Journal of Algebraic Combinatorics, 38:653-662, 2013

    N. Tokushige, The eigenvalue method for crosst-intersecting families.Journal of Algebraic Combinatorics, 38:653-662, 2013

    work page 2013

  24. [24]

    Tanaka and N

    H. Tanaka and N. Tokushige, A semidefinite programming approach to cross 2- intersecting families. arXiv:2503.14844, 2025

    work page arXiv 2025

  25. [25]

    R. M. Wilson, The exact bound in the Erd˝ os–Ko–Rado theorem.Combinatorica, 4:247-257, 1984

    work page 1984

  26. [26]

    K. Wang, J. Guo and F. Li, Association schemes based on attenuated spaces.Eu- ropean Journal of Combinatorics, 31:297-305, 2010

    work page 2010

  27. [27]

    Wen and B

    J. Wen and B. Lv, Onr-crosst-intersecting families for vector spaces with large product of sizes,Journal of Combinatorial Theory. Series A, 220:106127, 2026

    work page 2026

  28. [28]

    Zhang and B

    H. Zhang and B. Wu, On a conjecture of Tokushige for cross-t-intersecting families, Journal of Combinatorial Theory. Series B, 171:49-70, 2025. 22

    work page 2025