On reasonably sure proofs

I happened to come across a 1993 opinion piece, Theorems for a price: Tomorrow's semi-rigorous mathematical culture by Doron Zeilberger. I think it's a rather fascinating document as it questions the future of mathematical proof. Its basic thesis is that some time in the future of mathematics, the expectation of proof will move to a "semi-rigorous" state where mathematical statements will be given probabilities of being true.

It helps to clarify this with an example even more simple than in Zeilberger's paper. Take the arithmetic-geometric mean inequality for two variables $a,b\geq 0$. It says that
$$\frac{a + b}{2} \geq \sqrt{ab}.$$ This simple identity is just a rearrangement of the inequality $(a – b)^2 \geq 0$. For simplicity, let's say that $a,b\in [0,1]$. Instead of actually proving this inequality, we could generate uniform random numbers in $[0,1]$ and see if this inequality actually works for them. So if I test this inequality 1000 times, of course I will get that it works 1000 times.
…read the rest of this post!

Abelian categories: examples and nonexamples

I've been talking a little about abelian categories these days. That's because I've been going over Weibel's An Introduction to Homological Algebra. It's a book I read before, and I still feel pretty confident about the material. This time, though, I think I'm going to explore a few different paths that I haven't really given much thought to before, such as diagram proofs in abelian categories, group cohomology (more in-depth), and Hochschild homology.

Back to abelian categories. An abelian category is a category with the following properties:
…read the rest of this post!

Book Review: Lost in Math by Hossenfelder

When it comes to the philosophy of science, not many publications are relevant to modern practice. Let's take math. The current literature still talks about platonism. Look harder and you might find the rise of non-Euclidean geometry or other breakthroughs like cardinality. In short, the bulk of mathematical philosophy still consists of math that's hundreds of years old. While these topics are still important, I find it much more interesting to look at the new philosophical issues present in modern mathematics and science.

That's why I was delighted to find Lost in Math by Sabine Hossenfelder, who is also the author of a popular physics blog called Backreaction.
…read the rest of this post!

Consider voting for this blog!

Update: Voting is now closed and the results of this contest will be announced on September 5, 2018.

Update #2: Due to a typo in the email I got about the contest rules, the previous update was a mistake. It seems like you can still vote until the end of August!

Update #3: Sadly, I did not win the Goosies. Perhaps next year! Thank you to everyone who voted for me.

Do you enjoy this blog and all the math on it? If so, consider voting for my blog in my host's Canadian Goosy Awards. That's right! Aleph Zero Categorical was nominated as a finalist in this contest. I am in the category for Best Blog/Personal Website. You have until August 31st to vote.

Part of the prize for this contest is free hosting for a year. If you do think I'm worthy of a vote, then your action will support this blog, which has been written my spare time for fun for over seven years. In fact, Aleph Zero Categorical is one of the longest running still-active math blogs on the Internet!

Thanks for considering :)

Image factorisation in abelian categories

Let $R$ be a ring and $f:B\to C$ be a morphism of $R$-modules. The image of $f$ is of course
$${\rm im}(f) = \{ f(x) : x\in B \}.$$The image of $f$ is a submodule of $C$. It is pretty much self-evident that $f$ factors as
$$B\xrightarrow{e} {\rm im}(f)\xrightarrow{m} C$$where $e$ is a surjective homomorphism and $m$ is an injective homomorphism. In fact, there is nothing special about working in the category of $R$-modules at all. The same thing holds in the category of sets and a proof for the category of sets works perfectly well for the category of $R$-modules. This set-theoretic reasoning is very natural.

However, we can't always work with categories whose objects are sets with additional structure and whose morphisms are set functions that respect the additional structure (concrete categories). Sometimes we have to work with abelian categories. What's an abelian category? Briefly, it is a category $\Acl$ such that:
…read the rest of this post!

Art vs. science in mathematical discovery

Is mathematics science or art? Mathematics resembles science. In math, data and examples are collected and hypotheses made. There is a difference in the hypotheses of math versus science: in the former they can be proved, but that could be considered a small point. But I have met mathematicians who don't consider themselves scientists, and I think most mathematicians could probably understand this point of view. The underlying motivation of mathematics is often more artistic than scientific: that practitioners may seek out results they find elegant and beautiful, and not yield to justifications about understanding the world. However, mathematics sometimes struggles against its artistic roots and I have a feeling this is becoming a problem.

Science is beneficial to mathematics in numerous ways. But there is also a dangerous aspect to this relationship as well. If mathematics is too closely viewed as a science, it is treated as such in practical ways: how new results are supported, funded, and published. This danger is perhaps more relevant to pure mathematics, but it has serious implications for applied mathematics as well.
…read the rest of this post!

A little intro to the Jacobi symbol: Part 3

This is the final post on the Jacobi symbol. Recall that the Jacobi symbol $(m/n)$ for relatively prime integers $m$ and $n$ is defined to be the sign of the permutation $x\mapsto mx$ on the ring $\Z/n$. In the introductory post we saw this definition, some examples, and basic properties for calculation purposes.

In Part 2 we saw that for an odd prime $p$ and an integer $a$ that is relatively prime to $p$, the Jacobi symbol $(a/p) = 1$ if and only if $a$ is a square modulo $p$ (a "quadratic residue"). The basic properties of the Jacobi symbol then give the classic law of quadratic reciprocity.

Now, we're going to see one last application of the Jacobi symbol: primality testing in what's called the Solovay-Strassen primality test. How does it work? It starts with an observation we saw before: in the ring $\Z/p$, there exists a primitive element $g\in \Z/p$. It is an element that generates the multiplicative cyclic group $\Z/p^\times\cong \Z/(p-1)$.
…read the rest of this post!

A little intro to the Jacobi symbol: Part 2

In the last post, we examined the Jacobi symbol: for two relatively prime integers $m$ and $n$, we defined the Jacobi symbol $(m/n)$ to be the sign of the permutation $x\mapsto mx$ on the ring $\Z/n$.

It turns out that the Jacobi symbol plays a part in the theory of quadratic residues. For a number $n$, we say that an element $a\in \Z/n$ is a quadratic residue if it's a square in $\Z/n$.

When $n = p$ is a prime number, the question of which integers are quadratic residues goes back to the ancient days of Gauss. He realized that for an odd prime $p$, half the numbers in the list $1,2,\dots, p-1$ are quadratic residues, and the other half are not quadratic residues (a.k.a. quadratic nonresidues). Indeed, if $x^2 = y^2$ in the field $\Z/p$, then $(x+y)(x-y) = 0$. Therefore, if $x\not= y$, we must have $x=-y$. So it is clear that amongst the numbers $1^2,2^2,\dots,(p-1)^2$, there are exactly $(p-1)/2$ distinct numbers.

This guy means business!

…read the rest of this post!

A little intro to the Jacobi symbol: Part 1

If $m$ and $n$ are relatively prime integers, the Jacobi symbol $(m/n)$ is defined as the sign of the permutation $x\mapsto mx$ on the set $\Z/n$. Let's give a simple example: $(7/5)$. The permutation on $\{1,2,3,4\}$ is given by $(1 2 4 3) = (1 2)(2 4)(4 3)$ which has an odd number of transpositions. Therefore, $(7/5) = -1$.

Note that as in this example, it is sufficient to compute the sign of the permutation on $\Z/n – \{0\}$, since multiplication always leaves zero fixed.

But what if we wanted to compute something like $(3/412871)$? These numbers aren't so big, so a computer could do it directly. However, there is a better way to do the computation of the Jacobi symbol $(m/n)$ if one of $m$ or $n$ is much larger than the other one. This method is good for computers too when one of the numbers is so large, that a direct computation even by a fast computer would be hopeless.
…read the rest of this post!