Local branch hypotheses as uniqueness and gluing principles for strategies

Definitions and mathematical statement

A.10 is Grigor Sargsyan's participant biography and learning goal: the source describes him at that time as a second-year UC Berkeley graduate student, mentions seminars with Steel and Woodin, and expresses interest in more advanced core model theory. It states no mathematical question. These are historical workshop remarks, not present biographical claims.

The aid develops a separate local strategy-selection synthesis. Fix a base premouse/model and a specified collection of relevant limit-length iteration trees, with all normality and admissibility conventions fixed. A branch-correct partial selector assigns to every tree in its domain a cofinal branch whose associated branch model is well-founded, and is compatible with its prescribed earlier trace. The record does not reproduce the full "minimal branch-correct" framework, so this is not silently identified with a total winning iteration strategy.

For such a domain $\mathcal D$, the local unique branch hypothesis is \[ \forall\mathcal T\in\mathcal D,\quad \#\{b:b\text{ is cofinal through }\mathcal T, \ M_b^{\mathcal T}\text{ is well-founded}\}\le1. \] The aid reports that two branch-correct partial selectors $\Sigma,\Theta$ agree on their common domain whenever this local hypothesis applies there. Hence their union is a well-defined selector, with branch correctness and the relevant trace compatibility preserved in the specified framework. It is not asserted to be total or to acquire additional game/iterability properties by taking a union.

Conversely, if two such selectors have a least disagreement at a commonly admissible tree $\mathcal T$, their distinct selected cofinal well-founded branches witness failure of the local unique-branch hypothesis at $\mathcal T$. The aid's trace-realizable converse assumes a tree with two well-founded cofinal branches whose proper initial-stage choices admit a common valid trace. In that minimal framework the common trace can be extended by either branch, yielding two partial selectors whose first disagreement is at that tree. No extension to total winning strategies is concluded.

The aid names a Neeman--Steel two-branch tree as a sharpness example. Its base model, tree class, large-cardinal assumptions, and exact theorem are not supplied, so no unqualified counterexample to every version of global UBH is inferred. None of this contextual synthesis recovers a missing conjecture from the participant biography.

Short English statement

The source is a biography rather than a problem. The aid adds a conditional local observation: unique well-founded branches force compatible partial selectors to agree, while a first disagreement exhibits two such branches. Its converse concerns trace-realizable partial selectors and does not construct total iteration strategies.

Sources

• Local UnsolvedMath registry, permanent ID 20002382, exact source code catalogue entry; canonical aim-logic-notes.json, notes[157], tag section; AIM Workshop Problem Lists, Logic, Recent advances in core model theory, A.10, Grigor Sargsyan. Created and updated 14 August 2026.
• Source URL https://aimath.org/WWN/coremodel/coremodel.pdf. The supplied verification confirms the participant biography/learning goal; the source mentions Professors Steel and Woodin. The PDF was not accessed.
• Neeman--Steel is named in the aid for a two-branch sharpness example, without a full title, theorem number, assumptions, publication identifier, or separate URL.
• Attempt 1: context_only, problem status at run not_a_problem, rigor label proved, novelty confidence low; classification OPEN-TRIAGE, suggested difficulty L2, registry status open. Candidate: local unique-branch agreement/gluing and trace-realizable converse. No full authoritative reference for this framework is supplied.
• Ulam AI / UnsolvedMath Contributors; CC BY 4.0. Machine-generated research aid, not peer reviewed; independently verify before citation.