Subspace Designs based on Algebraic Function Fields
Venkatesan Guruswami, Chaoping Xing, Chen Yuan

TL;DR
This paper introduces a new method for constructing subspace designs over any field using algebraic function fields, extending previous polynomial-based approaches and enabling applications like dimension expanders over all fields.
Contribution
It extends subspace design constructions to arbitrary fields by leveraging algebraic function fields, broadening their applicability and improving their utility in linear-algebraic pseudorandomness.
Findings
Constructed subspace designs over any field with slightly weaker parameters.
Applied the new designs to produce dimension expanders over all fields.
Achieved logarithmic degree and expansion for large subspaces.
Abstract
Subspace designs are a (large) collection of high-dimensional subspaces of such that for any low-dimensional subspace , only a small number of subspaces from the collection have non-trivial intersection with ; more precisely, the sum of dimensions of is at most some parameter . The notion was put forth by Guruswami and Xing (STOC'13) with applications to list decoding variants of Reed-Solomon and algebraic-geometric codes, and later also used for explicit rank-metric codes with optimal list decoding radius. Guruswami and Kopparty (FOCS'13, Combinatorica'16) gave an explicit construction of subspace designs with near-optimal parameters. This construction was based on polynomials and has close connections to folded Reed-Solomon codes, and required large field size (specifically ). Forbes and Guruswami (RANDOM'15) used this construction…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCoding theory and cryptography · Cooperative Communication and Network Coding · graph theory and CDMA systems
Subspace Designs based on Algebraic Function Fields
Venkatesan Guruswami
Computer Science Department, Carnegie Mellon University, Pittsburgh, USA.
,
Chaoping Xing
School of Physical and Mathematical Sciences, Nanyang Technological University, Singapore.
and
Chen Yuan
School of Physical and Mathematical Sciences, Nanyang Technological University, Singapore.
Abstract.
Subspace designs are a (large) collection of high-dimensional subspaces of such that for any low-dimensional subspace , only a small number of subspaces from the collection have non-trivial intersection with ; more precisely, the sum of dimensions of is at most some parameter . The notion was put forth by Guruswami and Xing (STOC’13) with applications to list decoding variants of Reed-Solomon and algebraic-geometric codes, and later also used for explicit rank-metric codes with optimal list decoding radius.
Guruswami and Kopparty (FOCS’13, Combinatorica’16) gave an explicit construction of subspace designs with near-optimal parameters. This construction was based on polynomials and has close connections to folded Reed-Solomon codes, and required large field size (specifically ). Forbes and Guruswami (RANDOM’15) used this construction to give explicit constant degree “dimension expanders” over large fields, and noted that subspace designs are a powerful tool in linear-algebraic pseudorandomness.
Here, we construct subspace designs over any field, at the expense of a modest worsening of the bound on total intersection dimension. Our approach is based on a (non-trivial) extension of the polynomial-based construction to algebraic function fields, and instantiating the approach with cyclotomic function fields. Plugging in our new subspace designs in the construction of Forbes and Guruswami yields dimension expanders over for any field , with logarithmic degree and expansion guarantee for subspaces of dimension .
Research supported in part by NSF CCF-1422045.
1. Introduction
An emerging theory of “linear-algebraic pseudorandomness” studies the linear-algebraic analogs of fundamental Boolean pseudorandom objects where the rank of subspaces plays the role of the size of subsets. A recent work [FG15] studied the interrelationships between several such algebraic objects such as subspace designs, dimension expanders, rank condensers, and rank-metric codes, and highlighted the fundamental unifying role played by subspace designs in this web of connections.
Informally, a subspace design is a collection of subspaces of a vector space (throughout we denote by the finite field with elements) such that any low-dimensional subspace intersects only a small number of subspaces from the collection. More precisely:
Definition 1**.**
A collection of -dimensional subspaces of form an -(strong) subspace design, if for every -dimensional subspace , .
In particular, this implies that at most subspaces have non-trivial intersection with . A collection meeting this weaker requirement is called a weak subspace design; unless we mention otherwise, by subspace design we always mean a strong subspace design in this paper. One would like the dimension of each subspace in the subspace design to be large, typically or applications of interest, to be small, and the number of subspaces to be large.
Subspace designs were introduced by the first two authors in [GX13], where they used them to improve the list size and efficiency of list decoding algorithms for algebraic-geometric codes, yielding efficiently list-decodable codes with optimal redundancy over fixed alphabets and small output list size. A standard probabilistic argument shows that a random collection of subspaces forms a good subspace design with high probability. Subsequently, Guruswami and Kopparty [GK16] gave an explicit construction of subspace designs, nearly matching the parameters of random constructions, albeit over large fields.
Intriguingly, the construction in [GK16] was based on algebraic list-decodable codes (specifically folded Reed-Solomon codes). Recall that improving the list-decodability of such codes was the motivation for the formulation of subspace designs in the first place! This is yet another compelling example of the heavily intertwined nature of error-correcting codes and other pseudorandom objects. The following states one of the main trade-offs achieved by the construction in [GK16].
Theorem 1.1** (Folded Reed-Solomon based construction [GK16]).**
For every , positive integers with , and a prime power , there exists an explicit111By explicit, we mean a deterministic construction that runs in time and outputs a basis for each of the subspaces in the subspace design. collection of subspaces in , each of dimension at least , which form a -(strong) subspace design.
Note the requirement of the field size being larger than the ambient dimension in their construction. To construct subspace designs over small fields, they use a construction over a large extension field , and view -dimensional subspaces of as -dimensional subspaces of . However, this transformation need not preserve the “strongness” of the subspace design, and an -subspace design over the extension field only yields an -weak subspace design over .
The strongness property is crucial for all the applications of subspace designs in [FG15]. In particular, the strongness is what drives the construction of dimension expanders (defined below) of low degree. The weak subspace design property does not suffice for these applications.
Definition 2**.**
A collection of linear maps is said to be a -dimension expander if for every subspace of of dimension at most , . The number of maps is the “degree” of the expander, and is the expansion factor.
Using the subspace designs constructed in Theorem 1.1 in a black-box fashion, Forbes and Guruswami [FG15] gave explicit -dimension expanders of degree when . Here explicit means that the maps are specified explicitly, say by the matrix representing their action with respect to some fixed basis. Extending Theorem 1.1 to smaller fields will yield constant-degree -dimension expanders over all fields. The only known constructions of such dimension expanders over finite fields rely on monotone expanders [DW10, DS11], a rather complicated (and remarkable) form of bipartite vertex expanders whose neighborhood maps are monotone. Even the existence of constant-degree monotone expanders does not follow from standard probabilistic methods, and the only known explicit construction is a sophisticated one using the group by Bourgain and Yehudayoff [BY13]. (Earlier, Dvir and Shpilka [DS11] constructed monotone expanders of logarithmic degree using Cayley graphs over the cyclic group, yielding logarithmic degree -dimension expanders.)
In light of this, it is a very interesting question to remove the field size restriction in Theorem 1.1 above, as it will yield an arguably simpler construction of constant-degree dimension expanders over every field, and which might also offer a quantitatively better trade-off between the degree and expansion factor. We note that probabilistic constructions achieve similar parameters (in fact a slightly larger sized collection with subspaces) with no restriction on the field size (one can even take ).
Our construction. The large field size in Theorem 1.1 was inherited from Reed-Solomon codes, which are defined over a field of size at least the code length. Our main contribution in this work is a construction of subspace designs based on algebraic function fields, which permits us to construct subspace designs over small fields. By instantiating this approach with a construction based on cyclotomic function fields, we are able to prove the following main result in this work:
Theorem 1.2** (Main Theorem).**
For every , a prime power and positive integers such that , there exists an explicit construction of subspaces in , each of dimension at least , which form an \Bigl{(}s^{\prime},\frac{2s^{\prime}\lceil\log_{q}(m)\rceil}{\varepsilon}\Bigr{)}-strong subspace design for all .
Note that we state a slightly stronger property that the bound on intersection size improves for subspaces of lower dimension . This property also holds for Theorem 1.1 and in fact is important for the dimension expander construction in [FG15], and so we make it explicit.
The bound on intersection size we guarantee above is worse than the one from the random construction by a factor of . The result of Theorem 1.1 can be viewed as a special case of Theorem 1.2 since when . The factor comes out as a trade-off of the explicit construction vs the random construction given in [GX13]. The extension field based construction using Theorem 1.1 would yield an -subspace design (since an -weak subspace design is trivially an -(strong) subspace design). The bound we achieve is better for all . In the use of subspace designs in the dimension expander construction of [FG15], governs the dimension of the subspaces which are guaranteed to expand, which we would like to be large (and ideally ). The application of subspace designs to list decoding [GX13, GWX16] employs the parameter choice in order keep the alphabet size small. Therefore, our improvement applies to a meaningful setting of parameters that is important for the known applications of (strong) subspace designs.
Application to dimension expanders over small fields. By plugging in the subspace designs of Theorem 1.2 into the dimension expander construction of [FG15], we can get the following:
Theorem 1.3**.**
For every prime power and positive integer , there exists an explicit construction of a \Bigl{(}b=\Omega\bigl{(}\frac{n}{\log_{q}\log_{q}n}\bigr{)},1/3\Bigr{)}-dimension expander with degree.
For completeness, let us very quickly recap how such dimension expanders may be obtained from the subspace designs of Theorem 1.2, using the “tensor-then-condense” approach in [FG15]. We begin with linear maps , where and — these trivially achieve expansion factor by doubling the ambient dimension. Then we take the subspace design of Theorem 1.2 with , , , and subspaces (if for small enough absolute constant , Theorem 1.2 guarantees these many subspaces). Let be linear maps such that . The dimension expander consists of the composed maps for and . Briefly, the analysis of the expansion in dimension proceeds as follows. Let be a subspace of with , and let be the -dimensional subspace of after the tensoring step. The strong subspace design property implies that the number of maps for which — which is equivalent to — is less than . So there must be an for which , and this when composed with and will expand to a subspace of dimension at least .
By using a method akin to the conversion of Reed-Solomon codes over extension fields to BCH codes over the base field, applied to the large field subspace designs of Theorem 1.1, Forbes and Guruswami [FG15] constructed -dimension expanders of degree. In contrast, our construction here guarantees expansion for dimension up to . The parameters offered by Theorem 1.3 are, however, weaker than both the construction given in [DS11], which has logarithmic degree but expands subspaces of dimension , as well as the one in [BY13], which further gets constant degree. However, we do not go through monotone expanders which are harder to construct than vertex expanders, and our construction works fully within the linear-algebraic setting. We hope that the ideas in this work pave the way for a subspace design similar to Theorem 1.1 over small fields, and the consequent construction of constant-degree -dimension expanders over all fields. In fact, all that is required for this is an -subspace design with a sufficiently large constant number of subspaces, each of dimension .
Construction approach. The generalization of the polynomials-based subspace design from [GK16] to take advantage of more general algebraic function fields is not straightforward. The natural approach would be to replace the space of low-degree polynomials by a Riemann-Roch space consisting of functions of bounded pole order at some place. We prove that such a construction can work, provided the degree is less than the degree of the field extension (and some other mild condition is met, see Lemma 3.2). However, this degree restriction is a severe one, and the dimension of the associated Riemann-Roch space will typically be too small (as the “genus” of the function field, which measures the degree minus dimension “defect,” will be large), unless the field size is large. Therefore, we don’t know an instantiation of this approach that yields a family of good subspace designs over a fixed size field.
Let us now sketch the algebraic crux of the polynomial based construction in [GK16], and the associated challenges in extending it to other function fields. The core property of a dimension subspace of polynomials underlying the construction of Theorem 1.1 is the following: If of degree less than are linearly independent over (these polynomials being a basis of the subspace ), then the “folded Wronskian,” which is the determinant of the matrix whose ’th entry is , is a nonzero polynomial in . Here is an arbitrary primitive element of . One might compare this with the classical Wronskian criterion for linear dependence over characteristic zero fields (and also holds when characteristic is bigger than the degree of the ’s), based on the singularity of the matrix whose ’th entry is .
One approach is to prove this claim about the folded Wronskian is via a “list size” bound from list decoding: one can prove that for any , not all [math], the space of solutions to
[TABLE]
has dimension at most . (This was the basis of the linear-algebraic list decoding algorithm for folded Reed-Solomon codes [Gur11, GW13].) Stating the contrapositive, if are linearly dependent over , then the rows of the matrix are linearly independent, and therefore its determinant, the folded Wronskian, is a nonzero polynomial. On the other hand, being the determinant of an matrix whose entries are degree polynomials, the folded Wronskian has degree at most . To prove the subspace design property, one then establishes that for each subspace in the collection that intersects , the determinant picks up a number of distinct roots each with multiplicity, the set of roots for different intersecting being disjoint from each other. The total intersection bound then follows because the folded Wronskian has at most roots, counting multiplicities.
One can try to mimic the above approach for folded algebraic-geometric (AG) codes, with for some suitable automorphism playing the role of the shifted polynomial . This, however, runs into significant trouble, as the bound on number of solutions to the functional equation analogous to (1), , is much higher. The list of solutions is either exponentially large and needs pruning via pre-coding the folded AG codes with subspace-evasive sets [GX12], or it is much bigger than in the constructions based on cyclotomic function fields and narrow ray class fields where the folded AG codes work directly [Gur10, GX15].
Let be a function field where the extension is Galois with Galois group generated by an automorphism . We choose the -dimensional ambient space to be a carefully chosen subspace of a Riemann-Roch space in of degree (specifically, we require where is the genus). We then establish that if are linearly independent over , a certain “automorphism Moore matrix” (Definition 4) is non-singular. The determinant of this Moore matrix is thus a non-zero function in , and this generalizes the folded Wronskian criterion for polynomials mentioned above.
This non-singularity result is proved in two steps. First, we show that for functions in , linear independence over implies linear independence over . Then we show that for any that are linearly independent over , the automorphism Moore matrix associated with is non-singular. With our hands on the non-zero function , we can proceed as in the folded Reed-Solomon case — the part about picking up many zeroes whenever a subspace in the collection intersects also generalizes. The pole order of , however, is now instead of in the polynomial-based construction. This is the cause for the worse bound on total intersection dimension in our Theorem 1.2.
Organization. We begin with a quick review of background on algebraic function fields in general and cyclotomic function fields in particular in Section 2. We also elaborate on the the complexity aspects of computing bases of Riemann-Roch spaces and evaluating functions at high degree places in cyclotomic function fields — this implies that our subspace designs can be constructed in polynomial time. We present and analyze our constructions of subspace designs from function fields in Section 3 — we give two criteria that enable our construction, Lemmas 3.1, 3.2, though the former is the more useful one for us. In Section 4, we instantiate our construction with specific cyclotomic function fields and derive our main consequence for subspace designs and establish Theorem 1.2. For reasons of space, several of the technical proofs appear are deferred to appendices.
2. Preliminaries on function fields
Background on function fields. Throughout this paper, denotes the finite field of elements. A function field over is a field extension over in which there exists an element of that is transcendental over such that is a finite extension. is called the full constant field of if the algebraic closure of in is itself. In this paper, we always assume that is the full constant field of , denoted by .
Each discrete valuation from to defines a local ring . The maximal ideal of is called a place. We denote the valuation and the local ring corresponding to by and , respectively. The residue class field , denoted by , is a finite extension of . The extension degree is called degree of , denoted by .
Let denote the set of places of . A divisor of is a formal sum , where are equal to [math] except for finitely many . The degree of is defined to be . We say that is positive, denoted by , if for all . For a nonzero function , the principal devisor is defined to be . Then the degree of the principal divisor is [math]. The Riemann-Roch space associated with a divisor , denoted by , is defined by
[TABLE]
Then is a finite dimensional space over . By the Riemann-Roch theorem [Sti08], the dimension of , denoted by , is lower bounded by , i.e., , where is the genus of . Furthermore, if . In addition, we have the following results [Sti08, Lemma 1.4.8 and Corollary 1.4.12(b)]:
- (i)
If , then ;
- (ii)
For a positive divisor , we have , i.e., .
Let denote the set of automorphisms of that fix every element of , i.e.,
[TABLE]
For a place and an automorphism , we denote by the set . Then is a place and moreover we have . The place is called a conjugate place of . also induces an automorphsim of . This implies that there exists an integer such that for all . is called the Frobenius of if , i.e., for all . For a place and a function , we denote by the residue class of in . Thus, we have .
Background on cyclotomic function fields. Let be a transcendental element over and denote by the rational function field . Let be an algebraic closure of . Denote by the polynomial ring . Let be the ring homomorphism from to . We define for all . For , we define . For a polynomial , we define . For simplicity, we denote by . It is easy to see that is a -linearized polynomial in of degree , where .
For a polynomial of degree , define the set
[TABLE]
Then is an -module and it has exactly elements. Furthermore, is a cyclic -module. For any generator of , one has and is a generator of if and only if . The extension is a Galois extension over with , where is the unit group of the ring . We use to denote the automorphism of corresponding to , i.e., . The size of is denoted by . If is an irreducible polynomial of degree over , we have . In this case, the extension is cyclic and .
From now on in this subsection, we assume that is a monic irreducible polynomial of degree over . The infinite place of splits into places of degree in , each having ramification index . The zero place of is totally ramified in . Furthermore, a monic irreducible polynomial of is unramified and splits into places of degree , where is the order of in the unit group and . This implies that the zero place of in totally inert in if is a monic primitive polynomial.
Lemma 2.1**.**
[Hay74, Ros02]** Let be a monic irreducible polynomial of degree and let be a generator of . Then is a local parameter of the unique place of lying over , i.e., . Furthermore, let be the integral closure of in . Then is an integral basis of over , where .
Let denote the pole place of in . The following lemma determines the principal divisor of a generator of .
Lemma 2.2**.**
Let be a monic irreducible polynomial of degree and let be a generator of . Then the principal divisor is equal to
[TABLE]
where is the unique place of lying over the zero of and is the set of all places of lying over of .
Proof.
Let us first look at the poles of . Write , where denotes the coefficient of . Then is a polynomial in of degree . If a place of does not lie over of , we claim that . Otherwise, one would have for all . This is impossible as .
By [Hay74, Theorem 3.2], we know that there exists a place of lying over of such that and for any polynomial of degree . This implies that for a polynomial of degree with , one has for , where is the unique polynomial of degree satisfying . When runs through all polynomials in , runs through all conjugate places lying over . This means that there are exactly places lying over with since there are monic polynomials of degree in . Hence, the divisor appears as part of the principal divisor . The desired result follows from the following facts: (i) has no poles other than those lying ; (ii) is a local parameter of ; and (iii) . This completes the proof. ∎
Now we show that every element in the Riemann-Roch space has a unique representation of certain form.
Lemma 2.3**.**
Let be a monic irreducible polynomial of degree and let be a generator of . Let be the place of lying over . Then every nonzero element of can be uniquely written as for some , where are polynomials of and not all of them are divisible by . Furthermore, for all .
Proof.
If , it is clearly true. Now let . Let and put . Then . Thus, belongs to . By Lemma 2.1, there exists a set of such that . We claim that not all are divisible by . Otherwise we would have and this is a contradiction.
Put . Let be a generator of the Galois group . Define . Since , we have for all and each infinite place . Let be the matrix with entry equal to . Let be the matrix obtained from by replacing the column with the column vector . Then we have .
Since , we have . As , we have . Thus, we have . This implies that . The proof is completed. ∎
We next discuss how to evaluate a function at a place of higher degree. Let be an irreducible polynomial of degree and it splits completely in . By the Kummer Theorem [Sti08, Theorem III.3.7], the polynomial is factorized into product of linear factors over . Let be a linear factor, then there is a place of degree of . To evaluate a function at , we can simple compute , where is the residue class of in . It is clear that the complexity of this evaluation takes time . The above analysis gives the following result.
Lemma 2.4**.**
Let be a monic irreducible polynomial of degree and let be a generator of . Let be the place of lying over . Then for a place of of degree that is completely splitting over , the evaluation of a function of at can be computed in time.
Computing bases. Our next goal is the following claim, which states that bases for the requisite bases for our construction can be efficiently computed.
Assume that is a monic primitive polynomial of degree in . Let be a generator of . Then we have the following facts:
- •
Every nonzero function in has the form
[TABLE]
where and and not all are divisible by .
- •
The principal divisor is
[TABLE]
where is the set of all places lying over of .
Let be a function given in (5). To show that belongs , it is sufficient to check that and for all places .
Let be the smallest number in such that is not divisible by . Then we have . Thus, we have . This implies that either (in this case ) or and .
To consider , we note that is a local parameter of for all . Assume that . Then we get an equation
[TABLE]
Let the local expansion of at be
[TABLE]
for some and . Substituting with local expansion of (8) into (7) to solve . Then substituting (8) into (5) get
[TABLE]
for some integer , and . Note that is a linear combination of coefficients of .
The genus of the function field is . Put Let be the unique place of lying over . It is clear that . Thus, . Choose such that and are a direct sum of .
In conclusion, in the form (5) belongs to if and only if (i) (a) or (b) and is divisible by for all ; (ii) the local expansion of in (9) satisfies for all . Furthermore, in the form (5) belongs to if and only if in addition satisfies that is divisible by for all .
To determine , it is equivalent to finding . We can solve through a homogenous equation system of about variables that are coefficients of . Therefore, one can find a basis of in time. Summering the above analysis gives us Lemma 2.5
Lemma 2.5**.**
Let be a monic primitive polynomial of degree and let be a generator of . Let be the places of lying over and , respectively. Put with . Then a basis of a vector space satisfying can be computed in time.
3. Construction of subspace design
3.1. Moore determinant
The main purpose of this subsection is to provide a function, namely the determinant of a “Moore” matrix, that is guaranteed to be non-zero when functions in a function field are linearly independent over . This will provide the necessary generalization of the fact that the folded Wronskian is non-zero when of degree less than are linearly independent over .
Lemma 3.1**.**
Let be a finite field extension. Suppose that is a place of lying above a rational place of . Let be a positive devisor of with . If is an -subspace of such that , then are -linearly independent if and only if they are linearly independent over .
Proof.
The “if” part is clearly true. Now assume that are -linearly independent. Suppose that there exist functions such that not all of them are equal to [math] and
[TABLE]
By the Strong Approximation Theorem [Sti08, Theorem I.6.4], we can multiply with a common nonzero function in such that the only possible pole of is for all . Thus, without loss of generality, we may assume that for all places of . Let . Then we have for all . Since is a rational place, one can find an -basis of such that the pole orders are strictly increasing.
Thus, can be expressed as for some . We rewrite (10) into the following identity
[TABLE]
As , and , we know that either or
[TABLE]
where denotes the ramification index of over . As the for are distinct, this implies that for all . Therefore, for all and since are -linearly independent. So . This is a contradiction and the proof is completed. ∎
The above lemma provides a sufficient condition under which -linear independence of a set of functions is equivalent to -linear independence. Now we give an alternative condition although we will mainly use Lemma 3.1 in this paper.
Lemma 3.2**.**
Let be a finite field extension of degree . Suppose that there exists a rational place in such that there is only one place of lying above . Let be a positive divisor of with and . Then are -linearly independent if and only if they are linearly independent over .
Proof.
The “if” part is clear. Now assume that are -linearly independent. Suppose that there would exist functions such that not all were not zero and
[TABLE]
We are going to derive a contradiction.
As in the proof of Lemma 3.1, we may assume that for all places of . Let . Then we have for all . Since is a rational place, one can find an -basis of such that the pole orders are strictly increasing as increases from to .
Thus, can be expressed as for some . We rewrite (12) into the following identity
[TABLE]
Assume that is the largest index such that . Such an index must exist as not all ’s are [math], and are linearly independent over . Then the above identity becomes
[TABLE]
Since is the unique place lying above , we have . Then, the fact that implies that either or . Therefore, the right hand side of (14) gives
[TABLE]
while the left hand side of (14) gives
[TABLE]
This is a contradiction and the proof is completed. ∎
Remark 1*.*
The requirement of in Lemma 3.2 makes it difficult to compute the dimension of as the genus of is usually larger than . While in Lemma 3.1, there is no such a requirement. When and , then by the Riemann-Roch theorem we have .
For each element , denote by the fixed field by , i.e., . By the Galois theory, if has a finite order, then is a Galois extension and .
Definition 3**.**
(Moore Matrix) Let be a field extension. Let be elements of , the Moore Matrix is defined by ,
It is a well-known fact that are linearly independent over if and only if the Moore Determinant is nonzero.
Now we generalize the above Moore matrix as follows.
Definition 4**.**
(Automorphism Moore Matrix)* Let be a field extension. Let be an automorphism in . Let be elements of . The -Moore matrix is defined by .*
Remark 2*.*
If is the usual Frobenius, i.e., for all . Then we have that if and only if are linearly independent over .
Our next theorem can be seen as a generalization of the result given in Remark 2.
Lemma 3.3**.**
Let . Let . Then the -Moore determinant equals [math] if and only if are linearly dependent over .
Proof.
Let us prove the “if” part first. Assume that are linearly dependent over , then there exist functions such that are not all zero and
[TABLE]
For each , let automorphism act on both the sides of (15), then we have
[TABLE]
Note that in the above equation, we use the fact that . The equation (16) implies that is a nonzero solution of . Hence, we conclude that .
Next we prove the “only if” part by induction. It is clearly true for the case where . Now assume that it holds for . Suppose that and are linearly independent over . We will derive a contradiction.
As , there exist such that not all are equal to [math] and
[TABLE]
Without loss of generality, we may assume that . Let and we have
[TABLE]
Let acts on both the sides of (17), then
[TABLE]
By subtracting the -th equation in (18) from the -th equation in (17), we obtain
[TABLE]
As are linearly independent over , by induction hypothesis, we have
[TABLE]
But then the linear dependence (19) implies that for all . Thus, and (17) gives a non-trivial linear dependence of over , a contradiction. ∎
Combining Lemmas 3.1 with 3.3 gives the following.
Corollary 3.4**.**
Assume that the conditions in Lemma 3.1 are satisfied with . Then for , the -Moore determinant if and only if are linearly dependent over .
Combining Lemmas 3.2 with 3.3 gives the following.
Corollary 3.5**.**
Assume that the conditions in Lemma 3.2 are satisfied with . Then for , the -Moore determinant if and only if are linearly dependent over .
Remark 3*.*
In [GK16], the function field is the rational function . The automorphism is given by , where is a primitive element of . It is clear that the order of is . The fixed field is . Thus, the degree of extension is . Now for , we consider the Riemman-Roch space , where is the unique pole of . Then in fact consists of all polynomials in of degree at most . It is clear that . Furthermore, the rational place of is fully inert in , where . This is because lies over and has degree . Thus, all conditions in Lemma 3.2 are satisfied. Therefore, by Corollary 3.5 for a set of polynomials in of degree at most , the -Moore determinant if and only if are linearly dependent over . This is exact the result of Lemma 12 of [GK16]. Note that the Moore determinant is called a folded Wronskian determinant in [GK16].
3.2. Construction
Let be an automorphism of a finite order. Let be a divisor of such that . Assume that all the conditions in Lemma 3.1 are satisfied. Recall such that .
For each place such that and are distinct, we define the subspace :
[TABLE]
Recall that is defined to be the residue class of in the residue field . Hence, it is clear that
[TABLE]
Let for some integer . Thus, we have for all integers .
Define , and denote by a set of places with degree such that are disjoint and .
Theorem 3.6**.**
For any integers with , the collection of subspaces of , each of codimension at most , is an strong subspace design, where .
Proof.
Let be an -subspace of dimension . Let be a basis for . Denote the dimension by . Let be a basis of . Extend this basis to a basis of . Then it is clear that
[TABLE]
for some .
For any and any with and , we have , i.e.,
[TABLE]
By definition of determinants, we have , where is the symmetric group. By (22), whenever . This implies that for all . Hence, for all . In conclusion, we have .
As is a nonzero function, we must have
[TABLE]
The desired result follows. ∎
So far in this subsection, we made use of Lemma 3.1 and Corollary 3.4 for construction of subspace designs. We can also make use of Lemma 3.2 and Corollary 3.5 to construct subspace designs. Let be a positive divisor of such that and . For each place such that and are distinct, we define the subspace :
[TABLE]
We present the following result without proof as it is very similar to the one of Theorem 3.6.
Theorem 3.7**.**
For any integers with , the collection of subspaces of , each of codimension at most , is an strong subspace design, where .
3.3. Picking the places indexing the subspaces
To obtain a large set of places which define the subspaces in Theorems 3.6 and 3.7, we consider those places that split completely in . Thus, are distinct as long as .
Lemma 3.8**.**
Let be a place of degree in with . If is unramified in , then splits completely in .
Proof.
Let be the place of that lies under , which has inertia degree . As and , we must have and . Since is unramified, the desired result follows. ∎
In view of the above result, we can choose as follows. Let be co-prime to . Let be all non-conjugate places of degree that are not ramified. Then for each , are all distinct. Thus, we can form sets that are pairwise disjoint. On the other hand, by [Sti08, Corollary 5.2.10(a)] there are at least places of degree , where is the genus . Hence, if and not many places of degree are ramified, we have roughly such sets . In fact, for our examples based on cyclotomic function fields in the next section, there are no places of degree that are ramified.
4. Subspace design from cyclotomic function fields
In this section, we will present subspace design from the construction given in Section 3 by applying cyclotomic function fields. We start with the subspace design in a ambient space of smaller dimension.
The small dimension case. If is smaller than and is smaller than the genus of , in general it is hard to compute dimension of the Riemann-Roch space . Therefore, we cannot use the construction given in Theorem 3.7. In this subsection, we apply Theorem 3.7 to the case where we can estimate the dimension of .
Let be the rational function field . Let be given by , where is a primitive element of . By Remark 3 and Theorem 3.7, one can obtain the subspace design given in [GK16]. Below we show that the subspace design given in [GK16] can be realized by using cyclotomic function fields.
Put . Let be a monic linear polynomial. For instance, we can simply take . Then the cyclotomic function field is a cyclic extension over with . In fact, with satisfying . Thus, . Let be a primitive root of and let be defined by . This gives the exactly the same function fields and automorphism as in Remark 1. Therefore, we conclude that this cyclotomic function field also realizes the subspace design given in [GK16].
Next we consider a monic primitive quadratic polynomial with . Then the cyclotomic function field is a cyclic extension over with . In fact, with satisfying (see [MXY16]). Let be a generator of . Then by the Galois theory, the fixed field is the rational function field . The genus of the function field is [Hay74, MXY16].
The zero of is the unique ramified place in and it is totally ramified. Let be the unique place of that lies over the zero of . Let be an even positive integer with and let . Then and . Furthermore, we know that the the zero of is fully inert in . Thus, all the conditions in Lemma 3.2 are satisfied. By Theorem 3.7, we have the following result.
Theorem 4.1**.**
For all positive integers and prime powers satisfying for some , the above construction yields a collection of spaces , each of codimension , which forms an strong subspace design for all .
Proof.
Choose such that the dimension of is . By the Riemman-Roch Theorem, we have , i.e., . The desired result follows from Theorem 3.7. ∎
The large dimension case. In this subsection, we will make use of Theorem 3.6 due to large genus. Let be a monic primitive polynomial of degree . Consider the cyclotomic function field , where is the rational function field . Then is a Galois extension with . Thus, is a cyclic group of order . Let be a generator of this group. Then by the Galois theory, the fixed field is the rational function field .
The zero of is the unique ramified place in and it is totally ramified. Let be the unique place of lying over the zero of . Let be the unique place of that lies over the zero of . Since is totally inert, we have .
The genus of the function field is . Put Then and hence, . Choose such that and are a direct sum of . Thus, we have and .
Thus, all the conditions in Lemma 3.1 are satisfied. By Theorem 3.6, we have the following.
Theorem 4.2**.**
For all positive integers and prime powers satisfying and , there is an explicit collection of spaces , each of codimension at most , which forms an -strong subspace design for all . Furthermore, the subspace design can be constructed in time.
Proof.
The subspace design property follows from Theorem 3.6 since . The construction of the subspace design mainly involves finding a basis of and evaluations of functions at places of degree . We have described how to compute a basis in Lemma 2.5 and how to evaluate a function a high degree place in Lemma 2.4. The places of degree defining the subspaces in the subspace design can be computed as described in Section 3.3. We can enumerate over all degree irreducible polynomials by brute-force in time. None of these places are ramified, and by Lemma 3.8 each of these places splits completely into places of degree , say , in . So we can pick of these places , and define a particular subspace of co-dimension associated with each of them as in (20). ∎
By setting and in Theorem 4.2, we obtain the Main Theorem 1.2.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[BY 13] Jean Bourgain and Amir Yehudayoff. Expansion in t e x t S L 2 ( ℝ ) 𝑡 𝑒 𝑥 𝑡 𝑆 subscript 𝐿 2 ℝ text{SL}_{2}(\mathbb{R}) and monotone expanders. Geometric and Functional Analysis , 23(1):1–41, 2013.
- 2[DS 11] Zeev Dvir and Amir Shpilka. Towards dimension expanders over finite fields. Combinatorica , 31(3):305–320, 2011.
- 3[DW 10] Zeev Dvir and Avi Wigderson. Monotone expanders: Constructions and applications. Theory of Computing , 6(12):291–308, 2010.
- 4[FG 15] Michael A. Forbes and Venkatesan Guruswami. Dimension expanders via rank condensers. In Proceedings of the 19th International Workshop on Randomization and Computation (RANDOM) , pages 800–814, 2015. Extended full version available as ECCC Technical Report TR 14-162.
- 5[GK 16] Venkatesan Guruswami and Swastik Kopparty. Explicit subspace designs. Combinatorica , 36(2):161–185, 2016. Preliminary version in FOCS 2013.
- 6[Gur 10] Venkatesan Guruswami. Cyclotomic function fields, Artin-Frobenius automorphisms, and list error-correction with optimal rate. Algebra and Number Theory , 4(4):433–463, 2010. Preliminary version in STOC 2009.
- 7[Gur 11] Venkatesan Guruswami. Linear-algebraic list decoding of folded Reed-Solomon codes. In Proceedings of the 26th IEEE Conference on Computational Complexity , June 2011.
- 8[GW 13] Venkatesan Guruswami and Carol Wang. Linear-algebraic list decoding for variants of Reed-Solomon codes. IEEE Transactions on Information Theory , 59(6):3257–3268, 2013.
