This paper also introduced me to the idea of hypergraph complexity, which I don’t yet understand, hence this post. We’ll start with some basic definitions and concepts.

**Definition 1.** Let be a set and for , let denote the set of all -element subsets of . An –*uniform hypergraph *on is any subset of .

It should be clear that this just generalises the notion of an edge as a choice or two elements, to a choice of an arbitrary (but constant) number of elements. Hypergraphs give us some nice generalisations of Ramsey-type results, for example,

**Theorem 1.** [2] An infinite -regular hypergraph contains an infinite clique or an infinite anticlique.

The nonstandard proof of this (which can be found in [2]) involves a beautiful use of iterated nonstandard extensions, a somewhat tricky (but very useful) subject I will probably address in a later post.

In what follows, we restrict our attention to finite hypergraphs. We firstly need to define a *hypergraph system*:

**Definition 2.** [1] A hypergraph system is a quadruple where is a finite set, is a collection of non-empty sets, is a positive integer, and is an -uniform hypergraph. For any , set .

What would be a reasonable hypergraph system, and what would it be good for? Since the concept occurs in a paper concern a Szemerédi-type theorem, it seems reasonable that they have something to do with arithmetic progressions. To make this clear, we’ll need the notion of a weighted hypergraph, which we’ll illustrate by means of an example. Set , , and . The *weights* on are functions . For instance, for the edge we have a function . Suppose that , and let denote its indicator function. We define the functions

The product will only be greater than if there are some such that are in . Equivalently, if

will contain a 3-arithmetic progression.

This is a simplistic example, and not nearly sufficient to characterise the existence of 3APs. For instance, we make no mention of the issue of wrap-around progressions in the cyclic group . What is more, one would ideally like to have a result which takes into account values of of arbitrary size. For appropriate linear forms conditions that work for any size of AP, the paper [1] should be consulted. For now, we continue with trying to get a handle on the complexity.

Suppose we are given a hypergraph system as above.

**Definition 3.** [1] For any set of size and any , define the complexity of to be the smallest integer such that there is a partition of into sets such that each is the set of -cliques of some -uniform hypergraph.

Thus, in the above example we would let be a subset of for some . Certainly, an -uniform hypergraph for is not the most scintillating mathematical object, but let us persist with this simple case.

To make sense of the latter part of the Definition 3, let us first discuss what the required cliques are (following [1]). If and , write for the obvious projection of onto the coordinates . For any , define

In a 2-uniform hypergraph as above, for , . Simply put, the boundary is seen as the set of edges of one dimension less that together uniquely determine the edge we are looking at.

If we now say that is the set of -cliques of some -uniform hypergraph, we mean that there is some for each so that

for all .

To be fair, this does not make anything very clear, so let’s unpack this notion further with our very simple example of a (complete) 2-uniform hypergraph, by trying to understand what a satisfying notion of complexity should be. Taking the edge as before, and . Let the set . We want sets and so that

for all . The triviality of this example now becomes obvious – setting and gives us a complexity of 1. We could see this example as an instance of a complete bipartite graph between the components making up , which is fully described by the Cartesian product of the two sets.

Let’s see if the same reasoning applies to 3-uniform hypergraphs. Let be an edge in some 3-uniform hypergraph, with the associated set . Let the subset be Now we need sets and subsets of such that

A little consideration will show that the same trick employed above works here as well, because our set can be considered to be a complete 3-uniform tripartite graph on the parts . It seems clear that we will need to be slightly more creative in order to get higher complexity.

Consider now the following subset of the above set :

This set can’t be written as a single Cartesian product of subsets of the sets we are considering, and seems slightly more random in character, so there is a hope that the complexity should be higher. Setting , and , we take

(where the notation has been shortened in an obvious way). To avoid confusion, we note that there are elements such that , but which do not correspond to projections of an edge in , and can therefore be ignored. We thus see that our set has a complexity of at most 4.

Of course, the case of a 3-uniform hypergraph is quite easy to analyse this way, because two of the edges determine the third, and the difficulty of generating such examples will increase rapidly for higher .

Intuitively, the example at least makes clear that the complexity of the hypergraph is somehow determined by how easily the set can be described in terms of parts of a smaller “dimension”, and that highly random sets will have higher complexity (without specifying exactly what we mean by “random” here). The real application of this complexity is in hypergraph removal lemmas, which we’ll (possibly) discuss in another post.

**Shameless self-promotion:** If you enjoy Fourier series and Martin-Löf randomness (or Kolmogorov-Chaitin-Solomonoff randomness – take your pick), see my paper in APAL. For something similar, involving Carleson’s theorem and Schnorr randomness, see the paper by Franklin, McNicholl and Rute at https://arxiv.org/abs/1603.01778.

**References:**

*A relative Szemerédi theorem*, David Conlon, Jacob Fox and Yufei Zhao- Nonstandard Methods in Ramsey Theory and Combinatorial Number Theory, M Di Nasso, I Goldbring and M Lupini

]]>

Since we’ve already discussed the use of simple element in the proof of the ergodic theorem, we will now address the existence of such elements.

Recall that we are working with a measure preserving system as defined previously, where denotes the shift operator. We are looking for an element of such that

for any . First, take a sequence in of elements that are periodic; in other words, each element is of the form

for some integer . We set

where denotes the Dirac measure, as usual. We require that the converge weakly to as .

Here we depart from the sequence of the proof in Kamae in order to first show how to construct such a sequence, before showing that we can use it to obtain a typical element. To show the existence of the sequence, it suffices to show that for any neigbourhood of in the weak topology of Borel measures on , we can find an element such that . The nature of the topology means that we can approximate the measure to an arbitrary degree by considering a finite amount of information. In other words, there are integers , and some positive such that if for any subset of the form

where are integers ranging from to , then .

Now set

We can define a measure on by

for the in the same range as before. We can see as an encoding of the measure on cylinder sets of the form we are considering, and will clearly be used to construct a measure in the neighbourhood of , once we have tweaked it a little.

We are given that is -invariant. From this, we can conclude that

for any . Why? We have that

and the latter term is equal to

From , we want to obtain a measure on which satisfies:

(1) For any , is a positive integer such that , where has been specified earlier.

(2) The relation holds for in the place of .

These do not seem like very great demands on , but we should still confirm that it can satisfy them. The first condition above requires that all the values are rational. This is not much of a challenge, because of the denseness of the rationals. We must just make sure that the adjustment from to does not violate condition (1). We therefore need to make sure, also, that the rationals we pick not only satisfy , but also

(obviously, since must still be a probability). Since there are only a finite number of elements of the measure space, we can ensure first that the latter condition holds, then ensure the validity of by more adjustments, making sure any adjustments upwards are balanced by adjustments downwards to guarantee This brings into question whether there will not be one of these adjustments that will turn the measure of one of these elements negative. But since we’re only dealing with a finite number of points of the measure space, and our adjustments are arbitrarily small, we must just make sure that none of the adjustments are as big as the least measure of any of the elements. If there are any elements of zero measure, we adjust the measure to avoid that, whilst still remaining close to $\latex \nu$.

Now pick a longest sequence of elements of such that

- for any and
- for any ,

where and .

The first condition clearly has to do with the translation operator, and requires that the -th element of is the translate of the -th element, with the last term of the element not dependent on the next element. Notice that there is nothing in the first condition which prevents “looping” the same sequence over and over again. If such were allowed, we would not be able to speak of the longest sequence, and so the second condition is introduced in order to limit the lengths.

Now, suppose that equality does not hold in (2), for some , remembering that is an integer, and also supposing that . In that case, we will be able to extend the sequence to increase the term on the left-hand side (by using closed loops), contradicting the assumption of the longest sequence. Thus, we can conclude that equality holds in (2) for each .

We define a periodic element of with period by

Thus, we have found a periodic element in the neighbourhood of for each . Taking neighbourhoods of such that , denote each corresponding periodic element by . For a sequence of positive integers increasing sufficiently fast, set

for any with , where and (recall that denotes the period of ). This gives us our desired typical element, and completes the argument.

**References: **

Kamae, T., *A simple proof of the ergodic theorem using nonstandard analysis,* Israel Journal of Mathematics, Vol. 42, No. 4, 1982

Our society values focus without encouraging it. Much is made of attention deficits in children, but how many adults work in surroundings that require absolute focus? We require children to sit quietly and pay attention in boring classes all day, but very few jobs would require that of an adult. I love learning, and I certainly enjoyed some classes at school, but most of the time I was bored out of my mind and kept quiet because I was afraid of getting low marks (which would ruin one’s life, I was told) or of getting sent to the principal or one of his minions, with the spectre of a caning always looming. However, if you look at how so many office workers conduct their day, it is replete with interruptions, e-mails, Facebook posts, meetings, phone conversations, etc. How many professional people can go an hour without checking either their phone or their e-mail?

I would go so far as to say that many jobs actively discourage focus. The grown-up version of not doing your homework is not replying to your boss’s e-mail quickly enough, or missing a call from a client.

A lot of what I do is stultifying – student admissions, tuition meetings and administrative matters which have me squirming in my seat (and checking my e-mail). I am fortunate enough though that most of my job involves things I like. Working out second-year calculus problems may sometimes be a little frustrating if I want to get to research, but fundamentally I enjoy doing maths problems and it is often a relief to do something easy. Also, I have to admit, the boring, less challenging stuff has its own attraction. It is easier to have a discussion on the syllabus of some course when you are well and truly stuck on a problem; you at least feel that you have earned part of your keep.

And that is the trap, one I must confess to having fallen into. Bureaucracy increases exponentially – the more bureaucrats there are, the more bureaucracy they generate. As such, I am never without some task awaiting my attention or ten e-mails waiting to be answered. Most of these tasks do not take a lot of time. They can usually be done in less than half an hour, and you have that slight feeling of accomplishment at having something you can cross off your list. I think that continually facing such things has attenuated my mathematical attention. I cannot remember the last time I have sat for hours on a single paper or book, completely engrossed in trying to understand it. I do maths here and there, correcting this paper, moving on to clearing my inbox, then trying to read a new theorem, remembering something urgent about an exam paper that I have to discuss with a colleague, and so on. When your mind operates thus for a while, it becomes ingrained, and it gets uncomfortable when you focus on one thing for too long.

Clearly, once recognised this problem could not be allowed to persist. Lines had to be drawn in the sand. The very first thing I did was to dedicate the first hour of my working day to reading mathematics with the fullest concentration I could muster. I have previously mentioned the book on nonstandard number theory I am reading, and decided to make that my focus. Unless summoned to a meeting I would do this directly after arriving at work and clocking in (literally – at our university you have to). I set aside a desk in my office which has nothing on it but some scratch paper. This part is very important – when I work at my desk with my computer, I will inevitable glance up at it from time to time, and that breaks the flow. Next, I put on wireless headphones with very calm music, something which manages to block external sounds but is not itself interesting enough to distract you. I sometimes use the sounds of ocean waves or rain falling, to the same effect. For that one hour, I don’t have to check my phone and don’t get up at all.

The first realisation from this practice was that concentration is its own reward. Giving myself the mental space to devote solely to mathematics not only reminded me of why I do it, but the very act of being intensely focused is extremely pleasant. I’m not saying it is always particularly easy, but it is worth it. Soon after starting to do this every morning, I found myself craving it. The clarity of mind during that hour is wonderfully refreshing. You have one thing to do, and only that. And when you get to the rest of the day, with its e-mails and interruptions, you have already learned something valuable, and done it well.

This worked so well that I found myself sneaking in extra hours of concentrated work whenever I could manage. It should be mentioned that this does not work as well with shorter periods of time. Thirty minutes is still not useless, but because the end is in sight, I find that I do not immerse myself as deeply. I often find myself longing to go on at the end of my hour, but do not push it to the point of fatigue. If I still feel eager to go on, I am more likely to create more time for it later. It also helps to be in the middle of an interesting proof, so I can’t wait to get back to it.

Cultivating mathematical attention is not as simple as this, though. Reading and research are two different animals. Both are creative activities, since learning anything well cannot be done passively. But the same method does not quite work for doing original mathematics, and this I consider the difficult bit. Since this deserves an entire post of its own, I will continue this later (after a maths-related post, of course).

]]>I am reading the proof of the ergodic theorem in the book Nonstandard Methods in Ramsey Theory and Combinatorial Number Theory by Mauro Di Nasso, Isaac Goldbring and Martino Lupini. Since the proof is clearly presented in the book and is freely available, I will not go into detail here. There is however one part of the proof which is not presented in the book – one assumes because it would take one too far afield. This concerns the existence of “typical elements”:

**Definition 1.** Let be a measure-preserving dynamical system, where is the Borel -algebra on , is the unilateral shift operator and is a -invariant probability measure. An element of is called *typical* if, for any ,

I have recently spent quite some time on ideas surrounding the concept of equidistribution, which is why I immediately found typical elements appealing. The idea that you can have a single element which can be used, via an ergodic average, to approximate the integral of any continuous function is perhaps not shocking, but pleasing nonetheless. My immediate reaction is to wonder what else we can say about these elements and collections of them. For instance, how many are there? How accessible are these elements in constructive terms? I have not yet explored these notions, but am eager to do so.

Existence can be proved with the ergodic theorem, but more interesting to me is that it can also be done without. The proof I will present here is from the paper by Kamae (who came up with the nonstandard proof of the ergodic theorem), who in turn states that he found it in Ville. The proof relies on little but some basic measure theory. I will stick closely to the Kamae paper, but hopefully clear up some details.

The key to the proof is to construct a sequence of periodic elements of which can be used to approximate the measure . We say that is periodic if there is some such that for all . Given a periodic with period , we construct a measure on by setting

as usual denoting the Dirac measure at . We want to show that we can find a sequence of periodic elements such that the associated measures converge weakly to .

The idea of the proof is now to encode a cylinder set in as a finite Cartesian product of a finite alphabet, then find a measure on that product which is very close to . The new measure will yield a kind of “maximal sequence” in the product, which we can use to construct our periodic element. But for now I am going to skip straight to the end and show how we can use such elements to get a typical one. In a follow-up post, we will get to the construction of the periodic elements, which is the real meat of the proof.

Suppose now that we have a sequence of periodic elements, assumed to have period , such that the associated measures converge weakly to as . Since each of these elements is determined by a finite numbers of “bits”, we can get the full information of each one in a finite string. To get our typical element then, we might be tempted to stick the first bits of string onto the end of the first bits of string , but this will lead to convergence problems when we look at again. Rather, we can think of the as increasingly good approximations to , and so would want to play a greater role in than , when . So we take the first elements of to form the first element of , follow them with the first bits of and so on, where . We will also require that is sufficiently small with respect to . To be a little more formal about it, we set

for any , with and , with .

In order to show that is indeed typical, it seems reasonable to write the sum in Definition 1 some form of integral in . Given that is a continuous function on a compact space, we know that the range is bounded and for convenience, positive. What we want then is something of the form

We can now see why it is necessary for the to increase quickly. It is a useful exercise to write out the integral as a sum according to the definition of a Lebesgue integral, to see that, for large

Due to the use of the periods of the in the construction of , we see that

where indicates the error due to the terms for . This can be made as small as we please by allowing the to increase rapidly, which yields the result.

Some of the fine detail has of course been left out here, but not, I think, anything that is too difficult to supply oneself. In a future post, I will discuss how we find using the measure .

]]>The blog will therefore be of a somewhat mixed nature. Some of the posts will be more personal, and may not always be of interest to someone interested in something mathematical. But I suspect there are quite a few people out there in similar positions to mine, and may benefit from knowing that the struggle is a shared one. This is not limited to mathematicians, but to scientists and academics in general. Especially, this may help some of those new to the business to at least avoid some of the mistakes I have made…

In addition, there will be purely mathematical entries. I have discovered (at a late stage, it must be said) that to understand something I have to write about it. I think I have avoided doing so more because writing mathematical documents is not easy. Yet one cannot be said to understand a topic to a reasonable degree unless one can convey it in writing. Lecturing is also good, but one usually doesn’t have the leisure to lecture on everything you want to understand, and it does not leave a permanent record to consult at a later stage. Writing a blog on the subject is a good compromise, since one has to make the material presentable to an audience, who could (at best) offer insight and correction and (at worst) savage your lack of understanding.

I make no claims of originality here. Much of what I write will have been stated by others. For instance, Terry Tao has a blog post from years ago that pretty much gives the exact advice of the previous paragraph. He has a great page of career advice at https://terrytao.wordpress.com/career-advice/, which should be read. All I can offer here is offer my own take on things.

This all sound quite serious, which will hopefully not be the dominant tone of this blog. One piece of advice for budding mathematicians would be not to take yourself too seriously. I have to keep reminding myself of this. Mathematics should be fun, and if it is not, find yourself another job. I tend to fall into a deep depression and blame myself endlessly when a solution I have been working on for months turns out to have a trivial counterexample. The answer is to get away from the problem, take a walk in a park, and realise that you are not a failure as a human being because of this. Sure, not every minute of mathematics will be pleasant, but if you can’t periodically remind yourself that you are doing this because you like it, you will suffer under a great psychological burden.

Thus, if I post something which seems silly, realise that this is just me reminding myself to lighten the hell up.

]]>

For those interested in exploring the murky waters of academic publishing in more detail, Timothy Gowers has some opinions on the subject.

]]>In order to learn something new about , go read this lovely post by John Baez.

]]>First though, let’s discuss how to avoid this kind of thing happening in the future:

**Do not use Windows.****For anything.**I only have a Windows partition for gaming, but with more and more games available on Linux, this is starting to look like a flimsy excuse. I hardly get to play anything these days, anyway…**Do not open suspicious email attachments.**This one can be slightly tricky, because the email may look like someone you know has sent it. However, if you do not recognise the file extension, and you think it might be a legitimate communication, ask them to re-send it in a more acceptable format. (They will probably reply that they never sent that email.) And if the attachment asks you to install something in order to view it (e.g. a new font), never, ever, ever, ever comply!**Have everything backed up.**This one will save you after nearly any kind of attack. Preferably have some kind of cloud storage and automatic back up set. I do like to have many backups, so I occasionally back up all my documents and photos on an external hard drive as well. Things that are easily available online don’t really need this treatment, unless you have a really slow connection. This will mean that even if your entire system is fried, you can just install a new open-source OS and continue working. If you don’t want to pay for storage (you should, it’s worth it), you can get some free space at various providers. The most that I’ve seen is Mega, which gives you a cool 50GB for free.

Of course, in this case the above advice had not been followed in time. We were looking at the possibility of lost work, family photos that were archived nowhere else and a serious amount of financial documentation. After some trial and error, we managed to get nearly everything back by following the following steps, and without paying the ransom!

**Clean the computer.**There are quite a few ways to do this. I used Malwarebytes and HitmanPro (look it up; I’m not going to link everything in this blog).**Remove the startup file.**Even after removing the malware, Firefox still opened on startup with the ransom note. Turns out there is a file which the software didn’t remove. Use msconfig to get to the start up applications and untick the box.**Recover your files.**You probably won’t be able to decrypt the files, but the ransomware fortunately did not encrypt all of your files, just the ones it could see. There are still many older versions of your files that hang around in your hard drive, that don’t show up in Windows Explorer. I found a rather nifty little program called Shadow Explorer to find and restore the files (Windows does have an option that let’s you do this for each file, but it is sucky). By using Shadow Explorer, we were able to recover all important documents, and only lost a page or two of work from the most recent document.

One other thing I did before starting to play with recovery was to make a full backup of the hard drive, after the bugs had been removed. That way, I knew that if I screwed things up even more and I could get hold of the authors, I still had the option of paying the ransom. But you don’t really want to do this, since you don’t want to encourage this kind of behaviour, and you also have no guarantee that they’ll give you the key!

]]>I do love my coffee in the morning, sometimes even Bulletproof Coffee, but I guess I will have to change some habits.

]]>