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.
The functor on is not covariantly representable
Statement refuted
The endofunctor defined by
is covariantly representable.
Facts & Assumptions
Given: The category and the tagged doubling assignment in the statement.
Sets and functions form the locally small category , and a functor must preserve identities and composition (Sets and functions form the large locally small category , Covariant functor, identity functor, composite functor, and contravariant functor).
The Cartesian product consists of its ordered pairs, and binary union contains exactly the elements in either of its two members (The Cartesian product , The union of a set, and the binary union , , , , , and ).
Ordered pairs satisfy if and only if and ; the naturals and are distinct (The Kuratowski ordered pair , if and only if and , The natural numbers (von Neumann)).
The functions form the set , and a function assigns exactly one value to each element of its domain. Hence for every set , including , there is exactly one function (The set of all functions , A function is a relation with and implying ; , the value , domain and codomain).
Representability by would give bijections for every set , and a bijection must be both injective and surjective (Presheaves, covariantly and contravariantly representable functors, and representations, Injection, surjection, bijection).
Counterexample
The formula for is a function by [F2] and [F3]. It preserves the tag and applies to the first coordinate, so and ; by [F1], is an endofunctor.
By [F4], is a singleton for every , including .
By [F2] and [F3], and its two displayed elements are distinct, so it has exactly two elements.
Suppose were represented by a set . The component at the singleton would be a bijection by [F5].
No function from a singleton onto a two-element set is surjective, contradicting the bijection in step 2.1.
Therefore is a well-defined functor but is not covariantly representable.
Depends on
- Presheaves, covariantly and contravariantly representable functors, and representations
- Sets and functions form the large locally small category $\mathbf{Set}$
- Covariant functor, identity functor, composite functor, and contravariant functor
- The set $B^{A}$ of all functions $A \to B$
- Injection, surjection, bijection
- The Cartesian product $A \times B := \{\, z \in \mathcal{P}(\mathcal{P}(A \cup B)) : \exists a \in A\ \exists b \in B\ z = (a,b) \,\}$
- The union $\bigcup x$ of a set, and the binary union $a \cup b := \bigcup \{a,b\}$
- $\bigcup \varnothing = \varnothing$, $\bigcup \{a\} = a$, $\bigcup \{a,b\} = a \cup b$, $\bigcap \{a\} = a$, and $\bigcap \{a,b\} = a \cap b$
- The Kuratowski ordered pair $(a,b) := \{\{a\},\{a,b\}\}$
- $(a,b) = (c,d)$ if and only if $a = c$ and $b = d$
- The natural numbers $\mathbb{N}$ (von Neumann)
- A function is a relation $f$ with $(a,b) \in f$ and $(a,c) \in f$ implying $b = c$; $f : A \to B$, the value $f(a)$, domain and codomain
Used by
Nothing in the library uses this result yet.
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 51 results over 25 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.
Sources
- Justin Campbell, Harvard Math 55b tutorial notes, Example 2.3 (standard reference, not scraped)