{'fraction_non_alphanumeric': 0.05475989890480202, 'fraction_numerical': 0.0, 'mean_word_length': 3.752, 'pattern_counts': {'":': 0, '<': 3, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Equalization of finite flowers

A dilator D is a functor from ON to itself commuting with direct limits and pull-backs. A dilator D is a flower iff D(x) is continuous. A flower F is regular iff F(x) is strictly increasing and F(f)(F(z)) = F(f(z)) (for f ϵ ON(x,y), z ϵ X). Equalization is the following axiom: if F, G ϵ Flr (class of regular flowers), then there is an H ϵ Flr such that F ° H = G ° H. From this we can deduce that if ℱ is a set ⊆ Flr, then there is an H ϵ Flr which is the smallest equalizer of ℱ (it can be said that H equalizes ℱ iff for every F, G ϵ ℱ we have F ° H = G ° H). Equalization is not provable in set theory because equalization for denumerable flowers is equivalent to -determinacy (see a forthcoming paper by Girard and Kechris). Therefore it is interesting to effectively find, by elementary means, equalizers even in the simplest cases. The aim of this paper is to prove Girard and Kechris's conjecture: “ is the (smallest) equalizer for Flr < ω” (where Flr < ω denotes the set of finite regular flowers). We will verify that is an equalizer of Flr < ω; we will sketch the proof that it is the smallest one at the end of the paper. We will denote by H.