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 product
Definition
Let be an indexed family (An indexed family is a function with domain ; is its range) and write (, and for ). By For an indexed family the collection of functions with domain and for every is a set the following collection is a set; it is the product of the family:
So an element of is a function with domain that takes its value at each index inside the member carried by that index; "function" is as in A function is a relation with and implying ; , the value , domain and codomain.
Remarks
-
Nonemptiness of the product is exactly the Axiom of Choice. Nothing in this definition decides whether is nonempty when every is nonempty. That assertion, for an arbitrary index set, is one of the standard formulations of the Axiom of Choice, stated later on this page at The Axiom of Choice. The product formulation recorded there, that is nonempty whenever every is nonempty, quantifies over exactly the object defined here: it is this definition that fixes what the symbol in that formulation denotes, and what its elements are. What is decided without any choice principle is the degenerate arithmetic: the empty index set and a family with an empty member, both in ; if for some then ; and for the evaluation is a bijection , together with the families whose product can be written down explicitly.
-
Why the ambient set is . The definition separates inside the set of all functions , so the ambient set must contain every function with domain whose value at lies in . Taking to be the union of the members secures that, since such a value lies in and hence in ; and is the smallest set that includes every member of the family.
Depends on
- For an indexed family $(A_i)_{i \in I}$ the collection of functions $f$ with domain $I$ and $f(i) \in A_i$ for every $i \in I$ is a set
- An indexed family $(A_i)_{i \in I}$ is a function with domain $I$; $\{A_i : i \in I\}$ is its range
- $\bigcup_{i \in I} A_i := \bigcup \{A_i : i \in I\}$, and $\bigcap_{i \in I} A_i := \bigcap \{A_i : i \in I\}$ for $I \neq \varnothing$
- 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
- ∅ is a relation on every set, is the unique equivalence relation on ∅, is a function ∅ → B for every B, is a bijection ∅ → ∅, and is not a surjection ∅ → {∅} Example
- For any indexed family the product ∏_i ∈ I P(Xᵢ) contains the constant function with value ∅, and ∏_i ∈ I {i} has exactly one element Example
- FALSE: assuming ZF is consistent, ZF proves that every surjection f : A → B has a right inverse g : B → A with f ∘ g = Δ_B False statement
- For I = {∅,{∅}} with A_∅ = A and A_{∅} = B, the map f ↦ (f(∅), f({∅})) is a bijection ∏_i ∈ I Aᵢ → A × B Lemma
- ∏_i ∈ ∅ Aᵢ = {∅}; if Aⱼ = ∅ for some j ∈ I then ∏_i ∈ I Aᵢ = ∅; and for I = {j} the evaluation f ↦ f(j) is a bijection ∏_i ∈ I Aᵢ → Aⱼ Proposition
- The Axiom of Choice is stated on this page and assumed by no proof on it; the two statements that would need it are identified and left unsettled Remark
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 25 results over 11 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
- B. Kaya, MATH 320 Set Theory (METU), Def. 21 (standard reference, not scraped)
- Cartesian product (Wikipedia) (standard reference, not scraped)
- Indexed family (Wikipedia) (standard reference, not scraped)