Macaulay2 » Documentation
Packages » DirectSummands » Example: summands of the Frobenius pushforward » frobeniusMap

next | previous | forward | backward | up | index | toc

frobeniusMap -- the iterated Frobenius map of a ring in positive characteristic

Usage:

frobeniusMap(e, R)
Inputs:
- e, an integer,
- R, a ring,
Outputs:
- a ring map, from the Frobenius source ring to the twisted target ring

Description

This function constructs the $e$-th Frobenius ring map used by the pushforward and pullback routines.

See also

frobeniusRing -- construct the source ring for an iterated Frobenius map
frobeniusTwist -- apply the Frobenius twist to rings, modules, and matrices
frobeniusPushforward -- compute Frobenius pushforwards
frobeniusPullback -- compute Frobenius pullbacks

Ways to use frobeniusMap:

frobeniusMap(Ring,ZZ)
frobeniusMap(ZZ,Ring)

For the programmer

The object frobeniusMap is a method function.

The source of this document is in /build/reproducible-path/macaulay2-1.26.06+ds/M2/Macaulay2/packages/DirectSummands/docs.m2:680:0.