Choice needed for bases over a fixed field — Problem 6.1
Choice needed for bases over a fixed field — Problem 6.1. Current research status is unassessed. The dated source poses this question; inclusion does not certify that it remains open today.
Editorial MSC2020 mapping of Choice needed for bases over a fixed field — Problem 6.1. https://arxiv.org/html/2608.26628v2#S6.Thmproblem1 Not an author-supplied code.
Problem statement
Problem 6.1.
For vector space over fixed , is choose a basis require the full Axiom of Choice?
Lean 4
No Lean statement or proof is attached yet. Have a formalization? Share its source to add it to this problem.
Background
- Chieu-Minh Tran
It is about Morley’s categoricity in power theorem. According to [1], there is the following consequence.
Theorem 6.1.
For a countable theory , if it is categorial for some , then it is categorial for all uncountable .
And [2] replaced in the above theorem by recursion theoretic complexity (arithmetic degree). Then, the sequel goes to categoricity without Choice. The first research about this topic date back to [3] shows that we still have the theorem holds if we assume ZF + there is some uncountable well ordered set of reals.
Theorem 6.2.
[ZF there is an uncountable well ordered set of reals].
The following conditions on a countable (first order) are equivalent:
is categorical in some cardinal ,in , of course
is categorical in every cardinal , in , of course
is, in , totally transcendental (i.e. -stable) with no two cardinal models (i.e., for no model of and formula and do we have and is a cardinal, i.e. the set of elements of is well-orderable hence its power is a cardinal)
If is a transitive class extending , and satisfies ZFC, then the conditions in (3) hold
For some clause (4) holds.
However, for non-well-ordered cardinals, the situation deteriorates quickly. The sequel is the following. For such a theory , we want to show it is very close to a stongly minimal . It is like a vector space over fixed field or algebraically closed field. And since there is no well order, it is hard to take a basis and match them to one another. So there is the question.
Progress & source assessment
Current research status is unassessed. The dated source poses this question; inclusion does not certify that it remains open today.
- [1]Barmpalias, George; Gao, Su; He, Jialiang; Kihara, Takayuki; Nies, Andre; Slaman, Theodore; Tran, Chieu-Minh; Turetsky, Daniel; Welch, Philip; Yu, Liang; Zhang, Hang. Tianyuan Workshop — Open Problems in Mathematical Logic (2026).; Choice needed for bases over a fixed field — Problem 6.1 linkhttp://creativecommons.org/licenses/by/4.0/; attributed adaptation; HTML converted to Markdown with original mathematical notation and source links.
Recorded progress
Add yours →Nothing recorded yet. A pointer to a paper the entry is missing counts.
Machine attempts
0 recordedAttempts run against the statement below and are recorded in full, including the failures. The point is to stop the next model — and the next person — from re-walking a road that is already known to end. Each attempt costs 25 credits.
No machine attempts recorded.
Sign in to run an attempt. New accounts start with enough credits for ten.
Discussion
0 notesNotes are for clarifying the statement, flagging a missing reference, or recording why an approach fails. Claimed solutions belong in a submission, where they can be reviewed.
No notes yet.
Sign in to add a note.