Alphabeta Math
CounterexampleConstruction: AI-generatedVerification: AI-generatedPipeline-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.

A right exact module functor without coproduct preservation is not tensor

Statement refuted

Every additive right exact module functor is naturally isomorphic to a tensor functor; in particular the coproduct-preservation hypothesis of the Eilenberg-Watts characterization can be dropped.

Facts & Assumptions

Given: The Axiom of Choice, a field k, the functor F:Modk→Modk with F(V)=∏n≥0V and F(u)=∏nu for k-linear maps, and the family (k)j∈N of k-modules.

[F1]

The Axiom of Choice: every family of nonempty sets has a choice function (The Axiom of Choice).

[F2]

For a family (Xi)i∈I of k-modules the direct product ∏iXi carries coordinatewise operations, and the direct sum ⨁iXi consists of the finitely supported families; the direct sum is the coproduct with coordinate inclusions ȷi, and a homomorphism out of it is uniquely determined by its components (The direct sum of an indexed family of modules, Universal property of a direct sum of modules, Unital left and right modules over a ring; unqualified module means left module).

[F3]

Every tensor functor TN=N⊗k−:Modk→Modk is additive, right exact and coproduct-preserving (Eilenberg-Watts theorem for arbitrary unital rings).

[F4]

A functor between abelian categories is exact if and only if it carries every short exact sequence to a short exact sequence; it is exact iff it is additive, left exact and right exact (Left exactness, right exactness, and exactness are characterized by short exact sequences; Exact sequences and short exact sequences of modules). The category Modk is abelian (Modules over a ring form an abelian category).

[F5]

A sequence of k-modules is exact exactly when it is exact after forgetting the scalar action, since kernels and images are computed on the underlying sets (Exact sequences and short exact sequences of modules).

Counterexample

technique · direct
1.1F2

F is an additive functor: the operations on ∏nV are coordinatewise by [F2], and for parallel maps u,v one has F(u+v)=∏n(u+v)=∏nu+∏nv=F(u)+F(v), with F(id)=id and F(u′u)=F(u′)F(u) coordinatewise.

1.2F4F5

F is left exact: let 0→V′→u′V→uV′′→0 be a short exact sequence of k-modules. Coordinatewise, ∏nu′ is injective, and an element (vn) of ∏nV lies in ker⁡∏nu exactly when u(vn)=0 for all n, i.e. vn∈im⁡u′ for all n by exactness at V; hence ker⁡∏nu=im⁡∏nu′ and 0→∏nV′→∏nV→∏nV′′ is exact. By [F4] this proves left exactness.

1.3F2

Let c:⨁jF(k)→F(⨁jk) be induced by the maps F(ȷj). An element of its source is a family of scalar sequences (sj)j supported on a finite set J⊆N of summand indices. Its image has n-th coordinate ∑j∈Jsj(n)ej, supported in J for every n. Conversely, if (vn)n has every vn supported in one finite set J, define sj(n) as the j-th coefficient of vn for j∈J and put sj=0 otherwise; then (sj)j belongs to the source and maps to (vn)n. Thus the image consists exactly of families with supports contained in one fixed finite set of summand indices.

2.1F1F4F5step 1.2

Under AC, F is right exact: if u:V→V′′ is surjective, each fibre u−1(wn) for (wn)∈∏nV′′ is nonempty, so by [F1] there is a choice function on the family (u−1(wn))n≥0, whose values form (vn)∈∏nV with u(vn)=wn; hence ∏nu is surjective, and with the kernel computation of step 1.2 the sequence ∏nV′→∏nV→∏nV′′→0 is exact. By [F4], F is right exact. The Axiom of Choice is used exactly here, to select one preimage in each of the countably many fibres; only this countable instance is used.

2.2F2step 1.3

The element w=(en)n≥0∈∏n(⨁jk), where en is the n-th standard basis vector, is not in the image of c: it would be the image of a source family supported on a finite set S of summand indices, forcing {n}=supp⁡(en)⊆S for every n, so S⊇N, contradicting the finiteness of S. Hence c is not surjective and F does not preserve the coproduct of the family (k)j∈N.

3.1F4step 1.1step 1.2step 2.1

By steps 1.1-1.3 and 2.1 the functor F is additive, left exact and right exact, hence exact by [F4] and in particular right exact.

3.2F3step 2.2

No tensor functor represents F: suppose σ:F⇒TN is a natural isomorphism. Naturality of σ at the coordinate inclusions ȷj gives TN(ȷj)∘σk=σ⨁jk∘F(ȷj) for every j, so by the universal property in [F2] the comparison maps satisfy σ⨁jk∘c=c′∘(⨁jσk), where c′ is the comparison of TN; since σ⨁jk and ⨁jσk are isomorphisms, c is an isomorphism if c′ is. But c′ is an isomorphism because TN preserves coproducts by [F3], while c is not surjective by step 2.2; this is a contradiction. Hence F is not naturally isomorphic to any tensor functor.

4.1step 2.1step 2.2step 3.1step 3.2∎

Therefore F is additive and exact, hence right exact, but does not preserve coproducts and is not tensor: the coproduct-preservation hypothesis of the Eilenberg-Watts theorem cannot be dropped even for exact functors. The only choice used is the coordinatewise lifting in step 2.1; the rest of the argument is choice-free.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

33 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.