Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-16
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.

Coextension of scalars is right adjoint to restriction of scalars

Statement

For a unital ring homomorphism φ:R→S, restriction of scalars

Res⁡:S-Mod→R-Mod

is left adjoint to coextension of scalars

Coind⁡(M):=Hom⁡R(S,M).

Naturally in an S-module N and an R-module M,

Hom⁡S(N,Hom⁡R(S,M))≅Hom⁡R(Res⁡N,M).

Facts & Assumptions

Given: The ring homomorphism φ:R→S, a left S-module N, and a left R-module M.

[L1]

On Hom⁡R(S,M) the canonical left S-action is (s⋅h)(t)=h(ts) (Coextension of scalars Hom⁡R(S,M) carries its canonical left S-module structure).

[F1]

Left modules and module homomorphisms form locally small categories (Left modules over a fixed ring and module homomorphisms form the large locally small category R-Mod).

[L2]

A natural family of hom-set bijections determines an adjunction (Under local smallness, transposition gives the natural hom-set bijection, and conversely).

Proof

technique · direct
1.1L1algebra

Given an S-linear map α:N→Hom⁡R(S,M), define E(α):Res⁡N→M by E(α)(n)=α(n)(1S). It is R-linear because α(φ(r)n)=φ(r)⋅α(n) and [L1] gives (φ(r)⋅α(n))(1)=α(n)(φ(r))=rα(n)(1).

1.2constructalgebra

Given an R-linear map u:Res⁡N→M, define C(u)(n)(s):=u(sn). For r∈R, C(u)(n)(φ(r)s)=u(φ(r)sn)=ru(sn), so C(u)(n) is R-linear.

2.1step 1.2L1

For a,s∈S, C(u)(an)(s)=u(san)=C(u)(n)(sa)=(a⋅C(u)(n))(s) by [L1], so C(u) is S-linear.

2.2step 1.1step 1.2L1

Evaluation gives E(C(u))(n)=C(u)(n)(1)=u(n). Conversely, S-linearity of α gives C(E(α))(n)(s)=E(α)(sn)=α(sn)(1)=(s⋅α(n))(1)=α(n)(s).

3.1step 2.1step 2.2F1

Thus E and C are inverse bijections. Precomposition in N and postcomposition in M commute with the two displayed formulas, so the bijections are natural.

4.1step 3.1L2∎

By [L2], these natural bijections define Res⁡⊣Coind⁡. No tensor-product or extension-of-scalars construction is used.

Depends on

Used by

Dependency tree · two levels

13 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