Suppose that $P = (X,\leq)$ is a poset such that for $x,y \in X, x \neq y$, we have that either $|[x,y]| = 0$ or $|[x,y]| = 2$ or $|[x,y]| = 6$. I asked to compute the Möbius function for this poset. I originally thought it to be $\mu(x,y) = 1, x = y$, $\mu(x,y) = -1, y = x + 1$, and $\mu(x,y) = 0$ otherwise. I have been debating with a classmates who believes it is $\mu(x,y) = 1, x = y$, $\mu(x,y) = -1, y = x + 1$, $\mu(x,y) = 3, y = x + 5$ and $\mu(x,y) = 0$ otherwise. Looking for some help on truly understanding this problem.
2026-05-10 19:44:21.1778442261
Poset and Mobius function
93 Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
1
There are 1 best solutions below
Related Questions in COMBINATORICS
- Using only the digits 2,3,9, how many six-digit numbers can be formed which are divisible by 6?
- The function $f(x)=$ ${b^mx^m}\over(1-bx)^{m+1}$ is a generating function of the sequence $\{a_n\}$. Find the coefficient of $x^n$
- Name of Theorem for Coloring of $\{1, \dots, n\}$
- Hard combinatorial identity: $\sum_{l=0}^p(-1)^l\binom{2l}{l}\binom{k}{p-l}\binom{2k+2l-2p}{k+l-p}^{-1}=4^p\binom{k-1}{p}\binom{2k}{k}^{-1}$
- Algebraic step including finite sum and binomial coefficient
- nth letter of lexicographically ordered substrings
- Count of possible money splits
- Covering vector space over finite field by subspaces
- A certain partition of 28
- Counting argument proof or inductive proof of $F_1 {n \choose1}+...+F_n {n \choose n} = F_{2n}$ where $F_i$ are Fibonacci
Related Questions in MOBIUS-FUNCTION
- A question about Mertens function $M(n)=\sum_{k=1}^n\mu(n)$
- A good estimation of the inverse $f^{-1}(x)$ of $-\sum_{n=2}^\infty\frac{\mu(n)}{n}x^n$, over the unit inverval if it has mathematical meaning
- A rigorous proof of $\Re\int_0^{2\pi}\left(\sum_{n=1}^{\infty}\frac{\mu(n)}{n}\log\left(\frac{1}{1-ne^{i\theta}}\right)\right)d\theta=2\pi$
- An inequality deduced for $-\sum_{n=1}^\infty\frac{\mu(n)}{n}x^{n-1}$ on assumption of convexity, invoking a theorem due to Dragomir
- Why $\sum\frac{\mu(h)\mu(k)}{hk}\gcd(h,k)=\prod\limits_{p\le x}\left(1-\frac1p\right)$, where the sum enumerates the pairs $(h,k)$ of primes below $x$
- Two questions concerning series involving the Möbius function and trigonometric functions
- Where is positive or negative the function $\sum_{n=1}^\infty\frac{\mu(n)}{n}\left(\frac{\cos(nx)}{n}\right)^2$ over the set $[0,2\pi]$?
- Prove $ \left\vert \sum_{n=1}^N \frac{\mu(n)}{n} \right\vert \leqslant 1,$ where $\mu(n)$ is the Mobius function.
- Justify an approximation of $-\sum_{n=2}^\infty H_n\left(\frac{1}{\zeta(n)}-1\right)$, where $H_n$ denotes the $n$th harmonic number
- polynomial annihilators of finite rings - proof generalization sought
Trending Questions
- Induction on the number of equations
- How to convince a math teacher of this simple and obvious fact?
- Find $E[XY|Y+Z=1 ]$
- Refuting the Anti-Cantor Cranks
- What are imaginary numbers?
- Determine the adjoint of $\tilde Q(x)$ for $\tilde Q(x)u:=(Qu)(x)$ where $Q:U→L^2(Ω,ℝ^d$ is a Hilbert-Schmidt operator and $U$ is a Hilbert space
- Why does this innovative method of subtraction from a third grader always work?
- How do we know that the number $1$ is not equal to the number $-1$?
- What are the Implications of having VΩ as a model for a theory?
- Defining a Galois Field based on primitive element versus polynomial?
- Can't find the relationship between two columns of numbers. Please Help
- Is computer science a branch of mathematics?
- Is there a bijection of $\mathbb{R}^n$ with itself such that the forward map is connected but the inverse is not?
- Identification of a quadrilateral as a trapezoid, rectangle, or square
- Generator of inertia group in function field extension
Popular # Hahtags
geometry
circles
algebraic-number-theory
functions
real-analysis
elementary-set-theory
proof-verification
proof-writing
number-theory
elementary-number-theory
puzzle
game-theory
calculus
multivariable-calculus
partial-derivative
complex-analysis
logic
set-theory
second-order-logic
homotopy-theory
winding-number
ordinary-differential-equations
numerical-methods
derivatives
integration
definite-integrals
probability
limits
sequences-and-series
algebra-precalculus
Popular Questions
- What is the integral of 1/x?
- How many squares actually ARE in this picture? Is this a trick question with no right answer?
- Is a matrix multiplied with its transpose something special?
- What is the difference between independent and mutually exclusive events?
- Visually stunning math concepts which are easy to explain
- taylor series of $\ln(1+x)$?
- How to tell if a set of vectors spans a space?
- Calculus question taking derivative to find horizontal tangent line
- How to determine if a function is one-to-one?
- Determine if vectors are linearly independent
- What does it mean to have a determinant equal to zero?
- Is this Batman equation for real?
- How to find perpendicular vector to another vector?
- How to find mean and median from histogram
- How many sides does a circle have?
I'm afraid your classmate is (mostly) right.
You either forgot to mention that the elements of the poset are numbers, or you abused notation in adding integers to them. I'll solve the problem as stated without assuming that the elements of the poset are numbers.
If $|[x,y]|=0$, then $x\nleq y$ and $\mu(x,y)=0$.
If $|[x,y]|=1$, then $x=y$ and $\mu(x,y)=1$.
If $|[x,y]|=2$, then the interval consists only of $x$ and $y$, and $\mu(x,y)=-1$.
If $|[x,y]|=6$, then there are $4$ elements between $x$ and $y$. Let one of them be $a$. Then $|[x,a]|=2$, since the cases $0$ and $1$ can be excluded and $|[x,a]|=6$ would imply that there are further elements in $[x,y]$. Then by Hall's theorem (see How to calculate the mobius function of a Poset using Hall's theorem), since $[x,y]$ contains $C_0=0$ chains of length $0$, $C_1=1$ chain of length $1$ and $C_2=4$ chains of length $2$, in this case we have $\mu(x,y)=0-1+4=3$.