- Univariate Lagrange interpolation: For any vector a=(a1,...,an)∈Fpn, there is a unique univariate polynomial of degree at most n−1 such that qa(i)=ai+1 for i=0,...,n−1
- Lagrange basis polynomials: δi(X)=∏k=0,1,...,n−1:k=ii−kX−k
- Set qa(i)=∑j=nn−qaj+1⋅δj(X)
- → qa is called the low-degree extension (LDA) of a
- → a is viewed as coefficients over the Lagrange polynomial basis
- Multivariate Polynomials: Polynomials defined over the v-variate domain {0,1}v
- E.g. v=logn for the domain to have the same size as the univariate domain {i=0,...,n−1}
- Multilinear polynomials: Polynomials where each variable appears at most once in each monomial, which implies that the total degree is at most v
- Lagrange interpolation of multilinear polynomials: For any vector a∈Fpn, there is a unique multilinear polynomial qa of degree at most n−1 such that qa(i)=ai+1 for i=0,...,n−1
- For any function f:{0,1}v→F, the following multilinear polynomial f~ uniquely extends f:
f~(x1,...,xv)=∑w∈{0,1}vf(w)⋅χw(x1,...,xv)
with the multilinear Lagrange basis polynomials defined as:
χw(x1,…,xv):=∏i=1v(xiwi+(1−xi)(1−wi))
- → Possible to compute in O(n) time and O(n) space