Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-generatedPipeline-generatedjudge pass (gpt-5.6-terra)
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.

Weak compactness and small infinitary theories

Statement

In ZFC, at an inaccessible kappa, weak compactness is equivalent to compactness for less-than-kappa satisfiable Lκ,κ theories in languages and theories of size at most kappa, and is also equivalent to the corresponding Lκ,ω compactness property.

Facts & Assumptions

Given: ZFC. Applied the authored Henkin model construction in the forward direction and supplied a propositional tree encoding, small-subtheory models and the full branch extraction in the reverse direction.

[F1]

Weakly compact cardinals: At the stipulated inaccessible, weak compactness is the tree property.

[F2]

Henkin truth trees for infinitary compactness: The constructed truth tree yields a model from any cofinal branch.

[F3]

The Axiom of Choice: AC chooses one injection of each tree level into kappa from the nonempty family of such injections.

Proof

1.1

If kappa is weakly compact, apply F2 to any theory in the assertion. F1 gives a cofinal branch in its truth tree, and F2 produces a model. Thus the L_(kappa,kappa) property holds. Every L_(kappa,omega) theory is a special case with finite blocks, so the latter compactness property follows.

F1F2
2.1

Conversely assume the L_(kappa,omega) property and fix a kappa-tree S. It has kappa nodes: its kappa nonempty levels give the lower bound, and choosing injections of levels into kappa gives the upper bound by the cardinal-square estimate used in F2. Introduce a unary relation P_t for each node t and one constant d; write p_t for the sentence P_t(d). Take a theory consisting of the disjunction tSαpt for each alpha<kappa and the sentences ¬(pspt) for each incomparable pair s,t. Every level disjunction has fewer than kappa terms, so this is already an L_(kappa,omega) theory (indeed it uses no quantifiers). Its language and theory have size at most kappa, using the same square bound.

F1F2F3step 1.1
3.1

Any subtheory of size below kappa has level-disjunction requirements at a bounded collection of levels, by regularity. Choose a node u above those levels. In a one-element structure interpret p_t as true exactly for t<=u. This meets every required level and violates no incomparable-pair prohibition, including prohibitions mentioning nodes at arbitrarily high levels. Hence every small subtheory is satisfiable. Compactness gives a full model. Its true p_t include a node at each level and never include incomparable nodes; they therefore form a cofinal branch of S. As S was arbitrary, F1 gives weak compactness. Together with step 1.1 this proves both equivalences.

F1step 2.1

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

9 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