当前位置：网站首页>[set theory] binary relation (example of binary relation operation | example of inverse operation | example of composite operation | example of limiting operation | example of image operation)
[set theory] binary relation (example of binary relation operation | example of inverse operation | example of composite operation | example of limiting operation | example of image operation)
2022-07-03 04:37:00 【Programmer community】
List of articles
- One 、 Examples of inverse operations
- Two 、 Examples of composite operations ( Reverse order synthesis )
- 3、 ... and 、 Examples of limiting operations
- Four 、 Like operation examples
One 、 Examples of inverse operations
A
=
{
a
,
b
,
c
,
d
}
A = \{ a, b, c, d \}
A={ a,b,c,d}
B
=
{
a
,
b
,
<
c
,
d
>
}
B = \{ a, b, <c, d> \}
B={ a,b,<c,d>}
C
=
{
<
a
,
b
>
,
<
c
,
d
>
}
C = \{ <a, b> , <c, d> \}
C={ <a,b>,<c,d>}
Find the inverse operation of the above set
The inverse operation can only aim at Ordered pair Conduct , If there is no order, right , There is no concept of relational operation ;
A
A
A There are no ordered pairs in the set , Therefore, there is no concept of relational operation , Inverse it , The result is an empty set ;
A
−
1
=
∅
A^{-1} = \varnothing
A−1=∅
B
B
B Collection Yes Ordered pair
<
c
,
d
>
<c, d>
<c,d> , The inverse operation is to find the inverse of all ordered pairs ;
B
−
1
=
{
<
d
,
c
>
}
B^{-1} = \{ <d, c> \}
B−1={ <d,c>}
C
C
C Collection Yes Ordered pair
<
a
,
b
>
,
<
c
,
d
>
<a,b> , <c, d>
<a,b>,<c,d> , The inverse operation is to find the inverse of all ordered pairs ;
C
−
1
=
{
<
b
,
a
>
,
<
d
,
c
>
}
C^{-1} = \{ <b,a> , <d, c> \}
C−1={ <b,a>,<d,c>}
Two 、 Examples of composite operations ( Reverse order synthesis )
B
=
{
a
,
b
,
<
c
,
d
>
}
B = \{ a, b , <c,d> \}
B={ a,b,<c,d>}
R
=
{
<
a
,
b
>
,
<
c
,
d
>
}
R = \{ <a,b> , <c,d> \}
R={ <a,b>,<c,d>}
G
=
{
<
b
,
e
>
,
<
d
,
c
>
}
G = \{ <b, e> , <d, c> \}
G={ <b,e>,<d,c>}
Find the result of the following synthesis operation , there synthesis refer to Reverse order synthesis
B
o
R
−
1
B o R^{-1}
BoR−1
R
−
1
=
{
<
b
,
a
>
,
<
d
,
c
>
}
R^{-1} = \{ <b,a> , <d,c> \}
R−1={ <b,a>,<d,c>}
B
o
R
−
1
=
{
<
c
,
d
>
}
o
{
<
b
,
a
>
,
<
d
,
c
>
}
=
{
<
d
,
d
>
}
B o R^{-1} = \{ <c, d> \} o \{ <b,a> , <d,c> \} = \{ <d, d> \}
BoR−1={ <c,d>}o{ <b,a>,<d,c>}={ <d,d>}
synthesis The default is Reverse order synthesis
G
o
B
G o B
GoB
G
o
B
=
{
<
b
,
e
>
,
<
d
,
c
>
}
o
{
<
c
,
d
>
}
=
{
<
c
,
c
>
}
G o B = \{<b,e>, <d, c>\} o \{ <c,d> \} = \{ <c,c> \}
GoB={ <b,e>,<d,c>}o{ <c,d>}={ <c,c>}
G
o
R
G o R
GoR
G
o
R
=
{
<
b
,
e
>
,
<
d
,
c
>
}
o
{
<
a
,
b
>
,
<
c
,
d
>
}
=
{
<
a
,
e
>
,
<
c
,
c
>
}
G o R =\{<b,e>, <d, c>\} o \{ <a,b> , <c,d> \} = \{ <a,e>, <c,c> \}
GoR={ <b,e>,<d,c>}o{ <a,b>,<c,d>}={ <a,e>,<c,c>}
R
o
G
R o G
RoG
R
o
G
=
{
<
a
,
b
>
,
<
c
,
d
>
}
o
{
<
b
,
e
>
,
<
d
,
c
>
}
=
{
<
d
,
d
>
}
R o G =\{ <a,b> , <c,d> \} o \{<b,e>, <d, c>\} = \{ <d,d> \}
RoG={ <a,b>,<c,d>}o{ <b,e>,<d,c>}={ <d,d>}
3、 ... and 、 Examples of limiting operations
F
=
{
<
a
,
b
>
,
<
a
,
{
a
}
>
,
<
{
a
}
,
{
a
,
{
a
}
}
>
}
F = \{ <a,b> , <a, \{a\}> , <\{a\} , \{a, \{a\}\}> \}
F={ <a,b>,<a,{ a}>,<{ a},{ a,{ a}}>}
Reference resources : 【 Set theory 】 Binary relationship ( Domain of definition | range | Domain | Inverse operation | Reverse composition operation | Limit | image | Single root | Single value | The nature of composition operation ) 5、 ... and 、 Relationship constraints
1. seek
F
↾
{
a
}
F \upharpoonright \{a\}
F↾{ a}
F
F
F Ordered pairs in sets , The first element is
{
a
}
\{a\}
{ a} An ordered pair of elements in a set , The set of these ordered pairs is
F
F
F aggregate stay
{
a
}
\{a\}
{ a} Restrictions on sets ;
F
↾
{
a
}
=
{
<
a
,
b
>
,
<
a
,
{
a
}
>
}
F \upharpoonright \{a\} = \{ <a,b> , <a, \{a\}> \}
F↾{ a}={ <a,b>,<a,{ a}>}
2. seek
F
↾
{
{
a
}
}
F \upharpoonright \{\{a\}\}
F↾{ { a}}
F
F
F Ordered pairs in sets , The first element is
{
{
a
}
}
\{\{a\}\}
{ { a}} An ordered pair of elements in a set ,
{
{
a
}
}
\{\{a\}\}
{ { a}} The elements in the set are
{
a
}
\{a\}
{ a} , The set of these ordered pairs is
F
F
F aggregate stay
{
{
a
}
}
\{\{a\}\}
{ { a}} Restrictions on sets ;
F
↾
{
{
a
}
}
=
{
<
{
a
,
{
a
}
}
>
}
F \upharpoonright \{\{a\}\} = \{ <\{a, \{a\}\}> \}
F↾{ { a}}={ <{ a,{ a}}>}
3. seek
F
↾
{
a
,
{
a
}
}
F \upharpoonright \{a, \{a\}\}
F↾{ a,{ a}}
F
F
F Ordered pairs in sets , The first element is
{
a
,
{
a
}
}
\{a, \{a\}\}
{ a,{ a}} The elements in the collection That's right , The set of these ordered pairs is
F
F
F aggregate stay
{
a
,
{
a
}
}
\{a, \{a\}\}
{ a,{ a}} Restrictions on sets ;
F
↾
{
a
,
{
a
}
}
=
{
<
a
,
b
>
,
<
a
,
{
a
}
>
,
<
{
a
}
,
{
a
,
{
a
}
}
>
}
F \upharpoonright \{a, \{a\}\} = \{ <a,b> , <a, \{a\}> , <\{a\} , \{a, \{a\}\}> \}
F↾{ a,{ a}}={ <a,b>,<a,{ a}>,<{ a},{ a,{ a}}>}
4. seek
F
−
1
↾
{
{
a
}
}
F^{-1} \upharpoonright \{\{a\}\}
F−1↾{ { a}}
F
−
1
=
{
<
b
,
a
>
,
<
{
a
}
,
a
>
,
<
{
a
,
{
a
}
}
,
{
a
}
>
}
F^{-1} = \{ <b, a> , <\{a\}, a> , <\{a, \{a\}\}, \{a\} > \}
F−1={ <b,a>,<{ a},a>,<{ a,{ a}},{ a}>}
F
−
1
F^{-1}
F−1 Ordered pairs in sets , The first element is
{
{
a
}
}
\{\{a\}\}
{ { a}} The elements in the collection That's right , The set of these ordered pairs is
F
−
1
F^{-1}
F−1 aggregate stay
{
{
a
}
}
\{\{a\}\}
{ { a}} Restrictions on sets ;
F
−
1
↾
{
{
a
}
}
=
{
<
{
a
}
,
a
>
}
F^{-1} \upharpoonright \{\{a\}\} = \{ <\{a\}, a> \}
F−1↾{ { a}}={ <{ a},a>}
Four 、 Like operation examples
F
=
{
<
a
,
b
>
,
<
a
,
{
a
}
>
,
<
{
a
}
,
{
a
,
{
a
}
}
>
}
F = \{ <a, b> , <a, \{ a \}> , <\{ a \} , \{ a, \{a\} \}> \}
F={ <a,b>,<a,{ a}>,<{ a},{ a,{ a}}>}
Reference resources : 【 Set theory 】 Binary relationship ( Domain of definition | range | Domain | Inverse operation | Reverse composition operation | Limit | image | Single root | Single value | The nature of composition operation ) 6、 ... and 、 Image of relationship
F
F
F Assemble in
A
A
A Collective image , yes
F
F
F Assemble in
A
A
A Limited on the set range ;
1.
F
[
{
a
}
]
F[\{a\}]
F[{ a}]
F
F
F Assemble in
{
a
}
\{a\}
{ a} The image on the set , yes
F
F
F Assemble in
{
a
}
\{a\}
{ a} The value range of the restriction on the set ,
F
F
F Assemble in
{
a
}
\{a\}
{ a} The limit on the set is
{
<
a
,
b
>
,
<
a
,
{
a
}
>
}
\{ <a, b> , <a, \{ a \}> \}
{ <a,b>,<a,{ a}>} , Corresponding
F
F
F Assemble in
{
a
}
\{a\}
{ a} On the set, it looks like
{
b
,
{
a
}
}
\{ b, \{a\} \}
{ b,{ a}}
F
[
{
a
}
]
=
{
b
,
{
a
}
}
F[\{a\}] = \{ b, \{a\} \}
F[{ a}]={ b,{ a}}
2.
F
[
{
a
,
{
a
}
}
]
F[\{a, \{a\}\}]
F[{ a,{ a}}]
F
F
F Assemble in
{
a
,
{
a
}
}
\{a, \{a\}\}
{ a,{ a}} The image on the set , yes
F
F
F Assemble in
{
a
,
{
a
}
}
\{a, \{a\}\}
{ a,{ a}} The value range of the restriction on the set ,
F
F
F Assemble in
{
a
,
{
a
}
}
\{a, \{a\}\}
{ a,{ a}} The limit on the set is
{
<
a
,
b
>
,
<
a
,
{
a
}
>
,
<
{
a
}
,
{
a
,
{
a
}
}
>
}
\{ <a, b> , <a, \{ a \}> , <\{ a \} , \{ a, \{a\} \}> \}
{ <a,b>,<a,{ a}>,<{ a},{ a,{ a}}>} , Corresponding
F
F
F Assemble in
{
a
,
{
a
}
}
\{a, \{a\}\}
{ a,{ a}} On the set, it looks like
{
b
,
{
a
}
,
{
a
,
{
a
}
}
\{ b, \{a\} , \{ a, \{a\} \}
{ b,{ a},{ a,{ a}}
F
[
{
a
,
{
a
}
}
]
=
{
b
,
{
a
}
,
{
a
,
{
a
}
}
F[\{a, \{a\}\}] = \{ b, \{a\} , \{ a, \{a\} \}
F[{ a,{ a}}]={ b,{ a},{ a,{ a}}
3.
F
−
1
[
{
a
}
]
F^{-1}[\{a\}]
F−1[{ a}]
F
−
1
=
{
<
b
,
a
>
,
<
{
a
}
,
a
>
,
<
{
a
,
{
a
}
}
,
{
a
}
>
}
F^{-1} = \{ <b, a> , <\{a\}, a> , <\{a, \{a\}\}, \{a\} > \}
F−1={ <b,a>,<{ a},a>,<{ a,{ a}},{ a}>}
F
−
1
F^{-1}
F−1 Assemble in
{
a
}
\{a\}
{ a} The image on the set , yes
F
−
1
F^{-1}
F−1 Assemble in
{
a
}
\{a\}
{ a} The value range of the restriction on the set ,
F
−
1
F^{-1}
F−1 Assemble in
{
a
}
\{a\}
{ a} The limit on the set is
∅
\varnothing
∅ , Corresponding
F
−
1
F^{-1}
F−1 Assemble in
{
a
}
\{a\}
{ a} On the set, it looks like
∅
\varnothing
∅
F
−
1
[
{
a
}
]
=
∅
F^{-1}[\{a\}] = \varnothing
F−1[{ a}]=∅
4.
F
−
1
[
{
{
a
}
}
]
F^{-1}[\{ \{a\} \}]
F−1[{ { a}}]
F
−
1
=
{
<
b
,
a
>
,
<
{
a
}
,
a
>
,
<
{
a
,
{
a
}
}
,
{
a
}
>
}
F^{-1} = \{ <b, a> , <\{a\}, a> , <\{a, \{a\}\}, \{a\} > \}
F−1={ <b,a>,<{ a},a>,<{ a,{ a}},{ a}>}
F
−
1
F^{-1}
F−1 Assemble in
{
{
a
}
}
\{ \{a\} \}
{ { a}} The image on the set , yes
F
−
1
F^{-1}
F−1 Assemble in
{
{
a
}
}
\{ \{a\} \}
{ { a}} The value range of the restriction on the set ,
F
−
1
F^{-1}
F−1 Assemble in
{
{
a
}
}
\{ \{a\} \}
{ { a}} The limit on the set is
<
{
a
}
,
a
>
<\{a\}, a>
<{ a},a> , Corresponding
F
−
1
F^{-1}
F−1 Assemble in
{
{
a
}
}
\{ \{a\} \}
{ { a}} On the set, it looks like
{
a
}
\{a\}
{ a}
F
−
1
[
{
{
a
}
}
]
=
{
a
}
F^{-1}[\{ \{a\} \}] = \{a\}
F−1[{ { a}}]={ a}
边栏推荐
- [BMZCTF-pwn] 18-RCTF-2017-Recho
- Integration of Android high-frequency interview questions (including reference answers)
- Leetcode simple question: check whether two string arrays are equal
- X-ray normal based contour rendering
- 多板块轮动策略编写技巧----策略编写学习教材
- [literature reading] sparse in deep learning: practicing and growth for effective information and training in NN
- [fxcg] inflation differences will still lead to the differentiation of monetary policies in various countries
- Smart contract security audit company selection analysis and audit report resources download - domestic article
- Youdao cloud notes
- 2022 tea master (intermediate) examination questions and tea master (intermediate) examination skills
猜你喜欢
Web security - CSRF (token)
跨境电商多商户系统怎么选
Why should programmers learn microservice architecture if they want to enter a large factory?
2022 a special equipment related management (elevator) analysis and a special equipment related management (elevator) simulation test
2022 new examination questions for the main principals of hazardous chemical business units and examination skills for the main principals of hazardous chemical business units
Design and implementation of JSP logistics center storage information management system
解决bp中文乱码
【XSS绕过-防护策略】理解防护策略，更好的绕过
After job hopping at the end of the year, I interviewed more than 30 companies in two weeks and finally landed
How to choose cross-border e-commerce multi merchant system
随机推荐
Small program animation realizes the running lantern and animation object
BMZCTF simple_ pop
Leetcode simple question: check whether the array is sorted and rotated
2022 tea master (intermediate) examination questions and tea master (intermediate) examination skills
Wine travel Jianghu War: Ctrip is strong, meituan is strong, and Tiktok is fighting
逆袭大学生的职业规划
[PCL self study: filtering] introduction and use of various filters in PCL (continuously updated)
一名外包仔的2022年中总结
Contents of welder (primary) examination and welder (primary) examination in 2022
Writing skills of multi plate rotation strategy -- strategy writing learning materials
Function introduction of member points mall system
The usage of micro service project swagger aggregation document shows all micro service addresses in the form of swagger grouping
2.14 summary
FuncS sh file not found when using the benchmarksql tool to test kingbases
A outsourcing boy's mid-2022 summary
Web security - CSRF (token)
4 years of experience to interview test development, 10 minutes to end, ask too
The least operation of leetcode simple problem makes the array increment
有道云笔记
MC Layer Target