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 difference , the symmetric difference , and the complement relative to a set
Definition
Let and be sets. The difference of and is
a set by The Axiom Schema of Separation: for each formula , and the only one with those elements by The Axiom of Extensionality: ; so holds exactly when and . The symmetric difference is
formed with the binary union of The union of a set, and the binary union .
When (Subset , proper subset , and the separation notation ), the difference is called the complement of relative to . The qualification is not optional: there is no set of all sets (There is no set with for every set ), so an absolute complement, the class of all sets not in , is never a set.
Remarks
-
Difference needs no hypothesis. is defined for all sets and , with no assumption that or that the two meet. When they are disjoint, .
-
Symmetric difference collects what lies in exactly one of the two sets. Unfolding the definition, holds exactly when belongs to or to but not to both.
Depends on
- The Axiom Schema of Separation: for each formula $\varphi$, $\forall \bar p\,\forall x\,\exists y\,\forall z\,(z \in y \leftrightarrow (z \in x \wedge \varphi(z,\bar p)))$
- The union $\bigcup x$ of a set, and the binary union $a \cup b := \bigcup \{a,b\}$
- The Axiom of Extensionality: $\forall x\,\forall y\,(\forall z\,(z \in x \leftrightarrow z \in y) \to x = y)$
- Subset $x \subseteq y$, proper subset $x \subsetneq y$, and the separation notation $\{\, z \in x : \varphi(z) \,\}$
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
- Choice function Definition
- ⋃ ⋂ (a,b) = a for all a and b, and ⋃(a,b) = {a,b}, so both coordinates are recovered from the pair as a set Example
- FALSE: (a ∖ b) ∖ c = a ∖ (b ∖ c) for all sets a, b, c False statement
- A × (B ∪ C) = (A × B) ∪ (A × C), A × (B ∩ C) = (A × B) ∩ (A × C), A × (B ∖ C) = (A × B) ∖ (A × C), (A ∩ B) × (C ∩ D) = (A × C) ∩ (B × D); A × B = ∅ if and only if A = ∅ or B = ∅; and for nonempty A and B, A × B ⊆ C × D if and only if A ⊆ C and B ⊆ D Proposition
- For f : A → B and S, T ⊆ A: f[S ∪ T] = f[S] ∪ f[T], f[S ∩ T] ⊆ f[S] ∩ f[T] and f[S] ∖ f[T] ⊆ f[S ∖ T]; both inclusions are equalities for all S and T if and only if f is injective Proposition
- R[A ∪ B] = R[A] ∪ R[B], R[A ∩ B] ⊆ R[A] ∩ R[B], R[A] ∖ R[B] ⊆ R[A ∖ B], A ⊆ B implies R[A] ⊆ R[B], and (S ∘ R)[A] = S[R[A]] Proposition
- Union and intersection are commutative, associative, idempotent and absorptive; a ∪ ∅ = a, a ∩ ∅ = ∅, a ∖ ∅ = a, a ∖ a = ∅; and a ⊆ b if and only if a ∪ b = b, if and only if a ∩ b = a, if and only if a ∖ b = ∅ Proposition
- For f : A → B and T, U ⊆ B: f⁻¹[T ∪ U] = f⁻¹[T] ∪ f⁻¹[U], f⁻¹[T ∩ U] = f⁻¹[T] ∩ f⁻¹[U], f⁻¹[T ∖ U] = f⁻¹[T] ∖ f⁻¹[U], and f⁻¹[B ∖ T] = A ∖ f⁻¹[T] Theorem
- On a set A, R ↦ R ∖ Δ_A and S ↦ S ∪ Δ_A are mutually inverse bijections between the partial orders on A and the irreflexive, transitive relations on A; R ∖ Δ_A is the strict order of R, and every irreflexive transitive relation is asymmetric Theorem
- X ∖ (a ∪ b) = (X ∖ a) ∩ (X ∖ b) and X ∖ (a ∩ b) = (X ∖ a) ∪ (X ∖ b); and for a nonempty set F, X ∖ ⋃ F = ⋂ { X ∖ a : a ∈ F } and X ∖ ⋂ F = ⋃ { X ∖ a : a ∈ F } Theorem
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 8 results over 4 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. 4 and Def. 5 (standard reference, not scraped)
- Complement (set theory) (Wikipedia) (standard reference, not scraped)
- Symmetric difference (Wikipedia) (standard reference, not scraped)