Alphabeta Math
CorollaryStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge 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.

Eilenberg-Watts is a schematic equivalence of Hom categories

Statement

Let A,B be unital rings. The assignment M↦TM extends to an schematic equivalence between the category of (B,A)-bimodules with bimodule maps ((S,R)-bimodules and commuting left and right scalar actions) and the category of additive cocontinuous functors A-Mod→B-Mod with natural transformations (Natural transformations of additive cocontinuous module functors are determined at the regular module). It is full and faithful with Nat⁡(TM,TM′)≅Hom⁡B-A(M,M′), naturally in M and M′, and essentially surjective by Eilenberg-Watts theorem for arbitrary unital rings; a quasi-inverse is F↦F(AA). In particular TM≅TM′ if and only if M≅M′ as (B,A)-bimodules. Categorical language has the schematic meaning of Additive cocontinuous module functors and their schematic category; no category with proper-class functors as set-coded objects is asserted. No commutativity and no choice are used.

Facts & Assumptions

Given: Unital rings A,B and (B,A)-bimodules M,M′,M1,M2.

[F1]

The assignment M↦TM=M⊗A− lands in additive cocontinuous functors, and a bimodule map f:M→M′ gives the natural transformation with components f⊗1X, compatibly with identities and vertical composition; every additive cocontinuous functor F is naturally isomorphic to TF(A) (Eilenberg-Watts theorem for arbitrary unital rings).

[F2]

The additive cocontinuous functors with all natural transformations form a schematic category with set-coded fixed Hom-collections, and the (B,A)-bimodules with bimodule maps form a locally small category because each Hom-collection is a set of functions (Natural transformations of additive cocontinuous module functors are determined at the regular module, (S,R)-bimodules and commuting left and right scalar actions).

[F3]

The assignment f↦(f⊗1X) is a bijection Hom⁡B-A(M,M′)→Nat⁡(TM,TM′), and the two assignments are compatible with addition, identities and vertical composition; the inverse sends η to ρM′∘ηA∘ρM−1 (Natural transformations between tensor functors are bimodule maps).

[F4]

A functor is fully faithful when every induced hom-map is bijective and split essentially surjective when the data assign to every object D of the target an object C with an isomorphism FC≅D; such a functor is an equivalence, and no choice principle is needed because the splitting is part of the data (Faithful, full, fully faithful, essentially surjective, and split essentially surjective functors, A functor is an equivalence exactly when it is fully faithful and split essentially surjective, without Choice).

[F5]

A natural isomorphism has an inverse natural transformation (Natural isomorphism).

Proof

technique · direct
1.1F1F2

Let Φ be the assignment M↦TM on objects of the bimodule category and f↦(f⊗1X) on morphisms. By [F1] the objects are additive cocontinuous functors and the morphisms are natural transformations, compatibly with identities and vertical composition, so Φ respects the schematic category operations of [F2]; fixed Hom-collections are represented by sets by [F2].

1.2F3

Φ is full and faithful: for every pair M,M′ the map ΦM,M′:Hom⁡B-A(M,M′)→Nat⁡(TM,TM′) is the bijection of [F3].

1.3F1

Φ is split essentially surjective: by [F1] every additive cocontinuous F is naturally isomorphic to TF(A)=Φ(F(A)), and F(A) together with that isomorphism is determined by F, so the required data are supplied without any selection.

2.1F1F3F4step 1.1step 1.2step 1.3

The construction proving [F4] applies schematically: for η:F⇒G, define E(η) as the unique bimodule map whose tensor transformation is τG−1∘η∘τF, using the canonical comparisons τF:TF(A)⇒F of [F1] and the bijection [F3]. Composition compatibility makes E functorial, and τ is natural in F by this defining equation. Since τF,A=ρF(A), [F3] gives E(η)=ηA. The tensor-unit maps give the other natural isomorphism E(TM)≅M: the reconstructed right action is (m⊗a)b=m⊗ab, and ρM(m⊗ab)=(ma)b, while naturality follows on elementary tensors, so E(F)=F(A) is a schematic quasi-inverse. No quantification over objects that are proper classes is needed.

2.2F3step 1.2

Naturality in M and M′: for a bimodule map h:M1→M2 and f′:M2→M′, the bijection of [F3] sends f′∘h to the vertical composite of (f′⊗1X) with (h⊗1X) by the composition compatibility in [F3]; likewise postcomposition with a bimodule map corresponds to postcomposition with its tensor transformation. Hence the bijections are natural in both variables.

2.3F3F5step 1.2

The bijection identifies natural isomorphisms with bimodule isomorphisms: if η:TM⇒TM′ is a natural isomorphism with associated f and inverse η−1 with associated g, then the identities η−1∘η=1TM and η∘η−1=1TM′ translate under the compatibility of [F3] into g∘f=1M and f∘g=1M′, because the bijection sends 1TM to 1M; conversely, for a bimodule isomorphism f the transformation with components f⊗1X is a natural isomorphism with components f−1⊗1X. Hence TM≅TM′ if and only if M≅M′.

3.1step 1.1step 1.2step 1.3step 2.1step 2.2step 2.3∎

Steps 1.1-2.1 exhibit the equivalence Φ with quasi-inverse F↦F(A), step 2.2 its naturality in both variables, and step 2.3 the isomorphism statement. No object or presentation was chosen, and no commutativity is used.

Depends on

Used by

Dependency tree · two levels

35 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