Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-22
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

Brunner's models satisfy the required choice and Urysohn obstructions

Statement

The real-ordered countable-compact-support Läuchli model of Brunner's ordered Läuchli permutation models satisfies the Axiom of Countable Choice (The Axiom of Countable Choice (ACω)), and both that model and the rational-ordered finite-support model contain a nondegenerate compact linearly ordered normal space L (Open cover, subcover, and compact topological space; a compact subset is a subspace that is compact in its own right, Normal spaces and T4 spaces, with the source disagreement over whether normality includes T1 stated explicitly) on which every continuous real-valued function is constant (Continuity of a map of topological spaces at a point and globally); hence Urysohn's lemma fails in both models.

Facts & Assumptions

Given: The two models of Brunner's ordered Läuchli permutation models, formed internally in a ground model M of ZFA+AC. All constructions and arguments below, including ranks, real coordinates, compactness and sequences, are interpreted inside M; no external well-foundedness or transitivity of M is required. Write N for either symmetric model and L=[a,b]A for the closed atom interval, with a<b. Ground order coordinates identify A with R or Q in M, outside N; no such enumeration is asserted to belong to N.

[F1]

Internally in M, the permutation model is membership-closed with the same pure kernel; its objects are hereditarily symmetric, not merely symmetric. Pure reals and natural numbers are fixed by every atom permutation. Conjugation transports supports, and a symmetric set of hereditarily symmetric members is hereditarily symmetric (Brunner's ordered Läuchli permutation models, Permutation groups, stabilizers, supports, and normal filters, Symmetric and hereditarily symmetric sets).

[F2]
[F3]

Ground AC permits simultaneous witness choices and countable unions of countable sets are countable there (The Axiom of Choice, Countable unions of at most countable sets, assuming ACω). A compact real set is closed and bounded, and conversely (A subset of R is compact if and only if it is closed and bounded). Every nondegenerate real interval is uncountable (Every nondegenerate interval of R is uncountable); the rationals are dense and countable (Both Q and RQ are dense in R, and every nonempty open subset of R is uncountable, Q is countably infinite).

Proof

technique · direct
1.1

All constructions involving order coordinates in the following support argument take place in M. Given a sequence (Fn) of nonempty sets in the real model, enlarge a support for the sequence to a nonempty countable compact set e. Ground AC chooses xnFn and countable compact supports en for them. Each xn is hereditarily symmetric by membership closure. The sequence support fixes each Fn, since the index n is pure.

givenF1F2F3
1.2

In the real model the internal interval L is compact: each internal open cover is, in ground real coordinates, an open cover of the real closed bounded interval, hence has a finite subcover by [F3]. Every member of this subcover is already hereditarily symmetric, and a finite set of such objects is hereditarily symmetric by combining their finitely many supports. Thus that finite subcover belongs to N. The internal order topology is Hausdorff in either model: between two distinct points choose two intervening points and use the disjoint order rays. This is a finite existence argument in the dense atom order.

givenF1F2F3
1.3

In the rational model, every nonempty internal subset SL has a supremum in L. Enlarge a finite support for S by a,b, and call it e. In the ground real completion of the rational order let r=supS. If re, it lies in a complementary interval of the finite set e. Choose rational points u<r<v inside that interval and an increasing rational order automorphism fixing e whose extension to real cuts moves r: for instance choose rational breakpoints around r and a piecewise-affine map with positive rational slopes, identity outside the component, which moves the whole small interval containing r to its right. Such a map preserves the rational order and fixes e, hence preserves S, contradicting uniqueness of its real supremum. Therefore reL, so it is an atom and is the supremum internally too. This concerns internal sets only; no ambient irrational cut is added to N.

givenF1F2F3
1.4

Let g:LR be an internal continuous map. Enlarge a support of g to include a,b, using a countable compact support in the real model and a finite support in the rational model. An automorphism fixing this support fixes every pure real value, hence g(px)=g(x). On each complementary interval of the support in L, increasing automorphisms fixing the support act transitively: a piecewise-affine increasing map sends any prescribed interior point to another and fixes the boundary, and in the rational case its pieces can have rational coefficients. Hence g is constant on each such interval. No assertion is made that supported points move.

givenF1F2F4
2.1

Put εn=1/(n+1). There is an increasing bijection pn of the real order fixing e and sending every point of en within distance εn of e. Here is the component construction. On a bounded complementary interval (c,d) of e, choose c<u<v<d with [u,v]en=: the closed countable set en cannot contain an interval by [F3]. Choose 0<δ<min(εn,(dc)/3). Map [c,u] affinely to [c,c+δ], [u,v] affinely to [c+δ,dδ], and [v,d] affinely to [dδ,d]. The pieces agree, are strictly increasing and send the portion of en into the two boundary strips. On a right unbounded component (c,), choose R>c above all of en, map [c,R] affinely onto [c,c+εn/2], and continue by a positive-slope affine bijection onto [c+εn/2,); treat the left ray by reflection. Fix e pointwise. The component maps and this fixed part form a global increasing bijection, since each component maps onto itself with its endpoints fixed. AC in M permits these choices for all components and n.

step 1.1F2F3
2.2

Order completeness from step 1.3 implies compactness of the rational-model interval without choice. Given an internal open cover, internally form C={xL:[a,x] has a finite subcover}. It contains a and has a supremum c. A cover member containing c contains an interval neighbourhood of c. If c>a, choose xC in the left part of that neighbourhood using the supremum property; its finite subcover together with this member covers [a,c]. If c=a, that member alone covers [a,c]. Thus cC. If c<b, the same neighbourhood extends to a point to the right of c and would put that point in C, a contradiction. Hence c=b, and the cover has a finite subcover. This whole argument is internal to N. Combined with step 1.2, both intervals are compact Hausdorff and therefore normal by [F5].

step 1.2step 1.3F2F5
2.3

In the rational model there are only finitely many support points and complementary intervals. Continuity at each interior support point makes the constants on its two adjacent intervals equal to its value: if a constant differed, disjoint real neighbourhoods of the two values would contradict continuity along that adjacent interval. The same one-sided argument applies at a,b. Moving across the finite ordered list of support points proves that g is constant on L.

step 1.4F4
2.4

In the real model the complementary intervals are countable in M: enumerate the ground rationals and assign to each interval the least rational index inside it; disjoint intervals get different indices. Together with the countable support and step 1.4 this makes g[L] at most countable in M, by [F3]. But g, viewed in ground real coordinates, is continuous: the preimage of every ground open real set is internally open (the pure kernel is unchanged), and internally open subsets of L are ground open subsets. If two values differed, the intermediate-value theorem on the real subinterval between their arguments would put a nondegenerate real interval in g[L], contrary to [F3]. Thus g is constant here as well.

step 1.4F1F3F4
3.1

Let K=enpn[en]. It is countable by [F3] and bounded, since every new point is within 1 of the bounded nonempty set e. It is closed: if ze, some neighbourhood of z has positive distance from e, so it misses pn[en] for all sufficiently large n. The remaining finitely many sets pn[en], and e, are closed, since increasing real bijections are homeomorphisms (they map order intervals to order intervals). Thus a point outside K has an open neighbourhood missing K. By [F3], K is compact and is an allowed support.

step 2.1F3
4.1

Set yn=pn(xn). Since pn fixes e, ynFn; conjugation makes pn[en] a support for yn. Hence K supports the graph {(n,yn):nN}. Its members and all their membership descendants are hereditarily symmetric by [F1], so this graph belongs to N. It is a choice function for the given sequence. This proves Countable Choice in the real model; AC was used only in M to obtain the supported graph.

step 1.1step 2.1step 3.1F1F3
5.1

The endpoint atoms a,b are distinct closed singleton subsets of the normal space L. A Urysohn separator would take values 0 and 1 at these endpoints and would be a nonconstant internal continuous real-valued function, contradicting steps 2.3 and 2.4. Hence Urysohn's lemma fails in both models, while step 4.1 establishes Countable Choice in the real model.

step 4.1step 2.2step 2.3step 2.4F2F5

Depends on

Used by

Dependency tree · two levels

103 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources