Alphabeta Math
False statementConstruction: AI-adaptedVerification: AI-generatedprecheck passaudited 2026-08-13
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.

FALSE: a functor preserving binary products and equalizers must preserve all finite limits

Statement refuted

Every functor that preserves binary products and equalizers preserves all finite limits.

Facts & Assumptions

Given: The terminal category 1 and the functor F:1→Set sending its sole object to ∅.

[L1]

Finite-limit criteria require nullary product data, equivalently a terminal object, in addition to binary products and equalizers (Finite, nonempty finite, and connected finite (co)limit criteria in terms of products, equalizers, pullbacks, terminal objects, and their duals).

Refutation

technique · constant-empty functor
1.1

The binary product of the sole object of 1 with itself is that object, and ∅×∅=∅. The image product cone consists of identity functions on ∅, so F preserves the binary product.

F2
1.2

Every parallel pair in 1 is (1,1) and has identity equalizer. Its image is (1∅,1∅), whose identity is also an equalizer. Thus F preserves equalizers.

F2
1.3

The sole object of 1 is terminal, but ∅ is not terminal in Set because no function {∗}→∅ exists. So F does not preserve the empty product, hence does not preserve all finite limits and is not continuous by [F1].

F1F2
2.1

This refutes the statement and exhibits exactly the missing nullary case in [L1].

L1step 1.1step 1.2step 1.3∎

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

18 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