Forcing relation on minimal interval patterns

Access Full Article

Abstract

top
Let ℳ be the set of pairs (T,g) such that T ⊂ ℝ is compact, g: T → T is continuous, g is minimal on T and has a piecewise monotone extension to convT. Two pairs (T,g),(S,f) from ℳ are equivalent if the map h: orb(minT,g) → orb(minS,f) defined for each m ∈ ℕ₀ by h(gm(minT))=fm(minS) is increasing on orb(minT,g). An equivalence class of this relation-a minimal (oriented) pattern A-is exhibited by a continuous interval map f:I → I if there is a set T ⊂ I such that (T,f|T) = (T,f) ∈ A. We define the forcing relation on minimal patterns: A forces B if all continuous interval maps exhibiting A also exhibit B. In Theorem 3.1 we show that for each minimal pattern A there are maps exhibiting only patterns forced by A. Using this result we prove that the forcing relation on minimal patterns is a partial ordering. Our Theorem 3.2 extends the result of [B], where pairs (T,g) with T finite are considered.

How to cite

@article{JozefBobok2001, abstract = {Let ℳ be the set of pairs (T,g) such that T ⊂ ℝ is compact, g: T → T is continuous, g is minimal on T and has a piecewise monotone extension to convT. Two pairs (T,g),(S,f) from ℳ are equivalent if the map h: orb(minT,g) → orb(minS,f) defined for each m ∈ ℕ₀ by $h(g^m(minT)) = f^m(minS)$ is increasing on orb(minT,g). An equivalence class of this relation-a minimal (oriented) pattern A-is exhibited by a continuous interval map f:I → I if there is a set T ⊂ I such that (T,f|T) = (T,f) ∈ A. We define the forcing relation on minimal patterns: A forces B if all continuous interval maps exhibiting A also exhibit B. In Theorem 3.1 we show that for each minimal pattern A there are maps exhibiting only patterns forced by A. Using this result we prove that the forcing relation on minimal patterns is a partial ordering. Our Theorem 3.2 extends the result of [B], where pairs (T,g) with T finite are considered.}, author = {Jozef Bobok}, journal = {Fundamenta Mathematicae}, keywords = {interval map; minimal pattern; forcing relation}, language = {eng}, number = {2}, pages = {161-173}, title = {Forcing relation on minimal interval patterns}, url = {http://eudml.org/doc/281968}, volume = {169}, year = {2001},}

TY - JOURAU - Jozef BobokTI - Forcing relation on minimal interval patternsJO - Fundamenta MathematicaePY - 2001VL - 169IS - 2SP - 161EP - 173AB - Let ℳ be the set of pairs (T,g) such that T ⊂ ℝ is compact, g: T → T is continuous, g is minimal on T and has a piecewise monotone extension to convT. Two pairs (T,g),(S,f) from ℳ are equivalent if the map h: orb(minT,g) → orb(minS,f) defined for each m ∈ ℕ₀ by $h(g^m(minT)) = f^m(minS)$ is increasing on orb(minT,g). An equivalence class of this relation-a minimal (oriented) pattern A-is exhibited by a continuous interval map f:I → I if there is a set T ⊂ I such that (T,f|T) = (T,f) ∈ A. We define the forcing relation on minimal patterns: A forces B if all continuous interval maps exhibiting A also exhibit B. In Theorem 3.1 we show that for each minimal pattern A there are maps exhibiting only patterns forced by A. Using this result we prove that the forcing relation on minimal patterns is a partial ordering. Our Theorem 3.2 extends the result of [B], where pairs (T,g) with T finite are considered.LA - engKW - interval map; minimal pattern; forcing relationUR - http://eudml.org/doc/281968ER -