I am proving that f: R->P, a function that associates a relation of equivalency to a partition is bijective. Let g: P->R. I showed that g(p=partition of X)={(a,b) belonging to X²| exists A belonging to p such as a,b belong to A} and i showed that g(p) is a relation of equivalency. I need to prove that g•f= identity of R and f•g= identity or P.
2026-03-29 19:10:23.1774811423
Bijective function from relations of equivalency set to partitions set
157 Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
1
There are 1 best solutions below
Related Questions in ABSTRACT-ALGEBRA
- Feel lost in the scheme of the reducibility of polynomials over $\Bbb Z$ or $\Bbb Q$
- Integral Domain and Degree of Polynomials in $R[X]$
- Fixed points of automorphisms of $\mathbb{Q}(\zeta)$
- Group with order $pq$ has subgroups of order $p$ and $q$
- A commutative ring is prime if and only if it is a domain.
- Conjugacy class formula
- Find gcd and invertible elements of a ring.
- Extending a linear action to monomials of higher degree
- polynomial remainder theorem proof, is it legit?
- $(2,1+\sqrt{-5}) \not \cong \mathbb{Z}[\sqrt{-5}]$ as $\mathbb{Z}[\sqrt{-5}]$-module
Related Questions in PROOF-WRITING
- how is my proof on equinumerous sets
- Do these special substring sets form a matroid?
- How do I prove this question involving primes?
- Total number of nodes in a full k-ary tree. Explanation
- Prove all limit points of $[a,b]$ are in $[a,b]$
- $\inf A = -\sup (-A)$
- Prove that $\sup(cA)=c\sup(A)$.
- Supremum of Sumset (Proof Writing)
- Fibonacci Numbers Proof by Induction (Looking for Feedback)
- Is my method correct for to prove $a^{\log_b c} = c^{\log_b a}$?
Related Questions in PROOF-EXPLANATION
- (From Awodey)$\sf C \cong D$ be equivalent categories then $\sf C$ has binary products if and only if $\sf D$ does.
- Lemma 1.8.2 - Convex Bodies: The Brunn-Minkowski Theory
- Proof of Fourier transform of cos$2\pi ft$
- Total number of nodes in a full k-ary tree. Explanation
- Finding height of a $k$-ary tree
- How to get the missing brick of the proof $A \circ P_\sigma = P_\sigma \circ A$ using permutations?
- Inner Product Same for all Inputs
- Complex Derivatives in Polar Form
- Confused about how to prove a function is surjective/injective?
- Question about proof of Hilbert's Nullstellensatz
Related Questions in EQUIVALENCE-RELATIONS
- Relations of equivalence...
- Number of subsets, relations etc of a set
- Number of possible equivalence relations
- Why is $p(z) = \frac{e^z}{1 + e^z} \color{red}{\equiv} \frac{1}{1 + e^{-z}}$ and not $=$?
- Simple question about relations
- Total number of equivalence class for a set
- Is this an equivalence relation and explaination?
- Partition of a set identified by a equivalence relation
- Define an equivalence relation on $\{ 1,2,3,4 \}^2$ by: (, )(, ) if ⋅ = ⋅ . How many equivalence classes are there?
- Prove that $\sum_{i=1}^n\lvert[a_i]\rvert$ is even iff $n$ is even
Related Questions in SET-PARTITION
- Existence of a denumerble partition.
- Given N sets of partitions, find a partition such that it satisfies a criterion
- Given a decreasing family of sets and partitions with a refinement condition, is there a monotonous choice function from the partitions?
- Partition of an $n$-element set such that the smallest component has at least $k$ elements?
- Number of equivalence relations on a set with $kn$ elements with the condition that each equivalence class has n elements
- Is there a similar notion of cycle type commonly in use for finite partitions, where instead of cycle sizes one counts the block sizes?
- Is it possible to construct two subsequences of a sequence X with specific properties such that the two subsequence sums are the same?
- Coloring $\mathbb{R}^2$ and single-colored paths
- A homework problem about set theory
- Canonical name for the partition that a partition of a set induces on its subsets
Trending Questions
- Induction on the number of equations
- How to convince a math teacher of this simple and obvious fact?
- Find $E[XY|Y+Z=1 ]$
- Refuting the Anti-Cantor Cranks
- What are imaginary numbers?
- Determine the adjoint of $\tilde Q(x)$ for $\tilde Q(x)u:=(Qu)(x)$ where $Q:U→L^2(Ω,ℝ^d$ is a Hilbert-Schmidt operator and $U$ is a Hilbert space
- Why does this innovative method of subtraction from a third grader always work?
- How do we know that the number $1$ is not equal to the number $-1$?
- What are the Implications of having VΩ as a model for a theory?
- Defining a Galois Field based on primitive element versus polynomial?
- Can't find the relationship between two columns of numbers. Please Help
- Is computer science a branch of mathematics?
- Is there a bijection of $\mathbb{R}^n$ with itself such that the forward map is connected but the inverse is not?
- Identification of a quadrilateral as a trapezoid, rectangle, or square
- Generator of inertia group in function field extension
Popular # Hahtags
second-order-logic
numerical-methods
puzzle
logic
probability
number-theory
winding-number
real-analysis
integration
calculus
complex-analysis
sequences-and-series
proof-writing
set-theory
functions
homotopy-theory
elementary-number-theory
ordinary-differential-equations
circles
derivatives
game-theory
definite-integrals
elementary-set-theory
limits
multivariable-calculus
geometry
algebraic-number-theory
proof-verification
partial-derivative
algebra-precalculus
Popular Questions
- What is the integral of 1/x?
- How many squares actually ARE in this picture? Is this a trick question with no right answer?
- Is a matrix multiplied with its transpose something special?
- What is the difference between independent and mutually exclusive events?
- Visually stunning math concepts which are easy to explain
- taylor series of $\ln(1+x)$?
- How to tell if a set of vectors spans a space?
- Calculus question taking derivative to find horizontal tangent line
- How to determine if a function is one-to-one?
- Determine if vectors are linearly independent
- What does it mean to have a determinant equal to zero?
- Is this Batman equation for real?
- How to find perpendicular vector to another vector?
- How to find mean and median from histogram
- How many sides does a circle have?
I would approach this problem in a slightly different way. I would construct the function and then prove it's one to one and onto.
Consider the set $X$.
Recall that an equivalence relation $R$ in $X$ is a subset of $X^2$ such that \begin{gather} \forall a\in X\,\colon(a,a)\in R\\ \forall a,b\in X\,\colon (a,b)\in R\Rightarrow (b,a)\in R\\ \left[(a,b)\in R\right]\wedge \left[(b,c)\in R \right]\Rightarrow (a,c)\in R \end{gather} Now, consider some $a\in X$, the equivalence class of $a$ is the subset $Ra$ of $X$ given by \begin{equation} Ra=\left\{b\in X\, \lvert \, (b,a)\in R\right\} \end{equation}
And a partition of $X$ is a covering $\left\{ A_\alpha\, \lvert \,\alpha \in I\right\}$ of $X$ such that $A_\alpha \cap A_\beta =\varnothing$ if and only if $\alpha \neq \beta$.
Covering just means that $\bigcup_{\alpha\in I} A_\alpha =X$.
Remark: The collection of sets $\left\{Ra\, \lvert \, a\in X\right\}$ is a partition of $X$ (using the relation $R$ as the 'equal' for the index $a$). This follows directly from the fact that $Ra =Rb$ if and only if $(a,b)\in R$.
With this definitions in mind, we want to show that there exists a bijective function $f$ from the set of equivalence relations in $X$ and the partitions of $X$.
So, for the proof:
Let $R$ be an equivalence relation in $X$. We claim that the map \begin{equation} R\mapsto \left\{Ra\, \lvert \, a\in X\right\} \end{equation} is the desired bijection.
Proof that $f$ is one to one:
Let $R$ and $S$ be equivalence relations in $X$, then, if $f(R)\neq f(S)$, it would mean that there exists (without losing generality) some $Rb$ in $ \left\{Ra\, \lvert \, a\in X\right\}$ such that $Rb$ is not in $\left\{Sa\, \lvert \, a\in X\right\}$, this meaning that $R\neq S$.
Proof that $f$ is onto:
Suppose $\left\{ A_\alpha\, \lvert \,\alpha \in I\right\}$ is a partition of $X$. It can be shown that the following is an equivalence relation \begin{equation} R = \bigcup\left\{ A_\alpha \times A_\alpha \,\lvert\, \alpha \in I \right\} \end{equation} And the equivalence classes would have the form $\left\{ A_\alpha\, \lvert \,\alpha \in I\right\}$. Hence $f(R)=\left\{ A_\alpha\, \lvert \,\alpha \in I\right\}$. This proves that $f$ is bijective.
Hope this helps you.