{'fraction_non_alphanumeric': 0.037037037037037035, 'fraction_numerical': 0.007054673721340388, 'mean_word_length': 4.2592592592592595, 'pattern_counts': {'":': 0, '<': 0, '<?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}}
Every Finite Lattice Can Be Embedded in a Finite Partition Lattice

We give here a proof of the theorem stated in the title. The theorem was conjectured by P. M. Whitman in [11]. The proof, mostly of combinatorial character, is based on " the regraph power technique" making use of special edge-colored graphs, called regraphs, as construction schemes. We use the proof of Combinatorial Lemma 6.1 by B. Wolk and B. Sands, which is shorter and more elegant than the original one. The list of references is a random collection of papers related to Whitman's conjecture.