Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generated
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.

Weight of an FI-module over a field of characteristic zero

Definition

Let k be a field of characteristic 0 and let V be an FI-module over k (The category FI and FI-modules over a commutative ring). For a partition λ and n≥∣λ∣+λ1 put λ[n]:=(n−∣λ∣,λ1,λ2,… ), the first-row padding (First-row padding of a partition), with ∣∅∣=∅1=0 and ∅[0]=∅, and let

V(λ)n:=k⊗QSQλ[n]

be the scalar extension of the rational Specht model of λ[n] (Complex Specht modules are irreducible, Specht modules classify the irreducibles over every field of characteristic zero). By the classification lemma, V(λ)n is the irreducible kSn-module with label λ[n], and every irreducible kSn-module is isomorphic to exactly one V(λ)n: indeed, every partition μ=(μ1,μ2,… ) of n is uniquely λ[n] for the partition λ=(μ2,μ3,… ) obtained by deleting the first row, and n≥∣λ∣+λ1 holds precisely because μ1≥μ2; consequently the labels λ[n] run over the partitions of n without repetition. At n=0 the only label and its tail are both ∅, and V(∅)0=k with the trivial S0-action.

Say that V(λ)n occurs as a constituent of Vn when there are kSn-submodules U⊆W⊆Vn with W/U≅V(λ)n (Submodule of a module, Quotient module M/N with scalar multiplication on additive cosets); this is a condition on subquotients and requires no decomposition or finite-dimensionality of Vn. The weight of V is

weight⁡(V):=sup⁡{∣λ∣:V(λ)n occurs as a constituent of Vn for some n≥∣λ∣+λ1},

the supremum over all pairs (λ,n) as displayed. The set of integers displayed is a set of nonnegative integers, so the supremum is well defined in N∪{∞}; it is 0 for V=0, and weight⁡(V)=∞ exactly when the displayed set is unbounded. No finiteness of weight⁡(V) is asserted.

If W is a subquotient of V, meaning that W≅U′/U for sub-FI-modules U⊆U′⊆V computed pointwise, then weight⁡(W)≤weight⁡(V): a constituent of Wn is a subquotient of the subquotient Un′/Un of Vn, hence a subquotient of Vn, so it contributes the same label ∣λ∣ to the supremum for V. No choice principle is used: the labels λ[n], constituents and the supremum are set-theoretic data, and no bases or decompositions are chosen.

Depends on

Used by

Dependency tree · two levels

37 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