@Markiyan Hirnyk But your input is two list. I want C only.

@Kitonum Thanks but I want a general method.

@roman_pearce I want not happend this error in the running of my algorithm. What I have to do?

@Kitonum 

lt(p,T)=LeadingCoefficient(p,T)*LeadingTerm(p,T). Is there any question?

@Kitonum 

I think that the coeffs command use from my procedure.

@asa12 

There is a minor fault in the answer of Carl. For example if p=x^2 then by using Maple 14 we have

[op(p)]=[x,2]!!

For this simple question I implement the following procedure: In this procedure f is a polynomial and T is a monomial ordering such as lex or tdeg ordering.

FL := proc (f, T)
local L, p;
L := [];
p := f;
while p <> 0 do
    L := [op(L), lt(p, T)];
    p := simplify(p-lt(p, T))
end do;
RETURN(L)
end proc:

FL(x^2,plex(x))=[x^2]

FL(1+xy-x^2,plex(x))=[1,xy,x^2]

@Carl Love Thank you for this replying.

@Carl Love What is debug? I don't understand your idea. Could you please send me a Maple sheet contained your idea (running the debug)?

@Carl Love I think that eliminate command use from grobner basis also. Do you know its algorithm?

@Carl Love I don't know why you ask my title? I study Grobner basis and comprehensive grobner basis.
What is your idea about my procedure?

@Carl Love I don't know how you deduce that my reply is rude and evasive! I study some topics in Grobner basis and if I yield new results I will thank MaplePrime and especially you.
If you are sad I don't ask any question from now?

@Axel Vogt This is a little part of my main project.

@Carl Love  In the following procedeure F is a list of polynomials, f is a polynomial, R is a monomial ordering on parameters, T is a monomial ordering on variables and N is null set.

Since, F and f are homogeneous and linear and also F is a Grobner basis we can use from NormalForm command for checking linearly dependent.

ExtPolyLinear := proc (F, f, R, T, N)

local nf, nfp, L, nf1;

nf1 := Groebner:-NormalForm(f, F, T, 'Q');

nf := numer(nf1);

nfp := Groebner:-NormalForm(nf, N, R, 'K');

L := subs(seq(N[i] = 0, i = 1 .. nops(N)), Q);

if nfp = 0 then

   RETURN(true, L)

else

   RETURN(false, [])

end if

end proc;

Example:

ExtPolyLinear([a*A1+b*A3, c*A2+d*A3], e*A1+h*A2,plex(a,b,c,d,e,h), plex(A1,A2,A3, A4, A5), [h, e]);
                                    true, [0, 0]

ExtPolyLinear([a*A1+b*A3, c*A2+d*A3], e*A1+h*A2, plex(a, b, c, d, e, h), plex(A1, A2, A3, A4, A5), []);
                                    false, []
ExtPolyLinear([a*A1+b*A3,c*A2+d*A3],e*A1+h*A2,plex(a,b,c,d,e,h),plex(A1, A2, A3, A4, A5), [e*c*b+h*d*a]);
                        

What is your idea?

@Carl Love now I am presenting an implementation for the answer my question without using eliminate command and then posted it!

@Carl Love Please consider the following example:

The null set is {h, b*d} and the notnull set is {a,c,e}. Therefore F=[cA4,caA2] and f=eA2 w.r.t. these two sets where shows that f is linearly dependent of F, But the output of your implementation is false. What is your idea?