## How to use the pumping lemma to show a language is not regular

How can you use pumping lemma to prove that the language H over the alphabet Σ = {L, M, N} is not a regular language? H = {L^o M^p N^q | o, p, q ≥ 0;o ≤ p} ∪ {L^o M^p N^q | o, p, q ≥ 0; p ≤ q} ∪ {L^o M^p N^q |o, p, q ≥ 0; q ≤ I}

## logic – Confusing about how the lemma can be stated

Let’s consider the following:

Lemma Let $$gin F(beta)$$ and $$fin Bbb R^Bbb R$$ such that $$frestriction M= grestriction M$$ for some $$Msubset mathbb R$$. Then $$fin F(beta).$$

Of course, no one will be able to follow the question without saying what $$F(beta)$$ is. In my case, $$F(beta)$$ needs to be constructed by transfinite induction or another way. I know the most natural way is that construct $$F(beta)$$ and then state the lemma. But for some, this was hard for me. This is why I am looking for another way to do this. Here I have some questions:

Q1 Is true if I state the lemma, then give the construction of $$F(beta)$$, and provide the proof of the lemma? If so, If this kind of idea sometimes use in book or journal paper?

Q2 If not, do you recommend an idea to play around this without introducing $$F(beta)$$ first?

## computer science – Pumping Lemma proof for this language: L={a^ib^jc^k∣k=i∗j}

i have troubles to show that this language is not context free with the pumping lemma.

As a word I chose: a^mb^mc^(m^2)

I solved all the cases but one, which is:
“vxy contains b’s and c’s”

I came up with the following approach to show that the resulting word can not be in the language:

p * (p+|v|) != p*p + |y|

this is equal to:

p * |v| != |y|

Because p must >= 1 and |vxy| > 0 and |vxy| <= p the resulting word is not in the language.
Is this assumption correct?

Posted on

## ac.commutative algebra – Artin-Rees lemma for multiplicative subsets?

The classical Artin-Rees lemma tells the following. Let $$R$$ be a Noetherian commutative ring and $$Isubset R$$ be an ideal. Let $$M$$ be a finitely generated $$R$$-module and $$Nsubset M$$ be a submodule. Then there exists an integer $$mge0$$ such that for all $$nge0$$ the following equality of two submodules in $$N$$ holds:
$$I^{n+m}Mcap N=I^n(I^mMcap N).$$
The usual proof is based on the Hilbert Basis Theorem: essentially, one uses the fact that the Rees ring $$bigoplus_{n=0}^infty I^n$$ is graded Noetherian (since it is a quotient ring of the ring of polynomials over $$R$$ spanned by some finite set of generators of the ideal $$I$$).

I would like to specialize the Artin-Rees lemma to principal ideals $$I=(s)subset R$$, and then extend it from multiplicative subsets of the form $${1,s,s^2,s^3,dotsc}subset R$$ to other multiplicative subsets $$Ssubset R$$.

So let $$R$$ be a Noetherian commutative ring and $$S$$ be a multiplicative subset in $$R$$. Assume for simplicity that $$S$$ is (at most) countable and all the elements of $$S$$ are regular (nonzero-divisors) in $$R$$.

Let $$M$$ be a finitely generated $$R$$-module and $$Nsubset M$$ be a submodule. Does there exist an element $$tin S$$ such that, for every $$sin S$$, the equality of two submodules in $$N$$
$$stMcap N=s(tMcap N)$$
holds?

Or, at least, can one find an element $$tin S$$ such that the above equality holds for a cofinal subset of elements $$sin S$$ (in the divisibility preorder)?

A straightforward attempt to argue similarly to the Hilbert Basis Theorem proof of the Artin-Rees lemma does not seem to work, as the ring $$bigoplus_{sin S}sR$$ does not have to be graded Noetherian when the multiplicative set $$S$$ is not finitely generated.

Posted on

## pr.probability – Lemma 3.10 of paper ‘Periodic nonlinear Schrodinger Equation and Invariant measure’ by J.Bourgain

I am reading a paper ‘Periodic nonlinear Schrodinger Equation and Invariant measure’ by J.Bourgain. And I have two questions on the lemma 3.10. 1. My first question is to get (3.12).

What I have up to now is as below.

begin{align*} lambda sigma_M &< left| sum_{n~ M} frac{g_n(omega)}{M} e^{inx} right|_p \ &leq left| sum_{n~ M} frac{g_n(omega)}{n} e^{inx} right|_p\ &leq M^{frac{1}{2}-frac{1}{p}} left| sum_{n~ M} frac{g_n(omega)}{M} e^{inx} right|_2\ &leq M^{frac{1}{2}-frac{1}{p}} B end{align*}

Thus, we get
$$sigma_M frac{lambda}{B}

In order to have (3.12), I would need to remove $$sigma_M$$ by using (3.14) but it seems like I went too far to use it. I will be happy to have any idea on this inequality.

1. My one another question is if there is any reference to understand this line in the proof of same lemma. Posted on

## algebraic topology – Looking for proof for variant of the Barratt-Whitehead lemma

usepackage{amsmath,amscd}

Consider the commutative diagram with exact sequences:

$$begin{CD} @. @. 0 @. 0 @. 0 @. @. \ @. @. @VVV @VVV @VVV @. @.\ @. 0 @>>> X @>a>> X’ @>a’>> X” @>>> 0 @. \ @. @. @VfVV @Vf’VV @Vf”VV @. @.\ @. 0 @>>> Y @>b>> Y’ @>b’>> Y” @>>> 0 @. \ @. @. @VgVV @Vg’VV @Vg”VV @. @.\ @. 0 @>>> Z @>c>> Z’ @>c’>> Z” @>>> 0 @. \ @. @. @VVV @VVV @VVV @. @.\ @. @. 0 @. 0 @. 0 @. @. \ end{CD}$$

I was wondering if there exists an exact map $$0to Xxrightarrow{alpha}X’oplus Yxrightarrow{beta} Y’xrightarrow{gamma}Y”oplus Z’xrightarrow{delta} Z”to 0$$ where $$alpha(x)=(a(x),f(x))$$, $$beta(x’,y)=f'(x’)-b(y)$$, $$gamma(y’)=(b'(y’),g'(y’))$$ and $$delta(y”,z’)=g”(y”)-c'(z’)$$. $$Im(alpha)subseteq Ker(beta)$$ and $$Im(gamma)subseteq Ker(delta)$$ are immediate but I can’t see $$Im(beta)subseteq Ker(gamma)$$. Can it be done through diagram-chasing and is there anywhere I could find a proof ?

Posted on

## pumping lemma – Check if a language is context free

Check whether the following language is context-free. If yes, a suitable grammar should be given; if no, the pumping lemma should be used as a tool.

$$L={a^ib^jc^k mid i, j, k in N text{ and } i

Can I choose (since N includes 0)

$$L={b^jc^k mid j,k >= 1 text{ and } j > k}$$

and provide a grammar for that language, and thus say L is indeed context-free?
If L is not context-free, how could I prove it using the Pumping Lemma?

## Proof that a Language is not context-free using the Pumping Lemma

$$L={a^ib^jc^k ;| ;i, j, k in N ; and ; i

I need to show that this language is not context-free with the help of the Pumping Lemma.
My first intuition is, that there exist 5 different cases, i.e. the middle part, let’s call it vwx, consists of

1. only a’s
2. only b’s
3. only c’s
4. a’s and b’s
5. b’s and c’s

and I need to find a pumping constant, which excludes the new word from the above defined language. However, I am having a hard time how show that formally and precisely. Any hints are highly appreciated!

Posted on

## shortest path – The Cut Lemma for graphs with non-distinct edges

In my introductory algorithms class I recently learned about the Cut Lemma and how it can be used to prove correctness for many Minimum Spanning Tree algorithms like Kruskal’s and Prim’s.

In class, to simplify these proofs-of-correctness, we assumed that all edge weights in the graphs we were considering were distinct. This was also a helpful assumption when working with the Cut Lemma, since it guaranteed there will only be one minimum-weight crossing edge between the two disjoint sets of vertices created by the cut. In fact, we used proof-by-contradiction to prove the Cut Lemma, which required a unique minimum-weight edge.

My question is, what happens if edge weights aren’t distinct? How can we still use the Cut Lemma to prove correctness for MST algorithms if we can no longer guarantee there is one minimum-weight crossing edge between the two sets of a cut? Is anything materially different?

Posted on

## axiom of choice – Does ZF + BPI alone prove the equivalence between “Baire theorem for compact Hausdorff spaces” and “Rasiowa-Sikorski Lemma for Forcing Posets”?

Rasiowa-Sikorski Lemma (for forcing posets)is the statement: For any p.o. $$mathbb{P}$$ (i.e. $$mathbb{P}$$ is a reflexive transitive relation) and for any countable family of dense subsets of $$mathbb{P}$$ there is a generic filter which intersects all dense subsets of the countable family. It is well-known that this statement is equivalent to the Baire Category Theorem for Complete Metric Spaces – and thus it is also equivalent to the Principle of Dependent Choices.

A masters student of mine has found in the literature the following statement: “Rasiowa-Sikorski Lemma is equivalent to the Baire Category Theorem for Compact Hausdorff Spaces, modulo the Boolean Prime Ideal Theorem”. We understood this as the assertion that the theory ZF + BPI alone is able to prove the equivalence between the Baire Category Theorem for Compact Hausdorff Spaces and the Rasiowa-Sikorski Lemma.

Well, I asked my student to verify such claim, and at first glance I suggested him to follow the results 3.1 to 3.4 of Chapter II of Kunen’s book, where there are proofs for some equivalences of Martin’s Axiom at $$kappa$$, MA($$kappa$$): the idea was to discard the hypothesis “c.c.c.” and adapt the reasoning, arguing for $$kappa = omega$$. It turns out that it was not a good suggestion, because in 3.1 a kind of Downward-Lowenheim-Skolem argument is done, to show that it is equivalent to work with a restricted form of the forcing axiom, considering only partial orders of bounded cardinality. However, such argument seems to require the Axiom of Choice, or some part of it other than BPI.

Does any of you know if it is indeed possible to prove the equivalence between “Baire Category Theorem for Compact Hausdorff Spaces” and “Rasiowa-Sikorski Lemma for forcing posets” from ZF + BPI alone ? Any suggestions or references would be appreciated.

Posted on