Ilijas Farah
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Ilijas Farah has a total of 73 co-authors. Here are the top co-authors by number of shared publications:
- Alessandro Vignati
Institut de Mathématiques de Jussieu - Paris, Rive Gauche (IMJ-PRG), Université Paris Cité, Bâtiment Sophie Germain, 8 Place Aurélie Nemours, 75013 Paris, France
18 shared publications - Bruno de Mendonça Braga
IMPA
14 shared publications - Bradd Hart
McMaster University
11 shared publications - Florent Pierre Baudier
Department of Mathematics, Texas A &M University, College Station, USA
6 shared publications - Ilan Hirshberg
Department of Mathematics, Ben Gurion University of the Negev, Be’er Sheva, Israel
6 shared publications - Rufus Willett
University of Hawai‘i at Manoa, Honolulu, USA
6 shared publications
Latest Publications
- Open Access
- 29 October 2026
- Published by Cambridge University Press (CUP) in Journal of the Institute of Mathematics of Jussieu
- p. 1-70
COORDINATE RECOGNITION: GENERAL THEORY, GROUPS, AND OTHER SURPRISES
A class of structures recognizes coordinates if any reduced product of structures from said class witnesses a certain kind of rigidity phenomenon. We provide several equivalent characterizations of this property. This property has (at least) two remarkable consequences, one set-theoretic and one model-theoretic, for reduced products of structures of the said class. First, under appropriate set-theoretic assumptions every isomorphism between such reduced products associated with the Fréchet ideal lifts (modulo a finite change) to an isomorphism between products of the original structures. Second, with an additional mild assumption, it implies a strong quantifier elimination result. Of note, we show that a class recognizes coordinates if and only if an individual formula witnesses a certain syntactic property. We also consider many concrete classes of structures and determine whether or not they recognize coordinates. We place heavy emphasis on well-known classes of groups, such as permutation groups, acylindrically hyperbolic groups, quasisimple groups, free products and graph products, but we also discuss other classes of structures.
- 29 October 2026
- Published by Cambridge University Press (CUP) in Journal of the Institute of Mathematics of Jussieu
- p. 1-70
Open AccessCOORDINATE RECOGNITION: GENERAL THEORY, GROUPS, AND OTHER SURPRISES
A class of structures recognizes coordinates if any reduced product of structures from said class witnesses a certain kind of rigidity phenomenon. We provide several equivalent characterizations of this property. This property has (at least) two remarkable consequences, one set-theoretic and one model-theoretic, for reduced products of structures of the said class. First, under appropriate set-theoretic assumptions every isomorphism between such reduced products associated with the Fréchet ideal lifts (modulo a finite change) to an isomorphism between products of the original structures. Second, with an additional mild assumption, it implies a strong quantifier elimination result. Of note, we show that a class recognizes coordinates if and only if an individual formula witnesses a certain syntactic property. We also consider many concrete classes of structures and determine whether or not they recognize coordinates. We place heavy emphasis on well-known classes of groups, such as permutation groups, acylindrically hyperbolic groups, quasisimple groups, free products and graph products, but we also discuss other classes of structures.
- 27 February 2026
- Published by World Scientific Pub Co Pte Ltd in Journal of Mathematical Logic
Saturation of reduced products
In this paper, we study reduced products [ ] of countable structures in a countable language associated with the Fréchet ideal. We prove that such [ ] is [ ]-saturated if its theory is stable and not [ ]-saturated otherwise (regardless of whether the Continuum Hypothesis holds). This implies that [ ] is isomorphic to an ultrapower (associated with an ultrafilter on [ ]) if its theory is stable, even if the CH fails. We also improve a result of Farah and Shelah and prove that there is a forcing extension in which such reduced product [ ] is isomorphic to an ultrapower if and only if the theory of [ ] is stable. All of these conclusions apply for reduced products associated with [ ] ideals or more general layered ideals. We also prove that a reduced product associated with the asymptotic density zero ideal [ ], or any other analytic P-ideal that is not [ ], is not even [ ]-saturated if its theory is unstable.
- 27 February 2026
- Published by World Scientific Pub Co Pte Ltd in Journal of Mathematical Logic
Saturation of reduced products
In this paper, we study reduced products [ ] of countable structures in a countable language associated with the Fréchet ideal. We prove that such [ ] is [ ]-saturated if its theory is stable and not [ ]-saturated otherwise (regardless of whether the Continuum Hypothesis holds). This implies that [ ] is isomorphic to an ultrapower (associated with an ultrafilter on [ ]) if its theory is stable, even if the CH fails. We also improve a result of Farah and Shelah and prove that there is a forcing extension in which such reduced product [ ] is isomorphic to an ultrapower if and only if the theory of [ ] is stable. All of these conclusions apply for reduced products associated with [ ] ideals or more general layered ideals. We also prove that a reduced product associated with the asymptotic density zero ideal [ ], or any other analytic P-ideal that is not [ ], is not even [ ]-saturated if its theory is unstable.
- Open Access
Separable C*-algebras Without the Countable Axiom of Choice
The goal of this paper is twofold. In addition to the results stated in the next paragraph, we present some classical results on absoluteness relevant to functional analysis that are well known to logicians but not nearly as well advertised as they should be. We show that the theory of separable C*-algebras can be developed in ZF (that is, without using any Choice). This includes proving the Gelfand-Naimark representation theorems as well as the Spectral Mapping Theorem for polynomials and developing continuous functional calculus for commuting normal elements. Some of our proofs are modifications of the standard ones, obtained by avoiding the use of Choice. Some other proofs require new ideas in order to avoid the use of Choice. Yet another batch of proofs proceeds by using the set-theoretic Shoenfield Absoluteness Theorem. This result (well known to logicians but regrettably not as well advertised as it deserves) implies that statements about standard Borel spaces of low quantifier complexity that are provable in ZFC, or even ZFC together with the Continuum Hypothesis are provable in ZF. One of the main objectives of this paper is to present these results in a convenient form that can be utilized by analysts not familiar with set theory. We also show that in the absence of Choice (more precisely, assuming the existence of a Russell set) there is a concretely representable unital commutative \cstar-algebra that is not isomorphic to C(X) for any compact Hausdorff space X. Finally, from the model-theoretic point of view, while the property of having a tracial state is provably axiomatizable in ZFC, it is not provably axiomatizable in ZF+DC.
Open AccessSeparable C*-algebras Without the Countable Axiom of Choice
The goal of this paper is twofold. In addition to the results stated in the next paragraph, we present some classical results on absoluteness relevant to functional analysis that are well known to logicians but not nearly as well advertised as they should be. We show that the theory of separable C*-algebras can be developed in ZF (that is, without using any Choice). This includes proving the Gelfand-Naimark representation theorems as well as the Spectral Mapping Theorem for polynomials and developing continuous functional calculus for commuting normal elements. Some of our proofs are modifications of the standard ones, obtained by avoiding the use of Choice. Some other proofs require new ideas in order to avoid the use of Choice. Yet another batch of proofs proceeds by using the set-theoretic Shoenfield Absoluteness Theorem. This result (well known to logicians but regrettably not as well advertised as it deserves) implies that statements about standard Borel spaces of low quantifier complexity that are provable in ZFC, or even ZFC together with the Continuum Hypothesis are provable in ZF. One of the main objectives of this paper is to present these results in a convenient form that can be utilized by analysts not familiar with set theory. We also show that in the absence of Choice (more precisely, assuming the existence of a Russell set) there is a concretely representable unital commutative \cstar-algebra that is not isomorphic to C(X) for any compact Hausdorff space X. Finally, from the model-theoretic point of view, while the property of having a tracial state is provably axiomatizable in ZFC, it is not provably axiomatizable in ZF+DC.
- 10 February 2026
- Published by American Mathematical Society (AMS) in Proceedings of the American Mathematical Society
- Vol. 154 (4) , 1609-1622
Continuous selection of unitaries in II₁ factors
We prove continuous-valued analogues of the basic fact that Murray–von Neumann subequivalence of projections in II 1 _1 factors is completely determined by tracial evaluations. We moreover use this result to solve the so-called trace problem in the case of factorial trivial W ∗ W^\ast -bundles whose base space has covering dimension at most 1. Our arguments are based on applications to von Neumann algebras of a continuous selection theorem due to Michael.
- 10 February 2026
- Published by American Mathematical Society (AMS) in Proceedings of the American Mathematical Society
- Vol. 154 (4) , 1609-1622
Continuous selection of unitaries in II₁ factors
We prove continuous-valued analogues of the basic fact that Murray–von Neumann subequivalence of projections in II 1 _1 factors is completely determined by tracial evaluations. We moreover use this result to solve the so-called trace problem in the case of factorial trivial W ∗ W^\ast -bundles whose base space has covering dimension at most 1. Our arguments are based on applications to von Neumann algebras of a continuous selection theorem due to Michael.
- 5 December 2025
- Published by American Mathematical Society (AMS) in Transactions of the American Mathematical Society
- Vol. 379 (4) , 2919-2954
Conjugating trivial automorphisms of 𝒫(ℕ)/`ch
A trivial automorphism of the Boolean algebrais an automorphism induced by the action of some function . The forcing axiom implies all automorphisms are trivial, and therefore two trivial automorphisms are conjugate if and only if they have the same (modulo finite) orbit structure. We show that the Continuum Hypothesis implies that two trivial automorphisms are conjugate if and only if there are no first-order obstructions to their conjugacy and their indices have the same parity, if and only if the given trivial automorphisms are conjugate in some forcing extension of the universe. To each automorphism of we associate the first-order structure and compute the existential theories of these structures. These results are applied to resolve a question of Braga, Farah, and Vignati and prove that there are coarse, uniformly locally finite, metric spaces and such that the isomorphism between their uniform Roe coronas is independent of . - 5 December 2025
- Published by American Mathematical Society (AMS) in Transactions of the American Mathematical Society
- Vol. 379 (4) , 2919-2954
Conjugating trivial automorphisms of 𝒫(ℕ)/`ch
A trivial automorphism of the Boolean algebrais an automorphism induced by the action of some function . The forcing axiom implies all automorphisms are trivial, and therefore two trivial automorphisms are conjugate if and only if they have the same (modulo finite) orbit structure. We show that the Continuum Hypothesis implies that two trivial automorphisms are conjugate if and only if there are no first-order obstructions to their conjugacy and their indices have the same parity, if and only if the given trivial automorphisms are conjugate in some forcing extension of the universe. To each automorphism of we associate the first-order structure and compute the existential theories of these structures. These results are applied to resolve a question of Braga, Farah, and Vignati and prove that there are coarse, uniformly locally finite, metric spaces and such that the isomorphism between their uniform Roe coronas is independent of . - Open Access
- 29 August 2025
- Published by European Mathematical Society - EMS - Publishing House GmbH in Oberwolfach Reports
- Vol. 22 (1) , 75-140
Set Theory
Set theory has experienced rapid development in the recent years, both in pure set theory and in its applications to other fields of mathematics. We have seen breakthroughs in combinatorial set theory, forcing, inner models, descriptive set theory, Borel combinatorics, and moreover, exciting new connections between some of these areas. The workshop succeeded in presenting and discussing the important developments, fostering interaction between researchers, and stimulating the field.
- 29 August 2025
- Published by European Mathematical Society - EMS - Publishing House GmbH in Oberwolfach Reports
- Vol. 22 (1) , 75-140
Open AccessSet Theory
Set theory has experienced rapid development in the recent years, both in pure set theory and in its applications to other fields of mathematics. We have seen breakthroughs in combinatorial set theory, forcing, inner models, descriptive set theory, Borel combinatorics, and moreover, exciting new connections between some of these areas. The workshop succeeded in presenting and discussing the important developments, fostering interaction between researchers, and stimulating the field.
- Open Access
- 4 July 2025
- Published by Cambridge University Press (CUP) in The Journal of Symbolic Logic
- Vol. 91 (2) , 776-812
QUANTUM EXPANDERS AND QUANTIFIER REDUCTION FOR TRACIAL VONNEUMANN ALGEBRAS
We provide a complete characterization of theories of tracial von Neumann algebras that admit quantifier elimination. We also show that the theory of a separable tracial von Neumann algebra script upper M $\mathcal {M}$ is never model complete if its direct integral decomposition contains upper I upper I Subscript 1 $\mathrm {II}_1$ factors script upper N $\mathcal {N}$ such that upper M 2 left parenthesis script upper N right parenthesis $M_2(\mathcal {N})$ embeds into an ultrapower of script upper N $\mathcal {N}$ . The proof in the case of upper I upper I Subscript 1 $\mathrm {II}_1$ factors uses an explicit construction based on random matrices and quantum expanders.- 4 July 2025
- Published by Cambridge University Press (CUP) in The Journal of Symbolic Logic
- Vol. 91 (2) , 776-812
Open AccessQUANTUM EXPANDERS AND QUANTIFIER REDUCTION FOR TRACIAL VONNEUMANN ALGEBRAS
We provide a complete characterization of theories of tracial von Neumann algebras that admit quantifier elimination. We also show that the theory of a separable tracial von Neumann algebra script upper M $\mathcal {M}$ is never model complete if its direct integral decomposition contains upper I upper I Subscript 1 $\mathrm {II}_1$ factors script upper N $\mathcal {N}$ such that upper M 2 left parenthesis script upper N right parenthesis $M_2(\mathcal {N})$ embeds into an ultrapower of script upper N $\mathcal {N}$ . The proof in the case of upper I upper I Subscript 1 $\mathrm {II}_1$ factors uses an explicit construction based on random matrices and quantum expanders. - Top Cited PapersOpen Access
- 30 June 2025
- Published by Cambridge University Press (CUP) in The Bulletin of Symbolic Logic
- Vol. 31 (2) , 195-287
CORONA RIGIDITY
We give a unified overview of the study of the effects of additional set theoretic axioms on quotient structures. Our focus is on rigidity, measured in terms of existence (or rather non-existence) of suitably non-trivial automorphisms of the quotients in question. A textbook example for the study of this topic is the Boolean algebra $\mathcal {P}({\mathbb N})/\operatorname {\mathrm {Fin}}$ , whose behavior is the template around which this survey revolves: Forcing axioms imply that all of its automorphisms are trivial , in the sense that they are induced by almost permutations of ${\mathbb N}$ , while under the Continuum Hypothesis this rigidity fails and $\mathcal {P}({\mathbb N})/\operatorname {\mathrm {Fin}}$ admits uncountably many non-trivial automorphisms. We consider far-reaching generalisations of this phenomenon and present a wide variety of situations where analogous patterns persist, focusing mainly (but not exclusively) on the categories of Boolean algebras, Čech–Stone remainders, and $\mathrm {C}^{*}$ -algebras. We survey the state of the art and the future prospects of this field, discussing the major open problems and outlining the main ideas of the proofs whenever possible.- 30 June 2025
- Published by Cambridge University Press (CUP) in The Bulletin of Symbolic Logic
- Vol. 31 (2) , 195-287
Top Cited PapersOpen AccessCORONA RIGIDITY
We give a unified overview of the study of the effects of additional set theoretic axioms on quotient structures. Our focus is on rigidity, measured in terms of existence (or rather non-existence) of suitably non-trivial automorphisms of the quotients in question. A textbook example for the study of this topic is the Boolean algebra $\mathcal {P}({\mathbb N})/\operatorname {\mathrm {Fin}}$ , whose behavior is the template around which this survey revolves: Forcing axioms imply that all of its automorphisms are trivial , in the sense that they are induced by almost permutations of ${\mathbb N}$ , while under the Continuum Hypothesis this rigidity fails and $\mathcal {P}({\mathbb N})/\operatorname {\mathrm {Fin}}$ admits uncountably many non-trivial automorphisms. We consider far-reaching generalisations of this phenomenon and present a wide variety of situations where analogous patterns persist, focusing mainly (but not exclusively) on the categories of Boolean algebras, Čech–Stone remainders, and $\mathrm {C}^{*}$ -algebras. We survey the state of the art and the future prospects of this field, discussing the major open problems and outlining the main ideas of the proofs whenever possible. - Open Access
Coordinate recognition: General theory, Groups, and other surprises
A class of structures recognizes coordinates if any reduced product of structures from said class witnesses a certain kind of rigidity phenomena. We provide several equivalent characterizations of this property. This property has (at least) two remarkable consequences, one set-theoretic and one model-theoretic, for reduced products of structures of the said class. First, under appropriate set-theoretic assumptions every isomorphism between such reduced products associated with the Fr\' echet ideal lifts (modulo a finite change) to an isomorphism between products of the original structures. Second, with an additional mild assumption, it implies a strong quantifier elimination result. Of note, we show that a class recognizes coordinates if and only if an individual formula witnesses a certain syntactic property. We also consider many concrete classes of structures and determine whether or not they recognize coordinates. We place heavy emphasis on well known classes of groups, but we also discuss other classes of structures.
Open AccessCoordinate recognition: General theory, Groups, and other surprises
A class of structures recognizes coordinates if any reduced product of structures from said class witnesses a certain kind of rigidity phenomena. We provide several equivalent characterizations of this property. This property has (at least) two remarkable consequences, one set-theoretic and one model-theoretic, for reduced products of structures of the said class. First, under appropriate set-theoretic assumptions every isomorphism between such reduced products associated with the Fr\' echet ideal lifts (modulo a finite change) to an isomorphism between products of the original structures. Second, with an additional mild assumption, it implies a strong quantifier elimination result. Of note, we show that a class recognizes coordinates if and only if an individual formula witnesses a certain syntactic property. We also consider many concrete classes of structures and determine whether or not they recognize coordinates. We place heavy emphasis on well known classes of groups, but we also discuss other classes of structures.