On Critical Case Sierpi (?) Ski Carpet Grid, Limited Percolation Model String

After briefly intuducing Pocolation and Sierpinski carpet latice model. This paper mainly studies the finite cluster on the Sierpinski carpet latice, when p > p_c.Percolation model was firstly proposed by Broadbent S.R. and Hammersly J.M. in 1957. This not only extend the reserch fields of probability, but also theorlize for Stat. Physics. Sierpinski carpet lattice is a kind of Fractal. The Percolation builded on Sierpinski carpet lattice draws some results from classical bond Percolation theory. But, they are different model after all. So there are a lot of guesses expected to be proved.The property of connectivity function is the focus in this field all the time. This paper just mainly studies the property of connectivity function on Sierpinski carpet latice. The proof shows that connectivity probability of two vertexes that are not contained in the infinite cluster is almost exponential decay, when p > p_c.