Determinization in Structure Theories: A Unified Framework via Closure, Comparability, and Joint Admissibility

Introduction to the show: ident: AI Radio. Generated commentary on the latest Artificial Intelligence papers.

Tom: Next we'll be talking about the paper "Determinization in Structure Theories: A Unified Framework via Closure, Comparability, and Joint Admissibility".

Jane: The paper was written by Hai Hai Fu from.

Tom: Stay tuned as we take you through the paper and discuss its implications.

Title: Tom: Alright, welcome back everyone. Today we're digging into a paper with a title that's a mouthful — "Determinization in Structure Theories: A Unified Framework via Closure, Comparability, and Joint Admissibility." Jane, I'll be honest, when I first read that title I had to sit down.

Jane: Ha, you and me both, Tom. But once you unpack it, it's actually about a really practical problem. "Determinization" just means making something give one clear answer instead of many possible answers. And "structure theories" — think of them as rulebooks for interpreting market structures, like Wyckoff or ICT, the stuff traders use to read charts.

Tom: Right, and that's the hook. These rulebooks are plural — they let multiple valid interpretations coexist at the same price point. The paper asks: when are you actually licensed to pick one and commit?

Jane: Exactly. And the authors — Hai Hai Fu, the sole author here — frames this in a really interesting way. They connect it to LLM-assisted reasoning. You know how a language model can hallucinate? The paper says hallucination is basically unsupported canonicalization — the system commits to a single answer when the underlying set of valid answers hasn't collapsed to one yet.

Tom: That's a wild reframe. So the LLM isn't being "wrong" in some vague sense — it's being structurally premature. It's emitting a determinate answer when the math says it shouldn't.

Jane: Precisely. And that's why this framework matters. It gives you formal conditions for when commitment is licensed. Not vibes, not heuristics — actual structural conditions.

Tom: I love that. And I know Lu's going to have thoughts on this because it touches that whole question of when AI systems should express uncertainty versus when they should just commit. Lu, you're on the line — what do you make of this framing?

Lu: Tom, I think it's genuinely important. The paper formalizes something we've all felt — that a model should be allowed to be decisive only when the evidence forces a unique answer. The distinction they draw between "closure stabilization" and full "determinization" is subtle but crucial. Stabilization means each starting point settles somewhere. Determinization means everyone settles at the same place. Those are very different claims, and the paper is careful about which one it proves.

Jane: And that care is the whole ballgame, right? Because a lot of papers would just claim the strong result and hand-wave. This one says, for the ICT theory, we've got stabilization, but the upgrade to full determinization is an open question — they literally label it OQ-GC-one.

Tom: Open questions in a paper — that's refreshing. It's not a weakness, it's intellectual honesty. Alright, we've got a lot more to unpack here, so let's keep going.

Abstract: Tom: So we're back with "Determinization in Structure Theories" and we've got the abstract in front of us. Jane, what jumps out at you?

Jane: The core principle they state at the end — that's the thing I keep coming back to. Completion-based canonicalization needs closure, comparability, and compatible extension. Selection-based canonicalization needs theory-intrinsic comparability and global compatibility. It reads like a recipe, Tom. Two different recipes for two different kinds of problems.

Tom: And that distinction — completion versus selection — that's the heart of their taxonomy. Some theories are "Type E" — epistemic plurality, where the ambiguity comes from missing evidence. Add more evidence, and the ambiguity vanishes. Other theories are "Type S" — structural plurality, where even with perfect information, multiple interpretations persist.

Lu: And then they refine Type S into "Type S-strong" — where two admissible interpretations have no common upper bound. That's the case where completion is provably impossible. You can't just keep adding structure until things converge, because the alternatives are axiomatically incomparable. Wyckoff theory is their example there.

Jane: Right, and for Type S-strong, you need a selector — a rule that just picks one, like PhaseClassify picking the dominant phase. It's not about proving convergence; it's about making a principled choice.

Tom: So for Type E — like ICT — you close the gaps with more inference. For Type S-strong — like Wyckoff — you select. And the paper proves that mixing those up gets you in trouble.

Meng: Can I jump in here? I'm the engineer, so I'm asking: how do I know which type my system is? Is there a test?

Jane: Great question, Meng. They define it formally — Type E means plurality vanishes under evidence refinement. Type S means it persists even at maximum information. So you can check: feed your system everything, and if two answers still stand, you're Type S.

Meng: Okay, and if I'm Type S but not "strong" — what then?

Tom: That's literally an open question in the paper — OQ-TypeS-Imp. They're honest that the generic Type S to selection inference isn't proven. Only the strong version.

Lu: And that's the kind of precision that makes this paper valuable. It doesn't overclaim. It gives you exactly the conditions under which each mechanism works, and flags where the proof stops.

Tom: Alright, so we've got the taxonomy. Next we need to talk about what they actually construct — the mechanisms themselves.

Improvements: Tom: We're back with "Determinization in Structure Theories." We've covered the taxonomy — Type E, Type S, Type S-strong. Now let's talk about what the paper actually builds. Jane, what's the big improvement here over previous work?

Jane: The big one is Theorem 6b — they call it the Construction Lemma. It gives you sufficient conditions for building a canonicalization mechanism. If you satisfy certain structural conditions — non-emptiness, finiteness, comparability, joint admissibility — then you can construct either a completion operator or a selector.

Tom: And they're careful to say it's a construction lemma, not a deep theorem. The real substance is in Corollary 6b' — that's where they show that if your inference rules satisfy certain syntactic constraints — they call them R1, R2, R3 — plus a soundness condition, then your completion operator automatically satisfies the four properties they want: extensivity, idempotence, admissibility preservation, and per-seed convergence.

Meng: So the improvement is — I don't have to verify all four properties manually? If my rules are shaped right, the properties come for free?

Jane: Exactly, Meng. That's the win. The syntactic constraints are checkable — rules only add conclusions, no negation-as-failure, no retraction. If your rules look like that, and they're sound, then saturation gives you a well-behaved completion operator.

Lu: And there's a subtlety there that I really appreciate. They distinguish between syntactic constraints and semantic soundness. You can have rules that look fine syntactically — positive, non-retractive — but are unsound because they add conclusions that contradict your axioms. Their example: rule "a implies b" plus an axiom forbidding both a and b together. Syntactically fine, semantically broken.

Tom: Right, and that's the kind of trap that would bite you in practice. They close it by making soundness an explicit hypothesis.

Meng: What about the multi-timeframe stuff? I saw something about staged operators and non-commutativity.

Jane: Oh, that's a great part. They show that if you have two operators — one for high timeframe, one for low — the order matters. Applying high-then-low works; low-then-high breaks admissibility. They have a concrete witness: a state where low-first produces a forbidden pair.

Tom: And they're careful to scope that claim — it's within the specific two-operator architecture they define. Not a global uniqueness claim across all possible architectures. That's the discipline of this paper — every claim is scoped.

Lu: Which is exactly why the classification in Section eight works. They define "theory-intrinsic" operations independently, then classify them conditionally — if your mechanism is realized in one of three ways, it's either Class C (closure) or Class S (selection). No third class within that grammar.

Tom: So the improvement is: a clear recipe, with explicit conditions, and honest scoping. Let's dig into the first page more — there's a lot packed into that abstract.

First Page: Tom: We're still on "Determinization in Structure Theories," and I want to zoom in on the first page because there's a lot of signal there. Jane, what's the thing you'd want a listener to take away from the opening?

Jane: The motivation, Tom. This paper is motivated by structural failures in LLM-assisted reasoning. The author literally says hallucination can be viewed as unsupported canonicalization — the system emits a determinate answer when the underlying admissible set hasn't collapsed to a singleton.

Lu: And that's a profound reframe. It moves hallucination from a statistical failure to a structural one. The model isn't just "confused" — it's committing to a unique interpretation when the theory itself doesn't license one. That's a different failure mode, and it needs a different fix.

Meng: So the fix would be — what? The model should check whether the admissible set is a singleton before committing?

Jane: That's exactly the idea, Meng. The framework gives you the conditions for when commitment is licensed. If you're in a Type E theory and evidence is still accumulating, you can stabilize but not determinize. If you're Type S-strong, you need a selector. If you have neither comparability nor joint admissibility — you shouldn't be committing at all.

Tom: And that's the counterexample they build — Tce. Two conclusions, individually admissible, axiomatically incompatible, no ordering between them. No canonicalization mechanism exists. The theory just doesn't license a unique answer.

Lu: Which is a beautiful minimal example. It shows that closure alone — just being able to add structure — is not enough. You need comparability. You need an order that tells you which answer wins.

Tom: Right. Closure plus comparability plus joint admissibility — that's the recipe. And the first page also sets up the three strengths of canonicalization: closure stabilization, global completion, and full determinization. Each is a stronger claim, and the paper is explicit about which one it achieves for each theory.

Jane: And for ICT, it's stabilization only — the upgrade to full determinization is open. For Wyckoff, it's full determinization via selection. That asymmetry is the whole point.

Meng: So if I'm building a system — I need to know which strength I actually need. Stabilization might be enough for some applications; determinization is needed for others.

Tom: Exactly. And that's the practical takeaway — the paper gives you the vocabulary to say precisely what your system can and cannot commit to. Alright, we're heading into the home stretch. Let's wrap this up.

Conclusion: Tom: Alright, we're closing out our discussion of "Determinization in Structure Theories: A Unified Framework via Closure, Comparability, and Joint Admissibility." Jane, give us the send-off.

Jane: Tom, I think the thing I'll remember most is the honesty. This paper doesn't pretend to have solved everything. It gives you a framework — two types of plurality, two mechanisms, three strengths of canonicalization — and then it tells you exactly where the proofs stop. Open questions are labeled, scoped, and tracked.

Lu: And that's rare in this space. The classification theorem — U3 — is explicitly conditional on a realization-coverage assumption they can't yet prove. The non-commutativity result is scoped to a specific architecture. Every strong claim has a qualifier.

Meng: From my side, the practical value is the checklist. If I'm building an LLM-assisted decision system, I can now ask: what type is my theory? Do I have comparability? Do I have joint admissibility? And only then — am I licensed to commit?

Tom: And that's the connection to hallucination that started the whole paper. It's not about making models "more confident" or "less confident." It's about giving them structural permission to commit — or telling them to hold off.

Jane: The core principle one more time: completion needs closure, comparability, and compatible extension. Selection needs theory-intrinsic comparability and global compatibility. Not all canonicalization is operator-theoretic. And under hierarchical interaction, operators form a non-commutative system.

Tom: Beautiful. So we're saying goodbye to this paper — but honestly, I think we'll be citing it for a while. The vocabulary alone — Type E, Type S-strong, closure stabilization versus determinization — that's going to stick.

Jane: Agreed. And the open questions give other researchers a roadmap. OQ-GC-one OQ-TypeS-Imp, OQ-Realization — those are invitations, not gaps.

Tom: Alright, that's our show for today. Thanks to Lu and Meng for joining us. And to our listeners — next time you see an AI system confidently assert something, ask yourself: is it licensed to do that? Thanks for tuning in, and we'll see you on the next paper.