Let’s G be a set and • : G x G -> G an application (named *composition law*). A *#group * is a pair (G,•) such that :
i) It exists e such that : For all x in G, x•e = e•x = x (neutral element)
ii) For all x in G, it exists y in G such that : x•y = y•x = e. We denoted y by x^{-1}, x inverse. (Inverse)
iii) For all x, y, z in G (x•y)•z = x•(y•z). This property is called associativity.
#algebra #GaloisTheorie #Group #mathematics #maths #mathematic #math #mathforbitcoin #algebraicgeometry
Galois / GaloisField
npub1rc…fct0w
2023-07-02 15:22:10
Author Public Key
npub1rcmnvhhnrylm805ynwcnnte8uq8aen6nu7d2e33gwdrqy7fhzgkqwfct0wPublished at
2023-07-02 15:22:10Event JSON
{
"id": "17f34729c5d62a216985537d789a77931df2965247a5e02b11cde212839508a9",
"pubkey": "1e37365ef3193fb3be849bb139af27e00fdccf53e79aacc6287346027937122c",
"created_at": 1688311330,
"kind": 1,
"tags": [
[
"t",
"group"
],
[
"t",
"algebra"
],
[
"t",
"galoistheorie"
],
[
"t",
"group"
],
[
"t",
"mathematics"
],
[
"t",
"maths"
],
[
"t",
"mathematic"
],
[
"t",
"math"
],
[
"t",
"mathforbitcoin"
],
[
"t",
"algebraicgeometry"
]
],
"content": "Let’s G be a set and • : G x G -\u003e G an application (named *composition law*). A *#group * is a pair (G,•) such that :\ni) It exists e such that : For all x in G, x•e = e•x = x (neutral element) \nii) For all x in G, it exists y in G such that : x•y = y•x = e. We denoted y by x^{-1}, x inverse. (Inverse)\niii) For all x, y, z in G (x•y)•z = x•(y•z). This property is called associativity. \n\n#algebra #GaloisTheorie #Group #mathematics #maths #mathematic #math #mathforbitcoin #algebraicgeometry",
"sig": "c7ca2deb2105670ea72c1542bd39ae88557ae2a8c7788f79523f4f7321e884b9cc7e2ddad62f60d970be3eb5bcc1900734346c03b689149d2281cfa87c609bf2"
}