How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
A four-element chain and a four-element diamond have equal-size endpoint intervals but Möbius values and
Statement refuted
The endpoint Möbius value of a finite interval is determined by the number of elements in that interval (False: depends only on the cardinality of ).
Facts & Assumptions
Given: The four-element chain and the four-element diamond with endpoints .
The chain computation gives (The Möbius table of a four-element chain).
The diamond computation gives (The endpoint Möbius value of the four-element diamond is ).
Counterexample
Both endpoint intervals have four elements.
Their endpoint Möbius values are nevertheless and by [F1] and [F2].
Hence equal-size intervals can have different Möbius values, and the statement is false.
Remarks
\node[elt] (c0) at (-2.7,0) {$c_0$}; \node[elt] (c1) at (-2.7,1.05) {$c_1$}; \node[elt] (c2) at (-2.7,2.1) {$c_2$}; \node[elt] (c3) at (-2.7,3.15) {$c_3$}; \draw[gray!70] (c0)--(c1)--(c2)--(c3);
\node[elt] (bot) at (2.7,0) {$\bot$}; \node[elt] (a) at (1.65,1.55) {$a$}; \node[elt] (b) at (3.75,1.55) {$b$}; \node[elt] (top) at (2.7,3.15) {$\top$}; \draw[gray!70] (bot)--(a)--(top) (bot)--(b)--(top);
\node[font=\small] at (-2.7,-.75) {$\mu(c_0,c_3)=0$}; \node[font=\small] at (2.7,-.75) {$\mu(\bot,\top)=1$}; \end{tikzpicture} ```
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
6 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- R. Stanley, Enumerative Combinatorics, Volume 1, §§3.6–3.8 (standard reference, not scraped)