Definition Tensor induction of a finite free paired module
✓ definition formalized

Tensor induction of a finite free paired module

Let \(\eta:R\to A\) be a finite free Frobenius extension, with trace \(t\) and trace duality \(D\). Let \(N\) be a finite free paired \(A\)-module, with pairing \(B_N(m,n)=p_N(m)(n)\).

The induced module is \[ \operatorname{Ind}(N)=A\otimes_R N. \] Here \(N\) is first regarded as an \(R\)-module by \(r m=\eta(r)m\). The tensor product is generated by \(a\otimes m\), with additivity in both variables and the relation \[ a\eta(r)\otimes m=a\otimes\eta(r)m. \] The new left \(A\)-action multiplies the first factor: \(c(a\otimes m)=(ca)\otimes m\).

Restriction and extension of scalars

Restriction keeps the elements and addition of \(N\) and lets \(R\) act through \(\eta\). Extension forms \(A\otimes_R N\), allowing an independent outer \(A\)-coefficient.

Choose an \(R\)-basis \(a_1,\ldots,a_d\) of \(A\) and an \(A\)-basis \(n_1,\ldots,n_r\) of \(N\). Then \(a_i n_j\) is an \(R\)-basis of \(N\): expand the coefficients of each \(n_j\) in the \(a_i\), and use uniqueness in the two bases successively. The source calls this restrictionBasis.

Extending that basis gives an \(A\)-basis \[ 1\otimes a_i n_j\qquad(1\le i\le d,\ 1\le j\le r) \] of the induced module. Its rank is \(dr\).

The induced perfect pairing

Restrict the old perfect pairing through \(t\), then extend it by the finite free tensor-duality construction. The resulting pairing is \[ B_{\operatorname{Ind}}(a\otimes m,b\otimes n) =ab\,\eta(t(B_N(m,n))). \] The source's inducedModule packages the tensor carrier, its finite freeness, and this composite duality. The tensor-pairing theorem verifies the construction and its formula in detail.

For a reflection extension, \(d=2\) and the basis of \(A\) over \(R=A^\tau\) is \(1,\alpha\). Thus one tensor step replaces every old basis vector \(n_j\) by \[ 1\otimes n_j,\qquad 1\otimes\alpha n_j. \] This is the basis recursion for word modules.

References

The local source declarations below give the construction and proof.

Lean formalization

OAI.KLInvariance.FrobeniusDuality.restrictionBasis: Frobenius.lean:263.

OAI.KLInvariance.FrobeniusDuality.inducedModule: Frobenius.lean:270.

OAI.KLInvariance.FrobeniusDuality.inducedModule_pairing_tmul: Frobenius.lean:276.

Used by