Subconjunts

Subconjunts is a term used in set theory to refer to subsets. In mathematics, a subconjunt of a set A is a set B such that B is contained in A, written B ⊆ A. The term subconjunt is the Catalan equivalent of subset; the related notion of a proper subconjunt (proper subset) requires B ≠ A. If B ⊆ A and B ≠ A, B is a proper subconjunt.

For example, if A = {1, 2, 3}, then ∅, {1}, {2, 3}, and {1, 2, 3} are subconjunts of A. The number of subconjunts of a finite set with n elements is 2^n; the power set P(A) collects all subconjunts.

Operations inside the family of subconjunts: If B ⊆ A and C ⊆ A, then B ∪ C ⊆ A and B ∩ C ⊆ A. The set difference A \ B (elements in A not in B) is also a subconjunt of A. Thus the subconjunts of A form a lattice under union and intersection, with inclusion as the order relation.

Power set and cardinality: The power set P(A) = {B : B ⊆ A} has cardinality |P(A)| = 2^|A|. For infinite A, Cantor’s theorem implies |P(A)| > |A|.

Applications: Subconjunts are central in probability (events as subsets of a sample space), logic (characteristic functions and truth sets), combinatorics (counting and enumeration), and computer science (bitmasks and subset algorithms). They provide a foundational language for discussing containment, inclusion, and the structure of collections of objects.

---