Erdős ProblemsMathematical logic
Erdős Problem 592
Determine which countable ordinals have the property that, if , then in any red/blue colouring of the edges of there is either a red or a blue .
Mathematical statement
Determine which countable ordinals have the property that, if , then in any red/blue colouring of the edges of there is either a red or a blue .
Statement source: Erdős Problems statement material
Statement terms: Source-specific
Source-specific terms. Therefore does not assert reuse rights beyond attributed display.
Statement artifacts, not proofs
These records expose exact Lean propositions and statement-only wrappers. Defining a proposition does not supply a proof of it. A placeholder-bearing target also contains no proof. Elaboration checks syntax and types; it does not certify that a formalization perfectly captures every nuance of the informal problem.
Pinned Lean formulation 1
erdos_592
theorem erdos_592 (β : Ordinal.{u}) : β.card ≤ ℵ₀ → OrdinalCardinalRamsey (ω ^ β) (ω ^ β) 3 ↔ (answer(sorry) : Ordinal.{u} → Prop) β := by sorry- Statement source
- Formal Conjectures
- Lean version
- v4.27.0
- Placeholder
- Present; no proof artifact
- Source evidence
- Pinned source index
- Fidelity review
- Community formulation
References