Martin Escardo
banner
martinescardo.mathstodon.xyz.ap.brid.gy
Martin Escardo
@martinescardo.mathstodon.xyz.ap.brid.gy
Professor at the University of Birmingham, UK.
I am interested in constructive mathematics and (constructive and non-constructive) homotopy type theory and […]

🌉 bridged from ⁂ https://mathstodon.xyz/@MartinEscardo, follow @ap.brid.gy to interact
@dpiponi I don't think the UK is the worst in this respect. Think of e.g. Italy, but also other European countries.
November 20, 2025 at 10:44 PM
@dpiponi writes "the US is the laughing stock of the world"

What's sadder is that a lot of countries are copying it, to the extent that fewer and fewer people laugh about this.
November 20, 2025 at 10:38 PM
@skewray writes "My wife just purchased an iPhone 17. When she is in the house and I am listening to music with my desktop and headphones, I can hear her iPhone microphone in the right headphone channel"

Funnily enough, something very similar happened to me two days ago.

I connected my […]
Original post on mathstodon.xyz
mathstodon.xyz
November 20, 2025 at 11:20 AM
Actually, (iii) was an oversight.

@de_Jong_Tom Developed this in TypeTopology:

https://cs.bham.ac.uk/~mhe/TypeTopology/DomainTheory.Lifting.LiftingDcpo.html

So in principle we just need to put things together.

@jonmsterling
November 19, 2025 at 7:31 PM
@jonmsterling

By the way, there is also a question, labelled by the prefix "TODO", which I find very interesting and for which I would like to know an answer.

I hesitate to call this a conjecture, because I am in two minds.

At some point I thought I could prove that my results are tight.

But […]
Original post on mathstodon.xyz
mathstodon.xyz
November 19, 2025 at 6:23 PM
@andrejbauer writes "If anyone knows of (non-trivial) examples of Lawvere's fixed point theorem, I'd be interested to know about them."

I have quite a few here:
https://martinescardo.github.io/TypeTopology/Various.LawvereFPT.html

@highergeometer @jameshanson
Various.LawvereFPT
martinescardo.github.io
November 19, 2025 at 11:20 AM
Even later:

"Loosely speaking, a mapping from one set, S, into another, T, is a "rule" (whatever that may mean) that associates with each element in S a unique element t in T."

This is followed by a formal definition in set theory as a set of pairs, only to be followed by

"This definition […]
Original post on mathstodon.xyz
mathstodon.xyz
November 16, 2025 at 9:28 PM
Later in the same book "The term "abstract"
is a highly subjective one; what is abstract to one person is very often concrete and down-to-earth to another, and vice versa."
November 16, 2025 at 8:21 PM
@sue

You probably know that mathematicians do write algorithms in natural language, including Euclid.

But, yes, I agree, my CS students find it more difficult to write algorithms in natural language than in some programming language. Worse, when they learn a second programming language, they […]
Original post on mathstodon.xyz
mathstodon.xyz
November 15, 2025 at 6:09 PM
I was considering writing a thread here about this subject, exact real number computation using infinite sequences of digits, here, but I concluded that I can't do better than the markdown / Haskell file I linked above.

Consider the above link as a blog post.

When the Haskell file was […]
Original post on mathstodon.xyz
mathstodon.xyz
November 14, 2025 at 7:18 PM
And this is an example of something "I knew" it was the case before I attempted to prove it, except that I concluded ¬¬ EM (which is good enough for the answer) rather than EM (which I thought I knew I could conclude). Also I didn't anticipate that Higgs Involution Theorem would be useful. But […]
Original post on mathstodon.xyz
mathstodon.xyz
November 8, 2025 at 11:39 PM
And so here is a thread that discusses Higgs' Involution Theorem, used above.

https://mathstodon.xyz/deck/@MartinEscardo/111291658836418672
Martin Escardo (@[email protected])
Let Ω be the subobject classifier, or object of truth values, aka propositions or subsingletons. The following discussion works in the internal language of a 1-topos, in HoTT/UF (an internal language for ∞-toposes), and in CZF/IZF (taking Ω = 𝓟 {∅}, the power class/set of the "canonical" singleton set), and possibly more "foundations" or "mathematical worlds". If our (∞-)topos under consideration is boolean, that is, if excluded middle holds in its internal language, there are precisely two automorphisms of Ω, namely the identity map and the negation map. The same is the case for CZF/IZF, and possibly more mathematical worlds. (1) If there is an automorphism f : Ω → Ω such that f(p₀)≠p₀ for some p₀:Ω, then excluded middle holds. Is this fact already known? I recorded my proof somewhere in TypeTopology. Moreover, in order to get the same conclusion, it is enough to assume that f is an embedding, or left-cancellable, meaning that f(p)=f(q) implies p=q. This is because any lc-map Ω → Ω is necessarily an (involutive) automorphism, which is due to Higgs. (2) The converse of (1) also holds trivially, because we can take f to be negation and p₀ to be ⊤ (or ⊥) if excluded middle holds. (1+2) So excluded middle holds if and only if there is an automorphism f : Ω → Ω such that f(p₀)≠p₀ for some p₀:Ω. Any such automorphism f is not the identity map. However, without excluded middle, there is no reason why for any automorphism f≠id there should exist p₀ with f(p₀)≠p₀. So we can't conclude from the above discussion that there is an automorphism different from the identity if and only if excluded middle holds. Can we conclude this by other means? I don't think so, but I don't have a (meta-)proof. 1/
mathstodon.xyz
November 8, 2025 at 7:18 PM
One thing I like about the proof of the above is that it uses what I call Higgs Involution Theorem: any embedding Ω → Ω, and in particular by equivalence Ω → Ω is involutive.
November 8, 2025 at 7:09 PM
Here is the paper in which Jon asks this question:

https://arxiv.org/abs/2312.17023

@jonmsterling
Tensorial structure of the lifting doctrine in constructive domain theory
We present a survey of the two-dimensional and tensorial structure of the lifting doctrine in constructive domain theory, i.e. in the theory of directed-complete partial orders (dcpos) over an arbitrary elementary topos. We establish the universal property of lifting of dcpos as the Sierpiński cone, from which we deduce (1) that lifting forms a Kock-Zöberlein doctrine, (2) that lifting algebras, pointed dcpos, and inductive partial orders form canonically equivalent locally posetal 2-categories, and (3) that the category of lifting algebras is cocomplete, with connected colimits created by the forgetful functor to dcpos. Finally we deduce the symmetric monoidal closure of the Eilenberg-Moore resolution of the lifting 2-monad by means of smash products; these are shown to classify both bilinear maps and strict maps, which we prove to coincide in the constructive setting. We provide several concrete computations of the smash product as dcpo coequalisers and lifting algebra coequalisers, and compare these with the more abstract results of Seal. Although all these results are well-known classically, the existing proofs do not apply in a constructive setting; indeed, the classical analysis of the Eilenberg-Moore category of the lifting monad relies on the fact that all lifting algebras are free, a condition that is not known to hold constructively.
arxiv.org
November 8, 2025 at 5:49 PM