Preprint
Article

This version is not peer-reviewed.

Finite Field Grothendieck Inequality, Finite Field Johnson-Lindenstrauss Flattening and Finite Field Bourgain-Tzafriri Restricted Invertibility Problems

Submitted:

25 March 2026

Posted:

27 March 2026

You are already at the latest version

Abstract
We ask for finite field versions of following three: (1) Grothendieck Inequality, (2) Johnson-Lindenstrauss Flattening Lemma, (3) Bourgain-Tzafriri Restricted Invertibility Theorem.
Keywords: 
;  ;  ;  

1. Finite Field Grothendieck Inequality Problem

The Grothendieck inequality was derived in the following form by Lindenstrauss and Pelczynski in 1968 [1].
Theorem 1. 
[1,2,3,4,5,6,7,8] (Grothendieck Inequality or The Fundamental Theorem in the Metric Theory of Tensor Products) Let K = R or C . There is a universal constant K G K > 0 satisfying the following: For every Hilbert space H over K and for all m , n N , if a scalar matrix [ a j , k ] 1 j m , 1 k n satisfies
j = 1 m k = 1 n a j , k s j t k max 1 j m | s j | max 1 k n | t k | , s j , t k K ,
then
j = 1 m k = 1 n a j , k u j , v k K G K max 1 j m u j max 1 k n v k , u j , v k H .
Further,
1.67 K G R 1.79 , 1.33 K G C 1.41 .
We formulate problem which is finite field analogue of Theorem 1. Let p be a prime, Z p : = { 0 , 1 , , p 1 } be the standard field of integers modulo p. Given n Z p , we define
| n | : = unique a such that 0 a p 1 and n a ( mod p ) .
Since p is a prime, we have the following:
(i)
If n Z p is such that | n | = 0 , then n = 0 .
(ii)
| m n | | m | | n | for all m , n Z p .
(iii)
| m + n | | m | + | n | for all m , n Z p .
For d N , let Z p d be the standard vector space over Z p . We define the inner product
( a j ) j = 1 d , ( b j ) j = 1 d : = j = 1 d a j b j Z p , ( a j ) j = 1 d , ( b j ) j = 1 d Z p d
and the norm
( c j ) j = 1 d 2 : = j = 1 d | c j | 2 { 0 , 1 , , d ( p 1 ) 2 } , ( c j ) j = 1 d Z p d .
Note that
j = 1 d | c j 2 | j = 1 d | c j | 2 = ( c j ) j = 1 d 2 , ( c j ) j = 1 d Z p d .
Inner product and norm will have following properties:
(i)
If x Z p d is such that x , y = 0 for all y Z p d , then x = 0 .
(ii)
n x , y = n x , y for all n Z p , for all x , y Z p d .
(iii)
x , y = y , x for all x , y Z p d .
(iv)
x + y , z = x , z + y , z for all x , y , z Z p d .
(v)
| x , y | x y for all x , y Z p d .
(vi)
If x Z p d is such that x = 0 , then x = 0 .
(vii)
x 2 N { 0 } for all x Z p d .
(viii)
n x | n | x for all n Z p , for all x Z p d .
(ix)
x + y x + y for all x , y Z p d .
Based on Theorem 1, we formulate following problem.
Problem 1. 
(Finite Field Grothendieck Inequality Problem) Let p be a prime. Whether there is a universal constant K p > 0 (which may depend upon p) satisfying the following property: for every d N , for all m , n N , if [ a j , k ] 1 j m , 1 k n M m × n ( Z p ) satisfies
j = 1 m k = 1 n a j , k s j t k max 1 j m | s j | max 1 k n | t k | , s j , t k Z p ,
then
j = 1 m k = 1 n a j , k u j , v k K p max 1 j m u j max 1 k n v k , u j , v k Z p d .

2. Finite Field Johnson-Lindenstrauss Flattening Problem

Johnson and Lindenstrauss showed that points in high dimensional Euclidean space can be mapped to low dimensional Euclidean space with small distortion to distances between every pair of points, using Lipschitz maps [9].
Theorem 2. 
[9,10] (Johnson-Lindenstrauss Flattening Lemma) Let M , N N and x 1 , x 2 , , x M R N . For every 0 < ε < 1 , there exists a Lipschitz map f : R N R m and a real number r > 0 such that
r ( 1 ε ) x j x k f ( x j ) f ( x k ) r ( 1 + ε ) x j x k , 1 j , k M ,
where
m = O log M ε 2 .
Over the period, some improvements of Theorem 2 have been obtained. We recall them.
Theorem 3. 
[9,11] (Johnson-Lindenstrauss Flattening Lemma: Frankl-Maehara form) Let 0 < ε < 1 2 and M N . Define
m ( ε , M ) : = 9 1 ε 2 2 ε 3 3 log M + 1 .
If M > m ( ε , M ) , then for every x 1 , x 2 , , x M R M , there exists a map f : { x j } j = 1 M R m such that
( 1 ε ) x j x k 2 f ( x j ) f ( x k ) 2 ( 1 + ε ) x j x k 2 , 1 j , k M .
Theorem 4. 
[9,12] (Johnson-Lindenstrauss Flattening Lemma: Dasgupta-Gupta form) Let M , N N and x 1 , x 2 , , x M R N . Let 0 < ε < 1 . Choose any natural number m such that
m > 4 1 ε 2 2 ε 3 3 log M .
Then there exists a map f : R N R m such that
( 1 ε ) x j x k 2 f ( x j ) f ( x k ) 2 ( 1 + ε ) x j x k 2 , 1 j , k M .
The map f can be determined in randomized polynomial time.
Theorem 5. 
[9,13] (Johnson-Lindenstrauss Flattening Lemma: matrix form) There is a universal constant C > 0 satisfying the following. Let 0 < ε < 1 , M , N N and x 1 , x 2 , , x M R N . For each natural number
m > C ε 2 log M ,
there exists a matrix M M m × N ( R ) such that
( 1 ε ) x j x k 2 M ( x j x k ) 2 ( 1 + ε ) x j x k 2 , 1 j , k M .
Based on Theorem 5, we formulate following problem.
Problem 2. 
(Finite Field Johnson-Lindenstrauss Flattening Problem) Let p be a prime. What is the best function ϕ : ( 0 , 1 ) × N ( 0 , ) satisfying the following: There is a universal constant C p > 0 (which may depend upon p) satisfying the following. Let 0 < ε < 1 , M , N N and x 1 , x 2 , , x M Z p N . For each natural number
m > C p ϕ ( ε , M ) ,
there exists a matrix M M m × N ( Z p ) such that
( 1 ε ) x j x k M ( x j x k ) ( 1 ε ) x j x k , 1 j , k M .

3. Finite Field Bourgain-Tzafriri Restricted Invertibility Problem

Let R d be the standard d-dimensional Euclidean space with canonical orthonormal basis { e j } j = 1 d . In 1987, Bourgain and Tzafriri showed that every matrix can be inverted restrictively with control over the norm [14].
Theorem 6. 
[14,15] (Bourgain-Tzafriri Restricted Invertibility Theorem) There are universal constants A > 0 , c > 0 satisfying the following property. If d N , and T : R d R d is a linear operator with T e j = 1 , 1 j d , then there exists a subset σ { 1 , , d } of cardinality
Card ( σ ) c d T 2
such that
T j σ a j e j 2 A j σ | a j | 2 , a j R , j σ .
It is clear that we can state Theorem 6 also in following way.
Theorem 7. 
[14,15] (Bourgain-Tzafriri Restricted Invertibility Theorem) There are universal constants A > 0 , c > 0 satisfying the following property. If d N , and T : R d R d is a linear operator with
T e 1 2 = = T e d 2 = : r ( say ) ,
then there exists a subset σ { 1 , , d } of cardinality
Card ( σ ) r c d T 2
such that
T j σ a j e j 2 r A j σ | a j | 2 , a j R , j σ .
Spielman and Srivastava gave a simple proof of Theorem 6 by proving a generalization of Theorem 6 [16] due to Vershynin [17]. Based on Theorem 6, we formulate finite field problem. Given a linear operator T : Z p d Z p d , we define
T : = max T x x : x Z p d , x 0 .
Problem 3. 
(Finite Field Bourgain-Tzafriri Restricted Invertibility Problem) Let p be a prime. Whether there are universal constants A p > 0 , c p > 0 (which may depend upon p) satisfying the following property: If d N , and T : Z p d Z p d is a linear operator with T e j = 1 , 1 j d , then there exists a subset σ { 1 , , d } of cardinality
Card ( σ ) c p d T 2
such that
T j σ a j e j 2 A p j σ | a j | 2 , a j Z p , j σ .
Problem 4. 
(Finite Field Bourgain-Tzafriri Restricted Invertibility Problem) Let p be a prime. Whether there are universal constants A p > 0 , c p > 0 (which may depend upon p) satisfying the following property: If d N , and T : Z p d Z p d is a linear operator with
T e 1 2 = = T e d 2 = : r ( say ) ,
then there exists a subset σ { 1 , , d } of cardinality
Card ( σ ) r c p d T 2
such that
T j σ a j e j 2 r A p j σ | a j | 2 , a j Z p , j σ .

References

  1. Lindenstrauss, J.; Pelczynski, A. Absolutely summing operators in Lp-spaces and their applications. Studia Math. 1968, 29, 275–326. [Google Scholar] [CrossRef]
  2. Blei, R.C. An elementary proof of the Grothendieck inequality. Proc. Amer. Math. Soc. 1987, 100, 58–60. [Google Scholar] [CrossRef]
  3. Rietz, R.E. A proof of the Grothendieck inequality. Israel J. Math. 1974, 19, 271–276. [Google Scholar] [CrossRef]
  4. Grothendieck, A. Produits tensoriels topologiques et espaces nucléaires. Mem. Amer. Math. Soc. 1955, 16. [Google Scholar] [CrossRef]
  5. Friedland, S.; Lim, L.H.; Zhang, J. An elementary and unified proof of Grothendieck’s inequality. Enseign. Math. 2018, 64, 327–351. [Google Scholar] [CrossRef]
  6. Albiac, F.; Kalton, N.J. Topics in Banach space theory. In Graduate Texts in Mathematics; Springer, 2016; Vol. 233, p. xx+508. [Google Scholar] [CrossRef]
  7. Diestel, J.; Fourie, J.H.; Swart, J. The metric theory of tensor products: Grothendieck’s resume revisited; American Mathematical Society: Providence, RI, 2008; p. x+278. [Google Scholar] [CrossRef]
  8. Pisier, G. Grothendieck’s theorem, past and present. Bull. Amer. Math. Soc. (N.S.) 2012, 49, 237–323. [Google Scholar] [CrossRef]
  9. Johnson, W.B.; Lindenstrauss, J. Extensions of Lipschitz mappings into a Hilbert space. Contemp. Math. 1984, 26, 189–206. [Google Scholar] [CrossRef]
  10. Matousek, J. Lectures on discrete geometry. In Graduate Texts in Mathematics; Springer-Verlag: New York, 2002; Vol. 212, p. xvi+481. [Google Scholar] [CrossRef]
  11. Frankl, P.; Maehara, H. The Johnson-Lindenstrauss lemma and the sphericity of some graphs. J. Combin. Theory Ser. B 1988, 44, 355–362. [Google Scholar] [CrossRef]
  12. Dasgupta, S.; Gupta, A. An elementary proof of a theorem of Johnson and Lindenstrauss. Random Structures Algorithms 2003, 22, 60–65. [Google Scholar] [CrossRef]
  13. Foucart, S.; Rauhut, H. A mathematical introduction to compressive sensing. In Applied and Numerical Harmonic Analysis; Birkhäuser/Springer: New York, 2013; p. xviii+625. [Google Scholar] [CrossRef]
  14. Bourgain, J.; Tzafriri, L. Invertibility of “large” submatrices with applications to the geometry of Banach spaces and harmonic analysis. Israel J. Math. 1987, 57, 137–224. [Google Scholar] [CrossRef]
  15. Vershynin, R. Random sets of isomorphism of linear operators on Hilbert space. In Proceedings of the fourth international conference High dimensional probability; IMS, Institute of Mathematical Statistics: Beachwood, OH, 2006; pp. 148–154. [Google Scholar] [CrossRef]
  16. Spielman, D.A.; Srivastava, N. An elementary proof of the restricted invertibility theorem. Israel J. Math. 2012, 190, 83–91. [Google Scholar] [CrossRef]
  17. Vershynin, R. John’s decompositions: selecting a large part. Israel J. Math. 2001, 122, 253–277. [Google Scholar] [CrossRef]
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.
Copyright: This open access article is published under a Creative Commons CC BY 4.0 license, which permit the free download, distribution, and reuse, provided that the author and preprint are cited in any reuse.
Prerpints.org logo

Preprints.org is a free preprint server supported by MDPI in Basel, Switzerland.

Subscribe

Disclaimer

Terms of Use

Privacy Policy

Privacy Settings

© 2026 MDPI (Basel, Switzerland) unless otherwise stated