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.
An indexed family is a function with domain ; is its range
Definition
Let be a set. An indexed family with index set is a function (A function is a relation with and implying ; , the value , domain and codomain) with . It is written , and abbreviates the value .
The set of its members is its range (Relation, , , , and the specialisations "relation from to " and "relation on "):
Remarks
-
An indexed family is not the set of its members. Two different indices may carry the same member, and the family records that while the set does not. The family with and has , and it is a different function from the family indexed by alone.
-
Every set is the range of some family. For a set , the identity relation is a function with domain and range , so is the set of members of the family it indexes. This is why the family forms of the distributive and De Morgan laws below say no less than the unindexed ones.
Depends on
Used by
- For a nonempty index set I: B ∩ ⋃_i ∈ I Aᵢ = ⋃_i ∈ I (B ∩ Aᵢ), B ∪ ⋂_i ∈ I Aᵢ = ⋂_i ∈ I (B ∪ Aᵢ), X ∖ ⋃_i ∈ I Aᵢ = ⋂_i ∈ I (X ∖ Aᵢ), and X ∖ ⋂_i ∈ I Aᵢ = ⋃_i ∈ I (X ∖ Aᵢ) Corollary
- ⋃_i ∈ I Aᵢ := ⋃ {Aᵢ : i ∈ I}, and ⋂_i ∈ I Aᵢ := ⋂ {Aᵢ : i ∈ I} for I ≠ ∅ Definition
- The product ∏_i ∈ I Aᵢ := { f : I → ⋃_i ∈ I Aᵢ ∣ f(i) ∈ Aᵢ for every i ∈ I } Definition
- 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 an indexed family (Aᵢ)_i ∈ I the collection of functions f with domain I and f(i) ∈ Aᵢ for every i ∈ I is a set Lemma
- For I = {∅,{∅}} with A_∅ = A and A_{∅} = B, the map f ↦ (f(∅), f({∅})) is a bijection ∏_i ∈ I Aᵢ → A × B Lemma
- 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: 17 results over 8 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), §2.3 (standard reference, not scraped)
- Indexed family (Wikipedia) (standard reference, not scraped)
- C. Wilson, A Brief Introduction to ZFC (Chicago REU 2016), Def. 2.13 (standard reference, not scraped)