Asaf Karagila

I saw a few papers on arXiv recently that were very clearly prepared by asking ChatGPT or some other GenAI to analyse an idea and write a paper.

I was recently reminded of an old answer I posted on Math.SE with advice on how to give a talk.

I spent the past few months training a few neural nets on large cardinal axioms and related results.

This is a piece of advice that I found myself giving to many early career researchers, students, and colleagues supervising and advising those as well.

Well, that was quite the week!

Continuing from last two posts, this is a final reminder to register to 120 Years of Choice.

Continuing from the previous post, we have a website for the conference now, and you can now register for the conference.

We are happy to make the initial announcement for the "120 Years of Choice" conference that will take place in Leeds between the 8th and 12th of July, 2024!

It was foretold of a legendary scientist, one who would master all of mathematics, all of physics, all of chemstiry, all of biology, some of engineering, bits of psychology, and none of economics.

So, I spent the last year training a bunch of neural nets how to do forcing, with and without choice, how to work with symmetric extensions, and how to force over symmetric extensions.

Oddly enough, one of the questions I hear from starting Ph.D. students is "how do you prove theorems?"

Sometimes, as a man in mathematics, the topic of diversity comes up.

Nothing.

Which answer is the most correct?

I got an email a few days ago from Lucas Polymeris, a Chilean student, who asked me a very nice question.

It's been a great ride at the University of East Anglia.

No, this isn't some personal blog post.

Well, it seems that there's a new paper about Flow and the Partition Principle on arXiv.

Recursion n.: (see recursion).

I know.

My new postdoc, Jiachen Yuan, suggested it will be a good idea to have a one-day workshop on Prikry forcing.

So.

Some of you already saw this new preprint on arXiv, and some of you even emailed me about it.

Back in autumn 2015 I took a functional analysis course with Prof.

As some of you may already know, I was recently awarded a UKRI Future Leaders Fellowship.

I recently posted an answer on MathOverflow where I explained a bit about the approaches to forcing in the literature, at least as I experienced them.

Three years ago I was looking for jobs, I was at the last stretch of my PhD and without clear prospects on what's next.

I am not here to solve racism.

Those who know me in real life will know that I enjoy cooking.

Last night someone asked a question on Math.SE regarding a lemma used in proving certain chain conditions hold when iterating forcing with finite support.

Oh, have I been waiting to tell you something...

I've decided to design a small "choose your own adventure".

One of the classic results of Sierpinski is that if there are as many countable sets of reals as there are reals, then there is a set which is not Lebesgue measurable.

With most people under quarantine, I spent some time going over older files in my computer.

The decade is drawing to a close, and while it is entirely arbitrary, it's a great excuse to look back at this decade.

The meeting in Norwich is over.

Methods in Higher Forcing Axioms (or MEHIFOX, for short) is an experimental workshop hosted in Norwich by David Asperó and myself.

Everybody wants to improve their mathematical skills!

I have posted two new lecture notes online.

I have often seen people complain about Replacement axioms.

I just posted another problem in the problems page.

Those who know me, also know my strong liking of the amazing Spreewaldhof Get One!

We all know and love Cohen's first model where the axiom of choice fails.

Talks.

Suppose that a parameter formula defines an inner model.

Yup.

I've decided to have a list of open problems on my site.

Welcome to my new website!

I had a recent back and forth on Math.SE with a user that asked whether or not some exercise he found in some textbook is correct.

Finally!