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.

Left and right Nakayama functors by finite kernel calculus

Statement

Let A be a finite k-linear abelian category (Finite k-linear abelian categories, Abelian category, k-linear categories and k-linear functors) and let Φl,Φr,Ψl,Ψr be the equivalences of the categorical Eilenberg–Watts triangle (Categorical Eilenberg–Watts equivalences for finite linear categories, Finite Eilenberg–Watts kernels: explicit end and coend universal maps). Define Γrl=ΦrΨl:Lex⁡(A,A)⟶Rex⁡(A,A),Γlr=ΦlΨr:Rex⁡(A,A)⟶Lex⁡(A,A) (using the notation of Left exact and right exact functors and Natural transformation and its components). The Nakayama functor of A is NAr=Γrl(1A), the image of the identity functor regarded as a left exact endofunctor, and its left exact analogue is NAl=Γlr(1A), the identity regarded as a right exact endofunctor (Covariant functor, identity functor, composite functor, and contravariant functor). In a module model A≃A-mod these are the endofunctors Nr≅A∗⊗A− and Nl≅Hom⁡A(A∗,−). The definition asserts no further properties, selects no object and makes no choice; well-definedness, independence of the module model, the intrinsic (co)end formulas and the adjunction Nr⊣Nl are proved in Nakayama kernels give well-defined adjoint functors ↗.

Definition

Let A be a finite k-linear abelian category (Finite k-linear abelian categories, Abelian category, k-linear categories and k-linear functors) and let Φl,Φr,Ψl,Ψr be the equivalences of the categorical Eilenberg–Watts triangle (Categorical Eilenberg–Watts equivalences for finite linear categories, Finite Eilenberg–Watts kernels: explicit end and coend universal maps). Define Γrl=ΦrΨl:Lex⁡(A,A)⟶Rex⁡(A,A),Γlr=ΦlΨr:Rex⁡(A,A)⟶Lex⁡(A,A) (using the notation of Left exact and right exact functors and Natural transformation and its components). The Nakayama functor of A is NAr=Γrl(1A), the image of the identity functor regarded as a left exact endofunctor, and its left exact analogue is NAl=Γlr(1A), the identity regarded as a right exact endofunctor (Covariant functor, identity functor, composite functor, and contravariant functor). In a module model A≃A-mod these are the endofunctors Nr≅A∗⊗A− and Nl≅Hom⁡A(A∗,−). The definition asserts no further properties, selects no object and makes no choice; well-definedness, independence of the module model, the intrinsic (co)end formulas and the adjunction Nr⊣Nl are proved in Nakayama kernels give well-defined adjoint functors ↗.

Remarks

  • Why the composites are legitimate. Ψl is defined on Lex⁡(A,A) with values in Aop⊠A and Φr is defined on Aop⊠A with values in Rex⁡(A,A), so the composite Γrl is a functor on the functor category of left exact endofunctors with all natural transformations; dually Γlr is defined on Rex⁡(A,A). The identity functor is both left exact and right exact, so both evaluations NAr=Γrl(1A) and NAl=Γlr(1A) are legitimate and use the same object 1A in the two different functor categories.

  • What the definition does not assert. No formula, adjunction, self-injectivity, symmetry or coincidence of Nr and Nl is asserted here: the displayed module-model formulas Nr≅A∗⊗A− and Nl≅Hom⁡A(A∗,−) are theorems of the justified_by supplier Nakayama kernels give well-defined adjoint functors ↗, together with the behaviour under a change of module model. In particular the definition does not choose a module model, a presentation or a basis, and it does not identify Γrl or Γlr with the identity.

Depends on

Used by

Dependency tree · two levels

40 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