olymmath

SCHWEITZER 1982 Problem 1

    A map F:P(X)→P(X)F : P(X) \rightarrow P(X) , where P(X)P(X) denotes the set of all subsets of XX , is called a closure operation\textit{closure operation} on XX if for arbitrary A,B⊂XA,B \subset X , the following conditions hold:

    (i) A⊂F(A);A \subset F(A);

    (ii) A⊂B⇒F(A)⊂F(B);A \subset B \Rightarrow F(A) \subset F(B);

    (iii) F(F(A))=F(A)F(F(A))=F(A) .

    The cardinal number min⁡{∣A∣:A⊂X ,F(A)=X }\min \{ |A| : A \subset X\ , F(A)=X\ \} is called the density\textit{density} of FF and is denoted by d(F)d(F) . A set H⊂XH \subset X is called discrete\textit{discrete} with respect to FF if u∉F(H−{u})u \not \in F(H-\{ u \}) holds for all u∈Hu \in H . Prove that if the density of the closure operation FF is a singular cardinal number, then for any nonnegative integer nn , there exists a set of size nn that is discrete with respect to FF . Show that the statement is not true when the existence of an infinite discrete subset is required, even if FF is the closure operation of a topological space satisfying the T1T_1 separation axiom.

    A. Hajnal

    Dataset text AI-MO AoPS. Quoted with source.

    Solutions

    No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.

    Add a solution

    Similar problems

    These problems have the most words in common with this statement.

    Locator schweitzer/1982/p1 · Tag 338P8Q95XR · Edit this page on GitHub · Keys: j next, k previous