OctoInformBeta

OpenAI preprint, September 2026 · §3. The abstract elementary class

Lemma 3.4: A nonempty linear order with countable closed intervals, or with countable closed initial segments, has at most ℵ1\aleph_1 points

Base orders of normal forms have at most ℵ1\aleph_1 points.

Hover over a blue or green term in the text, or a node in the graph, to find it in the other. Select it to read its declaration both in Lean and in words.

The Setting

A basic structure, a structure of the kind the paper studies, is handled through its normal form, which has a linear order BB as its base order. Lemma 3.4 bounds the size of BB, and the question it answers is one about linear orders: how many points can a linear order have when each of its closed intervals is countable? The rationals are such an order with ℵ0\aleph_0 points, and ω1×ℚ\omega_1 \times \mathbb{Q}, ordered lexicographically, is one with ℵ1\aleph_1.

Intervals and Normal Forms

Let (B,<)(B, <) be a linear order. For x,y∈Bx, y \in B, the closed interval [x,y][x, y] and the closed initial segment (−∞,y](-\infty, y] are the sets [x,y]={z∈B:x≤z≤y},(−∞,y]={z∈B:z≤y}.[x, y] = \{z \in B : x \le z \le y\}, \qquad (-\infty, y] = \{z \in B : z \le y\}.(1) A locally countable linear order is a linear order (B,<)(B, <) in which every closed interval [x,y][x, y] is countable.

A tuple tt from a set II is an injective map t:{0,…,n}→It \colon \{0, \dots, n\} \to I for some n∈ℕn \in \mathbb{N}, a finite sequence of distinct elements of II.✦

Array data M=(I,B,<,a)M = (I, B, <, a) consist of a nonempty index set II, a nonempty base order (B,<)(B, <) that is a dense, locally countable linear order without endpoints, and a bit a(t,n,b)∈{0,1}a(t, n, b) \in \{0, 1\} for every tuple tt from II, every n∈ℕn \in \mathbb{N} and every b∈Bb \in B.✦

The Claim

Theorem 1. Let (B,<)(B, <) be a linear order.

(i) If BB is nonempty and every closed interval [x,y][x, y] of BB is countable, then |B|≤ℵ1.|B| \le \aleph_1.(2)✦

(ii) If every closed initial segment (−∞,y](-\infty, y] of BB is countable, then |B|≤ℵ1.|B| \le \aleph_1.(3)✦

(iii) If (B,<)(B, <) is the base order of array data M=(I,B,<,a)M = (I, B, <, a), then |B|≤ℵ1.|B| \le \aleph_1.(4)✦

In the paper, the result reads: every order BB in a basic structure has cardinality at most ℵ1\aleph_1.

What Is Checked

The bounds (2) and (3) are stated over a linear order (B,<)(B, <), nonempty with countable closed intervals or with countable closed initial segments (1), and the bound (4) over array data M=(I,B,<,a)M = (I, B, <, a), whose bits are indexed by tuples from II.