Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generatedjudge pass (gpt-6.1-sol)
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

The coinvariant functors Φa and the transition maps T

Definition

A graded k[T]-module consists of k-modules Un, n≥0, together with k-linear maps T=Tn ⁣:Un→Un+1 for all n≥0. A morphism U→U′ of graded k[T]-modules is a family of k-linear maps un ⁣:Un→Un′ with un+1∘Tn=Tn′∘un for all n.

Fix a≥0, a set a of cardinality a, and a functorial disjoint union of finite sets. Let V be an FI-module over k (The category FI and FI-modules over a commutative ring) and let n≥0. Put

Φa(V)n:=(Va⊔n)Sn,

the coinvariants of the kSn-module Va⊔n: the quotient by the span of the elements σ⋅v−v, σ∈Sn, v∈Va⊔n (The coinvariants functor, Quotient module M/N with scalar multiplication on additive cosets). Equivalently Φa(V)n=k⊗kSnVa⊔n, the two descriptions being identified by the balancing argument of The tensor product M⊗RN from the additive group underlying the free Z-module on M×N, elementary tensors, and finite tensor sums and the corresponding identification for Z in The coinvariants functor; the group ring kSn is a unital k-algebra with basis the group elements (The group ring R[G] of finitely supported formal R-linear combinations of group elements, The group ring R[G] is a unital R-algebra with basis G, and each g∈G is a unit of R[G]).

To define the transition map T ⁣:Φa(V)n→Φa(V)n+1, choose an injection f ⁣:n→n+1. It induces the injection ida⊔f ⁣:a⊔n→a⊔n+1 and hence a k-linear map (Va⊔n→Va⊔n+1). This map is Sn-equivariant, where Sn acts on the target through the injection ida⊔f, so it descends to the quotient map T=Tf on coinvariants. The map Tf is independent of f: for two injections f,g ⁣:n→n+1 the composite g∘f−1 is a bijection f(n)→g(n), which extends along the complement to a permutation τ∈Sn+1 with g=τ∘f; then ida⊔g=(ida⊔τ)∘(ida⊔f), and the map induced by ida⊔τ on (Va⊔n+1)Sn+1 is the identity because it comes from the action of the group element τ. Thus T is well defined and (Φa(V),T) is a graded k[T]-module.

A map of FI-modules α ⁣:V→W gives k-linear maps αa⊔n ⁣:Va⊔n→Wa⊔n commuting with the Sn-actions and with the maps induced by ida⊔f, hence maps (Φaα)n of coinvariants commuting with T; so Φa is a functor from FI-modules over k to graded k[T]-modules.

Permutations of a commute with the moving-block action of Sn, so Φa(V)n also carries an Sa-action. Since ida⊔f commutes with these permutations, every T is Sa-equivariant. Naturality has the same equivariance.

Exactness. Coinvariants of a group module are right exact (The coinvariants functor is right exact), so the functor M↦MSn≅k⊗kSnM is right exact and each Φa is right exact in every degree. If k contains Q, then 1/n! exists in k and the averaging map s ⁣:Φa(V)n→Va⊔n, s([v])=1n!∑σ∈Snσ⋅v, is a well-defined k-linear section of the quotient map that is natural in V; it identifies Φa(V)n with the invariants Va⊔nSn. Under this natural identification Φa becomes the invariants functor, which is left exact (kernels of equivariant maps are computed pointwise), and therefore Φa is exact; in that case the induced map Φa(W)→Φa(V) is injective for every sub-FI-module W⊆V (Submodule of a module, Module homomorphism and isomorphism, kernel, image and cokernel), so Φa(W) is identified with a submodule of Φa(V). Finite averaging uses only the finite groups Sn; no choice principle is used.

Depends on

Used by

Dependency tree · two levels

27 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources