Alphabeta Math
CounterexampleConstruction: Literature-sourcedVerification: AI-generatedprecheck passaudited 2026-09-05
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 bijection of hom-sets that does not exhibit a cotensor

Statement refuted

If one finds the expected bijection of ordinary hom-sets for a candidate cotensor object, then the candidate is a cotensor.

Facts & Assumptions

Given: The one-object Cat-enriched witness from the theorem page.

[L1]

There is a candidate object with the right underlying hom-set bijection but the wrong enriched hom-object, so it is not a cotensor (A bijection on underlying hom-sets need not exhibit a cotensor).

Counterexample

technique · direct
1.1

In the witness of [L1], the sole hom-category is the one-object category E with endomorphism monoid N, and the weight X is the discrete two-object category. The candidate is the sole enriched object. Its underlying hom-set and the underlying set of [X,E] are both singletons, so the required underlying bijection is present and is natural in the only test object.

L1given
2.1

The enriched cotensor property would require E[X,E]E×E. This is impossible because the endomorphism monoids N and N2 are not isomorphic. Thus the candidate has the expected natural underlying hom-set bijection but is not a cotensor.

L1step 1.1

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

3 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