Stepanov restriction maps on a finite coefficient grid #
For finite families f : α → L and g : β → L, the coefficient space is
the free K-module (α × β →₀ K). Its two restriction maps evaluate the
same coefficient grid against
f i * (g j) ^ s, and(f i) ^ s * g j.
The maps are defined with Finsupp.linearCombination. One-point pole bounds
give codomain restrictions with budgets ell + s * m and s * ell + m.
The final results expose exactly the injectivity and finrank interfaces used
by exists_auxiliary_of_finrank_lt.
The algebra structure from K to L used in the stepanov restriction maps construction.
Equations
- BGS.HasseWeil.stepanovRestrictionConstantAlgebra K L = ((algebraMap (RatFunc K) L).comp (algebraMap K (RatFunc K))).toAlgebra
Instances For
The first Stepanov restriction: evaluate the coefficient grid against
f i * (g j) ^ s.
Equations
- BGS.HasseWeil.onePointStepanovFirstRestrictionMap K L f g s = Finsupp.linearCombination K fun (ij : α × β) => f ij.1 * g ij.2 ^ s
Instances For
The second Stepanov restriction: evaluate the coefficient grid against
(f i) ^ s * g j.
Equations
- BGS.HasseWeil.onePointStepanovSecondRestrictionMap K L f g s = Finsupp.linearCombination K fun (ij : α × β) => f ij.1 ^ s * g ij.2
Instances For
Powers multiply a one-point pole budget.
Every basis value of the first restriction has pole budget
ell + s * m.
Every basis value of the second restriction has pole budget
s * ell + m.
The whole first linear combination has pole budget ell + s * m.
The whole second linear combination has pole budget s * ell + m.
The first restriction with its one-point codomain made explicit.
Equations
- One or more equations did not get rendered due to their size.
Instances For
The second restriction with its one-point codomain made explicit.
Equations
- One or more equations did not get rendered due to their size.
Instances For
Linear independence of the first product grid is exactly injectivity of the first restriction map.
The mixed-order Stepanov-grid criterion proves injectivity of the first restriction.
The first codomain restriction remains injective.
A target finrank upper bound and a numerical strict inequality give the dimension inequality required by rank-nullity.
Concrete rank-nullity interface for the two Stepanov restrictions.
An upper bound for the second one-point target, strictly below the product index cardinality, produces a nonzero coefficient grid killed by the second restriction and detected by the first.