mastouille.fr est l'un des nombreux serveurs Mastodon indépendants que vous pouvez utiliser pour participer au fédiverse.
Mastouille est une instance Mastodon durable, ouverte, et hébergée en France.

Administré par :

Statistiques du serveur :

596
comptes actifs

#algebra

0 message0 participant0 message aujourd’hui

#softwareEngineering #programming #commonLisp #assertions #algebra - tight, efficient #lazyEvaluation vector multiplication with #series .
screwlisp.small-web.org/progra

I use assert in lisp, which automatically generates an interactive in-context failure resolution which I utilize in the article, where the lazy cotruncation series feature was not wanted. Shows off a #lisp useage: classic.

@vnikolov what do you think of this example of assert viz your assertables?
+ @kentpitman

What do Sudoku, AI, Rubik’s cubes, clocks and molecules have in common? They can all be reimagined as algebraic equations.

From @TheConversationUS: "Algebra is more than alphabet soup – it’s the language of algorithms and relationships."

flip.it/41r-jh

The ConversationAlgebra is more than alphabet soup – it’s the language of algorithms and relationshipsWhat do Sudoku, AI, Rubik’s cubes, clocks and molecules have in common? They can all be reimagined as algebraic equations.

A fundamental result in universal algebra is the Subdirect Representation Theorem, which tells us how to decompose an algebra \(A\) into its "basic parts". Formally, we say that \(A\) is a subdirect product of \(A_1\), \(A_2\), ..., \(A_n\) when \(A\) is a subalgebra of the product
\[
A_1\times A_2\times\cdots\times A_n
\]
and for each index \(1\le i\le n\) we have for the projection \(\pi_i\) that \(\pi_i(A)=A_i\). In other words, a subdirect product "uses each component completely", but may be smaller than the full product.

A trivial circumstance is that \(\pi_i:A\to A_i\) is an isomorphism for some \(i\). The remaining components would then be superfluous. If an algebra \(A\) has the property than any way of representing it as a subdirect product is trivial in this sense, we say that \(A\) is "subdirectly irreducible".

Subdirectly irreducible algebras generalize simple algebras. Subdirectly irreducible groups include all simple groups, as well as the cyclic \(p\)-groups \(\mathbb{Z}_{p^n}\) and the Prüfer groups \(\mathbb{Z}_{p^\infty}\).

In the case of lattices, there is no known classification of the finite subdirectly irreducible (or simple) lattices. This page (math.chapman.edu/~jipsen/poset) by Peter Jipsen has diagrams showing the 92 different nontrivial subdirectly irreducible lattices of order at most 8. See any patterns?

We know that every finite subdirectly irreducible lattice can be extended to a simple lattice by adding at most two new elements (Lemma 2.3 from Grätzer's "The Congruences of a Finite Lattice", arxiv.org/pdf/2104.06539), so there must be oodles of finite simple lattices out there.

Me: If you're a student in my class you will do group presentations, meaning that you will organize into a subset of the class, stand in front of the room, and talk about math to the rest of the class.

Also me: Let's talk about group presentations, a completely abstract algebraic concept that have absolutely nothing to do with standing in front of the room talking about your work.

Also also me: Okay, time for group presentations
about group presentations.

#Algebra #ITeachMath #GroupTheory #GroupPresentation

Just found an English translation of Emmy Noether's 1921 "Idealtheorie in Ringbereichen" ("Ideal Theory in Rings"): arxiv.org/abs/1401.2577

(while editing the wikipedia page on subdirect products - my first wiki edit to add an Emmy Noether reference! Turns out there's a direct lineage from Noether to Birkhoff's introduction of subdirect products in universal algebra. Just one more way in which she really revolutionized algebra.)

arXiv.orgIdeal Theory in Rings (Translation of "Idealtheorie in Ringbereichen" by Emmy Noether)This paper is a translation of the paper "Idealtheorie in Ringbereichen", written by Emmy Noether in 1920, from the original German into English. It in particular brings the language used into the modern world so that it is easily understandable by the mathematicians of today. The paper itself deals with ideal theory, and was revolutionary in its field, that is modern algebra. Topics covered include: the representation of an ideal as the least common multiple of irreducible ideals; the representation of an ideal as the least common multiple of maximal primary ideals; the association of prime ideals with primary ideals; the representation of an ideal as the least common multiple of relatively prime irreducible ideals; isolated ideals; the representation of an ideal as the product of coprime irreducible ideals; equivalent concepts regarding modules.

Learn Algebra with Julia - Math for entry-level IT professionals, vol. 1, #mybook #newbook 🆕 is available here:
leanpub.com/learnalgebrawithju

> As W. W. Saywer writes in his Mathematicians Delight, “The main object of this book is to dispel the fear of mathematics.”

> “It’s no secret that knowing advanced mathematical concepts and being comfortable with learning #math will open up more avenues for you as a software #developer. …"

> The very nature of programming is mathematical.

-- from the Intro

LeanpubLearn Algebra with JuliaLearn Algebra the fun way using Julia programming language
Suite du fil

But! TIL there's a categorical definition that supposedly agrees w/ "surjection" on any variety of algebras:

h is "categorically surjective" (a term I just made up) if for any factorization h=fg with f monic, f must be an iso.

(h/t Knoebel's book doi.org/10.1007/978-0-8176-464)

Are there categorical definitions that agree w/ injective (resp. surjective) on all concrete categories?

The notion of epimorphism can be quite different from surjection, e.g. in Rings.

Though I recently learned epimorphisms can be characterized in terms of Isbell's zig-zags: en.wikipedia.org/wiki/Isbell%2.

Whereas monic seems to capture the notion of "injective" quite well in a categorical def. And indeed the two agree on any variety of algebras in the sense of universal algebra.

en.wikipedia.orgIsbell's zigzag theorem - Wikipedia

My fourteenth Math Research Livestream is now available on YouTube:

youtube.com/watch?v=pVoFfZAyXz

I talked about some topics related to my recent preprint (arxiv.org/abs/2409.12923) about topological lattices.

I decided to skip streaming today because I wanted to talk about polyhedral products, but I haven't found the old calculation that I wanted to talk about yet. Shocking I couldn't find something I did like six years ago in the ten minutes before I would start streaming. I'll look for it now, so hopefully I'll be ready next week.

#math#topology#algebra

#Mathober #Mathober2024

The prompt for day 4 was 'Form'. In algebra, a multilinear map is a function from several vector spaces to another vector space which is linear in each argument. Just as a linear map can be represented by a grid of numbers in a matrix, a multilinear map can be represented by a multidimensional grid of numbers: a tensor. A 'form' is the function you get by taking a multilinear map from V×...×V to the scalars and evaluating it with each of its arguments the same. In this way you get a *non*linear map from V to the scalars.

The image shows a degree 50 form on ℝ³ evaluated on the unit sphere. The form was randomly chosen with each of the 3⁵⁰ entries in its tensor having a standard normal distribution.