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 free FI-module M(W) generated by an Sm-module

Definition

Let W be an FB-module over k, i.e. a functor from the groupoid of finite sets and bijections to k-Mod (The category FI and FI-modules over a commutative ring); thus W(T) is a k-module for every finite set T, and every bijection β ⁣:T→T′ gives an isomorphism W(β) ⁣:W(T)→W(T′). Because an FB-module is defined on all finite sets, no transport choices are needed below.

The free FI-module M(W) assigns to a finite set S the direct sum

M(W)S:=⨁T⊆SW(T)

over all subsets T⊆S (Subset x⊆y, proper subset x⊊y, and the separation notation { z∈x:φ(z) }, The direct sum of an indexed family of modules; only finitely many summands occur). For an injection f ⁣:S→S′ and a subset T⊆S, the restriction f∣T ⁣:T→f(T) is a bijection (Injection, surjection, bijection), and the transition map f∗ ⁣:M(W)S→M(W)S′ is the sum of the isomorphisms W(f∣T) ⁣:W(T)→W(f(T)) over all T⊆S. This is k-linear and functorial, since (f′∘f)∣T=f′∣f(T)∘f∣T; hence M(W) is an FI-module over k.

For S=[n]={0,…,n−1} the symmetric group Sn (The finite symmetric group Sn, one-line notation, and cycle notation) acts by σ⋅T:=σ(T) and W(σ∣T), and this is a left action making M(W)n a left kSn-module (The group ring R[G] of finitely supported formal R-linear combinations of group elements). Grouping the sum by the cardinality of T, the subsets of cardinality a form a single Sn-orbit with stabilizer the ordered block subgroup S{0,…,a−1}×S{a,…,n−1}≅Sa×Sn−a, so the orbit summand is identified with an induced module (The induced R-linear G-module Ind⁡HGW as H-covariant functions on G):

M(W)n≅⨁a=0nInd⁡Sa×Sn−aSn(Wa⊠k),

where Wa:=W({0,…,a−1}) is the value of the FB-module on an a-element set, the first factor acts on Wa through W and the second factor acts trivially, and ⊠ is the external tensor product of modules for the two direct factors (The outer induction product of symmetric-group characters, The character ring of a direct product is the tensor product of the factor character rings, The tensor product M⊗RN from the additive group underlying the free Z-module on M×N, elementary tensors, and finite tensor sums).

Adjunction. Let π be the functor from FI-modules to FB-modules that forgets the maps between distinct cardinalities. The inclusion of the T=S summand is a natural map ηW ⁣:W→πM(W), and evaluating a map F ⁣:M(W)→V of FI-modules on that summand yields a map of FB-modules πF∘ηW ⁣:W→πV. Conversely, a map of FB-modules φ ⁣:W→πV extends uniquely to a map of FI-modules φ~ ⁣:M(W)→V whose value on the summand W(T)⊆M(W)S is V(ιT,S)∘φT, with ιT,S ⁣:T→S the inclusion; the components are compatible with injections and the two constructions are inverse, so Hom⁡FI-Mod(M(W),V)≅Hom⁡FB-Mod(W,πV) naturally in V and W: M is left adjoint to π, with unit η.

For m≥0 write k[Sm] for the FB-module with k[Sm](T) the free k-module on the bijections [m]→T, and zero when ∣T∣≠m; its value on an m-element set is the regular representation of Sm. Put M(m):=M(k[Sm]). Then M(m)S has as k-basis the injections [m]↪S — equivalently, the ordered sequences of m distinct elements of S — and for a partition λ with ∣λ∣=m and a field k of characteristic 0, put M(λ):=M(Skλ), where the FB-module Skλ is supported on m-element sets and Skλ(T):=k[Iso⁡([m],T)]⊗kSmSkλ. By the adjunction, a map M(m)→V of FI-modules corresponds naturally to the choice of an element of Vm: the module M(m) represents the functor V↦Vm. All constructions are given by finitely many canonical bijections of finite sets; no choice principle is used.

Depends on

Used by

Dependency tree · two levels

50 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