# Decomposition of completions of reloids

 Importance: Medium ✭✭
 Author(s): Porton, Victor
 Subject: Topology
 Keywords: co-completion completion reloid
 Posted by: porton on: September 2nd, 2013

\begin{conjecture} For composable reloids $f$ and $g$ it holds \begin{enumerate} \item $\operatorname{Compl} ( g \circ f) = ( \operatorname{Compl} g) \circ f$ if $f$ is a co-complete reloid; \item $\operatorname{CoCompl} ( f \circ g) = f \circ \operatorname{CoCompl} g$ if $f$ is a complete reloid; \item $\operatorname{CoCompl} ( ( \operatorname{Compl} g) \circ f) = \operatorname{Compl} ( g \circ ( \operatorname{CoCompl} f)) = ( \operatorname{Compl} g) \circ ( \operatorname{CoCompl} f)$; \item $\operatorname{Compl} ( g \circ ( \operatorname{Compl} f)) = \operatorname{Compl} ( g \circ f)$; \item $\operatorname{CoCompl} ( ( \operatorname{CoCompl} g) \circ f) = \operatorname{CoCompl} ( g \circ f)$. \end{enumerate} \end{conjecture}

Well, in fact this is three separate problems (if we count dual formulas as one formula), but I am lazy to create three pages for them.

This conjecture is inspired by the proven fact that the above formulas hold for every composable funcoids $f$ and $g$ (instead of reloids). Properties of reloids are expected to be similar to properties of funcoids.

% You may use many features of TeX, such as % arbitrary math (between $...$ and $$...$$) % \begin{theorem}...\end{theorem} environment, also works for question, problem, conjecture, ... % % Our special features: % Links to wikipedia: \Def {mathematics} or \Def[coloring]{Graph_coloring} % General web links: \href [The On-Line Encyclopedia of Integer Sequences]{http://www.research.att.com/~njas/sequences/}

## Bibliography

*\href [Algebraic General Toplogy. Volume 1]{http://www.mathematics21.org/algebraic-general-topology.html}

% Example: %*[B] Claude Berge, Farbung von Graphen, deren samtliche bzw. deren ungerade Kreise starr sind, Wiss. Z. Martin-Luther-Univ. Halle-Wittenberg Math.-Natur. Reihe 10 (1961), 114. % %[CRS] Maria Chudnovsky, Neil Robertson, Paul Seymour, Robin Thomas: \arxiv[The strong perfect graph theorem]{math.CO/0212070}, % Ann. of Math. (2) 164 (2006), no. 1, 51--229. \MRhref{MR2233847} % % (Put an empty line between individual entries)

* indicates original appearance(s) of problem.
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 1, "mathjax_display_tex": 1, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.9957375526428223, "perplexity": 7130.437743921082}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 20, "end_threshold": 5, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2018-34/segments/1534221209755.32/warc/CC-MAIN-20180815004637-20180815024637-00189.warc.gz"}