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.

Injectivity, surjectivity and stability degree

Definition

Let V be an FI-module over k and let Φa and T be the coinvariant functors and transition maps of The coinvariant functors Φa and the transition maps T. The injectivity degree inj-deg⁡(V) is the least s≥0 such that for every a≥0 the transition map T ⁣:Φa(V)n→Φa(V)n+1 is injective for all n≥s; the surjectivity degree surj-deg⁡(V) is the least s≥0 such that for every a≥0 the map T is surjective for all n≥s. The stability degree is

stab-deg⁡(V):=max⁡(inj-deg⁡(V),surj-deg⁡(V)).

Each of the three is +∞ when no such s exists; here the bounds are read as elements of the extended nonnegative integers N∪{+∞} with the evident order, in which every nonempty subset of N has a least element (The natural numbers N (von Neumann)), so "the least s" is well defined. Equivalently, T ⁣:Φa(V)n→Φa(V)n+1 is an isomorphism for all a≥0 and all n≥stab-deg⁡(V): the map is an isomorphism exactly when it is both injective and surjective, and for finite bounds a threshold that controls all a simultaneously is the larger of the two thresholds, while each of the two stated bounds remains the least threshold controlling its own property.

The three bounds are kept distinct: stab-deg⁡(V) is the maximum of the other two, and nothing in the definition requires inj-deg⁡(V)=surj-deg⁡(V). No finiteness is asserted: each bound is allowed to be +∞. No choice principle is used.

Depends on

Used by

Dependency tree · two levels

16 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