Why does Lang describe a field as a union and compositum of its subfields in this manner?
$begingroup$
I am reading Serge Lang's Algebra, revised 3rd edition, and on page 226, the author makes the following definitions and observations:
- If $E,F subset L$, the compositum of $E$ and $F$ in $L$ is defined to be the smallest subfield of $L$ containing both $E$ and $F$. It is denoted $EF$.
- If $k subset E$ and $alpha_1,dots,alpha_n in E$, then $k(alpha_1,dots,alpha_n)$ is defined to be the smallest subfield of $E$ containing $k$ and $alpha_1,dots,alpha_n$.
- Observe that $$ E = bigcup k(alpha_1,dots,alpha_n), $$ where the union is taken over all finite families ${ alpha_1,dots,alpha_n }$ of elements of $E$.
- The compositum of an arbitrary family of subfields of a field $L$ is defined as the smallest subfield of $L$ containing all fields in the family.
$E$ is finitely generated over $k$ if there is a finite family ${ alpha_1,dots,alpha_n }$ of elements of $E$ such that $E = k(alpha_1,dots,alpha_n)$.- Observe that $E$ is the compositum of all its finitely generated subfields over $k$.
My question is regarding the two observations (point nos. 3 and 6). It appears to me that it is enough to take union (and compositum) over all subfields generated by a single element. For example for point no. 3, I can write
$$
E = bigcup_{alpha in E} k(alpha)
$$
because $E$ is clearly contained in the RHS, and each $k(alpha)$ is contained in $E$ and hence so is the union, implying that $E$ contains the RHS. Similarly for point no. 6.
So, why does Lang emphasise to take the union and compositum over all finitely generated subfields? Is there some perspective that he wishes to emphasise that I am missing? Any help in understanding this will be appreciated.
abstract-algebra field-theory definition
$endgroup$
|
show 1 more comment
$begingroup$
I am reading Serge Lang's Algebra, revised 3rd edition, and on page 226, the author makes the following definitions and observations:
- If $E,F subset L$, the compositum of $E$ and $F$ in $L$ is defined to be the smallest subfield of $L$ containing both $E$ and $F$. It is denoted $EF$.
- If $k subset E$ and $alpha_1,dots,alpha_n in E$, then $k(alpha_1,dots,alpha_n)$ is defined to be the smallest subfield of $E$ containing $k$ and $alpha_1,dots,alpha_n$.
- Observe that $$ E = bigcup k(alpha_1,dots,alpha_n), $$ where the union is taken over all finite families ${ alpha_1,dots,alpha_n }$ of elements of $E$.
- The compositum of an arbitrary family of subfields of a field $L$ is defined as the smallest subfield of $L$ containing all fields in the family.
$E$ is finitely generated over $k$ if there is a finite family ${ alpha_1,dots,alpha_n }$ of elements of $E$ such that $E = k(alpha_1,dots,alpha_n)$.- Observe that $E$ is the compositum of all its finitely generated subfields over $k$.
My question is regarding the two observations (point nos. 3 and 6). It appears to me that it is enough to take union (and compositum) over all subfields generated by a single element. For example for point no. 3, I can write
$$
E = bigcup_{alpha in E} k(alpha)
$$
because $E$ is clearly contained in the RHS, and each $k(alpha)$ is contained in $E$ and hence so is the union, implying that $E$ contains the RHS. Similarly for point no. 6.
So, why does Lang emphasise to take the union and compositum over all finitely generated subfields? Is there some perspective that he wishes to emphasise that I am missing? Any help in understanding this will be appreciated.
abstract-algebra field-theory definition
$endgroup$
2
$begingroup$
Probably typical Langish sloppiness. Perhaps he was thinking of direct limit of fields, rather than union, but I ought not presume…
$endgroup$
– Lubin
Jul 27 '18 at 14:28
1
$begingroup$
It is hard to tell why Lang did something...
$endgroup$
– xarles
Jul 27 '18 at 21:57
$begingroup$
Consider $a_1,a_2in E$ where $E$ is a set. You have $E'=cup_{ain E}k(a)$. Why is $a_1+a_2$ inside $E'$. You can take ascending chain family of $E_n=K(a_1,dots, a_n)$ s.t. $E_nsubset E_{n+1}$ with $a_iin E$. This gives you the field containing elements of $E$.
$endgroup$
– user45765
Jul 27 '18 at 22:06
2
$begingroup$
Maybe it’s because finitely generates fields is a nice family, while fields generated by one element; although smaller, is not as nice?
$endgroup$
– Lior B-S
Jul 28 '18 at 0:14
$begingroup$
@Lubin Maybe there is trouble for separatedness. There are fields that cannot be principally generated if the extension is not finite separable.
$endgroup$
– user45765
Jul 28 '18 at 0:18
|
show 1 more comment
$begingroup$
I am reading Serge Lang's Algebra, revised 3rd edition, and on page 226, the author makes the following definitions and observations:
- If $E,F subset L$, the compositum of $E$ and $F$ in $L$ is defined to be the smallest subfield of $L$ containing both $E$ and $F$. It is denoted $EF$.
- If $k subset E$ and $alpha_1,dots,alpha_n in E$, then $k(alpha_1,dots,alpha_n)$ is defined to be the smallest subfield of $E$ containing $k$ and $alpha_1,dots,alpha_n$.
- Observe that $$ E = bigcup k(alpha_1,dots,alpha_n), $$ where the union is taken over all finite families ${ alpha_1,dots,alpha_n }$ of elements of $E$.
- The compositum of an arbitrary family of subfields of a field $L$ is defined as the smallest subfield of $L$ containing all fields in the family.
$E$ is finitely generated over $k$ if there is a finite family ${ alpha_1,dots,alpha_n }$ of elements of $E$ such that $E = k(alpha_1,dots,alpha_n)$.- Observe that $E$ is the compositum of all its finitely generated subfields over $k$.
My question is regarding the two observations (point nos. 3 and 6). It appears to me that it is enough to take union (and compositum) over all subfields generated by a single element. For example for point no. 3, I can write
$$
E = bigcup_{alpha in E} k(alpha)
$$
because $E$ is clearly contained in the RHS, and each $k(alpha)$ is contained in $E$ and hence so is the union, implying that $E$ contains the RHS. Similarly for point no. 6.
So, why does Lang emphasise to take the union and compositum over all finitely generated subfields? Is there some perspective that he wishes to emphasise that I am missing? Any help in understanding this will be appreciated.
abstract-algebra field-theory definition
$endgroup$
I am reading Serge Lang's Algebra, revised 3rd edition, and on page 226, the author makes the following definitions and observations:
- If $E,F subset L$, the compositum of $E$ and $F$ in $L$ is defined to be the smallest subfield of $L$ containing both $E$ and $F$. It is denoted $EF$.
- If $k subset E$ and $alpha_1,dots,alpha_n in E$, then $k(alpha_1,dots,alpha_n)$ is defined to be the smallest subfield of $E$ containing $k$ and $alpha_1,dots,alpha_n$.
- Observe that $$ E = bigcup k(alpha_1,dots,alpha_n), $$ where the union is taken over all finite families ${ alpha_1,dots,alpha_n }$ of elements of $E$.
- The compositum of an arbitrary family of subfields of a field $L$ is defined as the smallest subfield of $L$ containing all fields in the family.
$E$ is finitely generated over $k$ if there is a finite family ${ alpha_1,dots,alpha_n }$ of elements of $E$ such that $E = k(alpha_1,dots,alpha_n)$.- Observe that $E$ is the compositum of all its finitely generated subfields over $k$.
My question is regarding the two observations (point nos. 3 and 6). It appears to me that it is enough to take union (and compositum) over all subfields generated by a single element. For example for point no. 3, I can write
$$
E = bigcup_{alpha in E} k(alpha)
$$
because $E$ is clearly contained in the RHS, and each $k(alpha)$ is contained in $E$ and hence so is the union, implying that $E$ contains the RHS. Similarly for point no. 6.
So, why does Lang emphasise to take the union and compositum over all finitely generated subfields? Is there some perspective that he wishes to emphasise that I am missing? Any help in understanding this will be appreciated.
abstract-algebra field-theory definition
abstract-algebra field-theory definition
edited Jan 1 at 11:26
Brahadeesh
asked Jul 27 '18 at 13:55
BrahadeeshBrahadeesh
6,19742361
6,19742361
2
$begingroup$
Probably typical Langish sloppiness. Perhaps he was thinking of direct limit of fields, rather than union, but I ought not presume…
$endgroup$
– Lubin
Jul 27 '18 at 14:28
1
$begingroup$
It is hard to tell why Lang did something...
$endgroup$
– xarles
Jul 27 '18 at 21:57
$begingroup$
Consider $a_1,a_2in E$ where $E$ is a set. You have $E'=cup_{ain E}k(a)$. Why is $a_1+a_2$ inside $E'$. You can take ascending chain family of $E_n=K(a_1,dots, a_n)$ s.t. $E_nsubset E_{n+1}$ with $a_iin E$. This gives you the field containing elements of $E$.
$endgroup$
– user45765
Jul 27 '18 at 22:06
2
$begingroup$
Maybe it’s because finitely generates fields is a nice family, while fields generated by one element; although smaller, is not as nice?
$endgroup$
– Lior B-S
Jul 28 '18 at 0:14
$begingroup$
@Lubin Maybe there is trouble for separatedness. There are fields that cannot be principally generated if the extension is not finite separable.
$endgroup$
– user45765
Jul 28 '18 at 0:18
|
show 1 more comment
2
$begingroup$
Probably typical Langish sloppiness. Perhaps he was thinking of direct limit of fields, rather than union, but I ought not presume…
$endgroup$
– Lubin
Jul 27 '18 at 14:28
1
$begingroup$
It is hard to tell why Lang did something...
$endgroup$
– xarles
Jul 27 '18 at 21:57
$begingroup$
Consider $a_1,a_2in E$ where $E$ is a set. You have $E'=cup_{ain E}k(a)$. Why is $a_1+a_2$ inside $E'$. You can take ascending chain family of $E_n=K(a_1,dots, a_n)$ s.t. $E_nsubset E_{n+1}$ with $a_iin E$. This gives you the field containing elements of $E$.
$endgroup$
– user45765
Jul 27 '18 at 22:06
2
$begingroup$
Maybe it’s because finitely generates fields is a nice family, while fields generated by one element; although smaller, is not as nice?
$endgroup$
– Lior B-S
Jul 28 '18 at 0:14
$begingroup$
@Lubin Maybe there is trouble for separatedness. There are fields that cannot be principally generated if the extension is not finite separable.
$endgroup$
– user45765
Jul 28 '18 at 0:18
2
2
$begingroup$
Probably typical Langish sloppiness. Perhaps he was thinking of direct limit of fields, rather than union, but I ought not presume…
$endgroup$
– Lubin
Jul 27 '18 at 14:28
$begingroup$
Probably typical Langish sloppiness. Perhaps he was thinking of direct limit of fields, rather than union, but I ought not presume…
$endgroup$
– Lubin
Jul 27 '18 at 14:28
1
1
$begingroup$
It is hard to tell why Lang did something...
$endgroup$
– xarles
Jul 27 '18 at 21:57
$begingroup$
It is hard to tell why Lang did something...
$endgroup$
– xarles
Jul 27 '18 at 21:57
$begingroup$
Consider $a_1,a_2in E$ where $E$ is a set. You have $E'=cup_{ain E}k(a)$. Why is $a_1+a_2$ inside $E'$. You can take ascending chain family of $E_n=K(a_1,dots, a_n)$ s.t. $E_nsubset E_{n+1}$ with $a_iin E$. This gives you the field containing elements of $E$.
$endgroup$
– user45765
Jul 27 '18 at 22:06
$begingroup$
Consider $a_1,a_2in E$ where $E$ is a set. You have $E'=cup_{ain E}k(a)$. Why is $a_1+a_2$ inside $E'$. You can take ascending chain family of $E_n=K(a_1,dots, a_n)$ s.t. $E_nsubset E_{n+1}$ with $a_iin E$. This gives you the field containing elements of $E$.
$endgroup$
– user45765
Jul 27 '18 at 22:06
2
2
$begingroup$
Maybe it’s because finitely generates fields is a nice family, while fields generated by one element; although smaller, is not as nice?
$endgroup$
– Lior B-S
Jul 28 '18 at 0:14
$begingroup$
Maybe it’s because finitely generates fields is a nice family, while fields generated by one element; although smaller, is not as nice?
$endgroup$
– Lior B-S
Jul 28 '18 at 0:14
$begingroup$
@Lubin Maybe there is trouble for separatedness. There are fields that cannot be principally generated if the extension is not finite separable.
$endgroup$
– user45765
Jul 28 '18 at 0:18
$begingroup$
@Lubin Maybe there is trouble for separatedness. There are fields that cannot be principally generated if the extension is not finite separable.
$endgroup$
– user45765
Jul 28 '18 at 0:18
|
show 1 more comment
1 Answer
1
active
oldest
votes
$begingroup$
I try to summarize some of the comments: The problem with considering simple subextensions of $E/k$, so of the form $k(a)$ for some $ain E$, is that they do not form an filtered set: it is not true that given two simple extensions, say $k(a)$ and $k(b)$, there exists a $cin E$ such that $k(a),k(b)subset k(c)$.
If the extension $E/k$ is finite but it contains infinitely many subextensions (so it is not separable), then it is not simple (by the primitive element theorem).
For example, if $E=L(t,s)$ and $k=L(t^p,s^p)$, and $L$ is of characteristic $p$. In this case, although $E=bigcup_{ain E} k(a)$, you need infinitely many elements in the union to get $E$. But $E$ is finitely generated, so with only one element you are done.
The same is true for transcendental extensions: if $E=k(t,s)$, and $t$ and $s$ are algebraically independent, then $E/k$ is not a simple extension.
Why do you need the set to be filtered? The reason is that then you can construct the direct limit abstractly. And then prove that this direct limit is the initial $E$. So it is possible that the result he had in mind was the following.
Result: For any extension $E/k$, consider the direct system of finitely generated subextensions of $E/k$. Then $E$ is isomorphic to the direct limit of this system.
So, even it is hard to tell why some people does something, and specially if this people is Serge Lang (who did some weird things), it seems natural to me that he liked the system of extensions to consider to be a filtered.
$endgroup$
add a comment |
Your Answer
StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "69"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});
function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});
}
});
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2864412%2fwhy-does-lang-describe-a-field-as-a-union-and-compositum-of-its-subfields-in-thi%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
I try to summarize some of the comments: The problem with considering simple subextensions of $E/k$, so of the form $k(a)$ for some $ain E$, is that they do not form an filtered set: it is not true that given two simple extensions, say $k(a)$ and $k(b)$, there exists a $cin E$ such that $k(a),k(b)subset k(c)$.
If the extension $E/k$ is finite but it contains infinitely many subextensions (so it is not separable), then it is not simple (by the primitive element theorem).
For example, if $E=L(t,s)$ and $k=L(t^p,s^p)$, and $L$ is of characteristic $p$. In this case, although $E=bigcup_{ain E} k(a)$, you need infinitely many elements in the union to get $E$. But $E$ is finitely generated, so with only one element you are done.
The same is true for transcendental extensions: if $E=k(t,s)$, and $t$ and $s$ are algebraically independent, then $E/k$ is not a simple extension.
Why do you need the set to be filtered? The reason is that then you can construct the direct limit abstractly. And then prove that this direct limit is the initial $E$. So it is possible that the result he had in mind was the following.
Result: For any extension $E/k$, consider the direct system of finitely generated subextensions of $E/k$. Then $E$ is isomorphic to the direct limit of this system.
So, even it is hard to tell why some people does something, and specially if this people is Serge Lang (who did some weird things), it seems natural to me that he liked the system of extensions to consider to be a filtered.
$endgroup$
add a comment |
$begingroup$
I try to summarize some of the comments: The problem with considering simple subextensions of $E/k$, so of the form $k(a)$ for some $ain E$, is that they do not form an filtered set: it is not true that given two simple extensions, say $k(a)$ and $k(b)$, there exists a $cin E$ such that $k(a),k(b)subset k(c)$.
If the extension $E/k$ is finite but it contains infinitely many subextensions (so it is not separable), then it is not simple (by the primitive element theorem).
For example, if $E=L(t,s)$ and $k=L(t^p,s^p)$, and $L$ is of characteristic $p$. In this case, although $E=bigcup_{ain E} k(a)$, you need infinitely many elements in the union to get $E$. But $E$ is finitely generated, so with only one element you are done.
The same is true for transcendental extensions: if $E=k(t,s)$, and $t$ and $s$ are algebraically independent, then $E/k$ is not a simple extension.
Why do you need the set to be filtered? The reason is that then you can construct the direct limit abstractly. And then prove that this direct limit is the initial $E$. So it is possible that the result he had in mind was the following.
Result: For any extension $E/k$, consider the direct system of finitely generated subextensions of $E/k$. Then $E$ is isomorphic to the direct limit of this system.
So, even it is hard to tell why some people does something, and specially if this people is Serge Lang (who did some weird things), it seems natural to me that he liked the system of extensions to consider to be a filtered.
$endgroup$
add a comment |
$begingroup$
I try to summarize some of the comments: The problem with considering simple subextensions of $E/k$, so of the form $k(a)$ for some $ain E$, is that they do not form an filtered set: it is not true that given two simple extensions, say $k(a)$ and $k(b)$, there exists a $cin E$ such that $k(a),k(b)subset k(c)$.
If the extension $E/k$ is finite but it contains infinitely many subextensions (so it is not separable), then it is not simple (by the primitive element theorem).
For example, if $E=L(t,s)$ and $k=L(t^p,s^p)$, and $L$ is of characteristic $p$. In this case, although $E=bigcup_{ain E} k(a)$, you need infinitely many elements in the union to get $E$. But $E$ is finitely generated, so with only one element you are done.
The same is true for transcendental extensions: if $E=k(t,s)$, and $t$ and $s$ are algebraically independent, then $E/k$ is not a simple extension.
Why do you need the set to be filtered? The reason is that then you can construct the direct limit abstractly. And then prove that this direct limit is the initial $E$. So it is possible that the result he had in mind was the following.
Result: For any extension $E/k$, consider the direct system of finitely generated subextensions of $E/k$. Then $E$ is isomorphic to the direct limit of this system.
So, even it is hard to tell why some people does something, and specially if this people is Serge Lang (who did some weird things), it seems natural to me that he liked the system of extensions to consider to be a filtered.
$endgroup$
I try to summarize some of the comments: The problem with considering simple subextensions of $E/k$, so of the form $k(a)$ for some $ain E$, is that they do not form an filtered set: it is not true that given two simple extensions, say $k(a)$ and $k(b)$, there exists a $cin E$ such that $k(a),k(b)subset k(c)$.
If the extension $E/k$ is finite but it contains infinitely many subextensions (so it is not separable), then it is not simple (by the primitive element theorem).
For example, if $E=L(t,s)$ and $k=L(t^p,s^p)$, and $L$ is of characteristic $p$. In this case, although $E=bigcup_{ain E} k(a)$, you need infinitely many elements in the union to get $E$. But $E$ is finitely generated, so with only one element you are done.
The same is true for transcendental extensions: if $E=k(t,s)$, and $t$ and $s$ are algebraically independent, then $E/k$ is not a simple extension.
Why do you need the set to be filtered? The reason is that then you can construct the direct limit abstractly. And then prove that this direct limit is the initial $E$. So it is possible that the result he had in mind was the following.
Result: For any extension $E/k$, consider the direct system of finitely generated subextensions of $E/k$. Then $E$ is isomorphic to the direct limit of this system.
So, even it is hard to tell why some people does something, and specially if this people is Serge Lang (who did some weird things), it seems natural to me that he liked the system of extensions to consider to be a filtered.
answered Jul 28 '18 at 7:38
xarlesxarles
1,49079
1,49079
add a comment |
add a comment |
Thanks for contributing an answer to Mathematics Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2864412%2fwhy-does-lang-describe-a-field-as-a-union-and-compositum-of-its-subfields-in-thi%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
2
$begingroup$
Probably typical Langish sloppiness. Perhaps he was thinking of direct limit of fields, rather than union, but I ought not presume…
$endgroup$
– Lubin
Jul 27 '18 at 14:28
1
$begingroup$
It is hard to tell why Lang did something...
$endgroup$
– xarles
Jul 27 '18 at 21:57
$begingroup$
Consider $a_1,a_2in E$ where $E$ is a set. You have $E'=cup_{ain E}k(a)$. Why is $a_1+a_2$ inside $E'$. You can take ascending chain family of $E_n=K(a_1,dots, a_n)$ s.t. $E_nsubset E_{n+1}$ with $a_iin E$. This gives you the field containing elements of $E$.
$endgroup$
– user45765
Jul 27 '18 at 22:06
2
$begingroup$
Maybe it’s because finitely generates fields is a nice family, while fields generated by one element; although smaller, is not as nice?
$endgroup$
– Lior B-S
Jul 28 '18 at 0:14
$begingroup$
@Lubin Maybe there is trouble for separatedness. There are fields that cannot be principally generated if the extension is not finite separable.
$endgroup$
– user45765
Jul 28 '18 at 0:18